Results 31 to 40 of about 26,723 (134)
Lagrangian combinatorics of matroids [PDF]
Algebraic Combinatorics, 2021 The Lagrangian geometry of matroids was introduced in [ADH20] through the construction of the conormal fan of a matroid M. We used the conormal fan to give a Lagrangian-geometric interpretation of the h-vector of the broken circuit complex of M: its ...
Federico Ardila, G. Denham, June Huh
semanticscholar +1 more source
Discrete Mathematics & Theoretical Computer Science, 2020 The main objects of noncrossing Catalan combinatorics associated to a finite Coxeter system are noncross- ing partitions, sortable elements, and cluster complexes. The first and the third of these have known Fuss–Catalan generalizations.
Christian Stump +2 more
doaj +1 more source
Symmetric matrices, Catalan paths, and correlations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Kenyon and Pemantle (2014) gave a formula for the entries of a square matrix in terms of connected principal and almost-principal minors. Each entry is an explicit Laurent polynomial whose terms are the weights of domino tilings of a half Aztec diamond ...
Emmanuel Tsukerman +2 more
doaj +1 more source
Combinatorics and Representation Theory of Special Cases of Chern Plethysm [PDF]
Electronic Journal of Combinatorics, 2023 Chern plethysm, introduced by Billey, Rhoades, and Tewari, is a geometric way to produce Schur positive symmetric polynomials. We present combinatorial interpretations for the Schur expansions of special cases of Chern plethysm.
Nathaniel Libman, Gidon Orelowitz
semanticscholar +1 more source
Staircase diagrams and the enumeration of smooth Schubert varieties [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 In this extended abstract, we give a complete description and enumeration of smooth and rationally smooth Schubert varieties in finite type. In particular, we show that rationally smooth Schubert varieties are in bijection with a new combinatorial data ...
Edward Richmond, William Slofstra
doaj +1 more source
An equivalence of multistatistics on permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We prove a conjecture of J.-C. Novelli, J.-Y. Thibon, and L. K. Williams (2010) about an equivalence of two triples of statistics on permutations. To prove this conjecture, we construct a bijection through different combinatorial objects, starting with a
Arthur Nunge
doaj +1 more source
Extending the weak order on Coxeter groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We introduce a new family of complete lattices, arising from a digraph together with a valuation on its vertices and generalizing a previous construction of the author.
Francois Viard
doaj +1 more source
Graph Theory and Additive Combinatorics
, 2023 Using the dichotomy of structure and pseudorandomness as a central theme, this accessible text provides a modern introduction to extremal graph theory and additive combinatorics.
Yufei Zhao
semanticscholar +1 more source
Combinatorics of $(m,n)$-Word Lattices [PDF]
Electronic Journal of Combinatorics, 2023 We study the $(m,n)$-word lattices recently introduced by V. Pilaud and D. Poliakova in their study of generalized Hochschild polytopes. We prove that these lattices are extremal and constructable by interval doublings.
Henri Mühle
semanticscholar +1 more source
The twist for positroids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 There are two reasonable ways to put a cluster structure on a positroid variety. In one, the initial seed is a set of Plu ̈cker coordinates. In the other, the initial seed consists of certain monomials in the edge weights of a plabic graph.
Greg Muller, David E. Speyer
doaj +1 more source