Weighted Modulo Orientations of Graphs

This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte\u27s 5-Flow Conjecture (1954) states that every bridgeless graph admits a nowhere-zero 5-flow, and Tutte\u27s 3-Flow Conjecture (1972) states that every 4-edge-connected graph admits a nowhere-zero 3-flow. Extending Tutte\u27s flows conjectures, Jaeger\u27s Circular Flow Conjecture (1981) says every 4k-edge-connected graph admits a modulo (2k+1)-orientation, that is, an orientation such that the indegree is congruent to outdegree modulo (2k+1) at every vertex. Note that the k=1 case of Circular Flow Conjecture coincides with the 3-Flow Conjecture, and the case of k=2 implies the 5-Flow Conjecture. This work is devoted to providing some partial results on these problems. In Chapter 2, we study the problem of modulo 5-orientation for given multigraphic degree sequences. We prove that a multigraphic degree sequence d=(d1,..., dn) has a realization G with a modulo 5-orientation if and only if di≤1,3 for each i. In addition, we show that every multigraphic sequence d=(d1,..., dn) with min{1≤i≤n}di≥9 has a 9-edge-connected realization that admits a modulo 5-orientation for every possible boundary function. Jaeger conjectured that every 9-edge-connected multigraph admits a modulo 5-orientation, whose truth would imply Tutte\u27s 5-Flow Conjecture. Consequently, this supports the conjecture of Jaeger. In Chapter 3, we show that there are essentially finite many exceptions for graphs with bounded matching numbers not admitting any modulo (2k+1)-orientations for any positive integers t. We additionally characterize all infinite many graphs with bounded matching numbers but without a nowhere-zero 3-flow. This partially supports Jaeger\u27s Circular Flow Conjecture and Tutte\u27s 3-Flow Conjecture. In 2018, Esperet, De Verclos, Le and Thomass introduced the problem of weighted modulo orientations of graphs and indicated that this problem is closely related to modulo orientations of graphs, including Tutte\u27s 3-Flow Conjecture. In Chapter 4 and Chapter 5, utilizing properties of additive bases and contractible configurations, we reduced the Esperet et al\u27s edge-connectivity lower bound for some (signed) graphs families including planar graphs, complete graphs, chordal graphs, series-parallel graphs and bipartite graphs, indicating that much lower edge-connectivity bound still guarantees the existence of such orientations for those graph families. In Chapter 6, we show that the assertion of Jaeger\u27s Circular Flow Conjecture with k=2 holds asymptotically almost surely for random 9-regular graphs

Classical 6j-symbols and the tetrahedron

A classical 6j-symbol is a real number which can be associated to a labelling of the six edges of a tetrahedron by irreducible representations of SU(2). This abstract association is traditionally used simply to express the symmetry of the 6j-symbol, which is a purely algebraic object; however, it has a deeper geometric significance. Ponzano and Regge, expanding on work of Wigner, gave a striking (but unproved) asymptotic formula relating the value of the 6j-symbol, when the dimensions of the representations are large, to the volume of an honest Euclidean tetrahedron whose edge lengths are these dimensions. The goal of this paper is to prove and explain this formula by using geometric quantization. A surprising spin-off is that a generic Euclidean tetrahedron gives rise to a family of twelve scissors-congruent but non-congruent tetrahedra.Comment: 46 pages. Published copy, also available at http://www.maths.warwick.ac.uk/gt/GTVol3/paper2.abs.htm

Periodic Points in Shifts of Finite Type Over Groups with Connections to Growth

We develop several tools and techniques for constructing or proving the non-existence of weakly and strongly aperiodic shifts of finite type on groups. Additionally, inspired by the classification of all groups of polynomial growth and its implications for SFT-periodicity, we consider the task of surveying groups according to their possible exponential growth rates. We also propose a theory of algebraic shift spaces and pose several questions for future investigations. Our main results are as follows: we prove that weak and strong SFT-periodicity is a commensurability invariant for all finitely generated groups, and we show that the extension of a group with a strongly aperiodic SFT by another such group has a strongly aperiodic SFT as well, provided the kernel is finitely generated. On the topic of exponential growth rates, we provide data for the growth spectrum of the free group on two generators, showing in particular that the growth spectrum is unbounded and has infinitely many limit points