More Like this

1. A TOPOLOGICAL APPROACH TO UNDEFINABILITY IN ALGEBRAIC EXTENSIONS OF Q

   https://doi.org/10.1017/bsl.2023.37  

   EISENTRÄGER, KIRSTEN; MILLER, RUSSELL; SPRINGER, CALEB; WESTRICK, LINDA (December 2023, The Bulletin of Symbolic Logic)

   Abstract For any subset$$Z \subseteq {\mathbb {Q}}$$, consider the set$$S_Z$$of subfields$$L\subseteq {\overline {\mathbb {Q}}}$$which contain a co-infinite subset$$C \subseteq L$$that is universally definable inLsuch that$$C \cap {\mathbb {Q}}=Z$$. Placing a natural topology on the set$${\operatorname {Sub}({\overline {\mathbb {Q}}})}$$of subfields of$${\overline {\mathbb {Q}}}$$, we show that ifZis not thin in$${\mathbb {Q}}$$, then$$S_Z$$is meager in$${\operatorname {Sub}({\overline {\mathbb {Q}}})}$$. Here,thinandmeagerboth mean “small”, in terms of arithmetic geometry and topology, respectively. For example, this implies that only a meager set of fieldsLhave the property that the ring of algebraic integers$$\mathcal {O}_L$$is universally definable inL. The main tools are Hilbert’s Irreducibility Theorem and a new normal form theorem for existential definitions. The normal form theorem, which may be of independent interest, says roughly that every$$\exists $$-definable subset of an algebraic extension of$${\mathbb Q}$$is a finite union of single points and projections of hypersurfaces defined by absolutely irreducible polynomials. 

   more » « less
2. PETERZIL–STEINHORN SUBGROUPS AND -STABILIZERS IN ACF

   https://doi.org/10.1017/S147474802100030X  

   Kamensky, Moshe; Starchenko, Sergei; Ye, Jinhe (May 2023, Journal of the Institute of Mathematics of Jussieu)

   Abstract We considerG, a linear algebraic group defined over$$\Bbbk $$, an algebraically closed field (ACF). By considering$$\Bbbk $$as an embedded residue field of an algebraically closed valued fieldK, we can associate to it a compactG-space$$S^\mu _G(\Bbbk )$$consisting of$$\mu $$-types onG. We show that for each$$p_\mu \in S^\mu _G(\Bbbk )$$,$$\mathrm {Stab}^\mu (p)=\mathrm {Stab}\left (p_\mu \right )$$is a solvable infinite algebraic group when$$p_\mu $$is centered at infinity and residually algebraic. Moreover, we give a description of the dimension of$$\mathrm {Stab}\left (p_\mu \right )$$in terms of the dimension ofp. 

   more » « less
3. Intersective sets for sparse sets of integers

   https://doi.org/10.1017/etds.2024.73  

   BIENVENU, PIERRE-YVES; GRIESMER, JOHN T; LE, ANH N; LÊ, THÁI HOÀNG (May 2025, Ergodic Theory and Dynamical Systems)

   Abstract For$$E \subset \mathbb {N}$$, a subset$$R \subset \mathbb {N}$$isE-intersectiveif for every$$A \subset E$$having positive relative density,$$R \cap (A - A) \neq \varnothing $$. We say thatRischromatically E-intersectiveif for every finite partition$$E=\bigcup _{i=1}^k E_i$$, there existsisuch that$$R\cap (E_i-E_i)\neq \varnothing $$. When$$E=\mathbb {N}$$, we recover the usual notions of intersectivity and chromatic intersectivity. We investigate to what extent the known intersectivity results hold in the relative setting when$$E = \mathbb {P}$$, the set of primes, or other sparse subsets of$$\mathbb {N}$$. Among other things, we prove the following: (1) the set of shifted Chen primes$$\mathbb {P}_{\mathrm {Chen}} + 1$$is both intersective and$$\mathbb {P}$$-intersective; (2) there exists an intersective set that is not$$\mathbb {P}$$-intersective; (3) every$$\mathbb {P}$$-intersective set is intersective; (4) there exists a chromatically$$\mathbb {P}$$-intersective set which is not intersective (and therefore not$$\mathbb {P}$$-intersective). 

   more » « less
