Related papers: Realizing the $s$-permutahedron via flow polytopes
In 2010 Santos described the construction of a counterexample to the Hirsch conjecture, and in 2012 Santos and Weibel provided the coordinates for the 40 facets of a 20-dimensional counterexample. In this paper we explore technical details…
We discuss walking behavior in gauge theories and weak first-order phase transitions in statistical physics. Despite appearing in very different systems (QCD below the conformal window, the Potts model, deconfined criticality) these two…
This paper is a study of the interaction between the combinatorics of boundaries of convex polytopes in arbitrary dimension and their metric geometry. Let S be the boundary of a convex polytope of dimension d+1, or more generally let S be a…
The leafwise cohomology of the weak stable foliation of the geodesic flows is very important in the study of the space of actions whose orbit foliation is the weak stable foliation of geodesic flows.The dimension one cohomology was computed…
In this paper, we study the (complex) geometry of the set $S$ of the square roots of $-1$ in a real associative algebra $A$, showing that $S$ carries a natural complex structure, given by an embedding into the Grassmannian of…
We review recent progress in understanding the different spatial broken symmetries that occur in the normal states of the family of charge-transfer solids (CTS) that exhibit superconductivity (SC), and discuss how this knowledge gives…
By considering the parity of the degrees and levels of nodes in increasing trees, a new combinatorial interpretation for the coefficients of the Taylor expansions of the Jacobi elliptic functions is found. As one application of this new…
Given any polytope $P$ and any generic linear functional ${\bf c} $, one obtains a directed graph $G(P,{\bf c})$ from the 1-skeleton of $P$ by orienting each edge $e(u,v)$ from $u$ to $v$ for ${\bf c} (u) < {\bf c} ( v)$. For $P$ a simple…
We present a unifying framework in which both the $\nu$-Tamari lattice, introduced by Pr\'eville-Ratelle and Viennot, and principal order ideals in Young's lattice indexed by lattice paths $\nu$, are realized as the dual graphs of two…
This is the third of a series of four papers in which we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at…
Weak coalgebra-Galois extensions are studied. A notion of an invertible weak entwining structure is introduced. It is proven that, within an invertible weak entwining structure, the surjectivity of the canonical map implies bijectivity…
We study the convergence analysis of a Picard-S iteration method for a particular class of weak-contraction mappings. Furthermore, we prove a data dependence result for fixed point of the class of weak-contraction mappings with the help of…
We initiate in this article the study of weakly exact structures, a generalization of Quillen exact structures. We introduce weak counterparts of one-sided exact structures and show that a left and a right weakly exact structure generate a…
We introduce and study a new topology on trees, that we call the countably coarse wedge topology. Such a topology is strictly finer than the coarse wedge topology and it turns every chain complete, rooted tree into a Fr\'echet--Urysohn,…
The main goal of this paper is proving the fixed point theorem for finite groups acting on weakly systolic complexes. As corollaries we obtain results concerning classifying spaces for the family of finite subgroups of weakly systolic…
We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…
In this paper, we show that given a weakly dicomplemented lattice (WDL) $\mathcal{L}=(L; \vee, \wedge, ^{\Delta}, ^{\nabla}, 0, 1)$, $^{\Delta}$ induces a structure of a dual weakly complemented lattice in the lattice $(F(L), \subseteq)$ of…
We consider the polyhedral properties of two spanning tree problems with additional constraints. In the first problem, it is required to find a tree with a minimum sum of edge weights among all spanning trees with the number of leaves less…
We investigate the rich combinatorial structure of premodel structures on finite lattices whose weak equivalences are closed under composition. We prove that there is a natural refinement of the inclusion order of weak factorization systems…
An associahedron is a polytope whose vertices correspond to triangulations of a convex polygon and whose edges correspond to flips between them. Using labeled polygons, C. Hohlweg and C. Lange constructed various realizations of the…