English
Related papers

Related papers: Transfinite Approximation of Hindman's Theorem

200 papers

The colored Tverberg theorem asserts that for every d and r there exists t=t(d,r) such that for every set C in R^d of cardinality (d+1)t, partitioned into t-point subsets C_1,C_2,...,C_{d+1} (which we think of as color classes; e.g., the…

Combinatorics · Mathematics 2011-06-02 Jiří Matoušek , Martin Tancer , Uli Wagner

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

We prove that double exponentiation is an upper bound to Ramsey theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.

Combinatorics · Mathematics 2016-09-06 Saharon Shelah

A well-known theorem of Wedderburn asserts that a finite division ring is commutative. In a division ring the group of invertible elements is as large as possible. Here we will be particularly interested in the case where this group is as…

Rings and Algebras · Mathematics 2013-02-14 Rodney Coleman

We study a conjecture linking ultimate periodicity of infnite words to the existence of colorings on finite words avoiding monochromatic factorisation of suffixes, with the extra condition that the ordered concatenation of elements of this…

Combinatorics · Mathematics 2018-02-26 Caius Wojcik

The Kruskal-Friedman theorem asserts: in any infinite sequence of finite trees with ordinal labels, some tree can be embedded into a later one, by an embedding that respects a certain gap condition. This strengthening of the original…

Logic · Mathematics 2025-08-13 Anton Freund

We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula…

Number Theory · Mathematics 2007-05-23 Constantin M. Petridi , Peter B. Krikelis

We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by affine functions. We obtain similar results for definable…

Logic · Mathematics 2011-07-20 Isaac Goldbring

We prove a better coloring theorem for aleph_4 and even aleph_3. This has a general topology consequence.

Logic · Mathematics 2019-01-29 Saharon Shelah

Let $(G,\pmb{+})$ be any given semimodule over a discrete semiring $(R,+,\cdot)$ with a finite coloring, say $G=B_1\cup\dotsm\cup B_q$. By establishing a Regional Multiple Recurrence Theorem for semimodules, we prove that one of the colors…

Dynamical Systems · Mathematics 2018-09-17 Xiongping Dai

The classical Artin--Whaples approximation theorem allows to simultaneously approximate finitely many different elements of a field with respect to finitely many pairwise inequivalent absolute values. Several variants and generalizations…

Commutative Algebra · Mathematics 2021-02-16 Sylvy Anscombe , Philip Dittmann , Arno Fehm

It is shown that any finitely generated subring of a global field has a universal first-order definition in its fraction field. This covers Koenigsmann's result for the ring of integers and its subsequent extensions to rings of integers in…

Number Theory · Mathematics 2023-01-06 Nicolas Daans

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…

Combinatorics · Mathematics 2007-05-23 Robert Brignall , Nik Ruskuc , Vince Vatter

A celebrated theorem of Spencer states that for every set system $S_1,\dots, S_m \subseteq [n]$, there is a coloring of the ground set with $\{\pm 1\}$ with discrepancy $O(\sqrt{n\log(m/n+2)})$. We provide an algorithm to find such a…

Data Structures and Algorithms · Computer Science 2022-06-10 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

Exchangeability is a fundamental concept in probability theory and statistics. It allows to model situations where the order of observations does not matter. The classical de Finetti's theorem provides a representation of infinitely…

Quantum Physics · Physics 2025-12-30 Alessio Benavoli , Alessandro Facchini , Marco Zaffalon

A proof of the continuous martingale convergence theorem is provided. It relies on a classical martingale inequality and the almost sure convergence of a uniformly bounded non-negative super-martingale, after a truncation argument.

Probability · Mathematics 2021-11-25 Joe Ghafari

In this paper we discuss the fidelity of states in infinite dimensional systems, give an elementary proof of the infinite dimensional version of Uhlmann's theorem, and then, apply it to generalize several properties of the fidelity from…

Quantum Physics · Physics 2011-07-05 Jinchuan Hou , Xiaofei Qi

We present finitary formulations of two well known results concerning infinite series, namely Abel's theorem, which establishes that if a series converges to some limit then its Abel sum converges to the same limit, and Tauber's theorem,…

Logic · Mathematics 2019-10-18 Thomas Powell

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

Combinatorics · Mathematics 2010-09-06 Jan Hubicka

Ends and end cohomology are powerful invariants for the study of noncompact spaces. We present a self-contained exposition of the topological theory of ends and prove novel extensions including the existence of an exhaustion of a proper…

Algebraic Topology · Mathematics 2025-04-17 William G. Bass , Jack S. Calcut
‹ Prev 1 8 9 10 Next ›