Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Patricia Hersh"'
Autor:
Karola Mészáros, Patricia Hersh
Publikováno v:
Journal of Combinatorial Theory, Series A. 152:104-120
We introduce a new class of poset edge labelings for locally finite lattices which we call $SB$-labelings. We prove for finite lattices which admit an $SB$-labeling that each open interval has the homotopy type of a ball or of a sphere of some dimens
Autor:
Patricia Hersh, Richard Kenyon
We prove a conjecture of Thomas Lam that the face posets of stratified spaces of planar resistor networks are shellable. These posets are called uncrossing partial orders. This shellability result combines with Lam's previous result that these same p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c9451fdedbcc3825671a4e7fac4a0a9
http://arxiv.org/abs/1803.06217
http://arxiv.org/abs/1803.06217
Richard Stanley's work in combinatorics revolutionized and reshaped the subject. Many of his hallmark ideas and techniques imported from other areas of mathematics have become mainstays in the framework of modern combinatorics. In addition to collect
Richard Stanley's work in combinatorics revolutionized and reshaped the subject. His lectures, papers, and books inspired a generation of researchers. In this volume, these researchers explain how Stanley's vision and insights influenced and guided t
Autor:
Patricia Hersh
Publikováno v:
Advances in Mathematics. 221:812-829
In their work on `Coxeter-like complexes', Babson and Reiner introduced a simplicial complex $\Delta_T$ associated to each tree $T$ on $n$ nodes, generalizing chessboard complexes and type A Coxeter complexes. They conjectured that $\Delta_T$ is $(n-
Autor:
Patricia Hersh, Robert Kleinberg
Publikováno v:
Contemporary Mathematics. :113-118
Publikováno v:
Journal of Algebra. 308(1):73-90
Backelin proved that the multigraded Poincare series for resolving a residue field over a polynomial ring modulo a monomial ideal is a rational function. The numerator is simple, but until the recent work of Berglund there was no combinatorial formul
Autor:
Patricia Hersh, John Shareshian
Publikováno v:
Order. 23:339-342
We show that the order complex of any finite lattice with a chain \(\widehat{0} < m_{1} < \cdots < m_{r} < \widehat{1}\) of modular elements is at least (r−2)-connected.
Autor:
Patricia Hersh, Cristian Lenart
We investigate the ways in which fundamental properties of the weak Bruhat order on a Weyl group can be lifted (or not) to a corresponding highest weight crystal graph, viewed as a partially ordered set; the latter projects to the weak order via the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf149ea6f5cfbc3c3a2f803e884fe8ea
Autor:
Patricia Hersh, Eric Babson
Publikováno v:
Transactions of the American Mathematical Society. 357:509-534
This paper shows how to construct a discrete Morse function with a relatively small number of critical cells for the order complex of any finite poset with 0 ^ \hat {0} and 1 ^ \hat {1} from any lexicographic order on its maximal chains. Specifically