Related papers: A note on Waring's problem
Waring's Problem asks whether, for each positive integer $k$, there exists an integer $s$ such that every positive integer is a sum of at most $k$th powers. While Hilbert proved the existence of such $s$, Waring's Problem has lead to areas…
Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…
Extending the approach of Iwaniec and Duke, we present strong uniform bounds for Fourier coefficients of half-integral weight cusp forms of level $N$. As an application, we consider a Waring-type problem with sums of mixed powers.
We improve recent results of D. Gomez and A. Winterhof (2010) and of A. Ostafe and I. E. Shparlinski (2011) on the Waring problem with Dickson polynomials in the case of prime finite fields. Our approach is based on recent bounds of…
In this paper, we present a new smoothing approach to solve general nonlinear complementarity problems. Under the $P_0$ condition on the original problems, we prove some existence and convergence results . We also present an error estimate…
In this paper, we rewrite the Stokes eigenvalue problem as an Elliptic eigenvalue problem restricted to subspace, and introduce an abstract framework of solving abstract elliptic eigenvalue problem to give the WG scheme, error estimates and…
Given a smooth positive function $K$ on the standard sphere $(\mathbb{S}^n,g_0)$, we use Morse theoretical methods and counting index formulae to prove that, under generic conditions on the function $K$, there are arbitrarily many metrics…
This article provides a general iterative approximation to partial differential equations, and thus establish existence of smooth solution. The heart of the method is to contract (or expand) the boundary conditions uniformly in the domain,…
We obtain an asymptotic formula on the Odlyzko-Stanley enumeration problem. Let $N_m^*(k,b)$ be the number of $k$-subsets $S\subseteq F_p^*$ such that $\sum_{x\in S}x^m=b$. If $m<p^{1-\delta}$, then there is a constant…
Along this work we study an indefinite abstract smoothing problem. After establishing necessary and sufficient conditions for the existence of solutions to this problem, the set of admissible parameters is discussed in detail. Then, its…
A natural number is a binary $k$'th power if its binary representation consists of $k$ consecutive identical blocks. We prove an analogue of Waring's theorem for sums of binary $k$'th powers. More precisely, we show that for each integer $k…
Let $\phi(n)$ be the Euler-phi function, define $\phi_0(n) = n$ and $\phi_{k+1}(n)=\phi(\phi_{k}(n))$ for all $k\geq 0$. We will determine an asymptotic formula for the set of integers $n$ less than $x$ for which $\phi_k(n)$ is $y$-smooth,…
We survey the various constructions of forward self-similar solutions (and generalizations of self-similar solutions) to the Navier-Stokes equations. We also include and prove an extension of a recent result from [7].
Let $\mathbb{N}_0$ be a class of natural numbers whose binary expansions contain even numbers of ones. Waring problem in numbers of class $\mathbb{N}_0$ is solved.
In part I of this paper we studied additive decomposability of the set $\F_y$ of th $y$-smooth numbers and the multiplicative decomposability of the shifted set $\g_y=\F_y+\{1\}$. In this paper, focusing on the case of 'large' functions…
We prove a tight quantum query lower bound $\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large. This is an…
We investigate a version of Waring's Problem over quaternion rings, focusing on cubes in quaternion rings with integer coefficients. We determine the global upper and lower bounds for the number of cubes necessary to represent all such…
Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we generalize the result of Vaughan for ternary admissible exponent. Moreover, we use the refined admissible…
This work introduces a moving anchor acceleration technique to extragradient algorithms for smooth structured minimax problems. The moving anchor is introduced as a generalization of the original algorithmic anchoring framework, i.e. the…
A new weak Galerkin (WG) finite element method for solving the second-order elliptic problems on polygonal meshes by using polynomials of boundary continuity is introduced and analyzed. The WG method is utilizing weak functions and their…