Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs.

DOI10.1016/S0012-365X(00)00069-8MaRDI QIDQ5931409zbMATH OpenOpenAlexFDO

Authors Anna Lee, Gábor Révész, Jenő Szigeti, Zsolt Tuza

Publication date 5 July 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(00)00069-8

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Eulerian polynomial identities on matrix rings
• Quasi-polynomials of Capelli. III
• Criteria for vanishing of Eulerian polynomials on \(n\times n\) matrices
• Permanental polynomial identities on matrix rings
• Quasi-Polynomials of Capelli. II

Cited in

(2)

• PI INCIDENCE ALGEBRAS AND CAPELLI POLYNOMIALS
• To Chang theorem. II.

This page was built for publication: Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5931409)