Related papers: On Waring's problem for intermediate powers

Let $k_i\in \mathbb N$ $(i\ge 1)$ satisfy $2\le k_1\le k_2\le \ldots $. Freiman's theorem shows that when $j\in \mathbb N$, there exists $s=s(j)\in \mathbb N$ such that all large integers $n$ are represented in the form…

For any graph $G$, assume that $J(G)$ is the cover ideal of $G$. Let $J(G)^{(k)}$ denote the $k$th symbolic power of $J(G)$. We characterize all graphs $G$ with the property that $J(G)^{(k)}$ has a linear resolution for some (equivalently,…

Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies…

This paper is concerned with the function $r_{k,s}(n)$, the number of (ordered) representations of $n$ as the sum of $s$ positive $k$-th powers, where integers $k,s\ge 2$. We examine the mean average of the function, or equivalently,…

In this paper we show that for every positive integer $n$ there exists a prime number in the interval $[n,9(n+3)/8]$. Based on this result, we prove that if $a$ is an integer greater than 1, then for every integer $n>14.4a$ there are at…

A notion of open rank, related with generic power sum decompositions of forms, has recently been introduced in the literature. The main result here is that the maximum open rank for plane quartics is eight. In particular, this gives the…

We establish that every set of $k=10$ natural numbers determines at least $30$ distinct pairwise sums or at least $30$ distinct pairwise products, as well as the analogous result for $k=11$ and at least $34$ sums/products, with sharpness…

We determine the Waring rank of the fundamental skew invariant of any complex reflection group whose highest degree is a regular number. This includes all irreducible real reflection groups.

Using sharper Weyl sum estimates, we show that $H(10)\le 105$, improving upon the previous bound of $107$.

Let $G$ be a finite group and let $ram^{t}(G)$ denote the minimal positive integer $n$ such that $G$ can be realized as the Galois group of a tamely ramified extension of $\mathbb{Q}$ ramified only at $n$ finite primes. Let $d(G)$ denote…

Let s and k be integers with s \geq 2 and k \geq 2. Let g_k^{(s)}(n) denote the cardinality of the largest subset of the set {1,2,..., n} that contains no geometric progression of length k whose common ratio is a power of s. Let r_k(\ell)…

Let $G$ be a finite abelian group, and let $m>0$ with $\exp(G)\mid m$. Let $s_{m}(G)$ be the generalized Erd\H{o}s-Ginzburg-Ziv invariant which denotes the smallest positive integer $d$ such that any sequence of elements in $G$ of length…

Let $G$ be a simple graph and $I$ its edge ideal. We prove that $${\rm reg}(I^{(s)}) = {\rm reg}(I^s)$$ for $s = 2,3$, where $I^{(s)}$ is the $s$-th symbolic power of $I$. As a consequence, we prove the following bounds \begin{align*} {\rm…

We prove that $164634913$ is the smallest positive integer that is a sum of two rational sixth powers but not a sum of two integer sixth powers. If $C_{k}$ is the curve $x^{6} + y^{6} = k$, we use the existence of morphisms from $C_{k}$ to…

Let $a > 1$. Then $a^n < n!$ for some positive integer $n$. We show that the smallest such $n$ is one of a pair of possibilities, or is one possibility, which we show how to calculate. There are three interesting numerical sequences which…

Given a fixed positive integer $k$, the $k$-planar local crossing number of a graph $G$, denoted by $\text{LCR}_k(G)$, is the minimum positive integer $L$ such that $G$ can be decomposed into $k$ subgraphs, each of which can be drawn in a…

We assumed that, for every natural number k, there is a natural number u such that the (k-1)th term of G(u) is k^k, and that G(u) terminates finitely. It immediately follows that every Goodstein Sequence G(m) over the natural numbers must…

The inverse Galois problem is concerned with finding a Galois extension of a field $K$ with given Galois group. In this paper we consider the particular case where the base field is $K=\F_p(t)$. We give a conjectural formula for the minimal…

For two graph H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every red-blue edge coloring of the complete graph K_n on n vertices contains either a red copy of H or a blue copy of G. Motivated by questions…

For a real set $A$ consider the semigroup $S(A)$, additively generated by $A$; that is, the set of all real numbers representable as a (finite) sum of elements of $A$. If $A \subset (0,1)$ is open and non-empty, then $S(A)$ is easily seen…