4. Improved effective Łojasiewicz inequality and applications

   https://doi.org/10.1017/fms.2024.66  

   Basu, Saugata; Mohammad-Nezhad, Ali (December 2024, Forum of Mathematics, Sigma)

   Abstract Let$$\mathrm {R}$$be a real closed field. Given a closed and bounded semialgebraic set$$A \subset \mathrm {R}^n$$and semialgebraic continuous functions$$f,g:A \rightarrow \mathrm {R}$$such that$$f^{-1}(0) \subset g^{-1}(0)$$, there exist an integer$$N> 0$$and$$c \in \mathrm {R}$$such that the inequality (Łojasiewicz inequality)$$|g(x)|^N \le c \cdot |f(x)|$$holds for all$$x \in A$$. In this paper, we consider the case whenAis defined by a quantifier-free formula with atoms of the form$$P = 0, P>0, P \in \mathcal {P}$$for some finite subset of polynomials$$\mathcal {P} \subset \mathrm {R}[X_1,\ldots ,X_n]_{\leq d}$$, and the graphs of$$f,g$$are also defined by quantifier-free formulas with atoms of the form$$Q = 0, Q>0, Q \in \mathcal {Q}$$, for some finite set$$\mathcal {Q} \subset \mathrm {R}[X_1,\ldots ,X_n,Y]_{\leq d}$$. We prove that the Łojasiewicz exponent in this case is bounded by$$(8 d)^{2(n+7)}$$. Our bound depends ondandnbut is independent of the combinatorial parameters, namely the cardinalities of$$\mathcal {P}$$and$$\mathcal {Q}$$. The previous best-known upper bound in this generality appeared inP. Solernó, Effective Łojasiewicz Inequalities in Semi-Algebraic Geometry, Applicable Algebra in Engineering, Communication and Computing (1991)and depended on the sum of degrees of the polynomials defining$$A,f,g$$and thus implicitly on the cardinalities of$$\mathcal {P}$$and$$\mathcal {Q}$$. As a consequence, we improve the current best error bounds for polynomial systems under some conditions. Finally, we prove a version of Łojasiewicz inequality in polynomially bounded o-minimal structures. We prove the existence of a common upper bound on the Łojasiewicz exponent for certain combinatorially defined infinite (but not necessarily definable) families of pairs of functions. This improves a prior result of Chris Miller (C. Miller, Expansions of the real field with power functions, Ann. Pure Appl. Logic (1994)). 

   more » « less
5. Efficient simplicial replacement of semialgebraic sets

   https://doi.org/10.1017/fms.2023.36  

   Basu, Saugata; Karisani, Negin (January 2023, Forum of Mathematics, Sigma)

   Abstract Designing an algorithm with a singly exponential complexity for computing semialgebraic triangulations of a given semialgebraic set has been a holy grail in algorithmic semialgebraic geometry. More precisely, given a description of a semialgebraic set$$S \subset \mathbb {R}^k$$by a first-order quantifier-free formula in the language of the reals, the goal is to output a simplicial complex$$\Delta $$, whose geometric realization,$$|\Delta |$$, is semialgebraically homeomorphic toS. In this paper, we consider a weaker version of this question. We prove that for any$$\ell \geq 0$$, there exists an algorithm which takes as input a description of a semialgebraic subset$$S \subset \mathbb {R}^k$$given by a quantifier-free first-order formula$$\phi $$in the language of the reals and produces as output a simplicial complex$$\Delta $$, whose geometric realization,$$|\Delta |$$is$$\ell $$-equivalent toS. The complexity of our algorithm is bounded by$$(sd)^{k^{O(\ell )}}$$, wheresis the number of polynomials appearing in the formula$$\phi $$, andda bound on their degrees. For fixed$$\ell $$, this bound issingly exponentialink. In particular, since$$\ell $$-equivalence implies that thehomotopy groupsup to dimension$$\ell $$of$$|\Delta |$$are isomorphic to those ofS, we obtain a reduction (having singly exponential complexity) of the problem of computing the first$$\ell $$homotopy groups ofSto the combinatorial problem of computing the first$$\ell $$homotopy groups of a finite simplicial complex of size bounded by$$(sd)^{k^{O(\ell )}}$$. 

   more » « less