Related papers: Bernoulli Factories for Flow-Based Polytopes
We prove that every 0/1-polytope has a unique Minkowski decomposition into indecomposable polytopes, up to translation of summands. The summands lie in pairwise orthogonal subspaces. Thus, every 0/1-polytope is the Cartesian product of…
We show that a flow (timelike congruence) in any type $B_{1}$ warped product spacetime is uniquely and algorithmically determined by the condition of zero flux. (Though restricted, these spaces include many cases of interest.) The flow is…
Trace monoids and heaps of pieces appear in various contexts in combinatorics. They also constitute a model used in computer science to describe the executions of asynchronous systems. The design of a natural probabilistic layer on top of…
The Chan-Robbins-Yuen polytope can be thought of as the flow polytope of the complete graph with netflow vector $(1, 0, \ldots, 0, -1)$. The normalized volume of the Chan-Robbins-Yuen polytope equals the product of consecutive Catalan…
We distinguish a class of random point processes which we call Giambelli compatible point processes. Our definition was partly inspired by determinantal identities for averages of products and ratios of characteristic polynomials for random…
This paper presents a comprehensive study of the combinatorial $p$-th Calabi flow for both finite and infinite ideal circle patterns. In the finite case, we establish a sharp criterion: the combinatorial $p$-th Calabi flow with $p>1$…
We give a review of results on superpolynomial decay of correlations, and polynomial decay of correlations for nonuniformly expanding semiflows and nonuniformly hyperbolic flows. A self-contained proof is given for semiflows. Results for…
Optical Flow algorithms are of high importance for many applications. Recently, the Flow Field algorithm and its modifications have shown remarkable results, as they have been evaluated with top accuracy on different data sets. In our…
We study polytopes defined by inequalities of the form $\sum_{i\in I} z_{i}\leq 1$ for $I\subseteq [d]$ and nonnegative $z_i$ where the inequalities can be reordered into a matrix inequality involving a column-convex $\{0,1\}$-matrix. These…
We study Bayesian inverse problems with mixed noise, modeled as a combination of additive and multiplicative Gaussian components. While traditional inference methods often assume fixed or known noise characteristics, real-world…
Recently, a combinatorial interpretation of Baldoni and Vergne's generalized Lidskii formula for the volume of a flow polytope was developed by Benedetti et al.. This converts the problem of computing Kostant partition functions into a…
We establish the relationship between volumes of flow polytopes associated to signed graphs and the Kostant partition function. A special case of this relationship, namely, when the graphs are signless, has been studied in detail by Baldoni…
The space of unit flows on a finite acyclic directed graph is a lattice polytope called the flow polytope of the graph. Given a bipartite graph $G$ with minimum degree at least two, we construct two associated acyclic directed graphs: the…
We establish existence of Predictable Forward Performance Processes (PFPPs) in complete markets, which has been previously shown only in the binomial setting. Our market model can be a discrete-time or a continuous-time model, and the…
Adapting Lindstr\"om's well-known construction, we consider a wide class of functions which are generated by flows in a planar acyclic directed graph whose vertices (or edges) take weights in an arbitrary commutative semiring. We give a…
The Baldoni--Vergne volume and Ehrhart polynomial formulas for flow polytopes are significant in at least two ways. On one hand, these formulas are in terms of Kostant partition functions, connecting flow polytopes to this classical vector…
We explain how to adapt the methods of Abouzaid-McLean-Smith to the setting of Hamiltonian Floer theory. We develop a language around equivariant ``$\langle k \rangle$-manifolds'', which are a type of manifold-with-corners that suffices to…
We consider dataflow architecture for two classes of computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. We improve the earlier technique of almost continuous program…
We introduce one-way flows in near algebras and two-way flows in double near algebras with two interrelated multiplications. We establish parametric representations of the one-way and two-way flows in terms of a single element of the…
This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…