相关论文: Finite field models in additive combinatorics

Thanks to a new construction of the so-called Chudnovsky-Chudnovsky multiplication algorithm, we design efficient algorithms for both the exponentiation and the multiplication in finite fields. They are tailored to hardware implementation…

For any prime p we consider the density of elements in the multiplicative group of the finite field F_p having order, respectively index, congruent to a(mod d). We compute these densities on average, where the average is taken over all…

Let us consider a generalized Artin-Schreier algebraic function field extension $F$ of the rational function field $\F_{p^n}(x)$ defined over the finite field extension $K=\F_{p^n}$ of the prime field $\F_p$. We assume that $K$ is…

We explore in depth how categorical data can be processed with embeddings in the context of claim severity modeling. We develop several models that range in complexity from simple neural networks to state-of-the-art attention based…

A mathematics student's first introduction to the fundamental theorem of finite fields (FTFF) often occurs in an advanced abstract algebra course and invokes the power of Galois theory to prove it. Yet the combinatorial and algebraic coding…

We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…

Game comonads have brought forth a new approach to studying finite model theory categorically. By representing model comparison games semantically as comonads, they allow important logical and combinatorial properties to be exressed in…

This paper is the second part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the geometric Ramsey…

In this paper, we address the problem for enumerating the number of finite field elements with prescribed trace and co-trace in case of arbitrary characteristic $p$. We show that this problem can be reduced to solving a system of $p-1$…

This is an expository article detailing results concerning large arcs in finite projective spaces, which attempts to cover the most relevant results on arcs, simplifying and unifying proofs of known old and more recent theorems. The article…

There is a parallelism between growth in arithmetic combinatorics and growth in a geometric context. While, over $\mathbb{R}$ or $\mathbb{C}$, geometric statements on growth often have geometric proofs, what little is known over finite…

In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…

We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…

We present an auxiliary space theory that provides a unified framework for analyzing various iterative methods for solving linear systems that may be semidefinite. By interpreting a given iterative method for the original system as an…

In 1952, Perron showed that quadratic residues in a field of prime order satisfy certain ad- ditive properties. This result has been generalized in different directions, and our contribution is to provide a further generalization concerning…

Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…

We study the projections in vector spaces over finite fields. We prove finite fields analogues of the bounds on the dimensions of the exceptional sets for Euclidean projection mapping. We provide examples which do not have exceptional…

In this paper, we improve the finiteness constant for the finiteness principles for $C^m(\mathbb{R}^n,\mathbb{R}^d)$ and $C^{m-1,1}(\mathbb{R}^n,\mathbb{R}^D)$ selection proven by Fefferman, Israel, and the second author and extend the more…

In this article we prove lower and upper bounds for class numbers of algebraic curves defined over finite fields. These bounds turn out to be better than most of the previously known bounds obtained using combinatorics. The methods used in…