Criteria for balance in abelian gain graphs, with applications to piecewise-linear geometry

DOI10.1007/S00454-005-1170-6MaRDI QIDQ2571324zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Thomas Zaslavsky, K. A. Rybnikov

Publication date 1 November 2005

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0210052

zbMATH Keywords

projective geometrycycle space

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: A gain graph is a triple (G,h,H), where G is a connected graph with an arbitrary, but fixed, orientation of edges, H is a group, and h is a homomorphism from the free group on the edges of G to H. A gain graph is called balanced if the h-image of each closed walk on G is the identity. Consider a gain graph with abelian gain group having no odd torsion. If there is a basis of the graph's binary cycle space each of whose members can be lifted to a closed walk whose gain is the identity, then the gain graph is balanced, provided that the graph is finite or the group has no nontrivial infinitely 2-divisible elements. We apply this theorem to deduce a result on the projective geometry of piecewise-linear realizations of cell-decompositions of manifolds.

Recommendations

• Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
• A group representation approach to balance of gain graphs
• scientific article; zbMATH DE number 3351629
• On linear algebra of balance-binomial graphs
• Linear balanceable and subcubic balanceable graphs
• On the balanceability of some graph classes
• On balancedness of some graph constructions
• Balance, partial balance and balanced-type spectra in graph-designs
• ALGEBRAIC STRUCTURES RELATED TO BALANCED FUNCTIONS ON GRAPHS: RESULTS AND OPEN PROBLEMS
• Balance in gain graphs - a spectral analysis

Cited in

(8)

• On the sum of a parallelotope and a zonotope
• Groups of balanced labelings on graphs
• Totally frustrated states in the chromatic theory of gain graphs
• A group representation approach to balance of gain graphs
• Combinatorial characterization of the null spaces of symmetric H-matrices
• An efficient local approach to convexity testing of piecewise-linear hypersurfaces
• Cluster consensus with point group symmetries
• Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

This page was built for publication: Criteria for balance in abelian gain graphs, with applications to piecewise-linear geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571324)