相关论文: Framing Triangulations for Arbitrary Integer Flow …
We study the strongly connected components of the flow graph associated to a veering triangulation, and show that the infinitesimal components must be of a certain form, which have to do with subsets of the triangulation which we call…
In this paper we develop an approach to conformal geometry of piecewise flat metrics on manifolds. In particular, we formulate the combinatorial Yamabe problem for piecewise flat metrics. In the case of surfaces, we define the combinatorial…
Given a polytope $\mathcal{P}$ in $\mathbb{R}^d$ and a subset $U$ of its vertices, is there a triangulation of $\mathcal{P}$ using $d$-simplices that all contain $U$? We answer this question by proving an equivalent and easy-to-check…
A cosmological polytope is defined for a given Feynman diagram, and its canonical form may be used to compute the contribution of the Feynman diagram to the wavefunction of certain cosmological models. Given a subdivision of a polytope, its…
We show that the dual graph of the triangulation of the flow polytope of the zigzag graph adorned with the length-reverse-length framing is a subgraph of a grid graph. Through M\'esz\'aros, Morales, and Striker's bijection between simplices…
A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…
We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
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…
In this paper, we study the combinatorial Yamabe flow on infinite triangulated surfaces in Euclidean background geometry, aiming for solving discrete Yamabe problem on noncompact surfaces. Under suitable conditions, we establish the…
The objects of study are triangulations of the dilated standard triangle in the plane. Motivated by work on T-curves (Geiselmann et al., 2026), the focus lies on unimodular triangulations with a fixed symmetry axis. Lower and upper bounds…
The flow polytope $\mathcal{F}_{\widetilde{G}}$ is the set of nonnegative unit flows on the graph $\widetilde{G}$. The subdivision algebra of flow polytopes prescribes a way to dissect a flow polytope $\mathcal{F}_{\widetilde{G}}$ into…
Given an acyclic directed graph (DAG), the space of strength one flows is a lattice polytope called the flow polytope of the DAG. If the DAG admits an ample framing, then the flow polytope is Gorenstein and it linearly projects onto a…
Nonlinear monotone transformations are used extensively in normalizing flows to construct invertible triangular mappings from simple distributions to complex ones. In existing literature, monotonicity is usually enforced by restricting…
In this paper, we consider the volume of a special kind of flow polytope. We show that its volume satisfies a certain system of differential equations, and conversely, the solution of the system of differential equations is unique up to a…
Cosmological polytopes of graphs are a geometric tool in physics to study wavefunctions for cosmological models whose Feynman diagram is given by the graph. After their recent introduction by Arkani-Hamed, Benincasa and Postnikov the focus…
Given a finite directed acyclic graph, the space of non-negative unit flows is a lattice polytope called the flow polytope of the graph. We consider the volumes of flow polytopes for directed acyclic graphs on $n+1$ vertices with a fixed…
In this note we present a parameterized class of lower triangular matrices. The components of the eigenvectors grow rapidly and will exceed the representational range of any finite number system. The eigenvalues and the eigenvectors are…
We construct explicit combinatorial Bernoulli factories for the class of \emph{flow-based polytopes}; integral 0/1-polytopes defined by a set of network flow constraints. This generalizes the results of Niazadeh et al. (who constructed an…
We consider AF-flows, i.e., one-parameter automorphism groups of a unital simple C*-algebra which leave invariant the dense union of an increasing sequence of finite-dimensional *-subalgebras, and derive two properties for these; an absence…