English
Related papers

Related papers: A Montgomery-Hooley theorem for the k-fold divisor…

200 papers

Given a planar curve, imagine rolling a sphere along that curve without slipping or twisting, and by this means tracing out a curve on the sphere. It is well known that such a rolling operation induces a local isometry between the sphere…

Statistics Theory · Mathematics 2026-02-17 Simon Preston , Karthik Bharath , Pablo Lopez-Custodio , Alfred Kume

Based on the concept of manifold valued generalized functions we initiate a study of nonlinear ordinary differential equations with singular (in particular: distributional) right hand sides in a global setting. After establishing several…

Functional Analysis · Mathematics 2007-05-23 Michael Kunzinger , Michael Oberguggenberger , Roland Steinbauer , James A. Vickers

We investigate a fifty-year-old conjecture of Erd\H{o}s and Graham concerning whether the binomial coefficient ${n \choose k}$ with $1 \leq k \leq \frac{n}{2}$ must always have a divisor $\leq n$ that is ``close'' to $n$: that is, bigger…

Number Theory · Mathematics 2026-05-21 Hung M. Bui , Kyle Pratt , Alexandru Zaharescu

Motivated by applications to multiplicity formulas in index theory, we study a family of distributions $\Theta(m;k)$ associated to a piecewise quasi-polynomial function $m$. The family is indexed by an integer $k \in \mathbb{Z}_{>0}$, and…

Classical Analysis and ODEs · Mathematics 2022-05-03 Yiannis Loizides , Paul-Emile Paradan , Michele Vergne

We estimate the concentration functions of $n$-fold convolutions of one-dimensional probability measures. The main result is a supplement to the results of G\"otze and Zaitsev (1998). We show that the estimation of concentration functions…

Probability · Mathematics 2014-02-28 F. Götze , A. Yu. Zaitsev

The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…

Computational Geometry · Computer Science 2008-12-03 Andrea Vattani

We obtain sharp gradient bounds for perturbed diffusion semigroups. In contrast with existing results, the perturbation is here random and the bounds obtained are pathwise. Our approach builds on the classical work of Kusuoka and Stroock…

Probability · Mathematics 2013-11-05 Dan Crisan , Christian Litterer , Terry Lyons

Integrals of characteristic classes of tautological sheaves on the Hilbert scheme of points on a surface frequently arise in enumerative problems. We use the K-theoretic Donaldson-Thomas theory of certain toric Calabi-Yau threefolds to…

Algebraic Geometry · Mathematics 2021-08-12 Noah Arbesfeld

In [GW09a] we conjectured that uniformity of degree $k-1$ is sufficient to control an average over a family of linear forms if and only if the $k$th powers of these linear forms are linearly independent. In this paper we prove this…

Number Theory · Mathematics 2019-06-14 W. T. Gowers , J. Wolf

We show that the theory of varifolds can be suitably enriched to open the way to applications in the field of discrete and computational geometry. Using appropriate regularizations of the mass and of the first variation of a varifold we…

Classical Analysis and ODEs · Mathematics 2017-08-02 Blanche Buet , Gian Paolo Leonardi , Simon Masnou

Generalized smooth functions are a possible formalization of the original historical approach followed by Cauchy, Poisson, Kirchhoff, Helmholtz, Kelvin, Heaviside, and Dirac to deal with generalized functions. They are set-theoretical…

Functional Analysis · Mathematics 2016-06-14 Paolo Giordano , Michael Kunzinger

A long standing conjecture, known to us as the Eisenbud Goto conjecture, states that an n-dimensional variety embedded with degree $d$ in the $N$- dimensional projective space is $(d-(N-n)+1)$-regular in the sense of Castelnuovo-Mumford. In…

alg-geom · Mathematics 2007-05-23 Alberto Alzati , Gian Mario Besana

We estimate linear functionals in the classical deconvolution problem by kernel estimators. We obtain a uniform central limit theorem with $\sqrt{n}$-rate on the assumption that the smoothness of the functionals is larger than the…

Statistics Theory · Mathematics 2020-06-12 Jakob Söhl , Mathias Trabs

The largest order $n(d,k)$ of a graph of maximum degree $d$ and diameter $k$ cannot exceed the Moore bound, which has the form $M(d,k)=d^k - O(d^{k-1})$ for $d\to\infty$ and any fixed $k$. Known results in finite geometries on generalised…

Combinatorics · Mathematics 2017-09-29 Martin Bachratý , Jana Šiagiová , Jozef Širáň

In this paper, we use normal surface theory to study Dehn filling on a knot-manifold. First, it is shown that there is a finite computable set of slopes on the boundary of a knot-manifold that bound normal and almost normal surfaces in a…

Geometric Topology · Mathematics 2007-05-23 William Jaco , Eric Sedgwick

Let $d^{(k)}(n)$ be the $k$-free divisor function for integer $k\ge2$. Let $a$ be a nonzero integer. In this paper, we establish an asymptotic formula \begin{equation*} \sum_{p\leq x} d^{(k)}(p-a) =b_k \cdot x+O\left(\frac{x}{\log x}\right)…

Number Theory · Mathematics 2024-06-19 Biao Wang

We consider a translation and dilation invariant system consisting of k diagonal equations of degrees 1,2,...,k with integer coefficients in s variables, where s is sufficiently large in terms of k. We show via the Hardy-Littlewood circle…

Number Theory · Mathematics 2010-10-11 Matthew L. Smith

For an odd integer $d > 1$ and a finite Galois extension $K/\mathbb{Q}$ of degree $d$, G. L\"{u} and Z. Yang \cite{lu3} obtained an asymptotic formula for the mean values of the divisor function for $K$ over square integers. In this…

Number Theory · Mathematics 2019-06-05 Jaitra Chattopadhyay , Pranendu Darbar

In this paper we address the convergence of stochastic approximation when the functions to be minimized are not convex and nonsmooth. We show that the "mean-limit" approach to the convergence which leads, for smooth problems, to the ODE…

Optimization and Control · Mathematics 2018-05-08 Szymon Majewski , Błażej Miasojedow , Eric Moulines

Aaronson and Ambainis (SICOMP `18) showed that any partial function on $N$ bits that can be computed with an advantage $\delta$ over a random guess by making $q$ quantum queries, can also be computed classically with an advantage $\delta/2$…

Quantum Physics · Physics 2020-11-18 Nikhil Bansal , Makrand Sinha