Related papers: On a function related to Chowla's cosine problem

Let $C=\inf (k/n)\sum_{i=1}^n x_i(x_{i+1}+\dots+x_{i+k})^{-1}$, where the infimum is taken over all pairs of integers $n\geq k\geq 1$ and all positive $x_1,\dots,x_{n+k}$ subject to cyclicity assumption $x_{n+i}=x_i$, $i=1,\dots,k$. We…

In this Note, we try to study the relations between the Goldbach Conjecture and the least prime number in an arithmetic progression. We give a new weakened form of the Goldbach Conjecture. We prove that this weakened form and a weakened…

We consider the one-dimensional Littlewood-Offord problem for general Ising models. More precisely, we consider the concentration function \[Q_n(x,v)=P\left(\sum_{i=1}^{n}\varepsilon_iv_i\in(x-1,x+1)\right),\] where $x\in\mathbb{R}$,…

This paper deals with the optimization of Bolza problem with a system of convex and nonconvex, discrete and differential state variable inequality constraints of second order by deriving necessary and sufficient conditions for optimality.…

Let $t \in \mathbb{N}$, $\eta >0$. Suppose that $x$ is a sufficiently large real number and $q$ is a natural number with $q \leq x^{5/12-\eta}$, $q$ not a multiple of the conductor of the exceptional character $\chi^*$ (if it exists).…

The various ways to reduce number of vectors describing condition of particles for high energy physics problems are presented. In particular decomposition of any vector with respect to the basis, consisting of any four linearly independent…

Let $k\geq2$ and $s$ be positive integers. Let $\theta\in(0,1)$ be a real number. In this paper, we establish that if $s>k(k+1)$ and $\theta>0.55$, then every sufficiently large natural number $n$, subjects to certain congruence conditions,…

We consider the integration of two-dimensional, piecewise constant functions with respect to copulas. By drawing a connection to linear assignment problems, we can give optimal upper and lower bounds for such integrals and construct the…

In this work we study weighted total least squares problems on infinite dimensional spaces. We show that in most cases this problem does not admit a solution (except in the trivial case) and then, we consider a regularization on the…

This work deals with a classic problem: "Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balance scales, with the minimum number of weighings possible, and…

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

Let $P = \{p(i)\}$ be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, there are nontrivial $P$ for which known methods find a…

We study a sequence of differences related to the problem of finding the smallest factorial $n!$ greater than or equal to $a^n$, where $a > 1$, using the gamma function.

The aim of the present paper is to give extensions of the cosine-sine functional equation.

We study local computation algorithms (LCA) for maximum matching. An LCA does not return its output entirely, but reveals parts of it upon query. For matchings, each query is a vertex $v$; the LCA should return whether $v$ is matched -- and…

Finding the largest code with a given minimum distance is one of the most basic problems in coding theory. In this paper, we study the linear programming bound for codes in the Lee metric. We introduce refinements on the linear programming…

Let $A(n,d,w)$ be the largest possible size of an $(n,d,w)$ constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on $A(n,d,w)$ for $n \leq 28$. The used techniques…

We consider the general Choquard equations $$ -\Delta u + u = (I_\alpha \ast |u|^p) |u|^{p - 2} u $$ where $I_\alpha$ is a Riesz potential. We construct minimal action odd solutions for $p \in (\frac{N + \alpha}{N}, \frac{N + \alpha}{N -…

In this note, we study the maximum number $N_\alpha(d)$ of a system of equiangular lines in $\mathbb{R}^d$ with cosine $\alpha$, where $\frac{1}{\alpha}$ is not an odd positive integer. This note is motivated by a remark in a $2018$ paper…

If f(x_1, x_2, ..., x_n) is a polynomial dependent on a large number of independent Bernoulli random variables, what can be said about the maximum concentration of f on any single value? For linear polynomials, this reduces to one version…