Related papers: Finite field models in additive combinatorics

We prove a version of Szemeredi's regularity lemma for subsets of a typical random set in F_p^n. As an application, a result on the distribution of three-term arithmetic progressions in sparse sets is discussed.

We study the growth of product sets in some finite three-dimensional matrix groups. In particular, we prove two results about the group of $2\times 2$ upper triangular matrices over arbitrary finite fields: a product set estimate using…

We show that the theory of algebraically closed fields with multiplicative circular orders has a model companion $\mathrm{ACFO}$. Using number-theoretic results on character sums over finite fields, we show that if $\mathbb{F}$ is an…

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

The Finite Element Method (FEM) is the gold standard for spatial discretization in numerical simulations for a wide spectrum of real-world engineering problems. Prototypical areas of interest include linear heat transfer and linear…

Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which…

We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the arithmetic and geometry of algebraic curves.

The main goal of this project is to prove the equivalency of several characterizations of completeness of Archimedean ordered fields; some of which appear in most modern literature as theorems following from the Dedekind completeness of the…

We give a proposal for future development of the model theory of valued fields. We also summarize some recent results on p-adic numbers.

Symmetry-informed machine learning can exhibit advantages over machine learning which fails to account for symmetry. In the context of continuous symmetry detection, current state of the art experiments are largely limited to detecting…

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

While solving Partial Differential Equations (PDEs) with finite element methods (FEM), serendipity elements allow us to obtain the same order of accuracy as rectangular tensor-product elements with many fewer degrees of freedom (DOFs). To…

We present here algorithms for efficient computation of linear algebra problems over finite fields.

Motivated by the definition of Freiman homomorphism, we explore the possibilities of formulating some basic notions and techniques of additive combinatorics in a categorical language. We show that additive sets and Freiman homomorphisms…

We establish a "diagonal" ergodic theorem involving the additive and multiplicative groups of a countable field $K$ and, with the help of a new variant of Furstenberg's correspondence principle, prove that any "large" set in $K$ contains…

We are going to use the nickname "Das Budapester Programm" for a large class of finite combinatorial problems to be posed below. Following Klein's original idea, they concern various dimensional Euclidean spaces and several groups of…

We begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…

Trained ML models are commonly embedded in optimization problems. In many cases, this leads to large-scale NLPs that are difficult to solve to global optimality. While ML models frequently lead to large problems, they also exhibit…

We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…

Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…