Related papers: Realizing the $s$-permutahedron via flow polytopes
Weak topological phases are usually described in terms of protection by the lattice translation symmetry. Their characterization explicitly relies on periodicity since weak invariants are expressed in terms of the momentum-space torus. We…
We introduce a bi-Hamiltonian hierarchy on the loop-algebra of sl(2) endowed with a suitable Poisson pair. It gives rise to the usual CH hierarchy by means of a bi-Hamiltonian reduction, and its first nontrivial flow provides a 3-component…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
We examine the fluid phase behaviour of the binary mixture of hard superellipses using the scaled particle theory The superellipse is a general two dimensional convex object which can be tuned between circular and rectangular shapes…
Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…
We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
We derive the equations of motion for a planar rigid body of circular shape moving in a 2D perfect fluid with point vortices using symplectic reduction by stages. After formulating the theory as a mechanical system on a configuration space…
The weak-map order on the matroid base polytopes is the partial order defined by inclusion. Lucas proved that the base polytope of no binary matroid includes the base polytope of a connected matroid. A matroid base polytope is said to be…
For each finite Coxeter group $W$ and each standard Coxeter element of $W$, we construct a triangulation of the $W$-permutahedron. For particular realizations of the $W$-permutahedron, we show that this is a regular triangulation induced by…
Let M be a compact oriented even-dimensional manifold. This note constructs a compact symplectic manifold S of the same dimension and a map f from S to M of strictly positive degree. The construction relies on two deep results: the first is…
In 2017, Davis, Nelson, Petersen, and Tenner [Discrete Math. 341 (2018),3249--3270] initiated the combinatorics of pinnacles in permutations. We provide a simple and efficient recursion to compute $p_n(S)$, the number of permutations of…
The purpose of this work is to develop a version of Forman's discrete Morse theory for simplicial complexes, based on internal strong collapses. Classical discrete Morse theory can be viewed as a generalization of Whitehead's collapses,…
Containment problems for polytopes and spectrahedra appear in various applications, such as linear and semidefinite programming, combinatorics, convexity and stability analysis of differential equations. This paper explores the theoretical…
Delsarte-Goethals-Seidel showed that if $X$ is a spherical $t$-design with degree $s$ satisfying $t\geq 2s-2$, $X$ carries the structure of an association scheme. Also Bannai-Bannai showed that the same conclusion holds if $X$ is an…
Weakly constrained double field theory, in the sense of Hull and Zwiebach, captures the subsector of string theory on toroidal backgrounds that includes gravity, $B$-field and dilaton together with all of their massive Kaluza-Klein and…
I present an overview of the research I have conducted for the past ten years in algebraic, bijective, enumerative, and geometric combinatorics. The two main objects I have studied are the permutahedron and the associahedron as well as the…
In a series of four papers 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 least $(\frac12+\alpha)n$…
Closed formulas for tree amplitudes of $n$-particle scatterings of gluon, graviton, and massless scalar particles have been proposed by Cachazo, He, and Yuan. It depends on $(n-3)$ quantities $\s_\a$ which satisfy a set of coupled {\it…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…