English
Related papers

Related papers: Ramsey growth in some NIP structures

200 papers

We obtain a double exponential bound in Brauer's generalisation of van der Waerden's theorem, which concerns progressions with the same colour as their common difference. Such a result has been obtained independently and in much greater…

Combinatorics · Mathematics 2020-01-06 Jonathan Chapman , Sean Prendiville

The well-known Galvin-Prikry Theorem states that Borel subsets of the Baire space are Ramsey: Given any Borel subset $\mathcal{X}\subseteq [\omega]^{\omega}$, where $[\omega]^{\omega}$ is endowed with the metric topology, each infinite…

Combinatorics · Mathematics 2024-10-01 Natasha Dobrinen

The path to the solution of Feder-Vardi dichotomy conjecture by Bulatov and Zhuk led through showing that more and more general algebraic conditions imply polynomial-time algorithms for the finite-domain Constraint Satisfaction Problems…

Computational Complexity · Computer Science 2025-02-05 Tomáš Nagy , Michael Pinsker , Michał Wrona

We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…

Number Theory · Mathematics 2021-05-04 Antonia W. Bluher

Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…

Discrete Mathematics · Computer Science 2022-06-30 Jan Dreier , Nikolas Mählmann , Amer E. Mouawad , Sebastian Siebertz , Alexandre Vigny

In Section 6 of the paper ``Fra\"{\i}ss\'{e}'s Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition'', we applied the methods developed in earlier sections to show that a certain reduct of the generic…

Combinatorics · Mathematics 2026-05-21 Dragan Mašulović

We give an example of a dense o-minimal structure in which there is a definable quotient that cannot be eliminated, even after naming parameters. Equivalently, there is an interpretable set which cannot be put in parametrically definable…

Logic · Mathematics 2019-11-25 Will Johnson

The classical Kepler-Coulomb system in 3 dimensions is well known to be 2nd order superintegrable, with a symmetry algebra that closes polynomially under Poisson brackets. This polynomial closure is typical for 2nd order superintegrable…

Mathematical Physics · Physics 2012-06-08 Ernie G. Kalnins Kalnins , Willard Miller

We prove the first inverse theorem for point--sphere incidence bounds over finite fields in dimensions $d \ge 3$, showing that near-extremality forces algebraic rigidity. While sharp upper bounds have been known for over a decade, the…

Combinatorics · Mathematics 2026-02-12 Shalender Singh , Vishnu Priya Singh

Given a weakly o-minimal structure $\mathcal M$ and its o-minimal completion $\bar {\mathcal M}$, we first associate to $\bar {\mathcal M}$ a canonical language and then prove that $Th(\mathcal M)$ determines $Th(\bar {\mathcal M})$. We…

Logic · Mathematics 2019-06-12 Elitzur Bar-Yehuda , Assaf Hasson , Ya'acov Peterzil

We provide partial results towards a conjectural generalization of a theorem of Lubotzky-Mozes-Raghunathan for arithmetic groups (over number fields or function fields) that implies, in low dimensions, both polynomial isoperimetric…

Group Theory · Mathematics 2011-06-07 Mladen Bestvina , Alex Eskin , Kevin Wortman

In this paper, we introduce a family of residually finite groups that helps us to systematically study the residual finiteness growth function (RFG) from various perspectives. First, by strengthening results of Bou-Rabee and Seward and also…

Group Theory · Mathematics 2025-08-19 Arman Darbinyan , Emmanuel Rauzy

We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…

Discrete Mathematics · Computer Science 2025-06-17 Jamolidin K. Abdurakhmanov

We build a collection of topological Ramsey spaces of trees giving rise to universal inverse limit structures,extending Zheng's work for the profinite graph to the setting of Fra\"{\i}ss\'{e} classes of finite ordered binary relational…

Combinatorics · Mathematics 2022-05-20 Natasha Dobrinen , Kaiyun Wang

This article is concerned with classes of relational structures that are closed under taking substructures and isomorphism, that have the joint embedding property, and that furthermore have the Ramsey property, a strong combinatorial…

Combinatorics · Mathematics 2015-05-28 Manuel Bodirsky

In NIP theories, generically stable Keisler measures can be characterized in several ways. We analyze these various forms of "generic stability" in arbitrary theories. Among other things, we show that the standard definition of generic…

Logic · Mathematics 2020-05-22 Gabriel Conant , Kyle Gannon

We examine topological properties of pointed metric measure spaces $(Y, p)$ that can be realized as the pointed Gromov-Hausdorff limit of a sequence of complete, Riemannian manifolds $\{(M^n_i, p_i)\}_{i=1}^{\infty}$ with nonnegative Ricci…

Metric Geometry · Mathematics 2010-03-31 Michael Munn

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

Combinatorics · Mathematics 2023-10-24 Herbert Edelsbrunner , János Pach

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

We study point sets arising from cut-and-project constructions. An important class is weak model sets, which include squarefree numbers and visible lattice points. For such model sets, we give a non-trivial upper bound on their pattern…

Combinatorics · Mathematics 2015-09-10 Christian Huck , Christoph Richard