Related papers: Bernoulli Factories for Flow-Based Polytopes
We construct the exponential map associated to a nonholonomic system that allows us to define an exact discrete nonholonomic constraint submanifold. We reproduce the continuous nonholonomic flow as a discrete flow on this discrete…
We construct entropy increasing monotone factors in the context of a Bernoulli shift over the free group of rank at least two.
Using the formalism of the Khalatnikov potential, we derive exact general formulae for the entropy flow dS/dy, where y is the rapidity, as a function of temperature for the (1+1) relativistic hydrodynamics of a perfect fluid. We study in…
This thesis presents an overview of the flow equations recently introduced by Wegner. The little known mathematical framework of the flow in the manifold of unitarily equivalent matrices, as discovered in the mathematical literature before…
Given the importance of floating-point~(FP) performance in numerous domains, several new variants of FP and its alternatives have been proposed (e.g., Bfloat16, TensorFloat32, and Posits). These representations do not have correctly rounded…
We describe an effective method for calculating certain infinite sums, generalizations of the classical Bernoulli polynomials. As shown by Edward Witten in his papers on two-dimensional gauge theories, the correlation functions of…
We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…
Generating new molecules is fundamental to advancing critical applications such as drug discovery and material synthesis. Flows can generate molecules effectively by inverting the encoding process, however, existing flow models either…
As a probabilistic modeling technique, the flow-based model has demonstrated remarkable potential in the field of lossless compression \cite{idf,idf++,lbb,ivpf,iflow},. Compared with other deep generative models (eg. Autoregressive, VAEs)…
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…
Recently normalizing flows (NFs) have demonstrated state-of-the-art performance on modeling 3D point clouds while allowing sampling with arbitrary resolution at inference time. However, these flow-based models still require long training…
We show that the analog of Hamilton's Ricci flow in the combinatorial setting produces solutions which converge exponentially fast to Thurston's circle packing on surfaces. As a consequence, a new proof of Thurston's existence of circle…
We introduce the notion of a matched pair of fusion rings and fusion categories, generalizing the one for groups. Using this concept, we define the bicrossed product of fusion rings and fusion categories and we construct exact…
Boltzmann Generators have emerged as a promising machine learning tool for generating samples from equilibrium distributions of molecular systems using Normalizing Flows and importance weighting. Recently, Flow Matching has helped speed up…
In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…
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 study polytopes associated to factorisations of prime powers. These polytopes have explicit descriptions either in terms of their vertices or as intersections of closed halfspaces associated to their facets. We give formulae for their…
We introduce and study a multivariate function that counts nowhere-zero flows on a graph G, in which each edge of G has an individual capacity. We prove that the associated counting function is a piecewise-defined polynomial in these…
We present a new class of particle methods with deformable shapes that converge in the uniform norm without requiring remappings, extended overlapping or vanishing moments for the particles. The crux of the method is to use polynomial…
Minimal flow spaces of dimension 1 are among the most fundamental limit sets in dynamical systems. These invariant sets occur as the typical minimal sets in surface flows, the minimal sets of suspensions of subshifts (for example, in Lorenz…