Clique polynomials have a unique root of smallest modulus (Q294815): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3994777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membership problems for regular and context-free trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems of commutation and rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinants and Möbius functions in trace monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Möbius functions and confluent semi-commutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-negative matrices and Markov chains. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5622371 / rank
 
Normal rank

Revision as of 03:50, 12 July 2024

scientific article
Language Label Description Also known as
English
Clique polynomials have a unique root of smallest modulus
scientific article

    Statements

    Clique polynomials have a unique root of smallest modulus (English)
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    clique polynomials
    0 references
    formal languages
    0 references
    rational functions
    0 references
    trace monoids
    0 references

    Identifiers