English
Related papers

Related papers: Realizing the $s$-permutahedron via flow polytopes

200 papers

The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed…

Differential Geometry · Mathematics 2007-05-23 Robert Connelly , Jean-Marc Schlenker

This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…

Logic · Mathematics 2012-11-01 K. Dosen , Z. Petric

The extended weak order on a Coxeter group $W$ is the poset of biclosed sets in its root system. In (Barkley-Speyer 2024), it was shown that when $W=\widetilde{S}_n$ is the affine symmetric group, then the extended weak order is a quotient…

Combinatorics · Mathematics 2025-02-11 Grant T. Barkley

The cyclohedron (Bott-Taubes polytope) arises both as the polyhedral realization of the poset of all cyclic bracketings of a circular word and as an essential part of the Fulton-MacPherson compactification of the configuration space of n…

Combinatorics · Mathematics 2008-11-11 Sinisa Vrecica , Rade Zivaljevic

A class of structures is monadically dependent if one cannot interpret all graphs in colored expansions from the class using a fixed first-order formula. A tree-ordered $\sigma$-structure is the expansion of a $\sigma$-structure with a…

Discrete Mathematics · Computer Science 2026-01-26 Hector Buffière , Yuquan Lin , Jaroslav Nešetřil , Patrice Ossona de Mendez , Sebastian Siebertz

In this paper, we prove that the set of triangulations of a polygon can be equipped with an order to become a lattice. First, we define this order. In [HN99], authors defined the flip operator and then prove some properties of the graph of…

Combinatorics · Mathematics 2018-06-08 Thinh D. Nguyen , Ha Duong Phan

We develop tools for characterizing vertices of fiber products of polytopes and apply them to simplicial distribution polytopes, a class of probability polytopes arising in quantum foundations and quantum information. In the theory of…

Combinatorics · Mathematics 2026-03-23 Aziz Kharoof , Cihan Okay

This paper extends some results on the S-Lemma proposed by Yakubovich and uses the improved results to investigate the asymptotic stability of a class of switched nonlinear systems. Firstly, the strict S-Lemma is extended from quadratic…

Optimization and Control · Mathematics 2014-03-06 Kuize Zhang , Lijun Zhang , Fuchun Sun

The reduced expressions for a given element $w$ of a Coxeter group $(W, S)$ can be regarded as the vertices of a directed graph $\mathcal{R}(w)$; its arcs correspond to the braid moves. Specifically, an arc goes from a reduced expression…

Combinatorics · Mathematics 2026-04-14 Darij Grinberg , Alexander Postnikov

We define a family of convex polytopes called constrainahedra, which index collisions of horizontal and vertical lines. Our construction proceeds by first defining a poset $C(m,n)$ of good rectangular preorders, then proving that $C(m,n)$…

Combinatorics · Mathematics 2022-09-01 Nathaniel Bottman , Daria Poliakova

We propose a procedure to clarify part of the physical sector in the five dimensional bubble geometries based on ideas similar to the split attractor flow conjecture proposed by Denef. This procedure involves building some simple tree-like…

High Energy Physics - Theory · Physics 2010-12-01 Chih-Wei Wang

In the context of spatial logics and spatial model checking for polyhedral models -- mathematical basis for visualisations in continuous space -- we propose a weakening of simplicial bisimilarity. We additionally propose a corresponding…

Logic in Computer Science · Computer Science 2024-04-19 Nick Bezhanishvili , Vincenzo Ciancia , David Gabelaia , Mamuka Jibladze , Diego Latella , Mieke Massink , Erik P. de Vink

The modified Camassa-Holm (mCH) equation is a bi-Hamiltonian system possessing $N$-peakon weak solutions, for all $N\geq 1$, in the setting of an integral formulation which is used in analysis for studying local well-posedness, global…

Exactly Solvable and Integrable Systems · Physics 2020-01-01 Stephen C. Anco , Daniel Kraus

Mitsumatsu constructed leafwise symplectic structures of certain codimension one foliations of the 5-sphere. This inspired the present author to improve his result on convergence of contact structure to foliation. We describe convergence of…

Geometric Topology · Mathematics 2017-07-17 Atsuhide Mori

Following an old result of Marcus and Schwarz we argue that in the heterotic string theory compactified on a seven dimensional torus, the target space duality group O(7,23;Z) and the strong-weak coupling duality transformations combine into…

High Energy Physics - Theory · Physics 2009-09-15 Ashoke Sen

We introduce a new broadly unifying family of combinatorial objects, which we call permutation flows, associated to an acyclic directed graph $G$ together with a framing $F$. This new family is combinatorially rich and contains as special…

Combinatorics · Mathematics 2025-12-04 Rafael S. González D'León , Christopher R. H. Hanusa , Martha Yip

Stochastic symmetries and related invariance properties of finite dimensional SDEs driven by general cadlag semimartingales taking values in Lie groups are defined and investigated. The considered set of SDEs, first introduced by S. Cohen,…

Probability · Mathematics 2020-08-04 Sergio Albeverio , Francesco C. De Vecchi , Paola Morando , Stefania Ugolini

There is a conjecture in the literature that indicates the tree-level S-matrix elements of graviton become symmetric under the $SL(2,Z)$ transformation after including the loops and the nonperturbative effects. Using the Ward identity…

High Energy Physics - Theory · Physics 2013-05-29 Mohammad R. Garousi

Graphons are analytic objects representing limits of convergent sequences of graphs. Lov\'asz and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determined by finitely many graph densities, has a simple…

Combinatorics · Mathematics 2016-08-29 Jacob W. Cooper , Tomas Kaiser , Daniel Kral , Jonathan A. Noel

We study linear orderings expanded by functions for successor and predecessor. The successor and predecessor on linear orderings capture the relatively intrinsically computably enumerable information about orderings in much the same way…

‹ Prev 1 4 5 6 7 8 10 Next ›