Related papers: On Manin-Schechtman orders related to directed gra…
Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the…
In this paper, we characterize the dynamical orders of minimal Morse components and, partially, of control sets on maximal compact subgroups of a semisimple Lie group as an algebraic order similar to the Bruhat order of the Weyl group. We…
In the present paper, the following convexity principle is proved: any closed convex multifunction, which is metrically regular in a certain uniform sense near a given point, carries small balls centered at that point to convex sets, even…
A well-known theorem of Sperner describes the largest collections of subsets of an $n$-element set none of which contains another set from the collection. Generalising this result, Erd\H{o}s characterised the largest families of subsets of…
Let k be a local field and let A be the two-by-two matrix algebra over k. In our previous work we developed a theory that allows the computation of the set of maximal orders in A containing a given suborder. This set is given as a sub-tree…
A dominating set in a directed graph is a set of vertices $S$ such that all the vertices that do not belong to $S$ have an in-neighbour in $S$. A locating set $S$ is a set of vertices such that all the vertices that do not belong to $S$ are…
Applying a classical theorem of Smith, we show that the poset property of being Gorenstein$^*$ over $\mathbb{Z}_2$ is inherited by the subposet of fixed points under an involutive poset automorphism. As an application, we prove that every…
We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that…
Higher-order connectivity patterns such as small induced sub-graphs called graphlets (network motifs) are vital to understand the important components (modules/functional units) governing the configuration and behavior of complex networks.…
For an integer $n\geq 1$, we display a poset $\Phi_n$ whose maximal chains are in bijection with the $n\times n$ alternating sign matrices. The Hasse diagram $\widehat \Phi_n$ is obtained from the $n$-cube by adding some edges. We show that…
Continuity of the value of the martingale optimal transport problem on the real line w.r.t. its marginals was recently established in Backhoff-Veraguas and Pammer [2] and Wiesel [21]. We present a new perspective of this result using the…
We introduce the notion of a move graph, that is, a directed graph whose vertex set is a $\mathbb Z$-module $\mathbb Z_n^m$, and whose arc set is uniquely determined by the action $M\!:\!\mathbb Z_n^m\to \mathbb Z_n^m$ where $M$ is an…
The purpose of this paper is to establish a correspondence between the higher Bruhat orders of Yu. I. Manin and V. Schechtman, and the cup-$i$ coproducts defining Steenrod squares in cohomology. To any element of the higher Bruhat orders we…
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…
The decomposition of undirected graphs simplifies complex problems by breaking them into solvable subgraphs, following the philosophy of divide and conquer. This paper investigates the relationship between atom decomposition and the maximum…
Reiher, R\"odl, Sales, and Schacht initiated the study of relative Tur\'an densities of ordered graphs and showed that it is more subtle and interesting than the unordered case. For an ordered graph $F$, its relative Tur\'an density,…
Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…
We investigate the poset of skew diagrams ordered by adding or forming the union of skew diagrams. We will show that a skew diagram which has at least n convex corners to the upper left and also to the lower right is larger than the skew…
In this paper we show that every graph of pathwidth less than $k$ that has a path of order $n$ also has an induced path of order at least $\frac{1}{3} n^{1/k}$. This is an exponential improvement and a generalization of the polylogarithmic…