Related papers: Maps between higher Bruhat orders and higher Stash…

Given a hypersurface coamoeba of a Laurent polynomial f, it is an open problem to describe the structure of its set of connected complement components. In this paper we approach this problem by introducing the lopsided coamoeba. We show…

A paired $k$-to-$k$ disjoint path cover of a graph $G$ is a collection of pairwise disjoint path subgraphs $P_1,P_2,\dotsc,P_k$ such that each $P_i$ has prescribed vertices $s_i$ and $t_i$ as endpoints and the union of $P_1,P_2,\dotsc,P_k$…

Given a planar graph $G$ and a partition of the neighbors of each vertex $v$ in four sets $UR(v)$, $UL(v)$, $DL(v)$, and $DR(v)$, the problem Windrose Planarity asks to decide whether $G$ admits a windrose-planar drawing, that is, a planar…

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…

Given an n-tuple {b_1, ..., b_n} of self-adjoint operators in a finite von Neumann algebra M and a faithful, normal tracial state tau on M, we define a map Psi from M to R^{n+1} by Psi(a) = (tau(a), tau(b_1a), ..., tau(b_na)). The image of…

A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets play a central role in the (3+1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have enumerated…

In the area of forbidden subposet problems we look for the largest possible size $La(n,P)$ of a family $\mathcal{F}\subseteq 2^{[n]}$ that does not contain a forbidden inclusion pattern described by $P$. The main conjecture of the area…

In arXiv:1905.07734 we presented a construction that is an analogue of Pontryagin's for proper maps in stable dimensions. This gives a bijection between the cobordism set of framed embedded compact submanifolds in $W\times\mathbb{R}^n$ for…

A family of subsets $\mathcal{F}$ is intersecting if $A \cap B \neq \emptyset$ for any $A, B \in \mathcal{F}$. In this paper, we show that for given integers $k > d \ge 2$ and $n \ge 2k+2d-3$, and any intersecting family $\mathcal{F}$ of…

We give an explicit description of the terms and differentials of the Tate resolution of sheaves arising from Segre embeddings of $\P^a\times\P^b$. We prove that the maps in this Tate resolution are either coming from Sylvester-type maps,…

A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets are the subject of the (3+1)-free conjecture of Stanley and Stembridge. Recently, Lewis and Zhang have…

We study upward pointset embeddings (UPSEs) of planar $st$-graphs. Let $G$ be a planar $st$-graph and let $S \subset \mathbb{R}^2$ be a pointset with $|S|= |V(G)|$. An UPSE of $G$ on $S$ is an upward planar straight-line drawing of $G$ that…

An N-parameter Brownian sheet in R^d maps a non-random compact set F in R^N_+ to the random compact set B(F) in \R^d. We prove two results on the image-set B(F): (1) It has positive d-dimensional Lebesgue measure if and only if F has…

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

We provide a combinatorial interpretation of the Kazhdan--Lusztig polynomial of the matroid arising from the braid arrangement of type $\mathrm{A}_{n-1}$, which gives an interpretation of the intersection cohomology Betti numbers of the…

A half-square of a bipartite graph $B=(X,Y,E_B)$ has one color class of $B$ as vertex set, say $X$; two vertices are adjacent whenever they have a common neighbor in $Y$. If $G=(V,E_G)$ is the half-square of a planar bipartite graph…

Joret, Micek, Milans, Trotter, Walczak, and Wang recently asked if there exists a constant $d$ such that if $P$ is a poset with cover graph of $P$ of pathwidth at most $2$, then $\dim(P)\leq d$. We answer this question in the affirmative by…

We investigate the problem of drawing two posets of the same ground set so that one is drawn from left to right and the other one is drawn from the bottom up. The input to this problem is a directed graph $G = (V, E)$ and two sets $X, Y$…

The connected components of $\mathcal{M}_{0,n}(\mathbb{R})$ are in bijection with the $(n-1)!/2$ dihedral orderings of $[n]$. They are all isomorphic. We construct monomial maps between them, and use these maps to prove a conjecture of…

We develop combinatorics of parabolic double cosets in finite Coxeter groups as a follow-up of recent articles by Billey-Konvalinka-Petersen-Slofstra-Tenner and Petersen. (1) We construct a double coset system as a generalization of a…