\(k\)-Eulerian posets (Q1611291): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1012296719116 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2162837847 / rank
 
Normal rank

Latest revision as of 08:23, 30 July 2024

scientific article
Language Label Description Also known as
English
\(k\)-Eulerian posets
scientific article

    Statements

    \(k\)-Eulerian posets (English)
    0 references
    0 references
    0 references
    21 August 2002
    0 references
    A graded poset \(P\) is called Eulerian if the number of elements of even rank equals the number of elements of odd rank in every interval of \(P\). A poset \(P\) is called \(k\)-Eulerian if every interval of \(P\) of rank \(k\) is Eulerian. If \(P\) is a \(2k\)-Eulerian poset then \(P\) is also \((2k+1)\)-Eulerian. The author studies, by algebraic methods, \((2k+1)\)-Eulerian posets.
    0 references
    cd-index
    0 references
    flag operators
    0 references
    Eulerian poset
    0 references

    Identifiers