Related papers: Fast-collapsing theories
With the increasing deployment of machine learning systems in practice, transparency and explainability have become serious issues. Contrastive explanations are considered to be useful and intuitive, in particular when it comes to…
The ABC conjecture implies many conjectures and theorems in number theory, including the celebrated Fermat's Last Theorem. Mason-Stothers Theorem is a function field analogue of the ABC conjecture that admits a much more elementary proof…
Let $W$ be an irreducible real reflection group. Armstrong, Reiner, and the author presented a model for parking functions attached to W and made three increasingly strong conjectures about these objects. The author generalized these…
William Thomson proved Carnot's theorem basing on postulate: "It is impossible, by means of inanimate material agency, to derive mechanical effect from any portion of matter by cooling it below the temperature of the coldest of the…
Providing explanations about how machine learning algorithms work and/or make particular predictions is one of the main tools that can be used to improve their trusworthiness, fairness and robustness. Among the most intuitive type of…
Justin Moore's weak club-guessing principle $\mho$ admits various possible generalizations to the second uncountable cardinal. One of them was shown to hold in ZFC by Shelah. A stronger one was shown to follow from several consequences of…
In this paper we study the integrals of fractional parts of given functions, and develop some new tools to understand the behaviour of prime differences. We demonstrate how simply some seemingly difficult conjectures related to prime…
It is a well known empirical observation that natural axiomatic theories are pre-well-ordered by consistency strength. For any natural theory $T$, the next strongest natural theory is $T+\mathsf{Con}_T$. We formulate and prove a statement…
Why does such a successful theory like Quantum Mechanics have so many mysteries? The history of this theory is replete with dubious interpretations and controversies, and yet a knowledge of its predictions, however, contributed to the…
We show that the subgroup lattice of any finite group satisfies Frankl's Union-Closed Conjecture. We show the same for all lattices with a modular coatom, a family which includes all supersolvable and dually semimodular lattices. A common…
In a previous article [1] we presented an argument to obtain (or rather infer) Born's rule, based on a simple set of axioms named "Contexts, Systems and Modalities" (CSM). In this approach there is no "emergence", but the structure of…
Two new sufficient conditions for generalized cycles (including Hamilton and dominating cycles as special cases) in an arbitrary k-connected graph (k=1,2,...) are derived, which prove the truth of Bondy's (1980) famous conjecture for some…
We propose and implement an approach to inference in linear instrumental variables models which is simultaneously robust and computationally tractable. Inference is based on self-normalization of sample moment conditions, and allows for…
Strassen's classical martingale coupling theorem states that two real-valued random variables are ordered in the convex (resp.\ increasing convex) stochastic order if and only if they admit a martingale (resp.\ submartingale) coupling. By…
We investigate the relation of countable closed subsets of the reals with respect to continuous monotone embeddability; we show that there are exactly aleph_1 many equivalence classes with respect to this embeddability relation. This is an…
This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…
One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…
We present variants of Goodstein's theorem that are equivalent to arithmetical comprehension and to arithmetical transfinite recursion, respectively, over a weak base theory. These variants differ from the usual Goodstein theorem in that…
In the 1970s Muckenhoupt and Wheeden made several conjectures relating two weight norm inequalities for the Hardy-Littlewood maximal operator to such inequalities for singular integrals. Using techniques developed for the recent proof of…
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