Related papers: New extensions to the sumsets with polynomial rest…
We provide new upper bounds for sums of certain arithmetic functions in many variables at polynomial arguments and, exploiting recent progress on the mean-value of the Erd\H os-Hooley $\Delta$-function, we derive lower bounds for the…
We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…
Let p and r be two primes and n, m be two distinct divisors of pr. Consider the n-th and m-th cyclotomic polynomials. In this paper, we present lower and upper bounds for the coefficients of the inverse of one of them modulo the other one.…
We obtain new multilinear multiplier theorems for symbols of restricted smoothness which lie locally in certain Sobolev spaces. We provide applications concerning the boundedness of the commutators of Calder\'on and…
We consider restricted sumsets over field $F$. Let\begin{align*}C=\{a_1+\cdots+a_n:a_1\in A_1,\ldots,a_n\in A_n, a_i-a_j\notin S_{ij}\ \text{if}\ i\not=j\},\end{align*} where $S_{ij}(1\leqslant i\not=j\leqslant n)$ are finite subsets of $F$…
Presented are polynomial identities which imply generalizations of Euler and Rogers--Ramanujan identities. Both sides of the identities can be interpreted as generating functions of certain restricted partitions. We prove the identities by…
Let $\boxplus$, $\boxtimes$ and $\uplus$ be the free additive, free multiplicative, and boolean additive convolutions, respectively. For a probability measure $\mu$ on $[0,\infty)$ with finite second moment, we find the scaling limit of…
We classify newforms with rational Fourier coefficients and complex multiplication for fixed weight up to twisting. Under the extended Riemann hypothesis for odd real Dirichlet characters, these newforms are finite in number. We produce…
Starting from the standard form of the five discrete Painlev\'e equations we show how one can obtain (through appropriate limits) a host of new equations which are also the discrete analogues of the continuous Painlev\'e equations. A…
An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…
A doubly infinite set of series expansion for $1/\pi$ are reported. They follow trivially from a formal expansion for the quotient of the values taken by the gamma function for two (complex) arguments differing by an integer plus one half,…
We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings…
The roots of a complex polynomial depend continuously on the coefficients; that is, an infinitesimal perturbation of the coefficients results in an infinitesimal perturbation of the roots. A short, straightforward proof of this is possible…
Phase space of General Relativity is extended to a Poisson manifold by inclusion of the determinant of the metric and conjugate momentum as additional independent variables. As a result, the action and the constraints take a polynomial…
In the present paper a new mean value theorem for polynomials of special form is obtained. The case of sums on vertices of a regular polygon is studied. A criterion for a certain equation to be satisfied is obtained.
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…
We further develop the finite length path generating transforms introduced previously, and use them to obtain constant sign polynomial expressions that reduce, in the limit of infinite path lengths, to parafermion and ABF Virasoro…
Under certain natural sufficient conditions on the sequence of uniformly bounded closed sets $E_k\subset\mathbb{R}$ of admissible coefficients, we construct a polynomial $P_n(x)=1+\sum_{k=1}^n\varepsilon_k x^k$, $\varepsilon_k\in E_k$, with…
Generalizations of Bell polynomials, Bell numbers, and Stirling numbers of the second kind have been introduced and their generating functions were evaluated.