Related papers: A Shifted Sum for the Congruent Number Problem

We study the convergence of the Hermite series of measurable functions on the real line. We characterize the norm convergence of truncated partial Hermite sums in rearrangement invariant spaces provided that the truncations vanish…

In this paper, the problem of reconstruction of signals in mixed Lebesgue spaces from their random average samples has been studied. Probabilistic sampling inequalities for certain subsets of shift-invariant spaces have been derived. It is…

The problem of object restoration in the case of spatially incoherent illumination is considered. A regularized solution to the inverse problem is obtained through a probabilistic approach, and a numerical algorithm based on the statistical…

We say a natural number $n$ is matchable if there is a bijection from the set of $\tau(n)$ divisors of $n$ to the set $\{1,2,\dots,\tau(n)\}$, where corresponding numbers are relatively prime. We show that the set of matchable numbers has…

We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…

We introduce invariants, called shifting numbers, that measure the asymptotic amount by which an autoequivalence of a triangulated category translates inside the category. The invariants are analogous to Poincare translation numbers that…

We produce nontrivial asymptotic estimates for shifted sums of the form $\sum a(h)b(m)c(2m-h)$, in which $a(n),b(n),c(n)$ are un-normalized Fourier coefficients of holomorphic cusp forms. These results are unconditional, but we demonstrate…

Let \{X_1, X_2, ...\} be a sequence of independent and identically distributed positive random variables of Pareto-type with index \alpha>0 and let \{N(t); t\geq 0\} be a counting process independent of the X_i's. For any fixed t\geq 0,…

In this paper, we obtain some formulae for harmonic sums, alternating harmonic sums and Stirling number sums by using the method of integral representations of series. As applications of these formulae, we give explicit formula of several…

In this paper, we obtain formulas for the number of representations of positive integers as sums of arbitrarily many squares (and other polygonal numbers) with a certain natural weighting. The resulting weighted sums give Fourier…

The twisted $T$-adic exponential sum associated to a polynomial in one variable is studied. An explicit arithmetic polygon is proved to be the generic Newton polygon of the twisted $C$-function of the T-adic exponential sum. It gives the…

In a common formulation of semi-infinite programs, the infinite constraint set is a requirement that a function parametrized by the decision variables is nonnegative over an interval. If this function is sufficiently closely approximable by…

We give an upper bound for the exponential sum over squarefree integers. This establishes a conjecture by Br\"udern and Perelli.

Numerical analysis has no satisfactory method for the more realistic optimization models. However, with constraint programming one can compute a cover for the solution set to arbitrarily close approximation. Because the use of constraint…

We study real numbers defined by multidimensional automatic arrays weighted by multiplicatively independent bases. Let $a_1, \dots, a_r\geq 2$ be integers such that $\log a_1, \dots, \log a_r$ are $\mathbb Q$-linearly independent. Given…

We consider a generalized Gauss sum supported on matrices over a number field. We evaluate this Gauss sum and relate it to the number of totally isotropic subspaces of related quadratic spaces. Then we consider a further generalization of…

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

Shifted combinatorial optimization is a new nonlinear optimization framework, which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. It captures well studied and…

Using a quadratic version of the Bott residue theorem, we give a quadratic refinement of the count of twisted cubic curves on hypersurfaces and complete intersections in a projective space.

We study representation of square-free polynomials in the polynomial ring F[t] over a finite field F by polynomials in F[t][x]. This is a function field version of the well-studied problem of representing squarefree integers by integer…