Related papers: Quantization for uniform distributions on hexagona…
In this article, we study rectifying curves in arbitrary dimensional Euclidean space. A curve is said to be a rectifying curve if, in all points of the curve, the orthogonal complement of its normal vector contains a fixed point. We…
In this work we study the estimation of the density of a totally positive random vector. Total positivity of the distribution of a random vector implies a strong form of positive dependence between its coordinates and, in particular, it…
The number of faces of the convex hull of $n$ independent and identically distributed random points chosen on the boundary of a smooth convex body in $\mathbb{R}^d$ is investigated. In dimensions two and three the number of $k$-faces is…
In this work, we extend the classical framework of quantization for Borel probability measures defined on normed spaces $\mathbb{R}^k$ by introducing and analyzing the notions of the $n$th constrained quantization error, constrained…
Starting from the classical division polynomials we construct homogeneous polynomials $\alpha_n$, $\beta_n$, $\gamma_n$ such that for $P = (x:y:z)$ on an elliptic curve in Weierstrass form over an arbitrary ring we have $nP =…
We present a procedure for averaging one-parameter random unitary groups and random self-adjoint groups. Central to this is a generalization of the notion of weak convergence of a sequence of measures and the corresponding generalization of…
Given a set $P$ of $n$ points in $\mathbf{R}^d$, and a positive integer $k \leq n$, the $k$-dispersion problem is that of selecting $k$ of the given points so that the minimum inter-point distance among them is maximized (under Euclidean…
We prove quantitative estimates on the rate of convergence for the oscillating Dirichlet problem in periodic homogenization of divergence-form uniformly elliptic systems. The estimates are optimal in dimensions larger than three and new in…
We demonstrate that it is possible to construct operators that stabilize the constraint-satisfying subspaces of computational problems in their Ising representations. We provide an explicit recipe to construct unitaries and associated…
We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…
Accurate approximation of probability measures is essential in numerical applications. This paper explores the quantization of probability measures using the maximum mean discrepancy (MMD) distance as a guiding metric. We first investigate…
Quantization is essential for reducing the computational cost and memory usage of deep neural networks, enabling efficient inference on low-precision hardware. Despite the growing adoption of uniform and floating-point quantization schemes,…
We study the distribution of sequences of the form $(q_ny)_{n=1}^\infty$, where $(q_n)_{n=1}^\infty$ is some increasing sequence of integers. In particular, we study the Lebesgue measure and find bounds on the Hausdorff dimension of the set…
We establish the existence of positive solutions to a general class of overdetermined semilinear elliptic boundary problems on suitable bounded open sets $\Omega\subset\mathbb{R}^n$. Specifically, for $n\leq 4$ and under mild technical…
The shape of a number field $K$ of degree $n$ is defined as the equivalence class of the lattice of integers with respect to linear operations that are composites of rotations, reflections, and positive scalar dilations. The shape is a…
Optimal transport (OT) is a versatile framework for comparing probability measures, with many applications to statistics, machine learning, and applied mathematics. However, OT distances suffer from computational and statistical scalability…
The uniform quadratic optimizatin problem (UQ) is a nonconvex quadratic constrained quadratic programming (QCQP) sharing the same Hessian matrix. Based on the second-order cone programming (SOCP) relaxation, we establish a new sufficient…
Major controversy surrounds the use of Elliptic Curves in finite fields as Random Number Generators. There is little information however concerning the "randomness" of different procedures on Elliptic Curves defined over fields of…
By introducing a parameter, we give a unified generalization of some quadrature rules, which not only unify the recent results about error bounds for generalized mid-point, trapezoid and Simpson's rules, but also give some new error bounds…
In this article we discuss the geometric quantization on a certain type of infinite dimensional super-disc. Such systems are quite natural when we analyze coupled bosons and fermions. The large-N limit of a system like that corresponds to a…