Related papers: Uncapacitated Flow-based Extended Formulations
Normalizing flows are a promising tool for modeling probability distributions in physical systems. While state-of-the-art flows accurately approximate distributions and energies, applications in physics additionally require smooth energies…
We prove that any mixed-integer linear extended formulation for the matching polytope of the complete graph on $n$ vertices, with a polynomial number of constraints, requires $\Omega(\sqrt{\sfrac{n}{\log n}})$ many integer variables. By…
The compute-and-forward framework permits each receiver in a Gaussian network to directly decode a linear combination of the transmitted messages. The resulting linear combinations can then be employed as an end-to-end communication…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
Polymer solutions exhibit anomalous flow thickening -- marked by an abrupt increase in the macroscopic flow resistance -- above a threshold flow rate in a porous medium, but not in bulk solution. This phenomenon has evaded a mechanistic…
Recent efforts have extended the flow-matching framework to discrete generative modeling. One strand of models directly works with the continuous probabilities instead of discrete tokens, which we colloquially refer to as Continuous-State…
We show that new definitions of the notion of "projection" on which some of the recent "extended formulations" works (such as Kaibel (2011); Fiorini et al. (2011; 2012); Kaibel and Walter (2013); Kaibel and Weltge (2013) for example) have…
We present a novel theoretical framework for understanding the expressive power of normalizing flows. Despite their prevalence in scientific applications, a comprehensive understanding of flows remains elusive due to their restricted…
These lectures on the combinatorics and geometry of 0/1-polytopes are meant as an \emph{introduction} and \emph{invitation}. Rather than heading for an extensive survey on 0/1-polytopes I present some interesting aspects of these objects;…
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
An elliptic Newton flow is a dynamical system that can be interpreted as a continuous version of Newton's iteration method for finding the zeros of an elliptic function f. Previous work focusses on structurally stable flows (i.e., the phase…
The support of a flow $x$ in a network is the subdigraph induced by the arcs $uv$ for which $x(uv)>0$. We discuss a number of results on flows in networks where we put certain restrictions on structure of the support of the flow. Many of…
In this paper, we define a non-iterative transformation method for boundary-layer flows of non-Newtonian fluids past a flat plate. The problem to be solved is an extended Blasius problem depending on a parameter. This method allows us to…
In recent years, open systems with balanced loss and gain, that are invariant under the combined parity and time-reversal ($\mathcal{PT}$) operations, have been studied via asymmetries of their solutions. They represent systems as diverse…
A prominent goal of representation learning research is to achieve representations which are factorized in a useful manner with respect to the ground truth factors of variation. The fields of disentangled and equivariant representation…
A new representation of Quantum Gravity is developed. This formulation is based on an extension of the group of loops. The enlarged group, that we call the Extended Loop Group, behaves locally as an infinite dimensional Lie group. Quantum…
Fluid transport networks are important in many natural settings and engineering applications, from animal cardiovascular and respiratory systems to plant vasculature to plumbing networks and chemical plants. Understanding how network…
We study the well-established problem of finding an optimal routing of unsplittable flows in a graph. While by now there is an extensive body of work targeting the problem on graph classes such as paths and trees, we aim at using the…
We represent an algorithm reducing the $(M+1)$-dimensional nonlinear partial differential equation (PDE) representable in the form of one-dimensional flow $u_t + w_{x_1}(u,u_{x},u_{xx},\dots)=0$, (where $w$ is an arbitrary local function of…
A binarization of a bounded variable $x$ is a linear formulation with variables $x$ and additional binary variables $y_1,\dots, y_k$, so that integrality of $x$ is implied by the integrality of $y_1,\dots, y_k$. A binary extended…