English
Related papers

Related papers: A characterization theorem for the $L^{2}$-discrep…

200 papers

Intransitive dice $D^{(1)}, \ldots, D^{(\ell)}$ are dice such that $D^{(1)}$ has advantage when played against $D^{(2)}$, dice $D^{(2)}$ has advantage when played against $D^{(3)}$ and so on, up to $D^{(\ell)}$, which has advantage over…

For d-dimensional irrational ellipsoids E with d >= 9 we show that the number of lattice points in rE is approximated by the volume of rE, as r tends to infinity, up to an error of order o(r^{d-2}). The estimate refines an earlier authors'…

Number Theory · Mathematics 2016-09-07 Vidmantas Bentkus , Friedrich Götze

$D$-optimal designs originate in statistics literature as an approach for optimal experimental designs. In numerical analysis points and weights resulting from maximal determinants turned out to be useful for quadrature and interpolation.…

Numerical Analysis · Mathematics 2024-12-04 Felix Bartel , Lutz Kämmerer , Kateryna Pozharska , Martin Schäfer , Tino Ullrich

We consider percolation on $\mathbb{Z}^d$ and on the $d$-dimensional discrete torus, in dimensions $d \ge 11$ for the nearest-neighbour model and in dimensions $d>6$ for spread-out models. For $\mathbb{Z}^d$, we employ a wide range of…

Probability · Mathematics 2022-09-30 Tom Hutchcroft , Emmanuel Michta , Gordon Slade

Working over an algebraically closed base field $k$ of characteristic 2, the ring of invariants $R^G$ is studied, where $G$ is the orthogonal group O(n) or the special orthogonal group SO(n), acting naturally on the coordinate ring $R$ of…

Rings and Algebras · Mathematics 2014-07-31 M. Domokos , P. E. Frenkel

The Minkowski content $L_0(G)$ of a body $G\subset{\mathbb{R}}^d$ represents the boundary length (for $d=2$) or the surface area (for $d=3$) of $G$. A method for estimating $L_0(G)$ is proposed. It relies on a nonparametric estimator based…

Statistics Theory · Mathematics 2007-08-22 Antonio Cuevas , Ricardo Fraiman , Alberto Rodríguez-Casal

The conjecture of Peter Horak and Alex Rosa (generalizing that of Marco Buratti) states that a multiset L of v-1 positive integers not exceeding [v/2] is the list of edge-lengths of a suitable Hamiltonian path of the complete graph with…

Combinatorics · Mathematics 2013-11-05 Anita Pasotti , Marco Antonio Pellegrini

Scott asked the question of determining $c_d$ such that if $D$ is a digraph with $m$ arcs and minimum outdegree $d\ge 2$ then $V(D)$ has a partition $V_1, V_2$ such that $\min\left\{e(V_1,V_2),e(V_2, V_1)\right\}\geq c_dm$, where…

Combinatorics · Mathematics 2020-12-24 Guanwu Liu , Xingxing Yu

Let $O$ be an order of odd discriminant $D$ in an imaginary quadratic field $K$. Let $Cl(O)$ be the group of proper $O$-ideals and $Cl(O)[2]$ the kernel of multiplication by $2$ in $Cl(O)$. We describe explicitly the group $Cl(O)[2]$. In…

Number Theory · Mathematics 2024-07-30 Yuri G. Zarhin

Let $\Sigma$ be a strictly convex, compact patch of a $C^2$ hypersurface in $\mathbb{R}^n$, with non-vanishing Gaussian curvature and surface measure $d\sigma$ induced by the Lebesgue measure in $\mathbb{R}^n$. The Mizohata--Takeuchi…

Classical Analysis and ODEs · Mathematics 2024-08-20 Anthony Carbery , Marina Iliopoulou , Hong Wang

We study the convergence of a discretized Fourier orthogonal expansion in orthogonal polynomials on $B^2 \times [-1,1]$, where $B^2$ is the closed unit disk in $\RR^2$. The discretized expansion uses a finite set of Radon projections and…

Numerical Analysis · Mathematics 2009-06-15 Jeremy Wade

We show the optimal coherence of $2d$ lines in $\mathbb{C}^{d}$ is given by the Welch bound whenever a skew Hadamard of order $d+1$ exists. Our proof uses a variant of Hadamard doubling that converts any equiangular tight frame of size…

Metric Geometry · Mathematics 2023-12-18 Kean Fallon , Joseph W. Iverson

We show that for large integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the number of prime factors follows an approximate normal distribution, with mean $C \log_2 n$ and variance $V \log_2 n$,…

Number Theory · Mathematics 2023-10-26 Gérald Tenenbaum , Andreas Weingartner

Motivated by problems in controlled experiments, we study the discrepancy of random matrices with continuous entries where the number of columns $n$ is much larger than the number of rows $m$. Our first result shows that if $\omega(1) = m =…

Discrete Mathematics · Computer Science 2020-11-10 Paxton Turner , Raghu Meka , Philippe Rigollet

We study an analogue of the large deviation principle for mixed measures associated with a class of $\log$-concave probability measures whose densities depend on the gauge function of a convex body. For convex bodies in $\mathbb{R}^n$, we…

Probability · Mathematics 2026-02-25 Malak Lafi , Artem Zvavitch

The convex hull generated by the restriction to the unit ball of a stationary Poisson point process in the $d$-dimensional Euclidean space is considered. By establishing sharp bounds on cumulants, exponential estimates for large deviation…

Probability · Mathematics 2015-12-15 Julian Grote , Christoph Thaele

We use probabilistic, topological and combinatorial methods to establish the following deviation inequality: For any normed space $X=(\mathbb R^n ,\|\cdot\| )$ there exists an invertible linear map $T:\mathbb R^n \to \mathbb R^n$ with \[…

Functional Analysis · Mathematics 2018-05-21 Grigoris Paouris , Petros Valettas

We propose a probabilistic variant of Brill-Noether's algorithm for computing a basis of the Riemann-Roch space $L(D)$ associated to a divisor $D$ on a projective nodal plane curve $\mathcal C$ over a sufficiently large perfect field $k$.…

Symbolic Computation · Computer Science 2020-10-20 Aude Le Gluher , Pierre-Jean Spaenlehauer

We prove a multivariate central limit theorem with explicit error bound on a non-smooth function distance for sums of bounded decomposable $d$-dimensional random vectors. The decomposition structure is similar to that of Barbour, Karo\'nski…

Probability · Mathematics 2015-05-19 Xiao Fang

We study the following metric distortion problem: there are two finite sets of points, $V$ and $C$, that lie in the same metric space, and our goal is to choose a point in $C$ whose total distance from the points in $V$ is as small as…

Computer Science and Game Theory · Computer Science 2020-09-08 Vasilis Gkatzelis , Daniel Halpern , Nisarg Shah
‹ Prev 1 4 5 6 7 8 10 Next ›