Related papers: Triangulations, order polytopes, and generalized s…
Let $S_{g,n}$ be an oriented surface of genus $g$ with $n$ punctures, where $2g-2+n>0$ and $n>0$. Any ideal triangulation of $S_{g,n}$ induces a global parametrization of the Teichm\"uller space $\mathcal{T}_{g,n}$ called the shearing…
The `Weyl symmetric functions' studied here naturally generalize classical symmetric (polynomial) functions, and `Weyl bialternants,' sometimes also called Weyl characters, analogize the Schur functions. For this generalization, the…
The geometry of the dual amplituhedron is generally described in reference to a particular triangulation. A given triangulation manifests only certain aspects of the underlying space while obscuring others, therefore understanding this…
We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of $\delta$-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay…
We describe how to cancel (when this is desirable) all tadpole and more generally all cephalopod Feynman diagrams in generic interacting scalar field theories to all orders in perturbation theory. This cancelation reduces the number of…
We create a framework for studying symmetric chain decompositions of families of finite posets based on the geometry of polytopes. Our framework unifies almost all known results regarding symmetric chain decompositions of the Young posets…
Lattice polytopes which possess the integer decomposition property (IDP for short) turn up in many fields of mathematics. It is known that if the Cayley sum of lattice polytopes possesses IDP, then so does their Minkowski sum. In this…
Partially ordered patterns (POPs) generalize the classical notion of permutation patterns within the framework of pattern avoidance. Building on recent work by Burstein, Han, Kitaev, and Zhang, which introduced the concept of…
A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking…
In this paper, a way of generalizing the tensor renormalization group(TRG) is proposed. Mathematically, the connection between patterns of tensor renormalization group and the concept of truncation sequence in polytope geometry is…
S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…
We give a necessary and sufficient condition for that the support $\tau$-tilting poset of a finite dimensional algebra is isomorphic to the poset of symmetric group with weak order. Moreover we show that there are infinitely many finite…
Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…
We construct a new infinite family of ideal triangulations and H-triangulations for the complements of twist knots, using a method originating from Thurston. These triangulations provide a new upper bound for the Matveev complexity of twist…
A scramble on a connected multigraph is a collection of connected subgraphs that generalizes the notion of a bramble. The maximum order of a scramble, called the scramble number of a graph, was recently developed as a tool for lower…
A catalogue of simplicial hyperplane arrangements was first given by Gr\"unbaum in 1971. These arrangements naturally generalize finite Coxeter arrangements and the weak order through the poset of regions. For simplicial arrangements,…
We develop a combinatorial and order-theoretic framework for shuffles, understood as ordered concatenations of indexed families of sequences that induce total orders on the natural numbers. Motivated by the classical \v{S}arkovski\u{i}…
A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…
We study a certain poset on the free monoid on a countable alphabet. This poset is determined by the fact that its total extensions are precisely the standard term orders. We also investigate the poset classifying degree-compatible standard…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…