Related papers: Algebraic flow theory of infinite graphs
Let $\Gamma_G$ denote a graph associated with a group $G$. A compelling question about finite groups asks whether or not a finite group $H$ must be nilpotent provided $\Gamma_H$ is isomorphic to $\Gamma_G$ for a finite nilpotent group $G$.…
A hyperbolic algebraic curve is a bounded subset of an algebraic set. We study the function theory and functional analytic aspects of these sets. We show that their function theory can be described by finite codimensional subalgebras of the…
The one-way measurement model is a framework for universal quantum computation, in which algorithms are partially described by a graph G of entanglement relations on a collection of qubits. A sufficient condition for an algorithm to perform…
For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…
We develop a unified theory of Eulerian spaces by combining the combinatorial theory of infinite, locally finite Eulerian graphs as introduced by Diestel and K\"uhn with the topological theory of Eulerian continua defined as irreducible…
We define a new correspondence for pairs $(\mathbb{F},H)$ formed by a flag manifold $\mathbb{F}$ together with an $H$-flux on $\mathbb{F}$. Given its role within our correspondence, infinitesimal $T$-duality may be viewed as a source of…
We study the geodesics problem in Heisenberg group H (case SR and riemannian). The sheaf of infinitesimal automorphisms of the (2n,2n+1) distribution D over H is an infinite, transitive Lie algebra sheaf.
An (r,alpha)-bounded excess flow ((r,alpha)-flow) in an orientation of a graph G=(V,E) is an assignment of a real "flow value" between 1 and r-1 to every edge. Rather than 0 as in an actual flow, some flow excess, which does not exceed…
Karo\'nski, {\L}uczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from $\{1,2,3\}$ in such a way that the endvertices of each edge have different sums of incident…
Given a simple vertex algebra A and a reductive group G of automorphisms of A, the invariant subalgebra A^G is strongly finitely generated in most examples where its structure is known. This phenomenon is subtle, and is generally not true…
Finite-density calculations in lattice field theory are typically plagued by sign problems. A promising way to ameliorate this issue is the holomorphic flow equations that deform the manifold of integration for the path integral to…
In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…
We study the maximum flow problem in directed H-minor-free graphs where H can be drawn in the plane with one crossing. If a structural decomposition of the graph as a clique-sum of planar graphs and graphs of constant complexity is given,…
The notion of a derived A-infinity algebra, considered by Sagave, is a generalization of the classical notion of A-infinity algebra, relevant to the case where one works over a commutative ring rather than a field. We initiate a study of…
The asymptotic study of percolation on finite transitive graphs is considered. Several questions and very few answers regarding percolation on finite graphs are presented.
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow between them along the shortest path. Each edge gets some…
We study the flow spectrum ${\cal S}(G)$ and the integer flow spectrum $\overline{{\cal S}}(G)$ of signed $(2t+1)$-regular graphs. We show that if $r \in {\cal S}(G)$, then $r = 2+\frac{1}{t}$ or $r \geq 2 + \frac{2}{2t-1}$. Furthermore, $2…
We prove that Menger's theorem is valid for infinite graphs, in the following strong form: let $A$ and $B$ be two sets of vertices in a possibly infinite digraph. Then there exist a set $\cp$ of disjoint $A$-$B$ paths, and a set $S$ of…
A vector calculus approach for the determination of advected invariants is presented for inviscid fluid flow. This approach describes invariants by means of Lie dragging of scalars, vectors, and skew-tensors with respect to the fluid…
Let $\Gamma$ be the fundamental group of a finite connected graph $\mathcal G$. Let $\mathfrak M$ be an abelian group. A {\it distribution} on the boundary $\partial\Delta$ of the universal covering tree $\Delta$ is an $\mathfrak M$-valued…