Related papers: A lower bound for the variance of generalized divi…
We consider the summatory function of the number of prime factors for integers $\leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg…
In the context of global optimization and mixed-integer non-linear programming, generalizing a technique of D'Ambrosio, Fampa, Lee and Vigerske for handling the square-root function, we develop a virtuous smoothing method, using cubics,…
We establish a lower bound on the forcing numbers of domino tilings computable in polynomial time based on height functions. This lower bound is sharp for a 2n by 2n square as well as other cases.
We provide uniform bounds on mean values of multiplicative functions under very general hypotheses, detecting certain power savings missed in known results in the literature. As an application, we study the distribution of the…
For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >=…
We prove an exponential lower bound for general circuits computing the clique function and hereby confirm that NP != P.
We prove a higher order generalization of Glaeser inequality, according to which one can estimate the first derivative of a function in terms of the function itself, and the Holder constant of its k-th derivative. We apply these…
We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…
We define an $f$-restricted partition $p_f(n,k)$ of fixed length $k$ given by the bivariate generating series \begin{align*} Q_f(z,u) \coloneqq 1+\sum_{n=1}^{\infty}\sum_{k=1}^{\infty} p_f(n,k) u^kz^n…
For arbitrary two probability measures on real d-space with given means and variances (covariance matrices), we provide lower bounds for their total variation distance. In the one-dimensional case, a tight bound is given.
We apply a probabilistic approach to study the computational complexity of analog computers which solve linear programming problems. We analyze numerically various ensembles of linear programming problems and obtain, for each of these…
For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…
A loss function measures the discrepancy between the true values and their estimated fits, for a given instance of data. In classification problems, a loss function is said to be proper if a minimizer of the expected loss is the true…
We give a new non-trivial upper bound for the Selberg integral of the three-divisor function $d_3(n)$. Our method applies our recent conjecture together with Laporta, for the modified Selberg integral of $d_3(n)$, and a kind of modified…
A generalization of the Davenport constant is investigated. For a finite abelian group $G$ and a positive integer $k$, let $D_k(G)$ denote the smallest $\ell$ such that each sequence over $G$ of length at least $\ell$ has $k$ disjoint…
In this paper, we study the sum of the divisor function over sets with digit restrictions.
Our main result provides a closed expression for the completely bounded Fourier multiplier norm of the spherical functions on the generalized Lorentz groups. As a corollary, we find that there is no uniform bound on the completely bounded…
We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…
Keating and Rudnick derived asymptotic formulas for the variances of primes in arithmetic progressions and short intervals in the function field setting. Here we consider the hybrid problem of calculating the variance of primes in…
For a finite subset $I$ of positive integers, the descent polynomial $\mathcal{D}(I;n)$ counts the number of permutations in $S_n$ that have descent set $I$. We generalize descent polynomials by considering permutations with a specific…