Related papers: High-Dimensional $p$-Normed Flows

Normalizing flows are a powerful tool for building expressive distributions in high dimensions. So far, most of the literature has concentrated on learning flows on Euclidean spaces. Some problems however, such as those involving angles,…

Let $X\in\mathbb{R}^{n}$ or $\mathbb{C}^{n}$. For $\phi:\mathbb{R}^{n}\mapsto\mathbb{R}^{n}$ (respectively, $\phi:\mathbb{C}^{n}\mapsto\mathbb{C}^{n}$) and $t\in\mathbb{R}$ (respectively, $\mathbb{C}$), we put $\phi^{t}=t^{-1}\phi(Xt)$. A…

Real-world data with underlying structure, such as pictures of faces, are hypothesized to lie on a low-dimensional manifold. This manifold hypothesis has motivated state-of-the-art generative algorithms that learn low-dimensional data…

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…

We provide an algorithm which, with high probability, maintains a $(1-\epsilon)$-approximate maximum flow on an undirected graph undergoing $m$-edge additions in amortized $m^{o(1)} \epsilon^{-3}$ time per update. To obtain this result, we…

Generalizations of the Jacobi and Weyl theorems on finite-dimensional linear flows to the case of linear flows on infinite-dimensional tori are presented. Conditions for periodicity, non-wandering, ergodicity and transitivity of…

Let $t_{i,j}$ be the coefficient of $x^iy^j$ in the Tutte polynomial $T(G;x,y)$ of a connected bridgeless and loopless graph $G$ with order $n$ and size $m$. It is trivial that $t_{0,m-n+1}=1$ and $t_{n-1,0}=1$. In this paper, we obtain…

A graph $U$ is an induced universal graph for a family $F$ of graphs if every graph in $F$ is a vertex-induced subgraph of $U$. For the family of all undirected graphs on $n$ vertices Alstrup, Kaplan, Thorup, and Zwick [STOC 2015] give an…

We prove that every 3-edge-connected graph $G$ has a 3-flow $\phi$ with the property that $|\mathop{supp}(\phi)| \ge \frac{5}{6} |E(G)|$. The graph $K_4$ demonstrates that this $\frac{5}{6}$ ratio is best possible; there is an infinite…

To a Toeplitz flow $(X,T)$ we associate an ordered $K^0$-group, denoted $K^0(X,T)$, which is order isomorphic to the $K^0$-group of the associated (non-commutative) $C^\ast$-crossed product $C(X)\rtimes_T \mathbb{Z}$. However, $K^0(X,T)$…

The $T\bar{T}$ deformation of a supersymmetric two-dimensional theory preserves the original supersymmetry. Moreover, in several interesting cases the deformed theory possesses additional non-linearly realized supersymmetries. We show this…

In this paper we characterize non-collapsed limits of Ricci flows. We show that such limits are smooth away from a set of codimension $\geq 4$ in the parabolic sense and that the tangent flows at every point are given by gradient shrinking…

The massless flow between successive minimal models of conformal field theory is related to a flow within the sine-Gordon model when the coefficient of the cosine potential is imaginary. This flow is studied, partly numerically, from three…

We construct a complete invariant for non-wandering surface flows with finitely many singular points but without locally dense orbits. Precisely, we show that a flow $v$ with finitely many singular points on a compact connected surface $S$…

Given a $t$-$(v, k, \lambda)$ design, $\mathcal{D}=(X,\mathcal{B})$, a zero-sum $n$-flow of $\mathcal{D}$ is a map $f : \mathcal{B}\longrightarrow \{\pm1,\ldots, \pm(n-1)\}$ such that for any point $x\in X$, the sum of $f$ over all blocks…

A survey of new geometric flows motivated by string theories is provided. Their settings can range from complex geometry to almost-complex geometry to symplectic geometry. From the PDE viewpoint, many of them can be viewed as intermediate…

In this paper we consider generalized flow problems where there is an $m$-edge $n$-node directed graph $G = (V,E)$ and each edge $e \in E$ has a loss factor $\gamma_e >0$ governing whether the flow is increased or decreased as it crosses…

We introduce a flow that is designed to flow maps $u:\Sigma\to \mathbb{R}^n$ which map the boundary of a general domain surface $\Sigma$ into a given (not necessarily connected) submanifold $N\hookrightarrow \mathbb{R}^n$ towards a free…

We provide evidence that computing the maximum flow value between every pair of nodes in a directed graph on $n$ nodes, $m$ edges,and capacities in the range $[1..n]$, which we call the All-Pairs Max-Flow problem, cannot be solved in time…

We develop an abstract theory of flows of geometric $H$-structures, i.e., flows of tensor fields defining $H$-reductions of the frame bundle, for a closed and connected subgroup $H\subset SO(n)$, on any connected and oriented $n$-manifold…