Related papers: Borel Determinacy: A Streamlined Proof
As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…
We give a generalization and a short mechanized proof of determinant conjectured by G. Kuperberg and J. Propp. Further generalizations and applications of the method to some q-analogues may be found in http://www.math.temple.edu/~tewodros
We take the perspective of an advanced high school student trying to understand the proof of Fermat's Last Theorem for the first time. We collect definitions and statements needed to summarise how Fermat's Last Theorem was first proved in…
This is a collection of variants of Schanuel's conjecture and the known dependencies between them. It was originally written in 2007, and made available for a time on my webpage. I have been asked by a few people to make it available again…
By changing variables in a suitable way and using dominated convergence methods, this note gives a short proof of Stirling's formula and its refinement.
Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the usage of the structural inference rules of weakening and contraction. With this, atoms of the logic are no longer interpreted as truth, but as…
The proofs first generated by automated theorem provers are far from optimal by any measure of simplicity. In this paper I describe a technique for simplifying automated proofs. Hopefully this discussion will stimulate interest in the…
We present a solution of Exercise 1.2.1 of [2] which yields a short new proof of a key step in one of proofs of Brouwer's fixed point theorem, 1910. A few people asked the author about the details of the solution and they might be…
We analyze the degree-structure induced by large reducibilities under the Axiom of Determinacy. This generalizes the analysis of Borel reducibilities given in references [1], [6] and [5] e.g. to the projective levels.
For each subset of Baire space, we define, in away similar to a common proof of the Cantor-Bendixson Theorem, a sequence of decreasing subsets S_alpha of N^N, indexed by ordinals. We use this to obtain two new characterizations of the…
We prove a tight upper bound on the variance of the priority sampling method (aka sequential Poisson sampling). Our proof is significantly shorter and simpler than the original proof given by Mario Szegedy at STOC 2006, which resolved a…
We prove an inequality on the Kantorovich-Rubinstein distance --which can be seen as a particular case of a Wasserstein metric-- between two solutions of the spatially homogeneous Boltzmann equation without angular cutoff, but with a…
Paul Meehl's foundational work "Clinical versus Statistical Prediction," provided early theoretical justification and empirical evidence of the superiority of statistical methods over clinical judgment. Despite a century of empirical…
Hankel determinants and automatic sequences are two classical subjects widely studied in Mathematics and Theoretical Computer Science. However, these two topics were considered totally independently, until in 1998, when Allouche,…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
We give a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. This proof extends to a principal specialization due to Fomin and Stanley. Such a proof has been sought for over 20 years. Our…
The recently developed proof of Fermat's Last Theorem is very lengthy and difficult, so much so as to be beyond all but a small body of specialists. While certainly of value in the developments that resulted, that proof could not be, nor…
In this paper we present a more transparent upgrade of our proofs and comment on Jerabek's paper [8].
We introduce two tools, dynamical thickening and flow selectors, to overcome the infamous discontinuity of the gradient flow endpoint map near non-degenerate critical points. More precisely, we interpret the stable fibrations of certain…
The purpose of this note is to advertise an elegant algorithmic proof for the Jordan--Chevalley decomposition of a matrix, following and (slightly) revising the discussion of Couty, Esterle und Zarouf (2011). The basic idea of that method…