Spectral analysis of the affine graph over the finite ring

We apply two methods to the block diagonalization of the adjacency matrix of the Cayley graph defined on the affine group. The affine group will be defined over the finite ring Z/pⁿZ. The method of irreducible representations will allow us to find nontrivial eigenvalue bounds for two different graphs. One of these bounds will result in a family of Ramanujan graphs. The method of covering graphs will be used to block diagonalize the affine graphs using a Galois group of graph automorphisms. In addition, we will demonstrate the method of covering graphs on a generalized version of the graphs of Lubotzky et al. [A. Lubotzky, R. Phillips, P. Sarnak, Ramanujan graphs, Combinatorica 8 (1988) 261-277].     

Coleman maps for modular forms at supersingular primes over Lubin-Tate extensions

Text

Given an elliptic curve with supersingular reduction at an odd prime p, Iovita and Pollack have generalised results of Kobayashi to define even and odd Coleman maps at p over Lubin-Tate extensions given by a formal group of height 1. We generalise this construction to modular forms of higher weights.

Video

For a video summary of this paper, please click here or visit http://www.youtube.com/watch?v=KQpsht0JaME.     

Tetravalent Vertex-Transitive Graphs of Order Twice A Prime Square

A graph is vertex-transitive if its automorphism group acts transitively on vertices of the graph. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, a complete classification is given of tetravalent vertex-transitive non-Cayley graphs of order \(2p^2\) for any prime p.     

Integral Cayley graphs over dihedral groups

In this paper, we give a necessary and sufficient condition for the integrality of Cayley graphs over the dihedral group \(D_n=\langle a,b\mid a^n=b^2=1,bab=a^{-1}\rangle \). Moreover, we also obtain some simple sufficient conditions for the integrality of Cayley graphs over \(D_n\) in terms of the Boolean algebra of \(\langle a\rangle \), from which we find infinite classes of integral Cayley graphs over \(D_n\). In particular, we completely determine all integral Cayley graphs over the dihedral group \(D_p\) for a prime p.     

On cubic non‐Cayley vertex‐transitive graphs

In 1983, the second author [D. Maru?i?, Ars Combinatoria 16B (1983), 297–302] asked for which positive integers n there exists a non‐Cayley vertex‐transitive graph on n vertices. (The term non‐Cayley numbers has later been given to such integers.) Motivated by this problem, Feng [Discrete Math 248 (2002), 265–269] asked to determine the smallest valency ?(n) among valencies of non‐Cayley vertex‐transitive graphs of order n. As cycles are clearly Cayley graphs, ?(n)?3 for any non‐Cayley number n. In this paper a goal is set to determine those non‐Cayley numbers n for which ?(n) = 3, and among the latter to determine those for which the generalized Petersen graphs are the only non‐Cayley vertex‐transitive graphs of order n. It is known that for a prime p every vertex‐transitive graph of order p, p² or p³ is a Cayley graph, and that, with the exception of the Coxeter graph, every cubic non‐Cayley vertex‐transitive graph of order 2p, 4p or 2p² is a generalized Petersen graph. In this paper the next natural step is taken by proving that every cubic non‐Cayley vertex‐transitive graph of order 4p², p>7 a prime, is a generalized Petersen graph. In addition, cubic non‐Cayley vertex‐transitive graphs of order 2p^k, where p>7 is a prime and k?p, are characterized. © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 77–95, 2012     

On locally primitive Cayley graphs of finite simple groups

In this paper we investigate locally primitive Cayley graphs of finite nonabelian simple groups. First, we prove that, for any valency d for which the Weiss conjecture holds (for example, d?20 or d is a prime number by Conder, Li and Praeger (2000) [1]), there exists a finite list of groups such that if G is a finite nonabelian simple group not in this list, then every locally primitive Cayley graph of valency d on G is normal. Next we construct an infinite family of p-valent non-normal locally primitive Cayley graph of the alternating group for all prime p?5. Finally, we consider locally primitive Cayley graphs of finite simple groups with valency 5 and determine all possible candidates of finite nonabelian simple groups G such that the Cayley graph Cay(G,S) might be non-normal.     

Distance-regular Cayley graphs with least eigenvalue $$$$

We classify the distance-regular Cayley graphs with least eigenvalue \(-2\) and diameter at most three. Besides sporadic examples, these comprise of the lattice graphs, certain triangular graphs, and line graphs of incidence graphs of certain projective planes. In addition, we classify the possible connection sets for the lattice graphs and obtain some results on the structure of distance-regular Cayley line graphs of incidence graphs of generalized polygons.     

