English
Related papers

Related papers: On Waring's problem for intermediate powers

200 papers

The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…

General Mathematics · Mathematics 2024-11-20 Eteri Samsonadze

In this note we construct a new infinite family of $(q-1)$-regular graphs of girth $8$ and order $2q(q-1)^2$ for all prime powers $q\ge 16$, which are the smallest known so far whenever $q-1$ is not a prime power or a prime power plus one…

Combinatorics · Mathematics 2015-01-13 M. Abreu , G. Araujo-Pardo , C. Balbuena , D. Labbate

For positive integers $s$ and $k_1, k_2, ..., k_s$, let $w(k_1,k_2,...,k_s)$ be the minimum integer $n$ such that any $s$-coloring $\{1,2,...,n\} \to \{1,2,...,s\}$ admits a $k_i$-term arithmetic progression of color $i$ for some $i$, $1…

Combinatorics · Mathematics 2007-07-02 Tom Brown , Bruce M. Landman , Aaron Robertson

Let $G$ be an additive finite abelian group and let $k\in [\exp(G),\mathsf{D}(G)-1]$ be a positive integer. Denote by $\mathsf{s}_{\leq k}(G)$ the smallest positive integer $l\in \mathbb{N}\cup \{+\infty\}$ such that each sequence of length…

Combinatorics · Mathematics 2025-06-27 Kevin Zhao

In this paper, we explore identities that allow for representation of positive integers raised to positive integral powers as sums of nested sums of smaller positive integral powers. We begin by establishing the base identity involving…

Number Theory · Mathematics 2025-07-01 Nikita Gurin

We prove a new criterion for the solvability of the finite groups, depending on the function $\psi_k(G)$ which is defined as the sum of $k$-th powers of the element orders of $G$. We show that our result can be used to show the solvability…

Group Theory · Mathematics 2022-12-16 Hiranya Kishore Dey

For n=1,2,3,... define S(n) as the smallest integer m>1 such that those 2k(k-1) mod m for k=1,...,n are pairwise distinct; we show that S(n) is the least prime greater than 2n-2 and hence the value set of the function S(n) is exactly the…

Number Theory · Mathematics 2013-04-18 Zhi-Wei Sun

An intersective polynomial is a monic polynomial in one variable with rational integer coefficients, with no rational root and having a root modulo $m$ for all positive integers $m$. Let $G$ be a finite noncyclic group and let $r(G)$ be the…

Group Theory · Mathematics 2015-07-31 D. Bubboloni , J. Sonn

Let $A$ be a subset of integers and let $2\cdot A+k\cdot A=\{2a_1+ka_2 : a_1,a_2\in A\}$. Y. O. Hamidoune and J. Ru\' e proved that if $k$ is an odd prime and $A$ a finite set of integers such that $|A|>8k^k$, then $|2\cdot A+k\cdot A|\ge…

Number Theory · Mathematics 2011-03-16 Zeljka Ljujic

The covering number of a finite group $G$, denoted $\sigma(G)$, is the smallest positive integer $k$ such that $G$ is a union of $k$ proper subgroups. We calculate $\sigma(G)$ for a family of primitive groups $G$ with a unique minimal…

Group Theory · Mathematics 2023-01-11 Martino Garonzi , Julia Almeida

Let $G$ be an additive finite abelian group with exponent $\exp(G)=m$. For any positive integer $k$, the $k$-th generalized Erd\H{o}s-Ginzburg-Ziv constant $\mathsf s_{km}(G)$ is defined as the smallest positive integer $t$ such that every…

Combinatorics · Mathematics 2018-11-27 Dongchun Han , Hanbin Zhang

Let $G$ be a finite additive abelian group. For given $k$ a positive integer, the $k$-Harborth constant $g^k(G)$ is defined to be the smallest positive integer $t$ such that given a set $S$ of elements of $G$ with size $t$ there exists a…

Combinatorics · Mathematics 2022-09-30 A. Lemos , B. K. Moriya , A. O. Moura , A. T. Silva

In recent years, maximizing G\'al sums regained interest due to a firm link with large values of $L$-functions. In the present paper, we initiate an investigation of small sums of G\'al type, with respect to the $L^1$-norm. We also consider…

Number Theory · Mathematics 2020-07-13 Régis de la Bretèche , Marc Munsch , Gérald Tenenbaum

Let $a$ be a positive integer, and let $\sigma(a)$ denote the least natural number $s$ such that an integer square lies between $s^2 a$ and $s^2 (a+1)$; let $\tau_s(a)$ denote the number of such integer squares. The function $\sigma(a)$ and…

Number Theory · Mathematics 2015-10-27 Michael Weiss

Let $t \in \mathbb{N}$, $\eta >0$. Suppose that $x$ is a sufficiently large real number and $q$ is a natural number with $q \leq x^{5/12-\eta}$, $q$ not a multiple of the conductor of the exceptional character $\chi^*$ (if it exists).…

Number Theory · Mathematics 2016-01-27 Roger C. Baker , Liangyi Zhao

A subset $S$ of a group $(G,+)$ is $t$-weakly sequenceable if there is an ordering $(y_1, \ldots, y_k)$ of its elements such that the partial sums~$s_0, s_1, \ldots, s_k$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i y_j$ for $1 \leq i \leq…

Combinatorics · Mathematics 2024-02-15 Simone Costa , Stefano Della Fiore

For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…

Number Theory · Mathematics 2010-07-05 Alfred Geroldinger , David J. Grynkiewicz , Wolfgang A. Schmid

For $k$ a positive integer let $S_k(n) = 1^k + 2^k + \cdots + n^k$, i.e., $S_k(n)$ is the sum of the first $k$-th powers. Faulhaber conjectured (later proved by Jacobi) that for $k$ odd, $S_k(n)$ could be written as a polynomial of…

Number Theory · Mathematics 2020-09-08 Steven J. Miller , Enrique Treviño

The crossing number $cr(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$-planar crossing number of $G$, $cr_k(G)$, is defined as the minimum of…

Combinatorics · Mathematics 2018-12-27 János Pach , László A. Székely , Csaba D. Tóth , Géza Tóth

Let $k \geq 3$ and let $L_i(n) = A_in + B_i$ be some linear forms such that $A_i$ and $B_i$ are integers. Define ${\mathcal{P}(n) = \prod_{i=1}^k L_i(n)}$. For each $k$ it is known that $\Omega (\mathcal{P} (n) ) \leq \rho_k$ infinitely…

Number Theory · Mathematics 2020-06-16 Paweł Lewulis