English
Related papers

Related papers: A Size-Sensitive Discrepancy Bound for Set Systems…

200 papers

The shift distance $\mathsf{sh}(S_1,S_2)$ between two strings $S_1$ and $S_2$ of the same length is defined as the minimum Hamming distance between $S_1$ and any rotation (cyclic shift) of $S_2$. We study the problem of sketching the shift…

Data Structures and Algorithms · Computer Science 2020-06-25 Shay Golan , Tomasz Kociumaka , Tsvi Kopelowitz , Ely Porat , Przemysław Uznański

In this paper, we study the following two hypercube coloring problems: Given $n$ and $d$, find the minimum number of colors, denoted as ${\chi}'_{d}(n)$ (resp. ${\chi}_{d}(n)$), needed to color the vertices of the $n$-cube such that any two…

Combinatorics · Mathematics 2010-01-14 Fang-Wei Fu , San Ling , Chaoping Xing

We consider a Schelling model of self-organized segregation in an open system that is equivalent to a zero-temperature Ising model with Glauber dynamics, or an Asynchronous Cellular Automaton (ACA) with extended Moore neighborhoods.…

Social and Information Networks · Computer Science 2018-11-28 Hamed Omidvar , Massimo Franceschetti

A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…

Combinatorics · Mathematics 2009-10-08 Simon R. Blackburn , Tuvi Etzion , Keith M. Martin , Maura B. Paterson

The Dushnik-Miller dimension of a partially-ordered set $P$ is the smallest $d$ such that one can embed $P$ into a product of $d$ linear orders. We prove that the dimension of the divisibility order on the interval $\{1, \dotsc, n\}$, is…

Combinatorics · Mathematics 2021-01-18 David Lewis , Victor Souza

The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…

Computational Complexity · Computer Science 2024-12-20 Mario Ullrich , Jan Vybíral

We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to the algorithm for discrepancy approximation of Winker and Fang [SIAM J. Numer. Anal. 34 (1997), 2028--2042] it is based on the optimization…

Data Structures and Algorithms · Computer Science 2021-09-21 Michael Gnewuch , Magnus Wahlström , Carola Winzen

For any two point sets $A,B \subset \mathbb{R}^d$ of size up to $n$, the Chamfer distance from $A$ to $B$ is defined as $\text{CH}(A,B)=\sum_{a \in A} \min_{b \in B} d_X(a,b)$, where $d_X$ is the underlying distance measure (e.g., the…

Data Structures and Algorithms · Computer Science 2023-07-07 Ainesh Bakshi , Piotr Indyk , Rajesh Jayaram , Sandeep Silwal , Erik Waingarten

The time-harmonic Maxwell equations with impedance boundary condition and large wave number are discretized using the second-type N\'{e}d\'{e}lec's edge element method (EEM). Preasymptotic error bounds are derived, showing that, under the…

Numerical Analysis · Mathematics 2025-11-25 Shuaishuai Lu , Haijun Wu

The binary Mumford-Shah model is a widespread tool for image segmentation and can be considered as a basic model in shape optimization with a broad range of applications in computer vision, ranging from basic segmentation and labeling to…

Numerical Analysis · Mathematics 2015-05-21 Benjamin Berkels , Alexander Effland , Martin Rumpf

For any $\varepsilon > 0$, we prove that $k$-Dimensional Matching is hard to approximate within a factor of $k/(12 + \varepsilon)$ for large $k$ unless $\textsf{NP} \subseteq \textsf{BPP}$. Listed in Karp's 21 $\textsf{NP}$-complete…

Computational Complexity · Computer Science 2024-09-27 Euiwoong Lee , Ola Svensson , Theophile Thiery

On the basis of a model system of pillars built of unit cubes, a two-component entropic measure for the multiscale analysis of spatio-compositional inhomogeneity is proposed. It quantifies the statistical dissimilarity per cell of the…

Statistical Mechanics · Physics 2015-05-13 Ryszard Piasecki

Subshifts are sets of colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissible completions. Since soficity of $\mathbb{Z}$ subshifts is…

Discrete Mathematics · Computer Science 2025-10-03 Antonin Callard , Léo Paviet Salomon , Pascal Vanier

We consider infinite graphs. The distinguishing number $D(G)$ of a graph $G$ is the minimum number of colours in a vertex colouring of $G$ that is preserved only by the trivial automorphism. An analogous invariant for edge colourings is…

Combinatorics · Mathematics 2021-05-18 Wilfried Imrich , Rafał Kalinowski , Monika Pilśniak , Mohammad H. Shekarriz

We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…

Combinatorics · Mathematics 2026-02-19 Kohei Suzuki , Takashi Goda

We investigate the construction of early stopping rules in the nonparametric regression problem where iterative learning algorithms are used and the optimal iteration number is unknown. More precisely, we study the discrepancy principle, as…

Statistics Theory · Mathematics 2020-04-21 Alain Celisse , Martin Wahl

Given a point set $P\subset \mathbb{R}^d$, the kernel density estimate of $P$ is defined as \[ \overline{\mathcal{G}}_P(x) = \frac{1}{\left|P\right|}\sum_{p\in P}e^{-\left\lVert x-p \right\rVert^2} \] for any $x\in\mathbb{R}^d$. We study…

Data Structures and Algorithms · Computer Science 2022-02-22 Wai Ming Tai

We prove sharp wavenumber-explicit error bounds for first- or second-family-N\'ed\'elec-element (a.k.a. edge-element) conforming discretisations, of arbitrary (fixed) order, of the variable-coefficient time-harmonic Maxwell equations posed…

Numerical Analysis · Mathematics 2026-01-09 Théophile Chaumont-Frelet , Jeffrey Galkowski , Euan A. Spence

The binary divergences that are divergences between probability measures defined on the same 2-point set have an interesting property. For the chi-squared divergence and the relative entropy, it is known that their binary divergence attain…

Information Theory · Computer Science 2021-02-09 Tomohiro Nishiyama

Given a set of points $P$ and axis-aligned rectangles $\mathcal{R}$ in the plane, a point $p \in P$ is called \emph{exposed} if it lies outside all rectangles in $\mathcal{R}$. In the \emph{max-exposure problem}, given an integer parameter…

Computational Geometry · Computer Science 2021-02-09 Neeraj Kumar , Stavros Sintos , Subhash Suri
‹ Prev 1 8 9 10 Next ›