Embedded Files
The 36 officers problem of Euler: can 36 officers each belonging to one of 6 distinct regiments and ranks be arranged in a square array such no regiment or rank is repeated along a column or row is not solvable. We showed that there is a quantum solution and it is represented by the chess pieces: colors regiment and values are the ranks.
Quanta Magazine article on it: Euler's 243 year old impossible puzzle gets a quantum solution
Livescience article on the same: Centuries-old 'impossible' math problem cracked using the strange physics of Schrödinger's cat
Publication: Physical Review Letters, Editor's suggestion
IITD_SiRe_2021.pdfSeminar at the School of Interdisciplinary research, IIT Delhi, Feb. 17, 2021
Dual_Bernoulli_IBS_Feb4.pdfSeminar at the Center for Physics of Complex Sytems, IBS, Daejeon, S. Korea. Feb. 4 2021
Seminar at Jagiellonian University, Cracow, Poland Jan 25. 2021 on
"A road to Bernoulli circuits"
(Animations will not work in downloaded pdf, sorry!)
Ashoka_2020.pdfColloquium at Ashoka University, Delhi Dec. 22, 2020 on
"Quantum physics and the butterfly effect" (animations will not work in the downloaded pdf, sorry!)
Google Sites
Report abuse