English
Related papers

Related papers: On Arnold's and Pushkin's puzzles

200 papers

This note highlights an interesting connection between Euler sums of even weight and prime numbers.

General Mathematics · Mathematics 2008-03-14 Donal F. Connon

Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…

Number Theory · Mathematics 2013-02-07 Zhi-Hong Sun

We give a new proof for Godel's second incompleteness theorem, based on Kolmogorov complexity, Chaitin's incompleteness theorem, and an argument that resembles the surprise examination paradox. We then go the other way around and suggest…

Logic · Mathematics 2010-11-24 Shira Kritchman , Ran Raz

In this note, I try to accomplish two things. First, I fulfill Andrei Khrennikov's request that I comment on his "Vaxjo Interpretation of Quantum Mechanics," contrasting it with my own present view of the subject matter. Second, I try to…

Quantum Physics · Physics 2007-05-23 Christopher A. Fuchs

These are the notes from my courses on the arithmetic of quadratic forms.

Number Theory · Mathematics 2021-03-23 Rainer Schulze-Pillot

I correct two misapprehensions, one historical and one conceptual, in the recent literature on extensions of the Wigner's Friend thought-experiment. Perhaps fittingly, both concern the accurate description of some quantum physicists'…

Quantum Physics · Physics 2019-07-18 Blake C. Stacey

Discussion of ``Statistical analysis of an archeological find'' by Andrey Feuerverger [arXiv:0804.0079]

Applications · Statistics 2008-12-18 Sheila M. Bird

This is an English translation of the following paper, published several years ago: Nikonorov Yu.G., Nikonorova Yu.V. Generalized Popoviciu's problem (Russian), Tr. Rubtsovsk. Ind. Inst., 7, 229-232 (2000), Zbl. 0958.51021. All inserted…

History and Overview · Mathematics 2018-06-12 Yu. G. Nikonorov , Yu. V. Nikonorova

We improve on Gonek-Montgomery's quantitative version of Kronecker's approximation theorem.

Number Theory · Mathematics 2024-05-14 Daria Maksimova

In this paper the author presents some non-conventional thoughts on the complexity of the Universe and the algorithmic reproducibility of the human brain, essentially sparked off by the notion of algorithmic complexity. We must warn that…

History and Overview · Mathematics 2007-05-23 Germano D'Abramo

Unarticulated, implicit hypotheses in Bell's analysis of Einstein, Podolsky and Rosen (EPR) correlations are identified and examined. These relate to the mathematical-analytical properties of random variables, the character of the relevant…

Quantum Physics · Physics 2007-05-23 A. F. Kracklauer , N. A. Kracklauer

We prove NP-completeness of Yin-Yang / Shiromaru-Kuromaru pencil-and-paper puzzles. Viewed as a graph partitioning problem, we prove NP-completeness of partitioning a rectangular grid graph into two induced trees (normal Yin-Yang), or into…

Computational Complexity · Computer Science 2021-06-30 Erik D. Demaine , Jayson Lynch , Mikhail Rudoy , Yushi Uno

This lectures notes consists of four lectures. The first lecture discusses questions around Hilbert-Arnold Problem which is naturally arises from Quantitative Hilbert 16-th problem. In the second lecture we outline author's solution of a…

Dynamical Systems · Mathematics 2007-05-23 Vadim Kaloshin

French translation, by Henri Lombardi and Stefan Neuwirth, of the article "Did Euclid need the Euclidean algorithm to prove unique factorization?", American Mathematical Monthly 113 (2006), pages 196-205.

Number Theory · Mathematics 2015-03-20 David Pengelley , Fred Richman

We discuss some seemingly unrelated observations on integers, whose close or farther away neighbors show a complex of combinatorial, ordering, arithmetical or probabilistic properties, emphasizing puzzlement in more common expectations.

History and Overview · Mathematics 2022-04-18 Cristian Cobeli

We consider sigma-words, which are words used by Evdokimov in the construction of the sigma-sequence. We then find the number of occurrences of certain patterns and subwords in these words.

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev

This note is purely expositional and is a complement to math review MR2730150 to the paper Bel'kov, S. I.; Korepanov, I. G. Matrix solution of the pentagon equation with anticommuting variables, Teoret. i Matemat. Fizika, 163:3 (2010),…

Algebraic Topology · Mathematics 2011-05-03 A. Skopenkov

The present notes are based on a course on Cherednik algebras given by the first author at MIT in the Fall of 2009. Their goal is to give an introduction to Cherednik algebras, and to review the web of connections between them and other…

Representation Theory · Mathematics 2010-04-20 Pavel Etingof , Xiaoguang Ma

Based on data from a large-scale experiment with human subjects, we conclude that the logarithm of probability to guess a word in context (unpredictability) depends linearly on the word length. This result holds both for poetry and prose,…

Information Theory · Computer Science 2007-07-16 Dmitrii Manin

We study the art gallery problem for opposing half guards: guards that can either see to their left or to their right only. We present art gallery theorems, show that the location of half guards in 2-guardable polygons is not restricted to…

Computational Geometry · Computer Science 2022-07-12 Erik Krohn , Bengt J. Nilsson , Christiane Schmidt