Single-hook characters and hamiltonian circuits∗
From MaRDI portal
Publication:3041397
Cites work
- Eulerian numbers, Newcomb's problem and representations of symmetric groups
- Factorization of permutations into n-cycles
- scientific article; zbMATH DE number 3164227 (Why is no real title available?)
- scientific article; zbMATH DE number 3750956 (Why is no real title available?)
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- scientific article; zbMATH DE number 3212917 (Why is no real title available?)
- scientific article; zbMATH DE number 3109449 (Why is no real title available?)
- Inequalities: theory of majorization and its applications
- Majorization of characters of the symmetric group
- Manifestations of Polya's counting theorem
- Monotonicity and unimodality of the pattern inventory
- Nonzero decomposable symmetrized tensors
- On the representation theory of the symmetric groups
- On the Snapper/Liebler-Vitale/Lam theorem on permutation representations of the symmetric group
- On vanishing decomposable symmetrized tensors†
- Ordering the partition characters of the symmetric group
- Permanental polynomials of graphs
- Regular products of the single-hook characters of the unitary group
- Symmetric functions and raising operators
- The complexity of computing the permanent
- Theory and Application of Plane Partitions: Part 1
- Young diagrams, Schur functions, the Gale-Ryser theorem and a conjecture or Snapper
Cited in
(12)- Inequalities and identities for generalized matrix functions
- A Hadamard inequality for the second immanant
- Laplacian matrices of graphs: A survey
- Hook immanantal inequalities for Laplacians of trees
- A Hopf algebra for counting cycles
- Immanantal invariants of graphs
- The coefficients of the immanantal polynomial
- A general purpose algorithm for counting simple cycles and simple paths of any length
- An update on Minc's survey of open problems involving permanents
- On the complexity of immanants
- Applications of multlinear algebra
- Some immanantal inequalities and equalities for linear combination matrices of (di)graphs
This page was built for publication: Single-hook characters and hamiltonian circuits∗
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3041397)