English
Related papers

Related papers: Shattering bounds for tuple systems

200 papers

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

Combinatorics · Mathematics 2021-10-26 Evangelos Bartzos , Ioannis Z. Emiris , Raimundas Vidunas

We consider the spontaneously broken regime of the $O(n)$ vector model in $d=n+1$ space-time dimensions, with boundary conditions enforcing the presence of a topological defect line. Comparing theory and finite size dependence of one-point…

Statistical Mechanics · Physics 2024-02-16 Gesualdo Delfino , Marianna Sorba

In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.

Combinatorics · Mathematics 2024-09-28 Gábor Hegedüs

The topological quantum number Q of a superconducting or chiral insulating wire counts the number of stable bound states at the end points. We determine Q from the matrix r of reflection amplitudes from one of the ends, generalizing the…

Mesoscale and Nanoscale Physics · Physics 2013-07-09 I. C. Fulga , F. Hassler , A. R. Akhmerov , C. W. J. Beenakker

We provide lower and upper bounds on the minimum size of a maximum stable set over graphs of flag spheres, as a function of the dimension of the sphere and the number of vertices. Further, we use stable sets to obtain an improved Lower…

Combinatorics · Mathematics 2022-04-05 Maria Chudnovsky , Eran Nevo

The minimal spherical cap dispersion ${\rm disp}_{\mathcal{C}}(n,d)$ is the largest number $\varepsilon\in (0,1]$ such that, for every $n$ points on the $d$-dimensional Euclidean unit sphere $\mathbb{S}^d$, there exists a spherical cap with…

Metric Geometry · Mathematics 2025-12-10 Alexander E. Litvak , Mathias Sonnleitner , Tomasz Szczepanski

The entanglement in a pure state of N qudits (d-dimensional distinguishable quantum particles) can be characterised by specifying how entangled its subsystems are. A generally mixed subsystem of m qudits is obtained by tracing over the…

Quantum Physics · Physics 2009-11-07 Vivien M Kendon , Karol Zyczkowski , William J Munro

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

Combinatorics · Mathematics 2022-09-16 Hariharan Narayanan , Rikhav Shah , Nikhil Srivastava

Let $q,d\geq 2$ be integers. Define $$ J(q,d):=\frac 1q \Big( \min_{0<x<1} \frac{1-x^q}{1-x} x^{-\frac{q-1}{d}}\Big). $$ Let $\mbox{$\cal G$}\subseteq {\mathbb R}^n$ be an arbitrary subset. We denote by $d(\mbox{$\cal G$})$ the set of…

Combinatorics · Mathematics 2018-12-31 Gábor Hegedüs

Let $K\geq 2$ be a natural number and $a_i,b_i\in\mathbb{Z}$ for $i=1,\ldots,K-1$. We use the large sieve to derive explicit upper bounds for the number of prime $k$-tuplets, i.e., for the number of primes $p\leq x$ for which all $a_ip+b_i$…

Number Theory · Mathematics 2024-09-09 Thomas Dubbe

We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…

Metric Geometry · Mathematics 2014-09-26 David de Laat , Fernando Mario de Oliveira Filho , Frank Vallentin

Many concepts from extremal set theory have analogues for families of permutations. This paper is concerned with the notion of shattering for permutations. A family $\mathcal{P}$ of permutations of an $n$-element set $X$ shatters a $k$-set…

Combinatorics · Mathematics 2023-04-06 J. Robert Johnson , Belinda Wickes

Let $f$ be a $C^{1}$ diffeomorphism on a compact manifold $M$ admitting a partially hyperbolic splitting $TM=E^{s}\oplus_{\prec} E^{1}\oplus_{\prec} E^{2}\cdots \oplus_{\prec}E^{l}\oplus_{\prec} E^{u}$ where $E^{s}$ is uniformly…

Dynamical Systems · Mathematics 2020-12-15 Dawei Yang , Yuntao Zang

Let $V$ denote an $r$-dimensional vector space over $\mathbb{F}_{q^n}$, the finite field of $q^n$ elements. Then $V$ is also an $rn$-dimension vector space over $\mathbb{F}_q$. An $\mathbb{F}_q$-subspace $U$ of $V$ is $(h,k)_q$-evasive if…

Combinatorics · Mathematics 2021-04-14 Daniele Bartoli , Bence Csajbók , Giuseppe Marino , Rocco Trombetti

In many cosmological models, including the $\Lambda$CDM concordance model, there exist a theoretical upper bounds on the size of collapsing structures. The most common formulations in the literature refer to a turnaround radius in spherical…

General Relativity and Quantum Cosmology · Physics 2022-05-11 Jan J. Ostrowski , Ismael Delgado Gaspar

Let $q=p^\alpha$ be a fixed prime power, $k\geq 2$ be an integer. We give a new upper bound for the size of $k$-wise $q$-modular $L$-avoiding $L$-intersecting set systems, where $L$ is any proper subset of $\{0, \ldots , q-1\}$. Our proof…

Combinatorics · Mathematics 2025-01-07 Gábor Hegedüs

Let $(X,\S)$ be a set system on an $n$-point set $X$. The \emph{discrepancy} of $\S$ is defined as the minimum of the largest deviation from an even split, over all subsets of $S \in \S$ and two-colorings $\chi$ on $X$. We consider the…

Computational Geometry · Computer Science 2013-08-01 Esther Ezra

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

Combinatorics · Mathematics 2024-03-14 Dmitrii Zakharov

For a point set of $n$ elements in the $d$-dimensional unit cube and a class of test sets we are interested in the largest volume of a test set which does not contain any point. For all natural numbers $n$, $d$ and under the assumption of a…

Computational Geometry · Computer Science 2017-10-03 Daniel Rudolf

Solutions $(u, v)$ to the chemotaxis system \begin{align*} \begin{cases} u_t = \nabla \cdot ( (u+1)^{m-1} \nabla u - u (u+1)^{q-1} \nabla v), \\ \tau v_t = \Delta v - v + u \end{cases} \end{align*} in a ball $\Omega \subset \mathbb R^n$, $n…

Analysis of PDEs · Mathematics 2020-12-08 Mario Fuest