SSSergei Starchenko

Sergei Starchenko

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Sergei Starchenko has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Model-theoretic Elekes-Szabó for stable and o-minimal hypergraphs

    by Artem Chernikov, Ya'Acov Peterzil, Sergei Starchenko

    A theorem of Elekes and Szab\'{o} recognizes algebraic groups among certain complex algebraic varieties with maximal size intersections with finite grids. We establish a generalization to relations of any arity and dimension, definable in: 1) stable structures with distal expansions (includes algebraically and differentially closed fields of characteristic $0$); and 2) $o$-minimal expansions of groups. Our methods provide explicit bounds on the power saving exponent in the non-group case. Ingredients of the proof include: a higher arity generalization of the abelian group configuration theorem in stable structures, along with a purely combinatorial variant characterizing Latin hypercubes that arise from abelian groups; and Zarankiewicz-style bounds for hypergraphs definable in distal structures.

  • Open Access

    Zarankiewicz’s problem for semilinear hypergraphs

    by Abdul Basit, Artem Chernikov, Sergei Starchenko, Terence Tao, Chieu-Minh Tran

    A bipartite graph $H = \left (V_1, V_2; E \right )$ with $\lvert V_1\rvert + \lvert V_2\rvert = n$ issemilinearif $V_i \subseteq \mathbb {R}^{d_i}$ for some $d_i$ and the edge relationEconsists of the pairs of points $(x_1, x_2) \in V_1 \times V_2$ satisfying a fixed Boolean combination ofslinear equalities and inequalities in $d_1 + d_2$ variables for somes. We show that for a fixedk, the number of edges in a $K_{k,k}$ -free semilinearHis almost linear inn, namely $\lvert E\rvert = O_{s,k,\varepsilon }\left (n^{1+\varepsilon }\right )$ for any $\varepsilon> 0$ ; and more generally, $\lvert E\rvert = O_{s,k,r,\varepsilon }\left (n^{r-1 + \varepsilon }\right )$ for a $K_{k, \dotsc ,k}$ -free semilinearr-partiter-uniform hypergraph.As an application, we obtain the following incidence bound: given $n_1$ points and $n_2$ open boxes with axis-parallel sides in $\mathbb {R}^d$ such that their incidence graph is $K_{k,k}$ -free, there can be at most $O_{k,\varepsilon }\left (n^{1+\varepsilon }\right )$ incidences. The same bound holds if instead of boxes, one takes polytopes cut out by the translates of an arbitrary fixed finite set of half-spaces.We also obtain matching upper and (superlinear) lower bounds in the case of dyadic boxes on the plane, and point out some connections to the model-theoretic trichotomy ino-minimal structures (showing that the failure of an almost-linear bound for some definable graph allows one to recover the field operations from that graph in a definable manner).


  • Open Access

    Zarankiewicz's problem for semilinear hypergraphs

    by Abdul Basit, Artem Chernikov, Sergei Starchenko, Terence Tao, Chieu-Minh Tran

    A bipartite graph $H = \left(V_1, V_2; E \right)$ with $|V_1| + |V_2| = n$ is semilinear if $V_i \subseteq \mathbb{R}^{d_i}$ for some $d_i$ and the edge relation $E$ consists of the pairs of points $(x_1, x_2) \in V_1 \times V_2$ satisfying a fixed Boolean combination of $s$ linear equalities and inequalities in $d_1 + d_2$ variables for some $s$. We show that for a fixed $k$, the number of edges in a $K_{k,k}$-free semilinear $H$ is almost linear in $n$, namely $|E| = O_{s,k,\varepsilon}(n^{1+\varepsilon})$ for any $\varepsilon > 0$; and more generally, $|E| = O_{s,k,r,\varepsilon}(n^{r-1 + \varepsilon})$ for a $K_{k, \ldots,k}$-free semilinear $r$-partite $r$-uniform hypergraph. As an application, we obtain the following incidence bound: given $n_1$ points and $n_2$ open boxes with axis parallel sides in $\mathbb{R}^d$ such that their incidence graph is $K_{k,k}$-free, there can be at most $O_{k,\varepsilon}(n^{1+\varepsilon})$ incidences. The same bound holds if instead of boxes one takes polytopes cut out by the translates of an arbitrary fixed finite set of halfspaces. We also obtain matching upper and (superlinear) lower bounds in the case of dyadic boxes on the plane, and point out some connections to the model-theoretic trichotomy in $o$-minimal structures (showing that the failure of an almost linear bound for some definable graph allows one to recover the field operations from that graph in a definable manner).

  • Open Access

    O-minimal flows on nilmanifolds

    by Ya'Acov Peterzil, Sergei Starchenko

    Let $G$ be a connected, simply connected nilpotent Lie group, identified with a real algebraic subgroup of $\mathrm{UT}(n,\mathbb{R})$, and let $\Gamma$ be a lattice in $G$, with $\pi:G\to G/\Gamma$ the quotient map. For a semi-algebraic $X\subseteq G$, and more generally a definable set in an o-minimal structure on the real field, we consider the topological closure of $\pi(X)$ in the compact nilmanifold $G/\Gamma$. Our theorem describes $\mathrm{cl}(\pi(X))$ in terms of finitely many families of cosets of real algebraic subgroups of $G$. The underlying families are extracted from $X$, independently of $\Gamma$. We also prove an equidistribution result in the case of curves.

  • Open Access

    Model-theoretic Elekes-Szabó in the strongly minimal case

    by Artem Chernikov, Sergei Starchenko

    We prove a generalizations of the Elekes-Szab\'o theorem for relations definable in strongly minimal structures that are interpretable in distal structures.

  • Open Access

    Algebraic and o-minimal flows on complex and real tori

    by Ya'Acov Peterzil, Sergei Starchenko

    We consider the covering map $\pi:\mathbb{C}^n\to \mathbb{T}$ of a compact complex torus. Given an algebraic variety $X\subseteq \mathbb{C}^n$ we describe the topological closure of $\pi(X)$ in $\mathbb T$. We obtain a similar description when $\mathbb{T}$ is a real torus and $X\subseteq \mathbb{R}^n$ is a set definable in an o-minimal structure over the reals.

  • Open Access

    A note on o-minimal flows and the Ax--Lindemann--Weierstrass theorem for abelian varieties over $\mathbb{C}$

    by Ya'Acov Peterzil, Sergei Starchenko

    In this short note we present an elementary proof of the Ax-Lindemann-Weierstrass theorem for abelian and semi-abelian varieties. The proof uses ideas of Pila, Ullmo, Yafaev, Zannier and is based on basic properties of sets definable in o-minimal structures. It does not use the Pila-Wilkie counting theorem.

  • Open Access

    Some (non-)elimination results for curves in geometric structures

    by Serge Randriambololona, Sergei Starchenko

    We show that the first order structure whose underlying universe is $\mathbb C$ and whose basic relations are all algebraic subset of $\mathbb C^2$ does not have quantifier elimination. Since an algebraic subset of $\mathbb C ^2$ needs either to be of dimension $\leq 1$ or to have a complement of dimension $\leq 1$, one can restate the former result as a failure of quantifier elimination for planar complex algebraic curves. We then prove that removing the planarity hypothesis suffices to recover quantifier elimination: the structure with the universe $\mathbb C$ and a predicate for each algebraic subset of $\mathbb C^n$ of dimension $\leq 1$ has quantifier elimination.

  • Open Access

    Definability of restricted theta functions and families of abelian varieties

    by Ya'Acov Peterzil, Sergei Starchenko

    We consider some classical maps from the theory of abelian varieties and their moduli spaces and prove their definability, on restricted domains, in the o-minimal structure $\Rae$. In particular, we prove that the embedding of moduli space of principally polarized ableian varierty, $Sp(2g,\Z)\backslash \CH_g$, is definable in $\Rae$, when restricted to Siegel's fundamental set $\fF_g$. We also prove the definability, on appropriate domains, of embeddings of families of abelian varieties into projective space.