Related papers: A more reasonable proof of Cobham's theorem

It is pointed out that current conservation alone does not suffice to prove Hara's theorem as it was claimed recently. By explicit calculation we show that the additional implicit assumption made in such "proofs" is that of a sufficiently…

An technically interesting proof of a known theorem.

We generalize several recognizability theorems for free single-sorted algebras to the field of many-sorted algebras and provide, in a uniform way and without using neither regular tree grammars nor tree automata, purely algebraic proofs of…

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.

We prove a generalization of Lopes's theorem, that is, of the converse of Brolin's theorem.

I give a proof of the confluence of combinatory strong reduction that does not use the one of lambda-calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed…

We provide an elementary proof of the quantum adiabatic theorem.

We present a simple short proof of the Fundamental Theorem of Algebra, without complex analysis and with a minimal use of topology. It can be taught in a first year calculus class.

We present a proof of Moessner's theorem by double induction, using only basic rules of arithmetic. No prerequisite knowledge is assumed. Familiarity with summation is advised.

We give a new proof of Brooks' theorem that immediately implies a strengthening of Brooks' theorem, known as Catlin's theorem.

We prove a conjecture of Stembridge concerning stability of Kronecker coefficients that vastly generalizes Murnaghan's theorem. The main idea is to identify the sequences of Kronecker coefficients in question with Hilbert functions of…

This paper presents a short and simple proof of the Four-Color Theorem that can be utterly checkable by human mathematicians, without computer assistance. The new key idea that has allowed it and the global structure of the proof are…

We give a counting based proof of the Graham Pollak Theorem

We provide a simple and short proof of the Karush-Kuhn-Tucker theorem with finite number of equality and inequality constraints. The proof relies on an elementary linear algebra lemma and the local inverse theorem.

We give a short proof of Stein's universal multiplier theorem, purely by probabilistic methods, thus avoiding any use of harmonic analysis techniques (complex interpolation or transference methods).

Conditions for the validity of the quantum adiabatic approximation are analyzed. For the case of linear Hamiltonians, a simple and general sufficient condition is derived, which is valid for arbitrary spectra and any kind of time variation.…

We provide a permutation-invariant version of the Koml\'os' theorem for non-negative random variables. The proof is quite elementary in the sense that it did not use the Axiom of Choice, and was based on a recent result in [3].

An alternative proof of low regularity well-posedness for the Chern-Simons-Dirac system in Coulomb gauge is given which completely avoids the use of any null structure similarly to a recent result of Bournaveas-Candy-Machihara. An…

A non-algorithmic, generalized version of a recent result, asserting that a natural relaxation of the Koml\'os conjecture from boolean discrepancy to spherical discrepancy is true, is proved by a very short argument using convex geometry.

We present a new and formal coinductive proof of confluence and normalisation of B\"ohm reduction in infinitary lambda calculus. The proof is simpler than previous proofs of this result. The technique of the proof is new, i.e., it is not…