Related papers: A central limit theorem for general orthogonal arr…
We investigate the rate of convergence in the central limit theorem for convex sets. We obtain bounds with a power-law dependence on the dimension. These bounds are asymptotically better than the logarithmic estimates which follow from the…
The class of O-metric spaces generalize several existing metric-types in literature including metric spaces, b-metric spaces, and ultra metric spaces. In this paper, we discuss the properties of the topology induced by an O-metric and…
Many geometric optimization problems can be reduced to finding points in space (centers) minimizing an objective function which continuously depends on the distances from the centers to given input points. Examples are $k$-Means, Geometric…
The commonly used spatial entropy $h_{r}(\mathcal{U})$ of the multi-dimensional shift space $\mathcal{U}$ is the limit of growth rate of admissible local patterns on finite rectangular sublattices which expands to whole space…
The Central Limit Theorem (CLT) establishes that sufficiently large sequences of independent and identically distributed random variables converge in probability to a normal distribution. This makes the CLT a fundamental building block of…
We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…
The area of research called \textquotedblleft Lineability\textquotedblright% \ looks for linear structures inside exotic subsets of vector spaces. In the last decade lineability/spaceability has been investigated in rather general settings;…
Structural disorder can improve the optical properties of metasurfaces, whether it is emerging from some large-scale fabrication methods, or explicitly designed and built lithographically. Correlated disorder, induced by a minimum…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…
Classical results on the statistical complexity of linear models have commonly identified the norm of the weights $\|w\|$ as a fundamental capacity measure. Generalizations of this measure to the setting of deep networks have been varied,…
In this paper, we explore the theme of orbifold stratified spaces and establish a general criterion for them to be smooth orbifolds. This criterion utilizes the notion of linear stratification on the gluing bundles for the orbifold…
We establish central limit theorems for general functionals on binomial point processes and their Poissonized version. As an application, a central limit theorem for Betti numbers of random geometric complexes in the thermodynamic regime is…
Measurement-based quantum computation is a model for quantum information processing utilizing local measurements on suitably entangled resource states for the implementation of quantum gates. A complete characterization for universal…
We prove a new, efficient version of the hypergraph container theorems that is suited for hypergraphs with large uniformities. The main novelty is a refined approach to constructing containers that employs simple ideas from high-dimensional…
In this paper we devise an optimal construction of fault-tolerant spanners for doubling metrics. Specifically, for any $n$-point doubling metric, any $\eps > 0$, and any integer $0 \le k \le n-2$, our construction provides a…
Nonregular fractional factorial designs such as Plackett-Burman designs and other orthogonal arrays are widely used in various screening experiments for their run size economy and flexibility. The traditional analysis focuses on main…
We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional…
In the framework of linearized elasticity, we study thin elastic composite plates with thickness $\delta$. The plates contain small, rigid rectangular plates distributed periodically along $\varepsilon$. Between two neighboring rigid plates…
Randomized saturation designs are a family of designs which assign a possibly different treatment proportion to each cluster of a population at random. As a result, they generalize the well-known (stratified) completely randomized designs…
Orthogonal arrays play a fundamental role in many applications. However, constructing orthogonal arrays with the required parameters for an application usually is extremely difficult and, sometimes, even impossible. Hence there is an…