Related papers: Variance of the k-fold divisor function in arithme…
We survey general properties of multiplicative arithmetic functions of several variables and related convolutions, including the Dirichlet convolution and the unitary convolution. We introduce and investigate a new convolution, called gcd…
In this paper, we establish an asymptotic formula for the twisted second moments of Dirichlet $L$-functions with one and two twists when averaged over all primitive Dirichlet characters of modulus $R$, where $R$ is a monic polynomial in…
A Dirichlet $k$-partition of a domain is a collection of $k$ pairwise disjoint open subsets such that the sum of their first Laplace--Dirichlet eigenvalues is minimal. In this paper, we propose a new relaxation of the problem by introducing…
Variable Muckenhoupt weights are considered in variable exponent Lebesgue spaces. Applications are given for polynomial approximation in these spaces. Boundedness of averaging operator is proved to gain a transference result. Almost all…
We examine the behavior of the number of $k$-term arithmetic progressions in a random subset of $\mathbb{Z}/n\mathbb{Z}$. We prove that if a set is chosen by including each element of $\mathbb{Z}/n\mathbb{Z}$ independently with constant…
Are score function estimators an underestimated approach to learning with $k$-subset sampling? Sampling $k$-subsets is a fundamental operation in many machine learning tasks that is not amenable to differentiable parametrization, impeding…
We deal with the problem of gradient estimation for stochastic differentiable relaxations of algorithms, operators, simulators, and other non-differentiable functions. Stochastic smoothing conventionally perturbs the input of a…
A new modulus of smoothness and its equivalent $K$-function are defined on the conic domains in $\mathbb{R}^d$, and used to characterize the weighted best approximation by polynomials. Both direct and weak inverse theorems of the…
The present paper is intended to provide the basis for the study of weakly differentiable functions on rectifiable varifolds with locally bounded first variation. The concept proposed here is defined by means of integration by parts…
We improve a result of Lau and Zhao on the variance of Fourier coefficients of primitive cuspidal modular forms for SL2(Z) in arithmetic progressions. This is achieved by using bounds on the first moment of Rankin-Selberg L-functions in the…
We calculate mean values of $\operatorname{GL}_n$-automorphic $L$-functions twisted by primitive even Dirichlet characters of prime-power conductor, at arbitrary points within the critical strip, by derivation of special Voronoi summation…
Sign changes in sums of arithmetic functions and their inverses are a subtle topic with room to grow new results. Suppose that $S_f(x) := \sum_{n \leq x} f(n)$ is the summatory function of some arithmetic function $f$ such that $f(1) \neq…
We study Voronoi diagrams for distance functions that add together two convex functions, each taking as its argument the difference between Cartesian coordinates of two planar points. When the functions do not grow too quickly, then the…
In this paper we introduce a new class of diffeomorphic smoothers based on general spline smoothing techniques and on the use of some tools that have been recently developed in the context of image warping to compute smooth diffeomorphisms.…
In this paper the issue of filtering and smoothing in continuous discrete time is studied when the state variable evolves in some submanifold of Euclidean space, which may not have the usual Lebesgue measure. Formal expressions for…
We study minimization of a structured objective function, being the sum of a smooth function and a composition of a weakly convex function with a linear operator. Applications include image reconstruction problems with regularizers that…
We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument…
The k-means method is one of the most widely used clustering algorithms, drawing its popularity from its speed in practice. Recently, however, it was shown to have exponential worst-case running time. In order to close the gap between…
We prove two bounds for discrete moments of Weyl sums. The first one can be obtained using a standard approach. The second one involves an observation how this method can be improved, which leads to a sharper bound in certain ranges. The…
We derive Vorono\"{\dotlessi} summation formulas for the Liouville function $\lambda(n)$, the M\"{o}bius function $\mu(n)$, and for $d^{2}(n)$, where $d(n)$ is the divisor function. The formula for $\lambda(n)$ requires explicit evaluation…