Related papers: Turnpike in infinite dimension

Suppose that $X$ is a smooth, projective threefold over $\mathbb C$ and that $\phi : X \to X$ is an automorphism of positive entropy. We show that one of the following must hold, after replacing $\phi$ by an iterate: i) the canonical class…

It is proven that if $ (X,d) $ is an arbitrary metric space and $ U $ is a path-connected subset of $ X $ with $M:=\{x_i:\ i\in\{1,2,\dots,k\}\}\subset int(U) $, then the property of path-connectedness is also preserved in the resulting set…

Let $G=(V,E)$ be a simple, connected graph. One is often interested in a short path between two vertices $u,v$. We propose a spectral algorithm: construct the function $\phi:V \rightarrow \mathbb{R}_{\geq 0}$ $$ \phi = \arg\min_{f:V…

A function $f:X\to \mathbb R$ defined on a topological space $X$ is called returning if for any point $x\in X$ there exists a positive real number $M_x$ such that for every path-connected subset $C_x\subset X$ containing the point $x$ and…

Consider a branching random walk $(G_u)_{u\in \mathbb T}$ on the general linear group $\textrm{GL}(V)$ of a finite dimensional space $V$, where $\mathbb T$ is the associated genealogical tree with nodes $u$. For any starting point $v \in V…

Suppose $(f,\mathcal{X},\nu)$ is a measure preserving dynamical system and $\phi:\mathcal{X}\to\mathbb{R}$ is an observable with some degree of regularity. We investigate the maximum process $M_n:=\max\{X_1,\ldots,X_n\}$, where…

Let $\Omega$ be a countable infinite product $\Omega^\N$ of copies of the same probability space $\Omega_1$, and let ${\Xi_n}$ be the sequence of the coordinate projection functions from $\Omega$ to $\Omega_1$. Let $\Psi$ be a possibly…

We use a local argument to prove if an $r$-dimensional torus acts isometrically and effectively on a connected $n$-dimensional manifold which has positive $k^\mathrm{th}$-intermediate Ricci curvature at some point, then $r \leq \lfloor…

A turn sequence of left and right turns is realized as a simple rectilinear chain of integral segments whose turns at its bends are the same as the turn sequence. The chain starts from the origin and ends at some point which we call a…

Let $(V(u),\, u\in \mathcal{T})$ be a (supercritical) branching random walk and $(\eta_u,\,u\in \mathcal{T})$ be marks on the vertices of the tree, distributed in an i.i.d.\ fashion. Following Aldous and Bandyopadhyay \cite{AB05}, for each…

Motivated by an old question of Gallai (1966) on the intersection of longest paths in a graph and the well-known conjectures of Lov\'{a}sz (1969) and Thomassen (1978) on the maximum length of paths and cycles in vertex-transitive graphs, we…

We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of…

The dynamical formulation of optimal transport, also known as Benamou-Brenier formulation or Computational Fluid Dynamics formulation, amounts to write the optimal transport problem as the optimization of a convex functional under a PDE…

In this note we asymptotically determine the maximum number of hyperedges possible in an $r$-uniform, connected $n$-vertex hypergraph without a Berge path of length $k$, as $n$ and $k$ tend to infinity. We show that, unlike in the graph…

We consider a directed graph on the 2-dimensional integer lattice, placing a directed edge from vertex $(i_1,i_2)$ to $(j_1,j_2)$, whenever $i_1 \le j_1$, $i_2 \le j_2$, with probability $p$, independently for each such pair of vertices.…

In this paper, we study a class of fully nonlinear contracting curvature flows of closed, uniformly convex hypersurfaces in the Euclidean space $\mathbb R^{n+1}$ with the normal speed $\Phi$ given by $r^\alpha F^\beta$ or $u^\alpha…

We study a specific convex maximization problem in n-dimensional space. The conjectured solution is proved to be a vertex of the polyhedral feasible region, but only a partial proof of local maximality is known. Integer sequences with…

We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…

We show that every $\alpha$-approximate minimum cut in a connected graph is the unique minimum $(S,T)$-terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloor2\alpha\rfloor+1$. This leads to an alternative proof…

We establish that solving an optimal transportation problem in which the source and target densities are defined on manifolds with different dimensions, is equivalent to solving a new nonlocal analog of the Monge-Amp\`ere equation,…