Cluster capacity functionals and isomorphism theorems for Gaussian free fields

We investigate level sets of the Gaussian free field on continuous transient metric graphs $$\widetilde{{\mathcal {G}}}$$ G ~ and study the capacity of its level set clusters. We prove, without any further assumption on the base graph $${\mathcal {G}}$$ G , that the capacity of sign clusters on $$\widetilde{{\mathcal {G}}}$$ G ~ is finite almost surely. This leads to a new and effective criterion to determine whether the sign clusters of the free field on $$\widetilde{{\mathcal {G}}}$$ G ~ are bounded or not. It also elucidates why the critical parameter for percolation of level sets on $$\widetilde{{\mathcal {G}}}$$ G ~ vanishes in most instances in the massless case and establishes the continuity of this phase transition in a wide range of cases, including all vertex-transitive graphs. When the sign clusters on $$\widetilde{{\mathcal {G}}}$$ G ~ do not percolate, we further determine by means of isomorphism theory the exact law of the capacity of compact clusters at any height. Specifically, we derive this law from an extension of Sznitman’s refinement of Lupu’s recent isomorphism theorem relating the free field and random interlacements, proved along the way, and which holds under the sole assumption that sign clusters on $$\widetilde{{\mathcal {G}}}$$ G ~ are bounded. Finally, we show that the law of the cluster capacity functionals obtained in this way actually characterizes the isomorphism theorem, i.e. the two are equivalent.

On valency problems of Saxl graphs

Let 𝐺 be a permutation group on a set Ω, and recall that a base for 𝐺 is a subset of Ω such that its pointwise stabiliser is trivial. In a recent paper, Burness and Giudici introduced the Saxl graph of 𝐺, denoted Σ ⁢ ( G ) \Sigma(G) , with vertex set Ω and two vertices adjacent if and only if they form a base for 𝐺. If 𝐺 is transitive, then Σ ⁢ ( G ) \Sigma(G) is vertex-transitive, and it is natural to consider its valency (which we refer to as the valency of 𝐺). In this paper, we present a general method for computing the valency of any finite transitive group, and we use it to calculate the exact valency of every primitive group with stabiliser a Frobenius group with cyclic kernel. As an application, we calculate the valency of every almost simple primitive group with an alternating socle and soluble stabiliser, and we use this to extend results of Burness and Giudici on almost simple primitive groups with prime-power or odd valency.

Presentations for vertex-transitive graphs

We generalise the standard constructions of a Cayley graph in terms of a group presentation by allowing some vertices to obey different relators than others. The resulting notion of presentation allows us to represent every vertex-transitive graph.

Embedding Non-planar Graphs: Storage and Representation

In this paper, we propose a convention for repre-senting non-planar graphs and their least-crossing embeddings in a canonical way. We achieve this by using state-of-the-art tools such as canonical labelling of graphs, Nauty’s Graph6 string and combinatorial representations for planar graphs. To the best of our knowledge, this has not been done before. Besides, we implement the men-tioned procedure in a SageMath language and compute embeddings for certain classes of cubic, vertex-transitive and general graphs. Our main contribution is an extension of one of the graph data sets hosted on MathDataHub, and towards extending the SageMath codebase.

On Borromean links and related structures

The creation of knotted, woven and linked molecular structures is an exciting and growing field in synthetic chemistry. Presented here is a description of an extended family of structures related to the classical `Borromean rings', in which no two rings are directly linked. These structures may serve as templates for the designed synthesis of Borromean polycatenanes. Links of n components in which no two are directly linked are termed `n-Borromean' [Liang & Mislow (1994). J. Math. Chem. 16, 27–35]. In the classic Borromean rings the components are three rings (closed loops). More generally, they may be a finite number of periodic objects such as graphs (nets), or sets of strings related by translations as in periodic chain mail. It has been shown [Chamberland & Herman (2015). Math. Intelligencer, 37, 20–25] that the linking patterns can be described by complete directed graphs (known as tournaments) and those up to 13 vertices that are vertex-transitive are enumerated. In turn, these lead to ring-transitive (isonemal) n-Borromean rings. Optimal piecewise-linear embeddings of such structures are given in their highest-symmetry point groups. In particular, isonemal embeddings with rotoinversion symmetry are described for three, five, six, seven, nine, ten, 11, 13 and 14 rings. Piecewise-linear embeddings are also given of isonemal 1- and 2-periodic polycatenanes (chains and chain mail) in their highest-symmetry setting. Also the linking of n-Borromean sets of interleaved honeycomb nets is described.

On Forbidden Subgraphs of (K2, H)-Sim-(Super)Magic Graphs

A graph G admits an H-covering if every edge of G belongs to a subgraph isomorphic to a given graph H. G is said to be H-magic if there exists a bijection f:V(G)∪E(G)→{1,2,…,|V(G)|+|E(G)|} such that wf(H′)=∑v∈V(H′)f(v)+∑e∈E(H′)f(e) is a constant, for every subgraph H′ isomorphic to H. In particular, G is said to be H-supermagic if f(V(G))={1,2,…,|V(G)|}. When H is isomorphic to a complete graph K2, an H-(super)magic labeling is an edge-(super)magic labeling. Suppose that G admits an F-covering and H-covering for two given graphs F and H. We define G to be (F,H)-sim-(super)magic if there exists a bijection f′ that is simultaneously F-(super)magic and H-(super)magic. In this paper, we consider (K2,H)-sim-(super)magic where H is isomorphic to three classes of graphs with varied symmetry: a cycle which is symmetric (both vertex-transitive and edge-transitive), a star which is edge-transitive but not vertex-transitive, and a path which is neither vertex-transitive nor edge-transitive. We discover forbidden subgraphs for the existence of (K2,H)-sim-(super)magic graphs and classify classes of (K2,H)-sim-(super)magic graphs. We also derive sufficient conditions for edge-(super)magic graphs to be (K2,H)-sim-(super)magic and utilize such conditions to characterize some (K2,H)-sim-(super)magic graphs.

A Note on Super Connectivity of the Bouwer Graph

The Bouwer graph [Formula: see text], proposed in 1970, is defined for every triple [Formula: see text] of integers greater than [Formula: see text] with [Formula: see text]. It has many good properties, such as vertex-transitive and edge-transitive. Conder and Žitnik used a cycle-counting argument to prove that almost all of the Bouwer graphs are half-arc-transitive in 2016. In this paper, by exploring the structure properties of [Formula: see text], we investigate some reliability measures, including super connectivity and super-edge connectivity, and show that the super connectivity and super-edge connectivity of the Bouwer graph are both [Formula: see text] for [Formula: see text], [Formula: see text] and [Formula: see text].