English
Related papers

Related papers: Flow modules and nowhere-zero flows

200 papers

It is shown, for a given graph group $G$, that the fixed point subgroup Fix$\,\varphi$ is finitely generated for every endomorphism $\varphi$ of $G$ if and only if $G$ is a free product of free abelian groups. The same conditions hold for…

Group Theory · Mathematics 2013-10-29 Emanuele Rodaro , Pedro V. Silva , Mihalis Sykiotis

Let $\Gamma$ denote a distance-regular graph with diameter $D \ge 3$. Assume $\Gamma$ has classical parameters $(D,b,\alpha,\beta)$ with $b < -1$. Let $X$ denote the vertex set of $\Gamma$ and let $A \in MX$ denote the adjacency matrix of…

Combinatorics · Mathematics 2008-04-11 Stefko Miklavic

Let $\Gamma$ denote a distance-regular graph with classical parameters $(D,b,\alpha,\beta)$ and $b\not=1$, $\alpha=b-1$. The condition on $\alpha$ implies that $\Gamma$ is formally self-dual. For $b=q^2$ we use the adjacency matrix and dual…

Combinatorics · Mathematics 2007-05-23 Tatsuro Ito , Paul Terwilliger

In 1972, Tutte posed the $3$-Flow Conjecture: that all $4$-edge-connected graphs have a nowhere zero $3$-flow. This was extended by Jaeger et al.(1992) to allow vertices to have a prescribed, possibly non-zero difference (modulo $3$)…

Combinatorics · Mathematics 2020-11-03 Jamie V. de Jong , R. Bruce Richter

We revisit the existence of monotonic quantities along renormalization group flows using only the Null Energy Condition and the Ryu-Takayanagi formula for the entanglement entropy of field theories with anti-de Sitter gravity duals. In…

High Energy Physics - Theory · Physics 2024-09-27 Evan Deddo , James T. Liu , Leopoldo A. Pando Zayas , Robert J. Saskowski

We provide a summary of research on disjoint zero-sum subsets in finite Abelian groups, which is a branch of additive group theory and combinatorial number theory. An orthomorphism of a group $\Gamma$ is defined as a bijection $\varphi$…

Combinatorics · Mathematics 2024-10-30 Sylwia Cichacz

The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. We consider the zero divisor graph…

Rings and Algebras · Mathematics 2020-01-07 B. Surendranath Reddy , Rupali S. Jain , N. Laxmikanth

A stochastic flow is constructed on a frame bundle adapted to a Riemannian foliation on a compact manifold. The generator A of the resulting transition semigroup is shown to preserve the basic functions and forms, and there is an…

Differential Geometry · Mathematics 2007-05-23 Alan Mason

The non--commuting graph $\Gamma(G)$ of a non--abelian group $G$ is defined as follows. The vertex set $V(\Gamma(G))$ of $\Gamma(G)$ is $G\setminus Z(G)$ where $Z(G)$ denotes the center of $G$ and two vertices $x$ and $y$ are adjacent if…

Group Theory · Mathematics 2017-09-21 Luis A. Dupont , Daniel G. Mendoza , Armando Sánchez-Nungaray

In this paper we study topological aspects of the dynamics of the foliated horocycle flow on flat projective bundles over hyperbolic surfaces and we derive ergodic consequences. If $\rho : \Gamma \to {\rm PSL}(n+1,\mathbb{R})$ is a…

Dynamical Systems · Mathematics 2024-09-04 Fernando Alcalde Cuesta , Françoise Dal'Bo

A graph $\Gamma$ is said to be a semi-Cayley graph over a group $G$ if it admits $G$ as a semiregular automorphism group with two orbits of equal size. We say that $\Gamma$ is normal if $G$ is a normal subgroup of ${\rm Aut}(\Gamma)$. We…

Combinatorics · Mathematics 2020-04-22 Majid Arezoomand , Mohsen Ghasemi

By studying the weak closure of multidimensional off-diagonal self-joinings we provide a criterion for non-isomorphism of a flow with its inverse, hence the non-reversibility of a flow. This is applied to special flows over rigid…

Dynamical Systems · Mathematics 2014-05-13 K. Fraczek , J. Kulaga , M. Lemanczyk

We prove a decomposition theorem for graphs that do not contain a subdivision of $K_4$ as an induced subgraph where $K_4$ is the complete graph on four vertices. We obtain also a structure theorem for the class $\cal C$ of graphs that…

Combinatorics · Mathematics 2013-09-10 Benjamin Lévêque , Frédéric Maffray , Nicolas Trotignon

We discuss certain recent mathematical advances, mainly due to Perelman, in the theory of Ricci flows and their relevance for renormalization group (RG) flows. We consider nonlinear sigma models with closed target manifolds supporting a…

High Energy Physics - Theory · Physics 2009-11-11 T Oliynyk , V Suneeta , E Woolgar

In 1983, Bouchet proved that every bidirected graph with a nowhere-zero integer-flow has a nowhere-zero 216-flow, and conjectured that 216 could be replaced with 6. This paper shows that for cyclically 5-edge-connected bidirected graphs…

Combinatorics · Mathematics 2023-09-06 Matt DeVos , Kathryn Nurse , Robert Sámal

Suppose that $X$ and $Y$ are surfaces of finite topological type, where $X$ has genus $g\geq 6$ and $Y$ has genus at most $2g-1$; in addition, suppose that $Y$ is not closed if it has genus $2g-1$. Our main result asserts that every…

Geometric Topology · Mathematics 2014-11-11 Javier Aramayona , Juan Souto

Let $\Gamma$ be a simple graph with $n$ vertices. The energy of $\Gamma$, denoted by $\mathcal{E}(\Gamma)$, is defined as the sum of the absolute values of the eigenvalues of $\Gamma$. The graph $\Gamma$ is said to be hyperenergetic if…

Combinatorics · Mathematics 2024-10-16 Mahdi Ebrahimi

Let R be a finite commutative ring with unity, and let G = (V, E) be a simple graph. The zero-divisor graph, denoted by {\Gamma}(R) is a simple graph with vertex set as R, and two vertices x, y \in R are adjacent in {\Gamma}(R) if and only…

Combinatorics · Mathematics 2023-03-14 Rameez Raja , Samir Ahmad Wagay

In this note, we prove -- in dimension at most 4 -- a conjectue of Hao which says that a morphism $f : X \to A$ to a simple abelian variety $A$ is smooth if and only if there is a 1-form pulled back from A without any zeros. We also give a…

Algebraic Geometry · Mathematics 2025-04-29 Benjamin Church

A retract of a graph $\Gamma$ is an induced subgraph $\Psi$ of $\Gamma$ such that there exists a homomorphism from $\Gamma$ to $\Psi$ whose restriction to $\Psi$ is the identity map. A graph is a core if it has no nontrivial retracts. In…

Combinatorics · Mathematics 2016-11-22 Ricky Rotheram , Sanming Zhou