The structure of the minimum size supertail of a subspace partition

被引:2
|
作者
Nastase, Esmeralda [1 ]
Sissokho, Papa [2 ]
机构
[1] Xavier Univ, Dept Math, Cincinnati, OH 45207 USA
[2] Illinois State Univ, Dept Math, Normal, IL 61790 USA
关键词
Vector space partition; Subspace partition; Partial d-spread; FINITE VECTOR-SPACES;
D O I
10.1007/s10623-016-0237-0
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Let denote the vector space of dimension n over the finite field with q elements. A subspace partition of V is a collection of nontrivial subspaces of V such that each nonzero vector of V is in exactly one subspace of . For any integer d, the d -supertail of is the set of subspaces in of dimension less than d, and it is denoted by ST. Let denote the minimum number of subspaces in any subspace partition of V in which the largest subspace has dimension t. It was shown by Heden et al. that , where t is the largest dimension of a subspace in ST. In this paper, we show that if , then the union of all the subspaces in ST constitutes a subspace under certain conditions.
引用
收藏
页码:549 / 563
页数:15
相关论文
共 50 条
  • [41] The minimum number of chains in a noncrossing partition of a poset
    Chen, Ricky X. F.
    [J]. FILOMAT, 2024, 38 (08) : 2915 - 2922
  • [42] Minimum partition of an independence system into independent sets
    Zhou, Sanming
    [J]. DISCRETE OPTIMIZATION, 2009, 6 (01) : 125 - 133
  • [43] Minimum convex partition of a constrained point set
    Fevens, T
    Meijer, H
    Rappaport, D
    [J]. DISCRETE APPLIED MATHEMATICS, 2001, 109 (1-2) : 95 - 107
  • [44] Approximation algorithms for the minimum convex partition problem
    Knauer, Christian
    Spillner, Andreas
    [J]. ALGORITHM THEORY - SWAT 2006, PROCEEDINGS, 2006, 4059 : 232 - 241
  • [45] Minimum Clique Partition in Unit Disk Graphs
    Dumitrescu, Adrian
    Pach, Janos
    [J]. GRAPHS AND COMBINATORICS, 2011, 27 (03) : 399 - 411
  • [46] Minimum Clique Partition in Unit Disk Graphs
    Adrian Dumitrescu
    János Pach
    [J]. Graphs and Combinatorics, 2011, 27 : 399 - 411
  • [47] On the minimum monochromatic or multicolored subgraph partition problems
    Li, Xueliang
    Zhang, Xiaoyan
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 385 (1-3) : 1 - 10
  • [48] A heuristic for the minimum cost chromatic partition problem
    Ribeiro, Celso C.
    dos Santos, Philippe L. F.
    [J]. RAIRO-OPERATIONS RESEARCH, 2020, 54 (03) : 845 - 871
  • [49] PARTITION OF GRAPHS WITH CONDITION ON THE CONNECTIVITY AND MINIMUM DEGREE
    HAJNAL, P
    [J]. COMBINATORICA, 1983, 3 (01) : 95 - 99
  • [50] On the Complexity of the Minimum Independent Set Partition Problem
    Chan, T. -H. Hubert
    Papamanthou, Charalampos
    Zhao, Zhichao
    [J]. COMPUTING AND COMBINATORICS, 2015, 9198 : 121 - 132