We continue the study by Melo and Winter (2019) [3] on the possible intersection sizes of a k-dimensional subspace with the vertices of the n-dimensional hypercube in Euclidean space. Melo and Winter conjectured that all intersection sizes larger than 2k−1 (the “large” sizes) are of the form 2k−1+2i. We show that this is almost true: the large intersection sizes are either of this form or of the form 35⋅2k−6. We also disprove a second conjecture of Melo and Winter by proving that a positive fraction of the “small” values is missing
In this article, constant dimension subspace codes whose codewords have subspace distance in a presc...
We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n ha...
ABSTRACT. Let F be an n-uniform hypergraph on 2n vertices. Suppose that |F1 ∩F2 ∩F3 ∩F4 | ≥ 2 and |...
We continue the study by Melo and Winter (2019) [3] on the possible intersection sizes of a k-dimens...
We continue the study by Melo and Winter (2019) [3] on the possible intersection sizes of a k-dimens...
We continue the study by Melo and Winter (2019) [3] on the possible intersection sizes of a k-dimens...
AbstractIn Ahlswede et al. [Discrete Math. 273(1–3) (2003) 9–21] we posed a series of extremal (set ...
Ahlswede R, Aydinian H, Khachatrian LH. Intersection theorems under dimension constraints. Journal o...
We begin by studying the possible intersection sizes of a $k$-dimensional linear subspace with the h...
AbstractA large variety of problems and results in Extremal Set Theory deal with estimates on the si...
AbstractLet be an n-uniform hypergraph on 2n vertices. Suppose that |F1∩F2∩F3∩F4|≥2 and |F1∪F2∪F3∪F...
Consider the following problem which we call Maximum k-Subset Intersection (MSI): Given a col-lectio...
AbstractIn this paper we improve the construction of Goto (1993) to obtain the Main Theorem: Let n, ...
A set system is L-intersecting if any pairwise intersection size lies in L, where L is some set of s...
In this article, constant dimension subspace codes whose codewords have subspace distance in a presc...
In this article, constant dimension subspace codes whose codewords have subspace distance in a presc...
We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n ha...
ABSTRACT. Let F be an n-uniform hypergraph on 2n vertices. Suppose that |F1 ∩F2 ∩F3 ∩F4 | ≥ 2 and |...
We continue the study by Melo and Winter (2019) [3] on the possible intersection sizes of a k-dimens...
We continue the study by Melo and Winter (2019) [3] on the possible intersection sizes of a k-dimens...
We continue the study by Melo and Winter (2019) [3] on the possible intersection sizes of a k-dimens...
AbstractIn Ahlswede et al. [Discrete Math. 273(1–3) (2003) 9–21] we posed a series of extremal (set ...
Ahlswede R, Aydinian H, Khachatrian LH. Intersection theorems under dimension constraints. Journal o...
We begin by studying the possible intersection sizes of a $k$-dimensional linear subspace with the h...
AbstractA large variety of problems and results in Extremal Set Theory deal with estimates on the si...
AbstractLet be an n-uniform hypergraph on 2n vertices. Suppose that |F1∩F2∩F3∩F4|≥2 and |F1∪F2∪F3∪F...
Consider the following problem which we call Maximum k-Subset Intersection (MSI): Given a col-lectio...
AbstractIn this paper we improve the construction of Goto (1993) to obtain the Main Theorem: Let n, ...
A set system is L-intersecting if any pairwise intersection size lies in L, where L is some set of s...
In this article, constant dimension subspace codes whose codewords have subspace distance in a presc...
In this article, constant dimension subspace codes whose codewords have subspace distance in a presc...
We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n ha...
ABSTRACT. Let F be an n-uniform hypergraph on 2n vertices. Suppose that |F1 ∩F2 ∩F3 ∩F4 | ≥ 2 and |...