Search results
Michael Simkin is a mathematician who works on high-dimensional combinatorics, random graphs, and functional analysis. He has solved several open problems in these fields and is interested in Latin squares and Steiner triple systems.
Jan 21, 2022 · Michael Simkin, a postdoc fellow at Harvard, has calculated the lower and upper bounds of the number of ways to place n queens on a chessboard so that none attack each other. He used combinatorics, optimization, and entropy methods to solve the 150-year-old mathematical puzzle.
Jan 25, 2022 · Michael Simkin, a Harvard professor, has found an approximate solution to the n-queens problem, a chess puzzle that has baffled experts for 150 years. He used various methods and techniques to calculate the number of possible arrangements of queens on a board of any size.
Michael Simkin is an instructor of applied mathematics at the MIT math department. Previously, he was a postdoctoral fellow at Harvard University's Center of Mathematical Sciences and Applications.
Michael Simkin, a post-doctoral fellow at Harvard’s CMSA, has solved the 150-year-old chess-based n-queens problem. His paper and article are available on arXiv.org and The Harvard Gazette, respectively.
May 24, 2021 · Mathematics > Combinatorics. [Submitted on 24 May 2021 ( v1 ), last revised 9 Jul 2021 (this version, v2)] A lower bound for the n -queens problem. Zur Luria, Michael Simkin. The n -queens puzzle is to place n mutually non-attacking queens on an n × n chessboard. We present a simple two stage randomized algorithm to construct such configurations.
What is learned in knowledge graph embedding?, Michael R. Douglas, Michael Simkin, Omri Ben-Eliezer, Tianqi Wu, Peter Chin, Trung V. Dang, Andrew Wood. Complex Networks & Their Applications X (CNA 2021). Perfect matchings in random subgraphs of regular bipartite graphs, with Roman Glebov and Zur Luria. Journal of Graph Theory, 97: 208-231 (2021).
