Related papers: Some sum-product type estimates for two-variables …
Most prime gaps results have been proven using tools from analytic or algebraic number theory in the last few centuries. In this paper, we would like to present some probabilistic way of proving many essential results. A major component of…
We consider a problem of P. Erdos, A. M. Odlyzko and A. Sarkozy about the representation of residue classes modulo m by products of two not too large primes. While it seems that even the Extended Riemann Hypothesis is not powerful enough to…
Let $P(x)\in \mathbb{Z}[x]$ be a polynomial with at least two distinct complex roots. We prove that the number of solutions $(x_1, \dots, x_k, y_1, \dots, y_k)\in [N]^{2k}$ to the equation \[ \prod_{1\le i \le k} P(x_i) = \prod_{1\le j \le…
Sum-rank codes have wide applications in multishot network coding, distributed storage and the construction of space-time codes. Asymptotically good sequences of linearized algebraic geometry sum-rank codes, exceeding the…
We give an improved bound on the famed sum-product estimate in a field of residue class modulo $p$ ($\mathbb{F}_{p}$) by Erd\H{o}s and Szemeredi, and a non-empty set $A \subset \mathbb{F}_{p}$ such that: $$ \max \{|A+A|,|A A|\} \gg \min…
Wolstenholme's type summations involve certain powers of all residues $k$ modulo some prime number $p$. We first consider the sums of double or triple products of certain powers of all residues, e.g., the sums of the terms $(a+k)^m(b+k)^n$…
Properties of analytic vectors in representations of SL(2,R) are used to give new bounds for the triple products recently considered by P. Sarnak. A conjecture of Sarnak about such products is proved. The results of this paper generalize…
The main results extend to sums over primes in a short interval earlier estimates by the author for "long" Weyl sums over primes.
This is my Ph.D. Thesis at Tohoku Univeristy (July 2018). It presents the theory on shape derivatives and focuses on its applications to two-phase optimization problems. In particular, we treat the two-phase torsion problem and a two-phase…
This paper introduces a deterministic algorithm for solving an instance of the Subset Sum Problem based on a new method entitled the Bipartite Synthesis Method. The algorithm is described and shown to have worst-case limiting performance…
For the past 25 years, one of the most studied algorithms in the field of Nonlinear Approximation Theory has been the Thresholding Greedy Algorithm. In this paper, we propose new summability methods for this algorithm, generating two new…
We propose a method for determining which integers can be written as a sum of two integral squares for quadratic fields $\Q(\sqrt{\pm p})$, where $p$ is a prime.
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…
This paper is a corrigendum to the article 'On the ideal theorem for number fields`. The main result of this paper proves to be untrue and is replaced by an estimate of a weighted sum with an improved error term.
We extend a recent result of Khalfalah and Szemeredi to the polynomials of prime variables.
We prove sum formulas for double polylogarithms of Hurwitz type, that is, involving a shifting parameter $b$ in the denominator. These formulas especially imply well-known sum formulas for double zeta values, and sum formulas for double…
We give a Molev-Sagan type formula for computing the product $\mathfrak{S}_u(x;y)\mathfrak{S}_v(x;z)$ of two double Schubert polynomials in different sets of coefficient variables where the descents of $u$ and $v$ satisfy certain conditions…
When solving a number of problems in prime number theory, it is sufficient that $t(x;q)$ admits an estimate close to this one. The best known estimates for $t(x;q)$ previously belonged to G.~Montgomery, R.~Vaughn, and Z.~Kh.~Rakhmonov. In…
In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an improved bound compared to both the Weil bound and the index…
In 2014, Chen and Singer solved the summability problem of bivariate rational functions. Later an algorithmic proof was presented by Hou and the author. In this paper, the algorithm will be simplified and adapted to the $q$-case.