English
Related papers

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

200 papers

In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…

Commutative Algebra · Mathematics 2015-02-02 Apoorva Khare

For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung , Marina V. Semenova

In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an…

Metric Geometry · Mathematics 2011-09-29 Karoly Bezdek , Alexander Litvak

We consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…

Functional Analysis · Mathematics 2017-08-07 Sergij V. Goncharov

A family of $k$-subsets $A_1, A_2, ..., A_d$ on $[n]=\{1,2,..., n\}$ is called a $(d, c)$-cluster if the union $A_1\cup A_2 \cup ... \cup A_d$ contains at most $ck$ elements with $c<d$. Let $\mathcal{F}$ be a family of $k$-subsets of an…

Combinatorics · Mathematics 2009-04-24 William Y. C. Chen , Jiuqiang Liu , Larry X. W. Wang

For every positive integer $d$, we show that there must exist an absolute constant $c > 0$ such that the following holds: for any integer $n \geq cd^{7}$ and any red-blue coloring of the one-dimensional subspaces of $\mathbb{F}_{2}^{n}$,…

Combinatorics · Mathematics 2024-12-24 Zach Hunter , Cosmin Pohoata

That is, given a compact set $B \subset \mathbb{R}^n$ (the boundary) and a subgroup $L$ of the \v{C}ech homology group $\check{H}_{d-1}(B;G)$ of dimension $d$ over some commutative group $G$, we find a compact set $E \supset B$ such that…

Classical Analysis and ODEs · Mathematics 2014-01-23 Yangqin Fang

A subspace of $\mathbb{F}_2^n$ is called cyclically covering if every vector in $\mathbb{F}_2^n$ has a cyclic shift which is inside the subspace. Let $h_2(n)$ denote the largest possible codimension of a cyclically covering subspace of…

Combinatorics · Mathematics 2021-02-18 James Aaronson , Carla Groenland , Tom Johnston

Let $3\le d\le k$ and $\nu\ge 0$ be fixed and $\mathcal{F}\subset\binom{[n]}{k}$. The matching number of $\mathcal{F}$, denoted by $\nu(\mathcal{F})$, is the maximum number of pairwise disjoint sets in $\mathcal{F}$, and $\mathcal{F}$ is…

Combinatorics · Mathematics 2019-11-11 Xizhi Liu

We consider the possible sizes of large sumfree sets contained in the discrete hypercube $\{1,...,n\}^k$, and we determine upper and lower bounds for the maximal size as $n$ becomes large. We also discuss a continuous analogue in which our…

Number Theory · Mathematics 2015-05-13 Daniel Katz

We investigate the size of subspaces in sumsets and show two main results. First, if A is a subset of F_2^n with density at least 1/2 - o(n^{-1/2}) then A+A contains a subspace of co-dimension 1. Secondly, if A is a subset of F_2^n with…

Number Theory · Mathematics 2010-12-03 Tom Sanders

In this paper we study bounded diameter variations of the following form of Ryser's conjecture. For every graph $G=(V,E)$ with independence number $\alpha(G)=\alpha$ and integer $r\geq 2$, in every $r$-edge coloring of $G$ there is a cover…

Combinatorics · Mathematics 2025-05-06 Andras Gyarfas , Gabor N. Sarkozy

A family $\mathcal{F}$ of subsets of $[n]=\{1,2,\ldots,n\}$ shatters a set $A \subseteq [n]$ if for every $A' \subseteq A$ there is an $F \in \mathcal{F}$ such that $F \cap A=A'$. We develop a framework to analyze $f(n,k,d)$, the maximum…

Combinatorics · Mathematics 2024-10-29 Noga Alon , Varun Sivashankar , Daniel G. Zhu

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

Combinatorics · Mathematics 2025-06-02 Koki Furukawa

Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…

Functional Analysis · Mathematics 2019-09-10 Luca Brandolini , Giancarlo Travaglini

This paper studies the combinatoric structure of the set of all representations, up to equivalence, of a finite-dimensional semisimple Lie algebra. This has intrinsic interest as a previously unsolved problem in representation theory, and…

Quantum Physics · Physics 2007-05-23 William Gordon Ritter

Let $\mathbb{F}$ be a fixed finite field, and let $A \subset \mathbb{F}^n$. It is a well-known fact that there is a subspace $V \leq \mathbb{F}^n$, $\mbox{codim} V \ll_{\delta} 1$, and an $x$, such that $A$ is $\delta$-uniform when…

Number Theory · Mathematics 2016-07-25 Ben Green , Tom Sanders

Let $[n] = \{1, 2, \ldots, n\}$ and let $2^{[n]}$ be the collection of all subsets of $[n]$ ordered by inclusion. ${\cal C} \subseteq 2^{[n]}$ is a {\em cutset} if it meets every maximal chain in $2^{[n]}$, and the {\em width} of ${\cal C}…

Combinatorics · Mathematics 2015-12-10 Béla Bajnok , Shahriar Shahriari

A blocking set in an affine plane is a set of points $B$ such that every line contains at least one point of $B$. The best known lower bound for blocking sets in arbitrary (non-desarguesian) affine planes was derived in the 1980's by Bruen…

Combinatorics · Mathematics 2018-04-26 Maarten De Boeck , Geertrui Van de Voorde

Given an integer $d \geq 2$, $s \in (0,1]$, and $t \in [0,2(d-1)]$, suppose a set $X$ in $\mathbb{R}^d$ has the following property: there is a collection of lines of packing dimension $t$ such that every line from the collection intersects…

Classical Analysis and ODEs · Mathematics 2024-09-23 Jonathan M. Fraser