Related papers: A combinatorial property of flows on a cycle
Simple cycles on a digraph form a trace monoid under the rule that two such cycles commute if and only if they are vertex disjoint. This rule describes the spatial configuration of simple cycles on the digraph. Cartier and Foata have showed…
We consider the combinatorial properties of the trace of a random walk on the complete graph and on the random graph $G(n,p)$. In particular, we study the appearance of a fixed subgraph in the trace. We prove that for a subgraph containing…
We introduce 2-partitionable clutters as the simplest case of the class of $k$-partitionable clutters and study some of their combinatorial properties. In particular, we study properties of the rank of the incidence matrix of these clutters…
Circulating currents in windings refer to unwanted electrical currents flowing between the parallel conductors of a winding. These currents arise due to several phenomena such as asymmetries, imperfections in the winding layout, and…
Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another. An instance of the problem consists of a capacitated directed network, in…
Sarkar and Wang have given a combinatorial algorithm for computing Heegaard Floer homology and Plamenevskaya has improved their method to compute Ozsvath-Szabo invariant. In this paper, applying the combinatorial method to stabilizations of…
We prove the Multiplicity One Conjecture for mean curvature flows of surfaces in $\mathbb{R}^3$. Specifically, we show that any blow-up limit of such mean curvature flows has multiplicity one. This has several applications. First, combining…
The maximum multicommodity flow problem is a natural generalization of the maximum flow problem to route multiple distinct flows. Obtaining a $1-\epsilon$ approximation to the multicommodity flow problem on graphs is a well-studied problem.…
Combinatorial Levy processes evolve on general state spaces of countable combinatorial structures. In this setting, the usual Levy process properties of stationary, independent increments are defined in an unconventional way in terms of the…
We consider a generalization of the unsplittable maximum two-commodity flow problem on undirected graphs where each commodity $i\in{1,2}$ can be split into a bounded number $k_i$ of equally-sized chunks that can be routed on different…
The cyclically reduced product of two words $u, v$, denoted $u * v$, is the cyclically reduced form of the concatenation of $u$ by $v$. This product is not associative. Recently S. V. Ivanov has proved that the Andrews-Curtis conjecture can…
We propose a new algorithm to obtain max flow for the multicommodity flow. This algorithm utilizes the max-flow min-cut theorem and the well known labeling algorithm due to Ford and Fulkerson [1]. We proceed as follows: We select one…
We study various combinatorial properties, and the implications between them, for filters generated by infinite-dimensional subspaces of a countable vector space. These properties are analogous to selectivity for ultrafilters on the natural…
We study time-reversal symmetry in dynamical systems with finite phase space, with applications to birational maps reduced over finite fields. For a polynomial automorphism with a single family of reversing symmetries, a universal (i.e.,…
This note provides a detailed proof of the fact that a linear vector field on a vector bundle has a flow by vector bundle isomorphisms. It implies then easily the existence of global solutions to linear non-autonomous ODE's, with a standard…
On a compact manifold of any dimension $d\geq 3$, we show that joint non-integrability of the stable and unstable foliation of a hyperbolic attractor with one-dimensional expanding direction, for a vector field of class $C^2$, implies…
It is proved that all special flows over the rotation by an irrational $\alpha$ with bounded partial quotients and under $f$ which is piecewise absolutely continuous with a non-zero sum of jumps are mildly mixing. Such flows are also shown…
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…
Recently it is proved in arXiv:1906.05493v1 [math.OA] that CCR flows over convex cones are cocycle conjugate if and only if the associated isometric representations are conjugate. We provide a very short, simple and direct proof of that.…
In this paper it is proved that near a compact, invariant, proper subset of a continuous flow on a compact, connected metric space, at least one, out of twenty eight relevant dynamical phenomena, will necessarily occur. This result shows…