English
Related papers

Related papers: Largest $3$-uniform set systems with VC-dimension …

200 papers

In this note we disprove a conjecture of Kuzmin and Warmuth claiming that every family whose VC-dimension is at most d admits an unlabeled compression scheme to a sample of size at most d. We also study the unlabeled compression schemes of…

Combinatorics · Mathematics 2021-10-15 Dömötör Pálvölgyi , Gábor Tardos

Let $\mathcal{F}$ be a family of subsets of $[n]=\{1,\ldots,n\}$ and let $L$ be a set of nonnegative integers. The family $\mathcal{F}$ is \emph{$L$-intersecting} if $|F\cap F'|\in L$ for every two distinct members $F,F'\in\mathcal{F}$; and…

Combinatorics · Mathematics 2018-11-29 Yandong Bai , Binlong Li , Jiuqiang Liu , Shenggui Zhang

A cap set is a subset of $\mathbb{F}_3^n$ with no solutions to $x+y+z=0$ other than when $x=y=z$. In this paper, we provide a new lower bound on the size of a maximal cap set. Building on a construction of Edel, we use improved…

Combinatorics · Mathematics 2023-12-13 Fred Tyrrell

Given a non-empty bounded subset of hyperbolic space and a Kleinian group acting on that space, the orbital set is the orbit of the given set under the action of the group. We may view orbital sets as bounded (often fractal) subsets of…

Dynamical Systems · Mathematics 2024-03-20 Thomas Bartlett , Jonathan M. Fraser

For a finite partially ordered set we calculate the dimension of the variety of its subspace representations having fixed dimension vector. The dimension is given in terms of the Euler quadratic form associated with a partially ordered set,…

Representation Theory · Mathematics 2019-02-27 Claudia Cavalcante Fonseca , Kostiantyn Iusenko

We prove algorithmic and hardness results for the problem of finding the largest set of a fixed diameter in the Euclidean space. In particular, we prove that if $A^*$ is the largest subset of diameter $r$ of $n$ points in the Euclidean…

Computational Geometry · Computer Science 2009-03-15 Peyman Afshani , Hamed Hatami

A spherical two-distance set is a finite collection of unit vectors in $\reals^n$ such that the set of distances between any two distinct vectors has cardinality two. We use the semidefinite programming method to compute improved estimates…

Metric Geometry · Mathematics 2013-01-24 Alexander Barg , Wei-Hsuan Yu

We say that a set system $\mathcal{F}\subseteq 2^{[n]}$ shatters a given set $S\subseteq [n]$ if $2^S={F \cap S : F \in \mathcal{F}}$. The Sauer inequality states that in general, a set system $\mathcal{F}$ shatters at least $|\mathcal{F}|$…

Combinatorics · Mathematics 2012-11-06 Tamás Mészáros , Lajos Rónyai

In this paper we deal with the feasibility-seeking problem for unions of convex sets (UCS) sets and propose an iterative process for its solution. Renewed interest in this problem stems from the fact that it was recently discovered to serve…

Optimization and Control · Mathematics 2025-04-08 Yair Censor , Alexander J. Zaslavski

We study controlled systems which are uniformly observable and differentially observable with an order larger than the system state dimension. We establish that they may be transformed into a (partial) triangular canonical form but with…

Optimization and Control · Mathematics 2019-04-30 Pauline Bernard , Laurent Praly , Vincent Andrieu , Hassan Hammouri

Let $U_n(q)$ be the upper triangular group of degree $n$ over the finite field $\F_q$ with $q$ elements. In this paper, we present constructions of large degree ordinary irreducible representations of $U_n(q)$ where $n\geq 7$, and then…

Representation Theory · Mathematics 2013-08-07 Tung Le

For $g \geq 2$ and $h \geq 3$, we give small improvements on the maximum size of a $B_h[g]$-set contained in the interval $\{1,2, \dots , N \}$. In particular, we show that a $B_3[g]$-set in $\{1,2, \dots , N \}$ has at most $(14.3 g…

Combinatorics · Mathematics 2016-04-05 Craig Timmons

We find the bounds of the size of the union of n sets satisfying the condition that the intersection of any k sets is empty. We show that any number between the upper and lower bounds can be realised, and in the measure version, the…

Combinatorics · Mathematics 2012-08-10 Yuanzhong Ou , Boli Wang , Min Yan

For positive integers $d$ and $n$, let $[n]^d$ be the set of all vectors $(a_1,a_2,\dots, a_d)$, where $a_i$ is an integer with $0\leq a_i\leq n-1$. A subset $S$ of $[n]^d$ is called a \emph{Sidon set} if all sums of two (not necessarily…

Combinatorics · Mathematics 2014-10-22 Sang June Lee

We study the concept of universal sets from the additive--combinatorial point of view. Among other results we obtain some applications of this type of uniformity to sets avoiding solutions to linear equations, and get an optimal upper bound…

Combinatorics · Mathematics 2024-04-03 Ilya D. Shkredov

Hyperuniform systems are distinguished by an unusually strong suppression of large-scale density fluctuations and, consequently, display a high degree of uniformity at the largest length scales. In some cases, however, enhanced uniformity…

Statistical Mechanics · Physics 2025-10-24 Carlo Vanoni , Paul J. Steinhardt , Salvatore Torquato

The largest possible average diameter of a bounded cell of a simple hyperplane arrangement is conjectured to be not greater than the dimension. We prove that this conjecture holds in dimension 2, and is asymptotically tight in fixed…

Metric Geometry · Mathematics 2007-10-02 Antoine Deza , Feng Xie

By considering the renormalization group flow between $N$ coupled Ising models in the UV and the cubic fixed point in the IR, we study the large $N$ behavior of the cubic fixed points in three dimensions. We derive a diagrammatic expansion…

High Energy Physics - Theory · Physics 2021-09-29 Damon J. Binder

We consider the problem of embedding a symmetric configuration with block size 3 in an orientable surface in such a way that the blocks of the configuration form triangular faces and there is only one extra large face. We develop a…

Combinatorics · Mathematics 2019-12-20 Grahame Erskine , Terry Griggs , Jozef Širáň

We characterize the largest point sets in the plane which define at most 1, 2, and 3 angles. For $P(k)$ the largest size of a point set admitting at most $k$ angles, we prove $P(2)=5$ and $P(3)=5$. We also provide the general bounds of $k+2…

Combinatorics · Mathematics 2022-10-18 Henry L. Fleischmann , Steven J. Miller , Eyvindur A. Palsson , Ethan Pesikoff , Charles Wolf
‹ Prev 1 4 5 6 7 8 10 Next ›