Related papers: A Lattice Path Interpretation of the Diamond Produ…
A modular or distributive lattice is `diamond-colored' if its order diagram edges are colored in such a way that, within any diamond of edges, parallel edges have the same color. Such lattices arise naturally in combinatorial representation…
Brawley and Carlitz introduced diamond products of elements of finite fields and associated composed products of polynomials in 1987. Composed products yield a method to construct irreducible polynomials of large composite degrees from…
A lattice path matroid is a transversal matroid corresponding to a pair of lattice paths on the plane. A matroid base polytope is the polytope whose vertices are the incidence vectors of the bases of the given matroid. In this paper, we…
It is an open question whether the linear extension complexity of the Cartesian product of two polytopes P, Q is the sum of the extension complexities of P and Q. We give an affirmative answer to this question for the case that one of the…
For each permutation $w$, we consider the set $\mathrm{PD}(w)$ of reduced pipe dreams for $w$, partially ordered so that cover relations correspond to (generalized) chute moves. Settling a conjecture of Rubey from 2012, we prove that…
A polyhedral product is a natural subspace of a Cartesian product that is specified by a simplicial complex. The modern formalism arose as a generalization of the spaces known as moment-angle complexes which were developed within the…
A novel basis of discrete analytic polynomials on a rhombic lattice is introduced and the associated convolution product is studied. A class of discrete analytic functions that are rational with respect to this product is also described.
We introduce a canonical operator-theoretic construction associated to a finite geometric lattice, in which a simple nonassociative ``diamond product'' on the lattice basis gives rise to a family of creation operators indexed by atoms and a…
We introduce posets of simple vertex labeled minors of graphs and a generalization to the level of polymatroids, collectively termed minor posets. We show that any minor poset is isomorphic to the face poset of a regular CW sphere, and in…
Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…
We analyze domino tilings of the two-periodic Aztec diamond by means of matrix valued orthogonal polynomials that we obtain from a reformulation of the Aztec diamond as a non-intersecting path model with periodic transition matrices. In a…
The M-polynomial provides a unifying framework for a wide class of degree-based topological indices. Despite its structural importance, general methods for computing the M-polynomial under graph constructions remain limited. In this paper,…
Dualising the construction of a polyhedral product, we introduce the notion of a polyhedral coproduct as a certain homotopy limit over the face poset of a simplicial complex. We begin a study of the basic properties of polyhedral…
Toric varieties associated with distributive lattices arise as a fibre of a flat degeneration of a Schubert variety in a minuscule. The singular locus of these varieties has been studied by various authors. In this article we prove that the…
Recently, Bapat and Kurata [\textit{Linear Algebra Appl.}, 562(2019), 135-153] defined the Cartesian product of two square matrices $A$ and $B$ as $A\oslash B=A\otimes \J+\J\otimes B$, where $\J$ is the all one matrix of appropriate order…
We study operators that are products of two orthogonal projections. Our results complement some of the classical results of Crimmins and von Neumann. Particular emphasis has been given to projections associated with inner functions defined…
We provide an exact construction of interaction Hamiltonians on a one-dimensional lattice which grow as a polynomial multiplied by an exponential with the lattice site separation as a matrix product operator (MPO), a type of one-dimensional…
This is a survey of the $cd$-index of Eulerian partially ordered sets. The $cd$-index is an encoding of the numbers of chains, specified by ranks, in the poset. It is the most efficient such encoding, incorporating all the affine relations…
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…
Birational rowmotion is an action on the space of assignments of rational functions to the elements of a finite partially-ordered set (poset). It is lifted from the well-studied rowmotion map on order ideals (equivariantly on antichains) of…