Ferrers graphs, D-permutations, and surjective staircases
From MaRDI portal
Publication:2688346
DOI10.1007/s11139-022-00581-5OpenAlexW3207996018MaRDI QIDQ2688346
Publication date: 2 March 2023
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.14358
characteristic polynomialshyperplane arrangementsGenocchi numbersFerrers graphssurjective staircases
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (1)
Cites Work
- Unnamed Item
- On geometric semilattices
- Interpretations combinatoires des nombres de Genocchi
- The homology of partitions with an even number of blocks
- Deformations of Coxeter hyperplane arrangements
- EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model
- Enumerative properties of Ferrers graphs
- Conjectures on the ternary symmetries connected to the Genocchi numbers
- Further triangles of Seidel-Arnold type and continued fractions related to Euler and Springer numbers
- On certain symmetry properties of the Genocchi numbers
- Generalized Dumont-Foata polynomials
- On the homogenized linial arrangement: intersection lattice and Genocchi numbers
- Alternation acyclic tournaments
- A class of geometric lattices based on finite groups
- Boolean complexes for Ferrers graphs
- The Chromatic Polynomial of a Complete Bipartite Graph
- Monomial and toric ideals associated to Ferrers graphs
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- The homogenized Linial arrangement and Genocchi numbers
This page was built for publication: Ferrers graphs, D-permutations, and surjective staircases