相关论文: On the Waring-Goldbach Problem for tenth powers

We provide empirical evidence for the Erd\H{o}s-Straus conjecture by improving computational bounds to $10^{18}$ and by evaluating the solution-counting function $f(p)$ for this conjecture.

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…

By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.

On the Waring's problems for matrices over a commutative ring, there are some trace conditions provided for matrices eligibly expressed as a sum of $k$-th powers with $k=2,3,4,5,6,7,8$ in several literatures. In this paper, we provide the…

We survey the potential for progress in additive number theory arising from recent advances concerning major arc bounds associated with mean value estimates for smooth Weyl sums. We focus attention on the problem of representing large…

This paper expands and improves on the general Sieve method. This expaned and improved Sieve is applied to Goldbach's problem. A new estimate of the exception set in Goldbach's number E(X), an improved lower bound D_{1,2}(N) and upper bound…

It is shown that the doublet-triplet splitting problem can be solved in SO(10) using the Dimopoulos-Wilczek mechanism with a very economical Higgs content and simple structure. Only one adjoint Higgs field is required, together with spinor…

We revisit a minimal renormalisable $SO(10)$ grand unified theory, with the Higgs representation $45_{\rm H}$, $126_{\rm H}$ and complex $10_{\rm H}$, responsible for the unification, intermediate and the weak scale symmetry breaking,…

We prove that every sufficiently large odd integer can be expressed as a sum of one square and fourteen fifth powers, all of primes. In addition, we establish that every sufficiently large even integer can be written as a sum of one square,…

Let $E(X)$ denote the number of even integers below $X$ which are not a sum of two primes. We prove the bound $E(X)=O(X^{\frac{7}{10}})$, where the implicit constant is ineffective. The method applied here also leads to $P(q)=O(q^5)$, where…

It is proved that bounded solutions of modified ($\theta$-twisted) cohomological equations for expanding circle maps are $\theta$-H\"{o}lder continuous but are not $(\theta+\gamma)$-H\"{o}lder continuous for every $\gamma>0$ at almost every…

We give an upper bound for the minimum $s$ with the property that every sufficiently large integer can be represented as the sum of $s$ positive $k$-th powers of integers represented as the sum of three positive cubes for the cases $2\leq…

We improve the known upper bound for short exponential sums and increase the range on which a sharp upper bound is known.

The Weyl group symmetry W(E_k) is studied from the points of view of the E-strings, Painleve equations and U-duality. We give a simple reformulation of the elliptic Painleve equation in such a way that the hidden symmetry W(E_10) is…

We prove the local boundedness and the local H\"older continuity of weak solutions to nonlocal equations with variable orders and exponents under sharp assumptions.

The minimal renormalizable supersymmetric SO(10) model, an SO(10) framework with only one 10 and one 126 Higgs multiplets in the Yukawa sector, is attractive because of its high predictive power for the neutrino oscillation data. However,…

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…

We find upper bounds that are sharp for the number of $k$th powers inside arbitrary arithmetic progressions whose step has $O(1)$ many divisors.

This article provides an Omega-result for the remainder term in Weyl's law for the spectral counting function of certain (2l+1)-dimensional Heisenberg manifolds.

The Waring rank of the generic $d \times d$ determinant is bounded above by $d \cdot d!$. This improves previous upper bounds, which were of the form an exponential times the factorial. Our upper bound comes from an explicit power sum…