Related papers: Cuts and flows of cell complexes
We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…
The multi-commodity flow-cut gap is a fundamental parameter that affects the performance of several divide \& conquer algorithms, and has been extensively studied for various classes of undirected graphs. It has been shown by Linial, London…
We introduce a new geometric flow called the chord shortening flow which is the negative gradient flow for the length functional on the space of chords with end points lying on a fixed submanifold in Euclidean space. As an application, we…
We study the problem of computing the homology of the configuration spaces of a finite cell complex $X$. We proceed by viewing $X$, together with its subdivisions, as a subdivisional space--a kind of diagram object in a category of cell…
This survey/expository article covers a variety of topics related to the "topology at infinity" of noncompact manifolds and complexes. In manifold topology and geometric group theory, the most important noncompact spaces are often…
Given CW complexes X and Y, let map(X,Y) denote the space of continuous functions from X to Y with the compact open topology. The space map(X,Y) need not have the homotopy type of a CW complex. Here the results of an extensive investigation…
We consider high dimensional variants of the maximum flow and minimum cut problems in the setting of simplicial complexes and provide both algorithmic and hardness results. By viewing flows and cuts topologically in terms of the simplicial…
We study quantum automorphism group of vertex-transitive graphs using intertwinner spaces of the magic unitary matrix associated to this quantum subgroups of $S_n^+$. We also give some applications to quantum symmetries of circulant graphs…
We study systematically cross sections of probability preserving actions of unimodular groups and their associated transverse measures, and introduce the invariant \emph{intersection covolume} to quantify their periodicity. Our main…
Cut-diagrams are diagrammatic objects, defined in dimensions 1 and 2, that generalize links in 3-space and surface-links in 4-space; in dimension 1, this coincides with the theory of welded links. Using cut-diagrams, we introduce an…
We study time-changes of unipotent flows on finite volume quotients of semisimple linear groups, generalising previous work by Ratner on time-changes of horocycle flows. Any measurable isomorphism between time-changes of unipotent flows…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We investigate a novel diagrammatic approach to examining strict actions of a Coxeter group or a braid group on a category. This diagrammatic language, which was developed in a series of papers by Elias, Khovanov and Williamson, provides…
In this paper we present the Ricci curvature on cell-complexes and show the Gauss-Bonnnet type theorem on graphs and 2-complex that decomposes closed surface. The defferential forms on a cell complex is defined as linear maps on chain…
We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different…
The study of subshifts on groups different from $\mathbb{Z}$, such as $\mathbb{Z}^d$, $d\geq 2$, has been a subject of intense research in recent years. These investigations have unveiled aremarkable connection between dynamics and…
These notes loosely follow an introductory course on graph complexes, held at Humboldt-Universit\"at zu Berlin in summer 23. Instead of simply typing up my lecture notes I decided to give here an overview over (parts of) the topic (lecture…
Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of…
We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. We obtain counterexamples to…
Let $H: \mathbb{R}^4 \to \mathbb{R}$ be any smooth function. This article introduces some arguments for extracting dynamical information about the Hamiltonian flow of $H$ from high-dimensional families of closed holomorphic curves. We work…