Extremal sizes of subspace partitions (Q438885): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Olof Heden / rank
Normal rank
 
Property / author
 
Property / author: Juliane Lehmann / rank
Normal rank
 
Property / author
 
Property / author: Esmeralda L. Năstase / rank
Normal rank
 
Property / author
 
Property / author: Q369433 / rank
Normal rank
 
Property / review text
 
Let \(V=V(n,q)\) be a vector space of dimension \(n\) over the Galois field of \(q\) elements. A subspace partition \(\Pi\) of \(V\) is a collection of subspaces of \(V\) such that each 1-dimensional subspace of \(V\) is in exactly one subspace of \(\Pi\). Let \(\sigma_q(n,t)\) denote the minimum size of a subspace partition of \(V\) (i.e. the number of subspaces in \(\Pi\)) in which the largest subspace has dimension \(t\), and let \(\rho_q (n,t)\) denote the maximum size of a subspace partition of \(V\) in which the smallest subspace has dimension \(t\). In this paper the authors determine, for each pair of positive integers \((n,t)\), the values of \(\sigma_q(n,t)\) and \(\rho_q (n,t)\). Furthermore they prove that if \(n\geq 2t\) then the minimum size of a maximal partial \(t\)-spread of \(V(n+t-1,t)\) is \(\sigma_q(n,t)\). Finally they conjecture that if \(\Pi\) is a subspace partition of \(V(n,q)\) with \(n_i>0\) subspaces of dimension \(d_i\), \(1<\leq i\leq k\), with \(d_1<\ldots,<d_k\), then \(n_1+\ldots+n_j\geq \sigma_q(d_j+1,d_j)\) for each \(j\in\{1,\ldots,k-1\}\).
Property / review text: Let \(V=V(n,q)\) be a vector space of dimension \(n\) over the Galois field of \(q\) elements. A subspace partition \(\Pi\) of \(V\) is a collection of subspaces of \(V\) such that each 1-dimensional subspace of \(V\) is in exactly one subspace of \(\Pi\). Let \(\sigma_q(n,t)\) denote the minimum size of a subspace partition of \(V\) (i.e. the number of subspaces in \(\Pi\)) in which the largest subspace has dimension \(t\), and let \(\rho_q (n,t)\) denote the maximum size of a subspace partition of \(V\) in which the smallest subspace has dimension \(t\). In this paper the authors determine, for each pair of positive integers \((n,t)\), the values of \(\sigma_q(n,t)\) and \(\rho_q (n,t)\). Furthermore they prove that if \(n\geq 2t\) then the minimum size of a maximal partial \(t\)-spread of \(V(n+t-1,t)\) is \(\sigma_q(n,t)\). Finally they conjecture that if \(\Pi\) is a subspace partition of \(V(n,q)\) with \(n_i>0\) subspaces of dimension \(d_i\), \(1<\leq i\leq k\), with \(d_1<\ldots,<d_k\), then \(n_1+\ldots+n_j\geq \sigma_q(d_j+1,d_j)\) for each \(j\in\{1,\ldots,k-1\}\). / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Daniele Bartoli / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 51E23 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 51E14 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 51E10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6062565 / rank
 
Normal rank
Property / zbMATH Keywords
 
subspace partition
Property / zbMATH Keywords: subspace partition / rank
 
Normal rank
Property / zbMATH Keywords
 
vector space partitions
Property / zbMATH Keywords: vector space partitions / rank
 
Normal rank
Property / zbMATH Keywords
 
partial t-spreads
Property / zbMATH Keywords: partial t-spreads / rank
 
Normal rank
Property / author
 
Property / author: Olof Heden / rank
 
Normal rank
Property / author
 
Property / author: Juliane Lehmann / rank
 
Normal rank
Property / author
 
Property / author: Esmeralda L. Năstase / rank
 
Normal rank
Property / author
 
Property / author: Papa Amar Sissokho / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2106235829 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1104.2706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vector space partitions and uniformly resolvable designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking sets in PG(2, p) for small <i>p</i>, and partial spreads in PG(3,7) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of a vector space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial t-spreads and group constructible \((s,r,\mu)\)-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectrum of the sizes of maximal partial line spreads in \(\mathrm{PG}(2n,q)\), \(n \geq 3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of the 8-dimensional vector space over GF(2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal partial spreads in \(PG\)(\(n\), \(q\)) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small maximal partial \(t\)-spreads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of finite Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximal partial spread of size 45 in \(PG(3,7)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the length of the tail of a vector space partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Partition, Factorization and the Vector Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Class of Maximal Codes ror Computer Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximal partial spreads with deficiency \(q+1\), \(q\) even / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some necessary conditions for vector space partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum size of a finite subspace partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and construction of randomization defining contrast subspaces for regular factorial designs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:56, 5 July 2024

scientific article
Language Label Description Also known as
English
Extremal sizes of subspace partitions
scientific article

    Statements

    Extremal sizes of subspace partitions (English)
    0 references
    31 July 2012
    0 references
    Let \(V=V(n,q)\) be a vector space of dimension \(n\) over the Galois field of \(q\) elements. A subspace partition \(\Pi\) of \(V\) is a collection of subspaces of \(V\) such that each 1-dimensional subspace of \(V\) is in exactly one subspace of \(\Pi\). Let \(\sigma_q(n,t)\) denote the minimum size of a subspace partition of \(V\) (i.e. the number of subspaces in \(\Pi\)) in which the largest subspace has dimension \(t\), and let \(\rho_q (n,t)\) denote the maximum size of a subspace partition of \(V\) in which the smallest subspace has dimension \(t\). In this paper the authors determine, for each pair of positive integers \((n,t)\), the values of \(\sigma_q(n,t)\) and \(\rho_q (n,t)\). Furthermore they prove that if \(n\geq 2t\) then the minimum size of a maximal partial \(t\)-spread of \(V(n+t-1,t)\) is \(\sigma_q(n,t)\). Finally they conjecture that if \(\Pi\) is a subspace partition of \(V(n,q)\) with \(n_i>0\) subspaces of dimension \(d_i\), \(1<\leq i\leq k\), with \(d_1<\ldots,<d_k\), then \(n_1+\ldots+n_j\geq \sigma_q(d_j+1,d_j)\) for each \(j\in\{1,\ldots,k-1\}\).
    0 references
    0 references
    0 references
    0 references
    0 references
    subspace partition
    0 references
    vector space partitions
    0 references
    partial t-spreads
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references