𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimum size of a finite subspace partition

✍ Scribed by Esmeralda L. Năstase; Papa A. Sissokho

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
218 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

A subspace partition of P = PG(n, q) is a collection of subspaces of P whose pairwise intersection is empty. Let σ q (n, t) denote the minimum size (i.e., minimum number of subspaces) in a subspace partition of P in which the largest subspace has dimension t. In this paper, we determine the value of σ q (n, t) for n 2t + 2. Moreover, we use the value of σ q (2t + 2, t) to find the minimum size of a maximal partial t-spread in PG(3t + 2, q).

📜 SIMILAR VOLUMES

Partitions of finite vector spaces into
Partitions of finite vector spaces into subspaces
✍ S. I. El-Zanati; G. F. Seelinger; P. A. Sissokho; L. E. Spence; C. Vanden Eynden 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract Let __V__~n~(q) denote a vector space of dimension __n__ over the field with __q__ elements. A set ${\cal P}$ of subspaces of __V__~n~(q) is a __partition__ of __V__~n~(q) if every nonzero element of __V__~n~(q) is contained in exactly one element of ${\cal P}$. Suppose there exists a p

Minimum-sized Infinite Partitions of Boo
Minimum-sized Infinite Partitions of Boolean Algebras
✍ J. Donald Monk 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 736 KB

## Abstract For any Boolean Algebra __A__, let c~mm~(__A__) be the smallest size of an infinite partition of unity in __A.__ The relationship of this function to the 21 common functions described in Monk [4] is described, for the class of all Boolean algebras, and also for its most important subcla

Partitioning the Boolean Lattice into Ch
Partitioning the Boolean Lattice into Chains of Large Minimum Size
✍ Tim Hsu; Mark J. Logan; Shahriar Shahriari; Christopher Towse 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Let 2 [n] denote the Boolean lattice of order n, that is, the poset of subsets of {1, ..., n} ordered by inclusion. Recall that 2 [n] may be partitioned into what we call the canonical symmetric chain decomposition (due to de Bruijn, Tengbergen, and Kruyswijk), or CSCD. Motivated by a question of Fü

The size of minimum 3-trees
The size of minimum 3-trees
✍ Jorge L. Arocha; Joaquín Tey 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

## Abstract A 3‐uniform hypergraph (3‐graph) is said to be tight, if for any 3‐partition of its vertex set there is a transversal triple. We give the final steps in the proof of the conjecture that the minimum number of triples in a tight 3‐graph on __n__ vertices is exactly $\left\lceil n(n-2)/3 \