Related papers: Maps between higher Bruhat orders and higher Stash…
Bergeron, Bousquet-Melou and Dulucq enumerated paths in the Hasse diagram of the following poset: the underlying set is that of all compositions, and a composition \mu covers another composition \lambda if \mu can be obtained from \lambda…
For each poset $P$, we construct a polytope $A(P)$ called the $P$-associahedron. Similarly to the case of graph associahedra, the faces of $A(P)$ correspond to certain nested collections of subsets of $P$. The Stasheff associahedron is a…
A plane poset is a finite set with two partial orders, satisfying a certain incompatibility condition. The set PP of isoclasses of plane posets owns two products, and an infinitesimal Hopf algebra structure is defined on the vector space…
We prove the conjecture of A. Postnikov that (A) the number of regions in the inversion hyperplane arrangement associated with a permutation $w\in \Sn$ is at most the number of elements below $w$ in the Bruhat order, and (B) that equality…
Two of the most prominent unresolved conjectures in graph theory, the Albertson-Berman conjecture and the Matheson-Tarjan conjecture, have been extensively studied by many researchers. (AB) Every planar graph of order $n$ has an induced…
In 2007, D.I. Panyushev defined a remarkable map on the set of nonnesting partitions (antichains in the root poset of a finite Weyl group). In this paper we identify Panyushev's map with the Kreweras complement on the set of noncrossing…
We study a family of above-below Ramsey functions $\operatorname{AB}^{(d)}(k)$ defined for sequences of points in $\mathbb R^d$ whose projections to $\mathbb R^{d-1}$ have cyclic order type. The case $d=3$ is the above-below function…
Very recently, Galashin, Postnikov, and Williams introduced the notion of higher secondary polytopes, generalizing the secondary polytope of Gelfand, Kapranov, and Zelevinsky. Given an $n$-point configuration $\mathcal{A}$ in…
We study a commutant-closed collection of von Neumann algebras acting on a common Hilbert space indexed by a poset with an order-reversing involution. We give simple geometric axioms for the poset which allow us to construct a braided…
We show a general result known as the Erdos_Sos Conjecture: if $E(G)>{1/2}(k-1)n$ where $G$ has order $n$ then $G$ contains every tree of order $k+1$ as a subgraph.
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the…
In this paper, we present a polynomial dynamic programming algorithm that tests whether a $n$-vertex directed tree $T$ has an upward planar embedding into a convex point-set $S$ of size $n$. Further, we extend our approach to the class of…
For any finite connected poset $P$, Galashin introduced a simple convex $(|P|-2)$-dimensional polytope $\mathscr{A}(P)$ called the poset associahedron. For a certain family of posets, whose poset associahedra interpolate between the…
We study the topdrop map, a mapping on permutations in $S_n$ related to card shuffling. We show this map is bijective and study its orbit structure. We introduce the notion of the topdrop-necklace as a way of classifying the orbits of the…
Let $V_{n,d}$ be the variety of equations for hypersurfaces of degree $d$ in $\mathbb{P}^n(\mathbb{C})$ with singularities not worse than simple nodes. We prove that the orbit map $G'=SL_{n+1}(\mathbb{C}) \to V_{n,d}$, $g\mapsto g\cdot…
Stasheff showed that if a map between H-spaces is an H-map, then the suspension of the map is extendable to a map between cprojective planes of the H-spaces. Stahseff also proved the converse under the assumption that the multiplication of…
The purpose of the present paper is to give a realization of a cylindric diagram as a subset of root systems of type $A_{\kappa-1}^{(1)}$ and several characterization of its poset structure. Furthermore, the set of order ideals of a…
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…
In [1] we introduced the notion of 'structured space', i.e. a space which locally resembles various algebraic structures. In [2] and [3] we studied some cohomology theories related to these space. In this paper we continue in this…
Schnyder characterized planar graphs in terms of order dimension. Brightwell and Trotter proved that the dimension of the vertex-edge-face poset $\Pvef{M}$ of a planar map $M$ is at most four. In this paper we investigate cases where…