Related papers: Expression for $g(k)$ Related to Waring's Problem

Given an integer $g$ and also some given integers $m$ (sufficiently large) and $c_1,\dots, c_m$, we show that the number of all non-negative integers $n\le M$ with the property that there exist non-negative integers $k_1,\dots, k_m$ such…

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…

Assuming that the Generalized Riemann Hypothesis (GRH) holds, we prove an explicit formula for the number of representations of an integer as a sum of $k\geq 5$ primes. Our error terms in such a formula improve by some logarithmic factors…

For a finite group $G$, let $\psi(G)$ denote the sum of element orders of $G$. This function was introduced by Amiri, Amiri, and Isaacs in 2009 and they proved that for any finite group $G$ of order $n$, $\psi(G)$ is maximum if and only if…

In this paper, we present an elementary proof of a theorem of Serre concerning the greatest eigenvalues of $k$-regular graphs. We also prove an analogue of Serre's theorem regarding the least eigenvalues of $k$-regular graphs: given…

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…

Let k>2 be a fixed integer exponent and let \theta > 9/10. We show that a positive integer N can be represented as a non-trivial sum or difference of 3 k-th powers, using integers of size at most B, in O(B^{\theta}N^{1/10}) ways, providing…

A classical theorem by Jacobson says that a ring in which every element $x$ satisfies the equation $x^n=x$ for some $n>1$ is commutative. According to Birkhoff's Completeness Theorem, if $n$ is fixed, there must be an equational proof of…

In this paper, we exhibit an asymptotic formula for the number of representations of a large integer as a sum of a fixed power of Piatetski-Shapiro primes, thereby establishing a variant of Waring-Goldbach problem with primes from a sparse…

Orthogonal designs and weighing matrices have many applications in areas such as coding theory, cryptography, wireless networking and communication. In this paper, we first show that if positive integer $k$ cannot be written as the sum of…

Fix $k$ a positive integer, and let $\ell$ be coprime to $k$. Let $p(k,\ell)$ denote the smallest prime equivalent to $\ell \pmod{k}$, and set $P(k)$ to be the maximum of all the $p(k,\ell)$. We seek lower bounds for $P(k)$. In particular,…

Amos et al. (Discrete Appl. Math. 181 (2015) 1-10) introduced the notion of the $k$-forcing number of graph for a positive integer $k$ as the generalization of the zero forcing number of a graph. The $k$-forcing number of a simple graph…

The function g(n) represents the smallest number Q such that every sequence of Q consecutive integers contains an integer coprime to n. We give a new and explicit upper bound on this function.

In this article, we investigate the existence, uniqueness, nonexistence, and regularity of weak solutions to the nonlinear fractional elliptic problem of type $(P)$ (see below) involving singular nonlinearity and singular weights in smooth…

An integer $k$ is called regular (mod $n$) if there exists an integer $x$ such that $k^2x\equiv k$ (mod $n$). This holds true if and only if $k$ possesses a weak order (mod $n$), i.e., there is an integer $m\ge 1$ such that $k^{m+1} \equiv…

We answer in the negative Siegel's problem for $G$-functions, as formulated by Fischler and Rivoal. Roughly, we prove that there are $G$-functions that cannot be written as polynomial expressions in algebraic pullbacks of hypergeometric…

Recently, Fici, Restivo, Silva, and Zamboni introduced the notion of a $k$-anti-power, which is defined as a word of the form $w^{(1)} w^{(2)} \cdots w^{(k)}$, where $w^{(1)}, w^{(2)}, \ldots, w^{(k)}$ are distinct words of the same length.…

We propose a weak Galerkin(WG) finite element method for solving the one-dimensional Burgers' equation. Based on a new weak variational form, both semi-discrete and fully-discrete WG finite element schemes are established and analyzed. We…

Given a classical symmetric pair, $(G,K)$, with $\mathfrak g = Lie(G)$, we provide descriptions of the Hilbert series of the algebra of $K$-invariant vectors in the associated graded algebra of $\mathcal U(\mathfrak g)$ viewed as a…

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…