English
Related papers

Related papers: On (2,3)-agreeable Box Societies

200 papers

Let $\mathcal{F}$ be a family of $n$ axis-parallel boxes in $\mathbb{R}^d$ and $\alpha\in (1-1/d,1]$ a real number. There exists a real number $\beta(\alpha )>0$ such that if there are $\alpha {n\choose 2}$ intersecting pairs in…

Metric Geometry · Mathematics 2015-02-25 I. Bárány , F. Fodor , A. Martínez-Pérez , L. Montejano , D. Oliveros , A. Pór

A family of subsets of $[n]$ is $r$-wise agreeing if for any $r$ sets from the family there is an element $x$ that is either contained in all or contained in none of the $r$ sets. The study of such families is motivated by questions in…

Combinatorics · Mathematics 2024-12-10 Peter Frankl , Andrey Kupavskii

We study the fundamental problem of clustering $n$ points into $K$ groups drawn from a mixture of isotropic Gaussians in $\mathbb{R}^d$. Specifically, we investigate the requisite minimal distance $\Delta$ between mean vectors to partially…

Statistics Theory · Mathematics 2026-02-27 Alexandra Carpentier , Nicolas Verzelen

We make some progress on a question of Babai from the 1970s, namely: for $n, k \in \mathbb{N}$ with $k \le n/2$, what is the largest possible cardinality $s(n,k)$ of an intersecting family of $k$-element subsets of $\{1,2,\ldots,n\}$…

Combinatorics · Mathematics 2022-06-10 David Ellis , Gil Kalai , Bhargav Narayanan

We consider the problem of minimizing the size of a family of sets G such that every subset of 1,...,n can be written as a disjoint union of at most k members of G, where k and n are given numbers. This problem originates in a real-world…

Discrete Mathematics · Computer Science 2007-11-20 Yannick Frein , Benjamin Lévêque , Andras Sebo

In the present paper, we introduce a new concept of convexity which is generated by a family of endomorphisms of an Abelian group. In Abelian groups equipped with a translation invariant metric, we define the boundedness, the norm, the…

Metric Geometry · Mathematics 2020-11-23 Włodzimierz Fechner , Zsolt Páles

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Metric Geometry · Mathematics 2022-03-23 Brett Leroux , Luis Rademacher

Let $ k, m, n $ be positive integers with $ k \geq 2 $. A $ k $-multiset of $ [n]_m $ is a collection of $ k $ integers from the set $ \{1, 2, \ldots, n\} $ in which the integers can appear more than once but at most $ m $ times. A family…

Combinatorics · Mathematics 2023-03-14 Jiaqi Liao , Zequn Lv , Mengyu Cao , Mei Lu

The convexity of a set can be generalized to the two weaker notions of reach and $r$-convexity; both describe the regularity of a set's boundary. For any compact subset of $\mathbb{R}^d$, we provide methods for computing upper bounds on…

Statistics Theory · Mathematics 2023-06-21 Ryan Cotsakis

We elaborate on the intimate connection between the largest volume of an empty axis-parallel box in a set of $n$ points from $[0,1]^d$ and cover-free families from the extremal set theory. This connection was discovered in a recent paper of…

Combinatorics · Mathematics 2025-09-09 Matěj Trödler , Jan Volec , Jan Vybíral

A family of vectors $A \subset [k]^n$ is said to be intersecting if any two elements of $A$ agree on at least one coordinate. We prove, for fixed $k \ge 3$, that the size of a symmetric intersecting subfamily of $[k]^n$ is $o(k^n)$, which…

Combinatorics · Mathematics 2021-07-01 Sean Eberhard , Jeff Kahn , Bhargav Narayanan , Sophie Spirkl

A family $\{A_{0},\ldots,A_{d}\}$ of $k$-element subsets of $[n]=\{1,2,\ldots,n\}$ is called a simplex-cluster if $A_{0}\cap\cdots\cap A_{d}=\varnothing$, $|A_{0}\cup\cdots\cup A_{d}|\le2k$, and the intersection of any $d$ of the sets in…

Combinatorics · Mathematics 2018-04-04 Noam Lifshitz

In this paper, we derive a tight upper bound for the size of an intersecting $k$-Sperner family of subspaces of the $n$-dimensional vector space $\mathbb{F}_{q}^{n}$ over finite field $\mathbb{F}_{q}$ which gives a $q$-analogue of the…

Combinatorics · Mathematics 2024-05-01 Jiuqiang Liu , Guihai Yu , Lihua Feng , Yongtao Li

The $k$-set agreement problem is a generalization of the classical consensus problem in which processes are permitted to output up to $k$ different input values. In a system of $n$ processes, an $m$-obstruction-free solution to the problem…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-05-20 Carole Delporte-Gallet , Hugues Fauconnier , Petr Kuznetsov , Eric Ruppert

We give upper and lower bounds on the information-theoretic threshold for community detection in the stochastic block model. Specifically, consider the symmetric stochastic block model with $q$ groups, average degree $d$, and connection…

Probability · Mathematics 2016-07-07 Jess Banks , Cristopher Moore , Joe Neeman , Praneeth Netrapalli

For positive integers $n$, $m$, and $h$, we let $\rho \hat{\;}(\mathbb{Z}_n, m, h)$ denote the minimum size of the $h$-fold restricted sumset among all $m$-subsets of the cyclic group of order $n$. The value of $\rho \hat{\;}(\mathbb{Z}_n,…

Number Theory · Mathematics 2013-05-15 Béla Bajnok

For a Minkowski centered convex compact set $K$ we define $\alpha(K)$ to be the smallest possible factor to cover $K \cap (-K)$ by a rescalation of $\mathrm{conv} (K\cup (-K))$ and give a complete description of the possible values of…

Metric Geometry · Mathematics 2024-01-29 René Brandenberg , Katherina von Dichter , Bernardo González Merino

We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…

Optimization and Control · Mathematics 2008-12-04 Jean B. Lasserre

Given a compact basic semi-algebraic set $K\subset R^n\times R^m$, a simple set $B$ (box or ellipsoid), and some semi-algebraic function $f$, we consider sets defined with quantifiers, of the form $R_f:=\{x\in B: \mbox{$f(x,y)\leq 0$ for…

Optimization and Control · Mathematics 2014-10-28 Jean B. Lasserre

A $k$-uniform, $d$-regular instance of Exact Cover is a family of $m$ sets $F_{n,d,k} = \{ S_j \subseteq \{1,...,n\} \}$, where each subset has size $k$ and each $1 \le i \le n$ is contained in $d$ of the $S_j$. It is satisfiable if there…

Computational Complexity · Computer Science 2015-03-05 Cristopher Moore