Related papers: Windmills of the minds: an algorithm for Fermat's …
Fermat Last Theorem, which inspired mathematicians during 300 years, is proved by Andrew Wiles. Even among mathematicians there is a narrow circle of specialists, who can read this proof and understand all details. Is it a reason for…
Theorems relating permutations with objects in other fields of mathematics are often stated in terms of avoided patterns. Examples include various classes of Schubert varieties from algebraic geometry (Billey and Abe 2013), commuting…
Double-soft theorems, like its single-soft counterparts, arises from the underlying symmetry principles that constrain the interactions of massless particles. While single soft theorems can be derived in a non-perturbative fashion by…
We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each…
In this article we introduce a simple physical model which realizes the algebra of orthofermions. The model is constructed from a cylinder which can be filled with some balls. The creation and annihilation operators of orthofermions are…
Modular flow is a symmetry of the algebra of observables associated to spacetime regions. Being closely related to entanglement, it has played a key role in recent connections between information theory, QFT and gravity. However, little is…
We establish a version of von Staudt's theorem on mappings which preserve harmonic quadruples for projective lines over (not necessarily commutative) rings with "sufficiently many" units, in particular 2 has to be a unit.
We introduce a game on graphs. By a theorem of Zermelo, each instance of the game on a finite graph is determined. While the general decision problem on which player has a winning strategy in a given instance of the game is unsolved, we…
This is the first in a series of papers laying the foundations for a differential graded approach to derived differential geometry (and other geometries in characteristic zero). In this paper, we study theories of supercommutative algebras…
In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.
The SOM algorithm is very astonishing. On the one hand, it is very simple to write down and to simulate, its practical properties are clear and easy to observe. But, on the other hand, its theoretical properties still remain without proof…
Ordinary differential equations have an arithmetic analogue in which functions are replaced by numbers and the derivation operator is replaced by a Fermat quotient operator. In this survey we explain the main motivations, constructions,…
`Fermat's Last Theorem for the exponent 3 has received numerous proofs, the most common of which being either in Euler's or in Gauss' style. This latter works entirely in the ring of integers of the quadratic field generated by the square…
In this article, we give a polynomial algorithm to decide whether a given permutation $\sigma$ is sortable with two stacks in series. This is indeed a longstanding open problem which was first introduced by Knuth. He introduced the stack…
Counterfactual inference considers a hypothetical intervention in a parallel world that shares some evidence with the factual world. If the evidence specifies a conditional distribution on a manifold, counterfactuals may be analytically…
In this short paper we propose four conjectures in synthetic geometry that generalize Erdos-Mordell Theorem, and three conjectures in number theory that generalize Fermat Numbers.
Elliptic functions considered by Dixon in the nineteenth century and related to Fermat's cubic, $x^3+y^3=1$, lead to a new set of continued fraction expansions with sextic numerators and cubic denominators. The functions and the fractions…
We describe an efficient algorithm to write any element of the alternating group A_n as a product of two n-cycles (in particular, we show that any element of A_n can be so written -- a result of E. A. Bertram). An easy corollary is that…
This paper gives an algorithm to determine whether a number in a cyclic quartic field is a sum of two squares, mainly based on local-global principle of isotropy of quadratic forms.
Fillmore Theorem says that if $A$ is a nonscalar matrix of order $n$ over a field $\mathbb{F}$ and $\gamma_1,\ldots,\gamma_n\in \mathbb{F}$ are such that $\gamma_1+\cdots+\gamma_n=\text{tr} \, A$, then there is a matrix $B$ similar to $A$…