Related papers: Minimal bad sequences are necessary for a uniform …

An example shows that weak decoherence is more restrictive than the minimal logical decoherence structure that allows probabilities to be used consistently for quantum histories. The probabilities in the sum rules that define minimal…

A sequence $s_1,s_2,\ldots, s_k$ of elements of a group $G$ is called a valid ordering if the partial products $s_1, s_1 s_2, \ldots, s_1\cdots s_k$ are all distinct. A long-standing problem in combinatorial group theory asks whether, for a…

This paper is a contribution to the growing investigation of strong reducibilities between $\Pi^1_2$ statements of second-order arithmetic, viewed as an extension of the traditional analysis of reverse mathematics. We answer several…

We discuss an incompleteness result proven by Bezboruah and Shepherdson. This result tells us that the weak theory ${\sf PA}^-$ does not prove the consistency of any theory (under certain assumptions explained in the paper). Kreisel argued…

We study the first-order consequences of Ramsey's Theorem for $k$-colourings of $n$-tuples, for fixed $n, k \ge 2$, over the relatively weak second-order arithmetic theory $\mathrm{RCA}^*_0$. Using the Chong-Mourad coding lemma, we show…

The infinite pigeonhole principle for $k$ colors ($\mathsf{RT}_k$) states, for every $k$-partition $A_0 \sqcup \dots \sqcup A_{k-1} = \mathbb{N}$, the existence of an infinite subset~$H \subseteq A_i$ for some~$i < k$. This seemingly…

Suppose we observe data from a distribution $P$ and we wish to test the composite null hypothesis that $P\in\mathscr P$ against a composite alternative $P\in \mathscr Q\subseteq \mathscr P^c$. Herbert Robbins and coauthors pointed out…

This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…

Roussel and Rubio proved a lemma which is essential in the proof of the Strong Perfect Graph Theorem. We give a new short proof of the main case of this lemma. In this note, we also give a short proof of Hayward's decomposition theorem for…

A confidence sequence (CS) is an anytime-valid sequential inference primitive which produces an adapted sequence of sets for a predictable parameter sequence with a time-uniform coverage guarantee. This work constructs a non-parametric…

We show in Bishop's constructive mathematics---in particular, using countable choice---that weak K\"{o}nig's lemma implies the uniform continuity theorem.

We prove a new inequality controlling the large deviations of the empirical measure of a Markov chain. This inequality is based on the martingale used by Donsker and Varadhan and the minimax theorem. It holds for convex sets and it requires…

We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain $D$. This theorem is relative to any element of $D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a recursive…

The notion of typical sequences plays a key role in the theory of information. Central to the idea of typicality is that a sequence $x_1, x_2, ..., x_n$ that is $P_X$-typical should, loosely speaking, have an empirical distribution that is…

Written with respect to an appropriate Poisson structure, a partially integrable Hamiltonian system is viewed as a completely integrable system with parameters. Then, the theorem on quasi-periodic stability in Ref. [1] (the KAM theorem) can…

We prove that if $(v_i)$ is a normalized basic sequence and X is a Banach space such that every normalized weakly null sequence in X has a subsequence that is dominated by $(v_i)$, then there exists a uniform constant $C\geq1$ such that…

We compare several versions of the quantitative Schur property of Banach spaces. We establish their equivalence up to multiplicative constants and provide examples clarifying when the change of constants is necessary. We also give exact…

We introduce the coordination principle, which states that perfect coordination, in the form of agreement on a uniformly random output, among N parties is possible only if they share a common cause. This principle is purely causal and can…

This paper generalizes the Fan-Knaster-Kuratowski-Mazurkiewicz (FKKM) lemma to the case of weak topology, and obtains the Ky Fan minimax inequality defined on non-empty non-compact convex subsets in reflexive Banach spaces, then we apply it…

Finding, counting, or determining the existence of Nash equilibria, where players must play optimally given each others' actions, are known to be computational intractable problems. We ask whether weakening optimality to the requirement…