Related papers: The Waring's problem over finite fields through ge…

The cage problem asks for the smallest number $c(k,g)$ of vertices in a $k$-regular graph of girth $g$ and graphs meeting this bound are known as cages. While cages are known to exist for all integers $k \ge 2$ and $g \ge 3$, the exact…

In this paper, we formulate an analogue of Waring's problem for an algebraic group $G$. At the field level we consider a morphism of varieties $f\colon \mathbb{A}^1\to G$ and ask whether every element of $G(K)$ is the product of a bounded…

We improve the bound of the $g$-invariant of the ring of integers of a totally real number field, where the $g$-invariant $g(r)$ is the smallest number of squares of linear forms in $r$ variables that is required to represent all the…

The generalized Ramsey number $f(n, p, q)$ is the smallest number of colors needed to color the edges of the complete graph $K_n$ so that every $p$-clique spans at least $q$ colors. Erd\H{o}s and Gy\'arf\'as showed that $f(n, p, q)$ grows…

Let $GP(q,d)$ be the $d$-Paley graph defined on the finite field $\mathbb{F}_q$. It is notoriously difficult to improve the trivial upper bound $\sqrt{q}$ on the clique number of $GP(q,d)$. In this paper, we investigate the connection…

We explore a paradigm which ties together seemingly disparate areas in number theory, additive combinatorics, and geometric combinatorics including the classical Waring problem, the Furstenberg-S\'{a}rk\"{o}zy theorem on squares in sets of…

We investigate the existence of representations of every large positive integer as a sum of $k$-th powers of integers represented as certain diagonal forms. In particular, we consider a family of diagonal forms and discuss the problem of…

Denote by P(K, k) the members of the field K which are sums of kth powers of field elements, by P+(K, k) the set of members of K which are sums of kth powers of totally positive elements of K. We are interested in deciding whether or not…

Let $G(k)$ denote the least number $s$ having the property that every sufficiently large natural number is the sum of at most $s$ positive integral $k$-th powers. Then for all $k\in \mathbb N$, one has \[ G(k)\le \lceil k(\log…

Motivated by the well-known Paley graphs over finite fields and their generalizations, in this paper we explore a natural multiplicative-additive analogue of such graphs arising from vector spaces over finite fields. Namely, if $n\ge 2$ and…

The commuting graph of a group G, denoted by Gamma(G), is the simple undirected graph whose vertices are the non-central elements of G and two distinct vertices are adjacent if and only if they commute. Let Z_m be the commutative ring of…

Let $q$ be a prime power such that $q\equiv 1\pmod{4}$. The Paley graph of order $q$ is the graph with vertex set as the finite field $\mathbb{F}_q$ and edges defined as, $ab$ is an edge if and only if $a-b$ is a non-zero square in…

The family of generalized Paley graphs of prime power order $q$ and degree $(q-1)/k$ is studied. It is shown that the automorphism group of a graph in this family is a subgroup of ${\mathrm{A\Gamma L}}(1,q)$ whenever $q$ is sufficiently…

Let $f\in \mathbb{Q}(x)$ be a non-constant rational function. We consider "Waring's Problem for $f(x)$," i.e., whether every element of $\bbq$ can be written as a bounded sum of elements of $\{f(a)\mid a\in \mathbb{Q}\}$. For rational…

To construct a Paley graph, we fix a finite field and consider its elements as vertices of the Paley graph. Two vertices are connected by an edge if their difference is a square in the field. We will study some important properties of the…

Given positive integers $p$ and $q$, a $(p,q)$-coloring of the complete graph $K_n$ is an edge-coloring in which every $p$-clique receives at least $q$ colors. Erd\H{o}s and Shelah posed the question of determining $f(n,p,q)$, the minimum…

Let $q$ be an odd power of a prime $p$, and $S \subset \mathbb{F}_q^*$ such that $S=-S$ and $S/S \neq \mathbb{F}_q^*$. We show that the clique number of the Cayley graph $\operatorname{Cay}(\mathbb{F}_q^+,S)$ is at most…

Let $\Gamma$ be a quiver on n vertices $v_1, v_2, ..., v_n$ with $g_{ij}$ edges between $v_i$ and $v_j$, and let $\alpha \in \N^n$. Hua gave a formula for $A_{\Gamma}(\alpha, q)$, the number of isomorphism classes of absolutely…

In this paper we obtain sharp results for Waring's problem over general finite rings, by using a combination of Artin-Wedderburn theory and Hensel's lemma and building on new proofs of analogous results over finite fields that are achieved…

We derive an asymptotic formula for the number of solutions in a given subfield to certain system of equations over finite fields. As an application, we construct new families of maximal cliques in generalized Paley graphs. Given integers…