Cayley graph expanders and groups of finite width

We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equal to 2) and our second family is given as Cayley graphs of finite groups with very short presentations with only two generators and four relations. Both families are based on particular finite quotients of a group G of infinite upper triangular matrices over the ring .We present explicit vector space bases for the finite abelian quotients of the lower exponent-2 groups of G by upper triangular subgroups and prove a particular 3-periodicity of these quotients. We also conjecture that the group G has finite width 3 and finite average width 8/3.     

Effective equidistribution and the Sato-Tate law for families of elliptic curves

Text

Extending recent work of others, we provide effective bounds on the family of all elliptic curves and one-parameter families of elliptic curves modulo p (for p prime tending to infinity) obeying the Sato-Tate law. We present two methods of proof. Both use the framework of Murty and Sinha (2009) [MS]; the first involves only knowledge of the moments of the Fourier coefficients of the L-functions and combinatorics, and saves a logarithm, while the second requires a Sato-Tate law. Our purpose is to illustrate how the caliber of the result depends on the error terms of the inputs and what combinatorics must be done.

Video

For a video summary of this paper, please click here or visit http://www.youtube.com/watch?v=faW2iDpe5IE.     

Normal cirulant graphs with noncyclic regular subroups

We prove that any circulant graph of order n with connection set S such that n and the order of ?(S), the subgroup of ? that fixes S set‐wise, are relatively prime, is also a Cayley graph on some noncyclic group, and shows that the converse does not hold in general. In the special case of normal circulants whose order is not divisible by 4, we classify all such graphs that are also Cayley graphs of a noncyclic group, and show that the noncyclic group must be metacyclic, generated by two cyclic groups whose orders are relatively prime. We construct an infinite family of normal circulants whose order is divisible by 4 that are also normal Cayley graphs on dihedral and noncyclic abelian groups. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Largest independent sets of certain regular subgraphs of the derangement graph

The derangement graph is the Cayley graph on the symmetric group \(\mathcal {S}_{n}\) whose generating set \(D_{n}\) is the set of permutations on \([n]=\{1, \ldots , n\}\) without any 1-cycle. For any fixed positive integer \(k \le n\), the Cayley graph generated by the subset of \(D_{n}\) consisting of permutations without any i-cycles for all \(1 \le i \le k\) is a regular subgraph of the derangement graph. In this paper, we determine the smallest eigenvalue of these subgraphs and show that the set of all the largest independent sets in these subgraphs is equal to the set of all the largest independent sets in the derangement graph, provided n is sufficiently large in terms of k.     

Finite 2-Geodesic Transitive Abelian Cayley Graphs

In this paper, we first give a classification of the family of 2-geodesic transitive abelian Cayley graphs. Let \(\Gamma \) be such a graph which is not 2-arc transitive. It is shown that one of the following holds: (1) \(\Gamma \cong \mathrm{K}_{m[b]}\) for some \(m\ge 3\) and \(b\ge 2\); (2) \(\Gamma \) is a normal Cayley graph of an elementary abelian group; (3) \(\Gamma \) is a cover of Cayley graph \(\Gamma _K\) of an abelian group T / K, where either \(\Gamma _K\) is complete arc transitive or \(\Gamma _K\) is 2-geodesic transitive of girth 3, and A / K acts primitively on \(V(\Gamma _K)\) of type Affine or Product Action. Second, we completely determine the family of 2-geodesic transitive circulants.     

Non-Cayley Vertex-Transitive Graphs of Order Twice the Product of Two Odd Primes

For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a Cayley graph, or, equivalently, a graph Γ on n vertices such that Aut Γ is transitive on vertices but none of its subgroups are regular on vertices? Previous work (by Alspach and Parsons, Frucht, Graver and Watkins, Marusic and Scapellato, and McKay and the second author) has produced answers to this question if n is prime, or divisible by the square of some prime, or if n is the product of two distinct primes. In this paper we consider the simplest unresolved case for even integers, namely for integers of the form n = 2pq, where 2 < q < p, and p and q are primes. We give a new construction of an infinite family of vertex-transitive graphs on 2pq vertices which are not Cayley graphs in the case where p ≡ 1 (mod q). Further, if p ? 1 (mod q), p ≡ q ≡ 3(mod 4), and if every vertex-transitive graph of order pq is a Cayley graph, then it is shown that, either 2pq = 66, or every vertex-transitive graph of order 2pq admitting a transitive imprimitive group of automorphisms is a Cayley graph.     

Tetravalent vertex‐transitive graphs of order 4p

