A linear algebraic view of partition regular matrices (Q603111): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4226075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Allow problems concerning spectral properties of sign pattern matrices: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular 2-graphs and extensions of partial geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5754494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Problems in Partition Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Lower Bounds using Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Studien zur Kombinatorik / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494299 / rank
 
Normal rank

Latest revision as of 11:03, 3 July 2024

scientific article
Language Label Description Also known as
English
A linear algebraic view of partition regular matrices
scientific article

    Statements

    A linear algebraic view of partition regular matrices (English)
    0 references
    0 references
    0 references
    5 November 2010
    0 references
    Let \(A=[a_1, a_2, \dots, a_u]\in {\mathbb Q}^{v\times u}\). We say that \(A\) has the columns condition, written \(A\in CC(m)\), if there exists a partition \(\{I_1,\dots,I_m\}\) of \(\{1,\dots,u\}\) of \(A\), such that for all \(t=1,\dots,m\), \(I_t\neq 0\) and \[ \sum_{i\in I_{t}}a_{i} \in\text{Span}\{a_{j} : j\in I_{1}\cup I_2\cup\cdots\cup I_{t-1}\}. \] The authors investigate the properties of the columns condition, especially for oriented incidence matrices of directed graphs and for sign pattern matrices. They show that the oriented incidence matrix of a graph has the columns condition for some \(m\) if and only if it is strongly connected. They also show that a sign pattern matrix has the columns condition for some \(m\) if and only if it has the columns conditions for all \(m\) if and only if each row is either all zeros or contains both \(+\) and \(-\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    columns condition
    0 references
    partition regular matrix
    0 references
    oriented incidence matrix
    0 references
    directed graphs
    0 references
    sign pattern matrices
    0 references
    0 references