Related papers: Cuts and flows of cell complexes
The cell complex structure is one of the most fundamental structures in topology and combinatorics, the Morse decomposition of a dynamical system analyzes the global gradient behavior, and the Reeb graph of a function is an elementary tool…
Machine-learned normalizing flows can be used in the context of lattice quantum field theory to generate statistically correlated ensembles of lattice gauge fields at different action parameters. This work demonstrates how these…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
We show that the Voronoi cells of the lattice of integer flows of a finite connected graph $G$ in the quadratic vector space of real valued flows have the following very precise combinatorics: the face poset of a Voronoi cell is isomorphic…
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…
We study Witt groups of smooth curves and surfaces over algebraically closed fields of characteristic not two. In both dimensions, we determine both the classical Witt group and Balmer's shifted Witt groups. In the case of curves, the…
We investigate the Hermitian curvature flow (HCF) of left-invariant metrics on complex unimodular Lie groups. We show that in this setting the flow is governed by the Ricci-flow type equation $\partial_tg_{t}=-{\rm Ric}^{1,1} (g_t)$. The…
This master thesis looks at the gradient flow of the length functional on embedded loops. The space of embedded loops is endowed with a scale structure so that the length functional becomes scale smooth. For certain underlying manifolds,…
We describe the cutting sequences associated to geodesic flow on regular polygons, in terms of a combinatorial process called "derivation." This work is an extension of some of the ideas and results in Smillie and Ulcigrai's recent paper,…
Many questions at the core of graph theory can be formulated as questions about certain group-valued flows: examples are the cycle double cover conjecture, Berge-Fulkerson conjecture, and Tutte's 3-flow, 4-flow, and 5-flow conjectures. As…
In this work, we present a brief but insightful overview of the gauge theories, which are defined on $ n $-dimensional lattices by using finite gauge groups, in order to show how they can be interpreted as a Hamiltonian system with…
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…
This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…
We study quasipolynomials enumerating proper colorings, nowhere-zero tensions, and nowhere-zero flows in an arbitrary CW-complex $X$, generalizing the chromatic, tension and flow polynomials of a graph. Our colorings, tensions and flows may…
We define cut-and-join operator in Hurwitz theory for merging of two branching points of arbitrary type. These operators have two alternative descriptions:(i) they have the GL characters as eigenfunctions and the symmetric-group characters…
We develop a general diagrammatic theory of welded graphs, and provide an extension of Satoh's Tube map from welded graphs to ribbon surface-links. As a topological application, we obtain a complete link-homotopy classification of so-called…
Inspired by work of Fr\"oberg (1990), and Eagon and Reiner (1998), we define the \emph{total $k$-cut complex} of a graph $G$ to be the simplicial complex whose facets are the complements of independent sets of size $k$ in $G$. We study the…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
We investigate one-point reduction methods of finite topological spaces. These methods allow one to study homotopy theory of cell complexes by means of elementary moves of their finite models. We also introduce the notion of h-regular…