English
Related papers

Related papers: On Waring's problem for intermediate powers

200 papers

We study a variant of Waring's problem for $\mathbb{Z}_n$, the ring of integers modulo $n$: For a fixed integer $k \geq 2$, what is the minimum number $m$ of $k$th powers necessary such that $x \equiv x_1^k + \dots + x_m^k \pmod{n}$ has a…

Number Theory · Mathematics 2017-08-31 David Covert , Alex Iosevich , Jonathan Pakianathan

Let $k \ge 2$ and $s$ be positive integers, and let $n$ be a large positive integer subject to certain local conditions. We prove that if $s \ge k^2+k+1$ and $\theta > 31/40$, then $n$ can be expressed as a sum $p_1^k + \dots + p_s^k$,…

Number Theory · Mathematics 2017-07-31 Angel Kumchev , Huafeng Liu

For each positive integer $n$, let $g_\Delta(n)$ be the smallest positive integer $g$ such that every complete quadratic polynomial in $n$ variables which can be represented by a sum of odd squares is represented by a sum of at most $g$ odd…

Number Theory · Mathematics 2019-10-18 Daejun Kim

We show that the Waring's number over a finite field $\mathbb{F}_q$, denoted $g(k,q)$, when exists, coincides with the diameter of the generalized Paley graph $\Gamma(k,q)=Cay(\mathbb{F}_{q},R_k)$ with $R_k=\{x^k : x\in \mathbb{F}_q^*\}$.…

Number Theory · Mathematics 2021-01-06 Ricardo A. Podestá , Denis E. Videla

In this paper, we study a density version of Waring's problem. We prove that a positive density subset of $k$th-powers forms an asymptotic additive basis of order $O(k^2)$ provided that the relative lower density of the set is greater than…

Number Theory · Mathematics 2022-03-08 Juho Salmensuu

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

Number Theory · Mathematics 2025-05-15 Daniel R. Johnston , Simon N. Thomas

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…

Number Theory · Mathematics 2017-07-26 Michael Larsen , Dong Quan Ngoc Nguyen

The Waring function $g(k,q)$ measures the difficulty of Waring's problem for $k$th powers in the field of $q$ elements. Its calculation seems to be difficult, and many partial results have been published, notably upper bounds for certain…

Number Theory · Mathematics 2008-10-03 Arne Winterhof , Christiaan van de Woestijne

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…

Combinatorics · Mathematics 2018-04-03 John Bamberg , Anurag Bishnoi , Gordon F. Royle

We prove that for all integers $k \geq 1$, $q\ge (k-1)^4+ 6k$, and $m \geq 1$, every matrix in $ M_m(\mathbb F_q)$ is a sum of two kth powers: $M_m(\mathbb F_q)=\{A^k+B^k|A,B\in M_m(\mathbb F_q)\}$. We further generalize and refine this…

Number Theory · Mathematics 2024-03-15 Krishna Kishore , Adrian Vasiu , Sailun Zhan

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ as a sum of $r = 2^n + 1$ summands, each of which is an $n$-th power of natural numbers $x_i$, $i = \overline{1,…

Number Theory · Mathematics 2024-11-12 Zarullo Rakhmonov , Firuz Rakhmonov

It is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers of 2. Under the Generalized Rieman Hypothesis one can replace 13 by 7. Unlike previous work on this problem, the proof avoids numerical…

Number Theory · Mathematics 2007-05-23 D. R. Heath-Brown , J. -C. Puchta

Assume that $G$ is a graph with edge ideal $I(G)$ and let $I(G)^{(s)}$ denote the $s$-th symbolic power of $I(G)$. It is proved that for every integer $s\geq 1$, $${\rm reg}(I(G)^{(s+1)})\leq \max\bigg\{{\rm reg}(I(G))+2s, {\rm…

Commutative Algebra · Mathematics 2019-08-30 S. A. Seyed Fakhari

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that, for $12\leqslant b\leqslant 35$ and for every sufficiently large odd integer $N$, the equation…

Number Theory · Mathematics 2017-08-16 Jinjiang Li , Min Zhang

Let G be a finite group and let k be a positive integer. We examine the relationship between structural properties of G and the number of elements of G that are not kth powers in G. In particular, we examine a bound on |G| given by Lucido…

Group Theory · Mathematics 2018-11-06 William Cocke

Let $A$ be a finite set of integers. We show that if $k$ is a prime power or a product of two distinct primes then $$|A+k\cdot A|\geq(k+1)|A|-\lceil k(k+2)/4\rceil$$ provided $|A|\geq (k-1)^{2}k!$, where $A+k\cdot A=\{a+kb:\ a,b\in A\}$. We…

Combinatorics · Mathematics 2014-02-21 Shan-Shan Du , Hui-Qin Cao , Zhi-Wei Sun

For a finite abelian group $G$ written additively, and a non-empty subset $A\subset [1,\exp(G)-1]$ the weighted Davenport Constant of $G$ with respect to the set $A$, denoted $D_A(G)$, is the least positive integer $k$ for which the…

Combinatorics · Mathematics 2018-07-12 Niranjan Balachandran , Eshita Mazumdar

We investigate the asymptotic formula for the number of representations of a large positive integer as a sum of $k$-th powers of integers represented as the sums of three positive cubes, counted with multiplicities. We also obtain a lower…

Number Theory · Mathematics 2020-12-17 Javier Pliego

Let $F$ be an algebraically closed field of characteristic $p>0$. In this paper we develop methods to represent arbitrary elements of $F[t]$ as sums of perfect $k$-th powers for any $k\in\mathbb{N}$ relatively prime to $p$. Using these…

Number Theory · Mathematics 2016-09-06 Seth Dutter , Cole Love

We use transference principle to show that whenever $s$ is suitably large depending on $k \geq 2$, every sufficiently large natural number $n$ satisfying some congruence conditions can be written in the form $n = p_1^k + \dots + p_s^k$,…

Number Theory · Mathematics 2019-03-06 Juho Salmensuu