arXiv subjects
Publications and source records attributed to Artem Chernikov.
We construct a simple expansion of the theory of nonabelian free groups in which the group admits a global type with bounded left-translation orbit but is not definably amenable. This extends the construction of Chernikov, Hrushovski, Kruckman, Krupiński, Moconja, Pillay, and Ramsey, and gives a counterexample to Petrykowski's conjecture.
We prove that a relation obtained by composing arbitrary functions of arity $\leq k$ with a relation definable in an $n$-dependent structure is $kn$-dependent. This confirms a conjecture of Chernikov and Hempel. We also demonstrate optimality of the result.
The classes of SOP$_2$ and SOP$_3$ first-order theories coincide. This answers a question of Džamonja and Shelah from 2004.
We consider some extremal combinatorial questions for bipartite graphs definable in stable one-based (and related) structures. We show that they satisfy both strong Erdős-Hajnal property and linear Zarankiewicz. We also show that the same is true for both collapsed and uncollapsed Hrushovski's ``ab initio'' constructions, and discuss some connections to Zilber's trichotomy principle. For strong Erdős-Hajnal, we show that in fact it holds in a more general class of $1$-semi-equational theories.
We investigate the class of FHP theories, i.e. theories of structures in which all definable families of sets satisfy the Fractional Helly Property (and its variants) from combinatorics. FHP theories generalize NIP and form a new subclass of low NTP$_2$ theories. We give many new examples (including ultraproducts of finite fields and of the $p$-adics) and establish some results about forking and $f$-generics for amenable groups definable in FHP theories. We make several conjectures about finitary combinatorial properties of forking in NTP$_2$ theories and establish some partial results, as well as investigate related two-cardinal type counting functions addressing a question of Adler.
We study Keisler measures in strongly n-distal NIP theories, generalizing some results of Simon and Chernikov-Starchenko for distal theories and addressing some questions of Walker. In particular, we establish a hypergraph version of the distal regularity lemma, compact domination for definable fsg groups, and demonstrate that the strong n-distality hierarchy is strict among stable theories using a connection to Poizat's total triviality of forking. We also show that infinite strongly n-distal NIP fields have characteristic 0 using a discrepancy result of Babai-Hayes-Kimmel from multiparty communication complexity.
This paper presents an analysis of the applicability of a quantum amplitude redistribution algorithm to the data filtering problem and the results of modeling the algorithm's operation in comparison with a median filter.
The aim of this note is to overview some of our work in Chernikov, Towsner'20 (arXiv:2010.00726) developing higher arity VC theory (VC$_n$ dimension), including a generalization of Haussler packing lemma, and an associated tame (slice-wise) hypergraph regularity lemma; and to demonstrate that it characterizes higher arity PAC learning (PAC$_n$ learning) in $n$-fold product spaces with respect to product measures introduced by Kobayashi, Kuriyama and Takeuchi'15. We also point out how some of the recent results in arXiv:2402.14294, arXiv:2505.15688, arXiv:2509.20404 follow from our work in arXiv:2010.00726.
We show that $k$-ary functions giving the measure of the intersection of multi-parametric families of sets in probability spaces, e.g. $(x,y,z) \in X \times Y \times Z \mapsto μ(P_{x,y} \cap Q_{x,z} \cap R_{y,z})$, satisfy a particularly strong form of hypergraph regularity. More generally, this applies to the (integral) averages of continuous combinations of functions of smaller arity. This result is connected to higher arity stability in model theory, that we discuss in the second part of the paper. We demonstrate that all hypergraphs embedding both into the half-simplex and into $GS(\mathbb{F}_3)$, the two known sources of failure of ternary stability, do satisfy an analogous regularity lemma -- hence strong ternary stability cannot be characterized simply by excluded hypergraphs.
We show that every fsg group externally definable in an NIP structure is definably isomorphic to a group interpretable in it. Our proof relies on honest definitions and a group chunk result reconstructing a hyper-definable group from its multiplication given generically with respect to a translation invariant definable Keisler measure on it. We obtain related results on externally (type-)definable sets and groups, including a proof of a conjecture of Eleftheriou on fsg groups in real closed valued fields, and a description of externally definable, definably amenable subgroups of definable groups.
The method is introduced for fast data processing by reducing the probability amplitudes of undesirable elements. The algorithm has a mathematical description and circuit implementation on a quantum processor. The idea is to make a quick decision (down to a single iteration) based on the correspondence between the data and the desired result, with a probability proportionate to this correspondence. Our approach allows one to calibrate the circuit to control specified proportions.
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 theory localizing on a generically stable type, including invariant stratified ranks and connected components. We establish generic transitivity of generically stable idempotent types in important new cases, including abelian groups in arbitrary theories and arbitrary groups in rosy theories, and characterize them as generics of connected type-definable subgroups. Using tools from Keisler's randomization theory, we generalize some of these results from types to generically stable Keisler measures, and classify idempotent generically stable measures in abelian groups as (unique) translation-invariant measures on type-definable fsg subgroups. This provides a partial definable counterpart to the classical work of Rudin, Cohen and Pym for locally compact topological groups. Finally, we provide an explicit construction of a minimal left ideal in the convolution semigroup of measures for an arbitrary countable NIP group, from a minimal left ideal in the corresponding semigroup on types and a canonical measure constructed on its ideal subgroup. In order to achieve it, we in particular prove the revised Ellis group conjecture of Newelski for countable NIP groups.
We develop some model theory of multi-linear forms, generalizing Granger in the bi-linear case. In particular, after proving a quantifier elimination result, we show that for an NIP field K, the theory of infinite dimensional non-degenerate alternating n-linear spaces over K is strictly n-dependent; and it is NSOP1 if K is. This relies on a new Composition Lemma for functions of arbitrary arity and NIP relations (which in turn relies on certain higher arity generalizations of Sauer-Shelah lemma). We also study the invariant connected components $G^{\infty}$ in n-dependent groups, demonstrating their relative absoluteness in the abelian case.
In this paper, we present an algorithm for preparing quantum states of the form $\sum_{i=0}^{n-1} α_i |i\rangle$, where the coefficients $α_i$ are specified by a quantum oracle. Our method achieves this task twice as fast as the best existing algorithm known to the authors. Such state preparation is essential for quantum algorithms that process large classical inputs, including matrix inversion and linear system solvers. The standard approach relies on amplitude amplification, a process that may require multiple, time-consuming oracle queries. Consequently, reducing the number of queries - and thereby the overall time complexity can lead to significant performance improvements in practice.
For $n \in \mathbb{N}$ and $\varepsilon > 0$, given a sufficiently long sequence of events in a probability space all of measure at least $\varepsilon$, some $n$ of them will have a common intersection. A more subtle pattern: for any $0 < p < q < 1$, we cannot find events $A_i$ and $B_i$ so that $μ\left( A_i \cap B_j \right) \leq p$ and $μ\left( A_j \cap B_i\right) \geq q$ for all $1 < i < j < n$, assuming $n$ is sufficiently large. This is closely connected to model-theoretic stability of probability algebras. We survey some results from our recent work on more complicated patterns that arise when our events are indexed by multiple indices. In particular, how such results are connected to higher arity generalizations of de Finetti's theorem in probability, structural Ramsey theory, hypergraph regularity in combinatorics, and model theory.
In this note we develop and clarify some of the basic combinatorial properties of the new notion of $n$-dependence (for $1\leq n < ω$) recently introduced by Shelah. In the same way as dependence of a theory means its inability to encode a bipartite random graph with a definable edge relation, $n$-dependence corresponds to the inability to encode a random $(n+1)$-partite $(n+1)$-hypergraph with a definable edge relation. Most importantly, we characterize $n$-dependence by counting $φ$-types over finite sets (generalizing Sauer-Shelah lemma and answering a question of Shelah) and in terms of the collapse of random ordered $(n+1)$-hypergraph indiscernibles down to order-indiscernibles (which implies that the failure of $n$-dependence is always witnessed by a formula in a single free variable).
We investigate various forms of (model-theoretic) stability for hypergraphs and their corresponding strengthenings of the hypergraph regularity lemma with respect to partitions of vertices. On the one hand, we provide a complete classification of the various possibilities in the ternary case. On the other hand, we provide an example of a family of slice-wise stable 3-hypergraphs so that for no partition of the vertices, any triple of parts has density close to 0 or 1. In particular, this addresses some questions and conjectures of Terry and Wolf. We work in the general measure theoretic context of graded probability spaces, so all our results apply both to measures in ultraproducts of finite graphs, leading to the aforementioned combinatorial applications, and to commuting definable Keisler measures, leading to applications in model theory.
We develop the theory of Kim-independence in the context of NSOP$_{1}$ theories satsifying the existence axiom. We show that, in such theories, Kim-independence is transitive and that $\ind^{K}$-Morley sequences witness Kim-dividing. As applications, we show that, under the assumption of existence, in a low NSOP$_{1}$ theory, Shelah strong types and Lascar strong types coincide and, additionally, we introduce a notion of rank for NSOP$_{1}$ theories.