A graph is vertex‐transitive if its automorphism group acts transitively on vertices of the graph. A vertex‐transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this article, the tetravalent vertex‐transitive non‐Cayley graphs of order 4p are classified for each prime p. As a result, there are one sporadic and five infinite families of such graphs, of which the sporadic one has order 20, and one infinite family exists for every prime p>3, two families exist if and only if p≡1 (mod 8) and the other two families exist if and only if p≡1 (mod 4). For each family there is a unique graph for a given order. © 2011 Wiley Periodicals, Inc.     

The hyperelliptic integrals and π

Text

A class of hyperelliptic integrals are expressed through hypergeometric functions, like those of Gauss, Lauricella and Appell, namely multiple power series. Whenever they can on their own be reduced to elliptic integrals through an algebraic transformation, we obtain a two-fold representation of the same mathematical object, and then several completely new π determinations through the above special functions and/or Euler integrals. All our π formulae have been successfully tested by means of convenient Mathematica_®'s packages and enter in a wide historical/sound context of π-formulae quite far from being exhausted. Due to their structure, the formulae's practical value does not lie in computing π, but in allowing, through π, a benchmark for computing the involved special functions, particularly those less elementary.

Video

For a video summary of this paper, please visit http://www.youtube.com/watch?v=UHZIHgAeCUc.     

On integral Cayley sum graphs

Let S be a subset of a finite abelian group G. The Cayley sum graph Cay⁺(G, S) of G with respect to S is a graph whose vertex set is G and two vertices g and h are joined by an edge if and only if g + h ∈ S. We call a finite abelian group G a Cayley sum integral group if for every subset S of G, Cay⁺(G, S) is integral i.e., all eigenvalues of its adjacency matrix are integers. In this paper, we prove that all Cayley sum integral groups are represented by Z₃ and Zn₂ ⁿ, n ≥ 1, where Z_k is the group of integers modulo k. Also, we classify simple connected cubic integral Cayley sum graphs.     

The spectral excess theorem for distance-regular graphs having distance-<Emphasis Type="Italic">d</Emphasis> graph with fewer distinct eigenvalues

Let \(\Gamma \) be a distance-regular graph with diameter d and Kneser graph \(K=\Gamma _d\), the distance-d graph of \(\Gamma \). We say that \(\Gamma \) is partially antipodal when K has fewer distinct eigenvalues than \(\Gamma \). In particular, this is the case of antipodal distance-regular graphs (K with only two distinct eigenvalues) and the so-called half-antipodal distance-regular graphs (K with only one negative eigenvalue). We provide a characterization of partially antipodal distance-regular graphs (among regular graphs with \(d+1\) distinct eigenvalues) in terms of the spectrum and the mean number of vertices at maximal distance d from every vertex. This can be seen as a more general version of the so-called spectral excess theorem, which allows us to characterize those distance-regular graphs which are half-antipodal, antipodal, bipartite, or with Kneser graph being strongly regular.     

Endomorphism algebras of Jacobians of certain superelliptic curves

Text

Let p be a prime, and q a power of p. Using Galois theory, we show that over a field K of characteristic zero, the endomorphism algebras of the Jacobians of certain superelliptic curves yq=f(x) are products of cyclotomic fields.

Video

For a video summary of this paper, please click here or visit http://www.youtube.com/watch?v=z5ZzOy1K_Ec.     

On color-preserving automorphisms of Cayley graphs of odd square-free order

An automorphism \(\alpha \) of a Cayley graph \(\mathrm{Cay}(G,S)\) of a group G with connection set S is color-preserving if \(\alpha (g,gs) = (h,hs)\) or \((h,hs^{-1})\) for every edge \((g,gs)\in E(\mathrm{Cay}(G,S))\). If every color-preserving automorphism of \(\mathrm{Cay}(G,S)\) is also affine, then \(\mathrm{Cay}(G,S)\) is a Cayley color automorphism (CCA) graph. If every Cayley graph \(\mathrm{Cay}(G,S)\) is a CCA graph, then G is a CCA group. Hujdurovi? et al. have shown that every non-CCA group G contains a section isomorphic to the non-abelian group \(F_{21}\) of order 21. We first show that there is a unique non-CCA Cayley graph \(\Gamma \) of \(F_{21}\). We then show that if \(\mathrm{Cay}(G,S)\) is a non-CCA graph of a group G of odd square-free order, then \(G = H\times F_{21}\) for some CCA group H, and \(\mathrm{Cay}(G,S) = \mathrm{Cay}(H,T)\mathbin {\square }\Gamma \).