English
Related papers

Related papers: Stabilizers and NIP arithmetic regularity

200 papers

We study idempotent measures and the structure of the convolution semigroups of measures over definable groups. We isolate the property of generic transitivity and demonstrate that it is sufficient (and necessary) to develop stable group…

Logic · Mathematics 2025-04-08 Artem Chernikov , Kyle Gannon , Krzysztof Krupiński

For a NIP theory $T$, a sufficiently saturated model $\mathfrak{C}$ of $T$, and an invariant (over some small subset of $\mathfrak{C}$) global type $p$, we prove that there exists a finest relatively type-definable over a small set of…

Logic · Mathematics 2025-07-16 Krzysztof Krupiński , Adrián Portillo

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…

Data Structures and Algorithms · Computer Science 2019-02-15 Zeev Dvir , Alexander Golovnev , Omri Weinstein

A version of the Riesz-Sobolev convolution inequality is formulated and proved for arbitrary compact connected Abelian groups. Maximizers are characterized and a quantitative stability theorem is proved, under natural hypotheses. A…

Classical Analysis and ODEs · Mathematics 2019-08-20 Michael Christ , Marina Iliopoulou

Let K >= 1 be a parameter. A K-approximate group is a finite set A in a (local) group which contains the identity, is symmetric, and such that A^2 is covered by K left translates of A. The main result of this paper is a qualitative…

Group Theory · Mathematics 2011-10-26 Emmanuel Breuillard , Ben Green , Terence Tao

The problem of characterizing which automatic sets of integers are stable is here solved. Given a positive integer $d$ and a subset $A\subseteq \mathbb{Z}$ whose set of representations base $d$ is recognized by a finite automaton, a…

Logic · Mathematics 2020-10-09 Christopher D. C. Hawthorne

We prove a number of results relating the concepts of Keisler measures, generic stability, randomizations, and NIP formulas. Among other things, we do the following: (1) We introduce the notion of a Keisler-Morley measure, which plays the…

Logic · Mathematics 2023-09-04 Gabriel Conant , Kyle Gannon , James E. Hanson

This paper establishes a classification of the critical numbers for restricted sumsets in finite abelian groups, determining them exactly for even-order groups and bounding them for odd-order groups, while revealing a fundamental structural…

Combinatorics · Mathematics 2026-02-12 Bocong Chen , Jing Huang

This paper aims at developing model-theoretic tools to study interpretable fields and definably amenable groups, mainly in $\mathrm{NIP}$ or $\mathrm{NTP_2}$ settings. An abstract theorem constructing definable group homomorphisms from…

Logic · Mathematics 2025-01-07 Paul Z. Wang

We prove a general homological stability theorem for certain families of groups equipped with product maps, followed by two theorems of a new kind that give information about the last two homology groups outside the stable range. (These…

Algebraic Topology · Mathematics 2020-07-13 Richard Hepworth

We give an 'arithmetic regularity lemma' for groups definable in finite fields, analogous to Tao's 'algebraic regularity lemma' for graphs definable in finite fields. More specifically, we show that, for any $M>0$, any finite field…

Logic · Mathematics 2026-02-06 Anand Pillay , Atticus Stonestrom

In this work we study some examples of groups definable and type-definable in NSOP1 theories. We exhibit some behaviors of these groups that differ from the ones of simple groups. We take interest in the notions of generics and stabilizers,…

Logic · Mathematics 2025-10-31 Yvon Bossut

We study a notion of VC-dimension for subsets of groups, defining this for a set $A$ to be the VC-dimension of the family $\{ (xA) \cap A : x \in A\cdot A^{-1} \}$. We show that if a finite subset $A$ of an abelian group has bounded…

Combinatorics · Mathematics 2021-03-26 Olof Sisask

Standard mixed-integer programming formulations for the stable set problem on $n$-node graphs require $n$ integer variables. We prove that this is almost optimal: We give a family of $n$-node graphs for which every polynomial-size MIP…

Discrete Mathematics · Computer Science 2024-03-14 Jamico Schade , Makrand Sinha , Stefan Weltge

We extend previous work on Hrushovski's stabilizer's theorem and prove a measure-theoretic version of a well-known result of Pillay-Scanlon-Wagner on products of three types. This generalizes results of Gowers on products of three sets and…

Logic · Mathematics 2024-05-01 Amador Martin-Pizarro , Daniel Palacín

We initiate a systematic study of the convolution operation on Keisler measures, generalizing the work of Newelski in the case of types. Adapting results of Glicksberg, we show that the supports of generically stable (or just definable,…

Logic · Mathematics 2021-01-19 Artem Chernikov , Kyle Gannon

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

Group Theory · Mathematics 2016-08-16 Emmanuel Breuillard , Matthew Tointon

We study forking, Lascar strong types, Keisler measures and definable groups, under an assumption of $NIP$ (not the independence property), continuing aspects of math.LO/0607442. Among key results are: (i) if $p = tp(b/A)$ does not fork…

Logic · Mathematics 2009-01-29 Ehud Hrushovski , Anand Pillay

We study and characterize stability, NIP and NSOP in terms of topological and measure theoretical properties of classes of functions. We study a measure theoretic property, `Talagrand's stability', and explain the relationship between this…

Logic · Mathematics 2021-11-19 Karim Khanaki

The stability problem of a class of nonlinear switched systems defined on compact sets with state-dependent switching is considered. Instead of the Caratheodory solutions, the general Filippov solutions are studied. This encapsulates…

Optimization and Control · Mathematics 2017-07-31 Mohamadreza Ahmadi , Hamed Mojallali , Rafael Wisniewski