Related papers: Flow-continuous mappings -- influence of the group
We consider cell colorings of drawings of graphs in the plane. Given a multi-graph $G$ together with a drawing $\Gamma(G)$ in the plane with only finitely many crossings, we define a cell $k$-coloring of $\Gamma(G)$ to be a coloring of the…
The Gamma-Theta Conjecture states that if the domination number of a graph is equal to its eternal domination number, then it is also equal to its clique covering number. This conjecture is known to be true for several graph classes, such…
We consider random labelings of finite graphs conditioned on a small fixed number of peaks. We introduce a continuum framework where a combinatorial graph is associated with a metric graph and edges are identified with intervals. Next we…
In this paper we study the dynamics of Bernoulli flows and their subflows over general countable groups from the symbolic and topological perspectives. We study free subflows (subflows in which every point has trivial stabilizer), minimal…
We use a version of the Trotter-Kato approximation theorem for strongly continuous semigroups in order to study flows on growing networks. For that reason we use the abstract notion of direct limits in the sense of category theory.
We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…
We study the vector spaces and integer lattices of cuts and flows associated with an arbitrary finite CW complex, and their relationships to group invariants including the critical group of a complex. Our results extend to higher dimension…
For each of the 14 classes of edge-transitive maps described by Graver and Watkins, necessary and sufficient conditions are given for a group to be the automorphism group of a map, or of an orientable map without boundary, in that class.…
We study discrete, cocompact, isometric actions of groups on Hadamard spaces, and the induced actions on ideal boundaries. For a class of groups generalizing fundamental groups of three-dimensional graph manifolds, we find a set of…
Bouchet conjectured in 1983 that each signed graph that admits a nowhere-zero flow has a nowhere-zero 6-flow. We prove that the conjecture is true for all signed series-parallel graphs. Unlike the unsigned case, the restriction to…
A nowhere-zero $k$-flow on a graph $\Gamma$ is a mapping from the edges of $\Gamma$ to the set $\{\pm1, \pm2, ..., \pm(k-1)\} \subset \bbZ$ such that, in any fixed orientation of $\Gamma$, at each node the sum of the labels over the edges…
A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…
We initiate a study of E-semigroups over convex cones. We prove a structure theorem for E-semigroups which leave the algebra of compact operators invariant. Then we study in detail the CCR flows, E$_0$semigroups constructed from isometric…
The multiplier representation of the generalized symmetry group of a quasiperiodic flow on the n-torus defines, for each subgroup of the multiplier group of the flow, a group invariant of the smooth conjugacy class of that flow. This group…
We study some percolation problems on the complete graph over $\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the…
Emergence of dominating cliques in Erd\"os-R\'enyi random graph model ${\bbbg(n,p)}$ is investigated in this paper. It is shown this phenomenon possesses a phase transition. Namely, we have argued that, given a constant probability $p$, an…
This paper gives a topological characterization of Hamiltonian flows with finitely many singular points on compact surfaces, using the concept of ``demi-caract\'eristique'' in the sense of Poincar\'e. Furthermore, we describe the…
Generalizing a construction of A. Weil, we introduce a topological invariant for flows on compact, connected, finite dimensional, abelian, topological groups. We calculate this invariant for some examples and compare the invariant with…
Mapping network flows provides insight into the organization of networks, but even though many real-networks are bipartite, no method for mapping flows takes advantage of the bipartite structure. What do we miss by discarding this…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…