Related papers: Diagram automorphisms and Rank-Level duality

Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…

We prove a rank-two potential automorphy theorem for mod $l$ representations satisfying an ordinary condition. Combined with an ordinary automorphy lifting theorem, we prove a rank-two, $p \ne l$ case of local-global compatibility for…

We introduce the concept of alternate-edge-colourings for maps, and study highly symmetric examples of such maps. Edge-biregular maps of type $(k,l)$ occur as smooth normal quotients of a particular index two subgroup of $T_{k,l}$, the full…

Let $X$ be a compact Riemann surface. A quadratic pair on $X$ consists of a holomorphic vector bundle with a quadratic form which takes values in fixed line bundle. We show that the moduli spaces of quadratic pairs of rank 2 are connected…

S-dualities in scale invariant N=2 supersymmetric field theories with product gauge groups are derived by embedding those theories in asymptotically free theories with higher rank gauge groups. S-duality transformations on the couplings of…

The classification of one parameter local Coulomb branch solution of theories with eight supercharges is given by assuming that it is given by a genus $g$ fiberation of Riemann surfaces. The crucial point is the fact that certain conjugacy…

We recall and define various kinds of supersingular $\ell$-isogeny graphs and precise graph isomorphism with a corresponding quaternion $\ell$-ideal graph. In particular, we introduce the notion of double-orientations on supersingular…

Symplectic resolutions are an exciting new frontier of research in representation theory. One of the most fascinating aspects of this study is symplectic duality: the observation that these resolutions come in pairs with matching…

The principal filtration of the infinite-dimensional odd Contact Lie superalgebra over a field of characteristic $p>2$ is proved to be invariant under the automorphism group by investigating ad-nilpotent elements and determining certain…

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

We show how to obtain the dual of any lattice model with inhomogeneous local interactions based on an arbitrary Abelian group in any dimension and on lattices with arbitrary topology. It is shown that in general the dual theory contains…

Toral automorphisms are widely used (discrete) dynamical systems, the perhaps most prominent example (in 2D) being Arnold's cat map. Given such an automorphism M, its symmetries (i.e. all automorphisms that commute with M) and reversing…

The paper concerns the automorphism groups of Cayley graphs over cyclic groups which have a rational spectrum (rational circulant graphs for short). With the aid of the techniques of Schur rings it is shown that the problem is equivalent to…

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…

We define a period pairing for flat, irregular singular, rank one connections, satisfying a technical condition regarding its stationary set, on complex surfaces between de Rham cohomology of the connection and a modified singular homology,…

An interesting fact is that most of the known connected $2$-arc-transitive nonnormal Cayley graphs of small valency on finite simple groups are $(\mathrm{A}_{n+1},2)$-arc-transitive Cayley graphs on $\mathrm{A}_n$. This motivates the study…

In this paper, we investigate the problem of generating the spanning trees of a graph $G$ up to the automorphisms or "symmetries" of $G$. After introducing and surveying this problem for general input graphs, we present algorithms that…

We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.

We use 4-valent planar graphs and singular cobordisms (called foams) to construct an integral doubly-graded cohomology for tangles, and in particular for links, whose graded Euler characteristic yields the sl(n) link polynomial (for n > 3).

Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices…