相关论文: Finite field models in additive combinatorics
We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain classification results over fields with 2, 3 and 4 elements.…
In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…
We study higher moments of convolutions of the characteristic function of a set, which generalize a classical notion of the additive energy. Such quantities appear in many problems of additive combinatorics as well as in number theory. In…
The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…
We show that any finite set S in a characteristic zero integral domain can be mapped to the finite field of order p, for infinitely many primes p, preserving all algebraic incidences in S. This can be seen as a generalization of the…
We give a proof of Gabber's presentation lemma for finite fields. We use ideas from Poonen's proof of Bertini's theorem to prove this lemma in the special case of open subsets of the affine plane. We then reduce the case of general smooth…
We introduce new types of local algorithms, which we call "ASI Algorithms", and use them to demonstrate a link between descriptive and computable combinatorics. This allows us to unify arguments from the two fields, and also sometimes to…
We define a class of pre-ordered abelian groups that we call finite-by-Presburger groups, and prove that their theory is model-complete. We show that certain quotients of the multiplicative group of a local field of characteristic zero are…
Recent results of Freitas, Kraus, Sengun and Siksek, give sufficient criteria for the asymptotic Fermat's Last Theorem to hold over a specific number field. Those works in turn build on many deep theorems in arithmetic geometry. In this…
The defect of valued field extensions is a major obstacle in open problems in resolution of singularities and in the model theory of valued fields, whenever positive characteristic is involved. We continue the detailed study of defect…
We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…
We review Deitmar's theory of monoidal schemes to start with, and have a detailed look at the standard examples. It is explained how one can combinatorially study such schemes through a generalization of graph theory. In a more general…
We characterize the smallest finite spaces with the same homotopy groups of the spheres. Similarly, we describe the minimal finite models of any finite graph. We also develop new combinatorial techniques based on finite spaces to study…
In recent decades, the defect of finite extensions of valued fields has emerged as the main obstacle in several fundamental problems in algebraic geometry such as the local uniformization problem. Hence, it is important to identify…
For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…
The well-known Formanek's module finiteness theorem states that every unital prime PI-algebra (i.e. a central order in a matrix algebra by Posner's theorem) embeds into a finitely generated module over its center. An analogue of this…
We classify the algebraic combinatorial geometries of arbitrary field extensions of transcendence degree greater than 4 and describe their groups of automorphisms. Our results and proofs extend similar results and proofs by Evans and…
We define the notion of an additive model category, and we prove that any additive, stable, combinatorial model category has a natural enrichment over symmetric spectra based on simplicial abelian groups. As a consequence, every object in…
We examine situations, where representations of a finite-dimensional $F$-algebra $A$ defined over a separable extension field $K/F$, have a unique minimal field of definition. Here the base field $F$ is assumed to be a $C_1$-field. In…
We survey our recent work on an extension of the theory of motivic integration, called arithmetic motivic integration. We developed this theory to understand how p-adic integrals of a very general type depend on p.