Searcharxiv⌕ Search

arXiv · 2611.08211

Solving polynomials in large pseudo-finite sets

Abstract

Using techniques from model theory, we prove analogues of Rado's and Sárközy's theorems on solutions to polynomial equations in dense sets of definable groups and fields equipped with well-behaved measures. As a special case, we adapt our results to pseudofinite structures, to deduce non-qualitative asymptotic results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alessandro Vegnuti. 2026-11-05. Solving polynomials in large pseudo-finite sets. https://arxiv.org/abs/2611.08211

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Formalization of Filter-Method Construction for Real Numbers in Coq

This paper presents a formalization for a theory of constructing real numbers using concepts related to filters. The formalization is implemented using the Coq proof assistant and is grounded in axiomatic set theory. The theory encompasses various notions such as filters, ultrafilters, principal ultrafilters, and arithmetical ultrafilters. A special filter, namely the non-principal arithmetical ultrafilter, whose existence requires the Continuum Hypothesis to be proven, is employed to establish several non-standard number sets: *N, *Z and *Q. The set of real numbers, R, is subsequently derived by equivalently classifying a specific subset of *Q. The entire theory is thoroughly formalized, with each detail verified to ensure rigor and precision. This work contributes a new selection of foundational materials for the formalization of mathematical theories.

math.LO↗