English
Related papers

Related papers: Flat-containing and shift-blocking sets in $F_2^r$

200 papers

Consider a convex polyhedral robot $B$ that can translate (without rotating) amidst a finite set of non-moving polyhedral obstacles in $\mathbb R^3$. The "free space" $\mathcal F$ of $B$ is the set of all positions in which $B$ is disjoint…

Computational Geometry · Computer Science 2026-02-10 Gabriel Nivasch

Let $n(k_1, k_2)$ be the least integer $n$ such that there exists a graph on $n$ vertices in which every vertex is contained in both a clique of size $k_1$ and an independent set of size $k_2$. Recently, Feige and Pauzner showed that ${n(k,…

Combinatorics · Mathematics 2026-04-24 Veronica Bitonti , Emma Hogan , Tommy Walker Mackay

Let K be a simplicial complex with vertex set V = {v_1,..., v_n}. The complex K is d-representable if there is a collection {C_1,...,C_n} of convex sets in R^d such that a subcollection {C_{i_1},...,C_{i_j}} has a nonempty intersection if…

Combinatorics · Mathematics 2011-07-07 Martin Tancer

We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing $\cal P$ with congruent…

Metric Geometry · Mathematics 2009-09-25 Gabor Fejes Tóth , Greg Kuperberg , Włodzimierz Kuperberg

We provide complete characterizations, on Banach spaces with cotype 2, of those linear operators which happen to be weakly mixing or strongly mixing transformations with respect to some nondegenerate Gaussian measure. These…

Functional Analysis · Mathematics 2011-12-07 Frédéric Bayart , Etienne Matheron

A constant-rate encoder--decoder pair is presented for a fairly large family of two-dimensional (2-D) constraints. Encoding and decoding is done in a row-by-row manner, and is sliding-block decodable. Essentially, the 2-D constraint is…

Information Theory · Computer Science 2008-08-06 Ido Tal , Tuvi Etzion , Ron M. Roth

We study the intersection statistics of affine subspaces in the hypercube $\mathbb{F}_2^n$, motivated by recent work of Alon, Axenovich, and Goldwasser on the intersection statistics of axis-aligned subcubes of an $n$-dimensional cube. Let…

Combinatorics · Mathematics 2026-04-16 Zixuan Xu

We prove that a subset of $\mathbb{F}_q^n$ that contains a hyperplane in any direction has size at least $q^{n}-O(q^2)$.

Combinatorics · Mathematics 2017-05-30 Beat Zurbuchen

This work revolves around the two following questions: Given a convex body $C\subset\mathbb{R}^d$, a positive integer $k$ and a finite set $S\subset\mathbb{R}^d$ (or a finite Borel measure $\mu$ on $\mathbb{R}^d$), how many homothets of $C$…

Combinatorics · Mathematics 2022-12-06 Oriol Solé Pi

A hypergraph $\mathcal{F}$ is non-trivial intersecting if every two edges in it have a nonempty intersection but no vertex is contained in all edges of $\mathcal{F}$. Mubayi and Verstra\"{e}te showed that for every $k \ge d+1 \ge 3$ and $n…

Combinatorics · Mathematics 2020-07-23 Xizhi Liu

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…

Information Theory · Computer Science 2020-12-02 P. G. Boyvalenkov , K. V. Delchev , D. V. Zinoviev , V. A. Zinoviev

Let $D$ be a division ring with center $F$ and $K$ a division subring of $D$. In this paper, we show that a non-central normal subgroup $N$ of the multiplicative group $D^*$ is left algebraic over $K$ if and only if so is $D$ provided $F$…

Rings and Algebras · Mathematics 2019-02-25 Bui Xuan Hai , Vu Mai Trang , Mai Hoang Bien

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in \R^d is contained in at least (d+1)^2/2 simplices with one vertex from each set. This improves the known lower bounds for all d >= 4.

Combinatorics · Mathematics 2010-06-01 Antoine Deza , Tamon Stephen , Feng Xie

For any natural number $d$ and positive number $\varepsilon$, we present a point set in the $d$-dimensional unit cube $[0,1]^d$ that intersects every axis-aligned box of volume greater than $\varepsilon$. These point sets are very easy to…

Computational Geometry · Computer Science 2017-09-12 David Krieg

Let $S_2$ be the set of integer squares. We show that the dimension $d$ of a Hilbert cube $a_0+\{0,a_1\}+...+ \{0, a_d\}\subset S_2$ is bounded by $d=O(\log \log N)$

Number Theory · Mathematics 2012-07-09 Rainer Dietmann , Christian Elsholtz

Let $V$ be a variety in $\mathbb{F}_q^d$ and $E\subset V$. It is known that if any line passing through the origin contains a bounded number of points from $E$, then $|\prod(E)|=|\{x\cdot y\colon x, y\in E\}|\gg q$ whenever $|E|\gg…

Number Theory · Mathematics 2022-08-10 Che-Jui Chang , Ali Mohammadi , Thang Pham , Chun-Yen Shen

Let $A_2(n,d)$ be the maximum size of a binary code of length $n$ and minimum distance $d$. In this paper we present the following new lower bounds: $A_2(18,4) \ge 5632$, $A_2(21,4) \ge 40960$, $A_2(22,4) \ge 81920$, $A_2(23,4) \ge 163840$,…

Information Theory · Computer Science 2016-07-19 Antti Laaksonen , Patric R. J. Östergård

We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size at most $k$. We show that if for some $b \ge i \ge 0$ the shatter function $f_R$ of a set system $([n],R)$ satisfies $f_R(b) < 2^i(b-i+1)$…

Discrete Mathematics · Computer Science 2009-12-17 Otfried Cheong , Xavier Goaoc , Cyril Nicaud

Given natural numbers $k \leq s \leq n$, we ask: what is the minimal VC-dimension of a family $\mathcal{F}$ of $s$-subsets of $[n]$ that covers all $k$-subsets of $[n]$? We first show that for sufficiently large $n$ this number is always…

Combinatorics · Mathematics 2024-01-24 George Peterzil , Johanna Steinmeyer

We study the set of intersection sizes of a k-dimensional affine subspace and a point set of size m \in [0, 2^n] of the n-dimensional binary affine space AG(n,2). Following the theme of Erd\H{o}s, F\"uredi, Rothschild and T. S\'os, we…

Combinatorics · Mathematics 2024-05-31 Benedek Kovács , Zoltán Lóránt Nagy