Related papers: Additive decompositions induced by multiplicative …
We improve a recent result of B. Hanson (2015) on multiplicative character sums with expressions of the type $a + b +cd$ and variables $a,b,c,d$ from four distinct sets of a finite field. We also consider similar sums with $a + b(c+d)$.…
We construct a collection of matrices defined by quadratic residue symbols, termed "quadratic residue matrices", associated to the splitting behavior of prime ideals in a composite of quadratic extensions of $\mathbb{Q}$, and prove a simple…
We consider the linear vector space formed by the elements of the finite fields $\mathbb{F}_q$ with $q=p^r$ over $\mathbb{F}_p$. Let ${a_1,\ldots,a_r}$ be a basis of this space. Then the elements $x$ of $\mathbb{F}_q$ have a unique…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
We propose a criterion that allows one to distinguish prime numbers from compound ones. This criterion is based on the counting of small quadratic residues.
In this paper, we derive an explicit combinatorial formula for the number of $k$-subset sums of quadratic residues over finite fields.
This paper provides two characterizations of the primitive roots of unity in quadratic cyclotomic extensions over arbitrary fields. Firstly, we introduce a mapping from $\mathbb{N}$ to $\mathbb{N}$ crucial for describing these roots,…
In this paper, we study several topics on additive decompositions of primitive elemements in finite fields. Also we refine some bounds obtained by Dartyge and S\'{a}rk\"{o}zy and Shparlinski.
Additive one-weight codes over a finite field of non-prime order are equivalent to special subspace coverings of the points of a projective space, which we call multispreads. The current paper is devoted to the characterization of the…
We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…
In the paper we obtain new estimates for binary and ternary sums of multiplicative characters with additive convolutions of characteristic functions of sets, having small additive doubling. In particular, we improve a result of M.-C. Chang.…
In this paper, we study residues of differential 2-forms on a smooth algebraic surface over an arbitrary field and give several statements about sums of residues. Afterwards, using these results we construct algebraic-geometric codes which…
We consider the proportion of zero entries in the character table of a sequence of reductive groups over a finite field. We prove an asymptotic lower bound when the reductive group is fixed and the size of the finite field increases.…
Polynomial composites were introduced by Anderson, Anderson, and Zafrullah. Over time, composites have appeared in many different papers, but they have not been sorted out in the algebra world. This paper is another part of the study of…
Can any element in a sufficiently large finite field be represented as a sum of two $d$th powers in the field? In this article, we recount some of the history of this problem, touching on cyclotomy, Fermat's last theorem, and diagonal…
We generalize Burgess' results on partial Gaussian sums to arbitrary finite fields. The main ingredients are the classical method of amplification, two deep results on multiplicative energy for subsets in finite fields which are obtained…
We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
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 prove that there is a one-one correspondence between sets of irreducible representations of a polyadic group and its Post's cover. Using this correspondence, we generalize some well-known properties of irreducible characters in finite…