Anzeige
Erschienen in:
1986 | OriginalPaper | Buchkapitel
Involutions
verfasst von : Dennis Stanton, Dennis White
Erschienen in: Constructive Combinatorics
Verlag: Springer New York
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Many combinatorial formulas include positive and negative values. It might first seem that a bijection is not the proper tool for dealing with these formulas. This is not the case, however. Such formulas can sometimes be proved by using an involution on a signed set. In fact, involutions may be used to prove theorems seemingly unrelated to combinatorics. This will be done in Section 3 for the Cayley-Hamilton Theorem.