Conjecture of Li and Praeger concerning the isomorphisms of Cayley graphs of A5

LetG be a finite group, andS a subset ofG \ |1| withS =S ^?1. We useX = Cay(G,S) to denote the Cayley graph ofG with respect toS. We callS a Cl-subset ofG, if for any isomorphism Cay(G,S) ≈ Cay(G,T) there is an α∈ Aut(G) such thatS ^α =T. Assume that m is a positive integer.G is called anm-Cl-group if every subsetS ofG withS =S ^?1 and | S | ≤m is Cl. In this paper we prove that the alternating groupA ₅ is a 4-Cl-group, which was a conjecture posed by Li and Praeger.     

On finite groups with the cayley isomorphism property

Let G be a finite group, and let Cay(G, S) be a Cayley digraph of G. If, for all T ⊂ G, Cay(G, S) ≅ Cay(G, T) implies S^α = T for some α ∈ Aut(G), then Cay(G, S) is called a CI-graph of G. For a group G, if all Cayley digraphs of valency m are CI-graphs, then G is said to have the m-DCI property; if all Cayley graphs of valency m are CI-graphs, then G is said to have the m-CI property. It is shown that every finite group of order greater than 2 has a nontrivial CI-graph, and all finite groups with the m-CI property and with the m-DCI property are characterized for small values of m. A general investigation is made of the structure of Sylow subgroups of finite groups with the m-DCI property and with the m-CI property for large values of m. © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 21–31, 1998     

On Isomorphisms of Finite Cayley Graphs

A Cayley graph Cay(G,S) of a groupGis called a CI-graph if wheneverTis another subset ofGfor which Cay(G,S) Cay(G,T), there exists an automorphism σ ofGsuch thatS^σ = T. For a positive integerm, the groupGis said to have them-CI property if all Cayley graphs ofGof valencymare CI-graphs; further, ifGhas thek-CI property for allk ≤ m, thenGis called anm-CI-group, and a |G|-CI-groupGis called a CI-group. In this paper, we prove that Ais not a 5-CI-group, that SL(2,5) is not a 6-CI-group, and that all finite 6-CI-groups are soluble. Then we show that a nonabelian simple group has the 4-CI property if and only if it is A₅, and that no nonabelian simple group has the 5-CI property. Also we give nine new examples of CI-groups of small order, which were found to be CI-groups with the assistance of a computer.     

On the Classification of Arc-transitive Circulant Digraphs of Order Odd-Prime-Squared

A Cayley graph F = Cay（G, S） of a group G with respect to S is called a circulant digraph of order pk if G is a cyclic group of the same order. Investigated in this paper are the normality conditions for arc-transitive circulant （di）graphs of order p^2 and the classification of all such graphs. It is proved that any connected arc-transitive circulant digraph of order p^2 is, up to a graph isomorphism, either Kp2, G（p^2,r）, or G（p,r）[pK1], where r｜p- 1.     

One-regular Normal Cayley Graphs on Dihedral Groups of Valency 4 or 6 with Cyclic Vertex Stabilizer

A graph G is one-regular if its automorphism group Aut（G） acts transitively and semiregularly on the arc set. A Cayley graph Cay（Г, S） is normal if Г is a normal subgroup of the full automorphism group of Cay（Г, S）. Xu, M. Y., Xu, J. （Southeast Asian Bulletin of Math., 25, 355-363 （2001）） classified one-regular Cayley graphs of valency at most 4 on finite abelian groups. Marusic, D., Pisanski, T. （Croat. Chemica Acta, 73, 969-981 （2000）） classified cubic one-regular Cayley graphs on a dihedral group, and all of such graphs turn out to be normal. In this paper, we classify the 4-valent one-regular normal Cayley graphs G on a dihedral group whose vertex stabilizers in Aut（G） are cyclic. A classification of the same kind of graphs of valency 6 is also discussed.     

Restricted sumsets and a conjecture of Lev

LetA, B, S be finite subsets of an abelian groupG. Suppose that the restricted sumsetC={α+b: α ∈A, b ∈B, and α − b ∉S} is nonempty and somec∈C can be written asa+b witha∈A andb∈B in at mostm ways. We show that ifG is torsion-free or elementary abelian, then |C|≥|A|+|B|−|S|−m. We also prove that |C|≥|A|+|B|−2|S|−m if the torsion subgroup ofG is cyclic. In the caseS={0} this provides an advance on a conjecture of Lev. This author is responsible for communications, and supported by the National Science Fund for Distinguished Young Scholars (No. 10425103) and the Key Program of NSF (No. 10331020) in China.     

Locally primitive Cayley graphs of finite simple groups

A graph Г is said to be G-locally primitive, where G is a subgroup of automorphisms of Г, if the stabiliser G_a of a vertex α acts primitively on the set Г( α ) of vertices of Г adjacent to α. For a finite non-abelian simple group L and a Cayley subset S of L, suppose that L ⊴ G ⩽ Aut( L), and the Cayley graph Г = Cay ( L, S) is G-locally primitive. In this paper we prove that L is a simple group of Lie type, and either the valency of Г is an add prine divisor of |Out(L)|, orL =PΩ ₈ ⁺ (q) and Г has valency 4. In either cases, it is proved that the full automorphism group of Г is also almost simple with the same socle L.     

Normal Cayley graphs of finite groups

LetG be a finite group and let S be a nonempty subset of G not containing the identity element 1. The Cayley (di) graph X = Cay(G, S) of G with respect to S is defined byV (X)=G, E (X)={(g,sg)|g∈G, s∈S} A Cayley (di) graph X = Cay (G,S) is said to be normal ifR(G) ◃A = Aut (X). A group G is said to have a normal Cayley (di) graph if G has a subset S such that the Cayley (di) graph X = Cay (G, S) is normal. It is proved that every finite group G has a normal Cayley graph unlessG≅ℤ₄×ℤ₂ orG≅Q ₈×ℤ ₂ ^r (r⩾0) and that every finite group has a normal Cayley digraph, where Z_m is the cyclic group of orderm and Q₈ is the quaternion group of order 8. Project supported by the National Natural Science Foundation of China (Grant No. 10231060) and the Doctorial Program Foundation of Institutions of Higher Education of China.     

A Family of Nonnormal Cayley Digraphs

We call a Cayley digraph Γ = Cay(G, S) normal for G if G _R , the right regular representation of G, is a normal subgroup of the full automorphism group Aut(Γ) of Γ. In this paper we determine the normality of Cayley digraphs of valency 2 on nonabelian groups of order 2p ² (p odd prime). As a result, a family of nonnormal Cayley digraphs is found. Received February 23, 1998, Revised September 25, 1998, Accepted October 27, 1998     

On Isomorphisms of Minimal Cayley Graphs and Digraphs

 A Cayley graph or digraph Cay(G,S) is called a CI-graph of G if, for any T⊂G, Cay(G,S)≅Cay(G,T) if and only if S ^σ=T for some σ∈Aut(G). The aim of this paper is to characterize finite abelian groups for which all minimal Cayley graphs and digraphs are CI-graphs. Received: February 13, 1998 Final version received: May 7, 1999     

Cayley digraphs and lexicographic product

In this paper, we prove that a Cayley digraph Γ = Cay(G, S) is a nontrivial lexicographical product if and only if there is a nontrivial subgroup H of G such that S∖H is a union of some double cosets of H in G.      

Further restrictions on the structure of finite CI-groups

A group G is called a CI-group if, for any subsets S,T⊂ G, whenever two Cayley graphs Cay(G,S) and Cay(G,T) are isomorphic, there exists an element σ∊Aut(G) such that Sσ = T. The problem of seeking finite CI-groups is a long-standing open problem in the area of Cayley graphs. This paper contributes towards a complete classification of finite CI-groups. First it is shown that the Frobenius groups of order 4p and 6p, and the metacyclic groups of order 9p of which the centre has order 3 are not CI-groups, where p is an odd prime. Then a shorter explicit list is given of candidates for finite CI-groups. Finally, some new families of finite CI-groups are found, that is, the metacyclic groups of order 4p (with centre of order 2) and of order 8p (with centre of order 4) are CI-groups, and a proof is given for the Frobenius group of order 3p to be a CI-group, where p is a prime. C. H. Li was supported by an Australian Research Council Discovery Grant and a QEII Fellowship. Z. P. Lu was partially supported by the NNSF and TYYF of China. P. P. Pálfy was supported by the Hungarian Science Foundation (OTKA), grant no. T38059.     

Closed sectorial forms and one-parameter contraction semigroups

Suppose thats[u, v] is a closed sesquilinear sectorial form with vertex at zero, half-angle α ∈ [0, π/2), and dense domainD(s) in a Hilbert spaceH, S is them-sectorial operator associated withs, S _R is the real part ofS, andT(t)=exp(−tS) is the contraction semigroup with generator −S, holomorphic in the sector |argt|<π/2−α. We characterizes in terms ofT(t). In particular, we prove that the following conditions a`2) the function ‖T(t)u‖ is differentiable at zero; 3) the function (T(t)u, u) is differentiable at zero. Translated fromMatematicheskie Zametki, Vol. 61, No. 5, pp. 643–654, May, 1997. Translated by V. E. Nazaikinskii     

Cubic vertex‐transitive graphs of order 2pq

A graph is vertex?transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of vertices of the graph, respectively. Let G be a finite group and S a subset of G such that 1?S and S={s^?1 | s∈S}. The Cayleygraph Cay(G, S) on G with respect to S is defined as the graph with vertex set G and edge set {{g, sg} | g∈G, s∈S}. Feng and Kwak [J Combin Theory B 97 (2007), 627–646; J Austral Math Soc 81 (2006), 153–164] classified all cubic symmetric graphs of order 4p or 2p² and in this article we classify all cubic symmetric graphs of order 2pq, where p and q are distinct odd primes. Furthermore, a classification of all cubic vertex‐transitive non‐Cayley graphs of order 2pq, which were investigated extensively in the literature, is given. As a result, among others, a classification of cubic vertex‐transitive graphs of order 2pq can be deduced. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 285–302, 2010     

Topological *-algebras withC*-enveloping algebras II

UniversalC*-algebrasC*(A) exist for certain topological *-algebras called algebras with aC*-enveloping algebra. A Frechet *-algebraA has aC*-enveloping algebra if and only if every operator representation ofA mapsA into bounded operators. This is proved by showing that every unbounded operator representation π, continuous in the uniform topology, of a topological *-algebraA, which is an inverse limit of Banach *-algebras, is a direct sum of bounded operator representations, thereby factoring through the enveloping pro-C*-algebraE(A) ofA. Given aC*-dynamical system (G,A,α), any topological *-algebraB containingC _c (G,A) as a dense *-subalgebra and contained in the crossed productC*-algebraC*(G,A,α) satisfiesE(B) =C*(G,A,α). IfG = ℝ, ifB is an α-invariant dense Frechet *-subalgebra ofA such thatE(B) =A, and if the action α onB ism-tempered, smooth and by continuous *-automorphisms: then the smooth Schwartz crossed productS(ℝ,B,α) satisfiesE(S(ℝ,B,α)) =C*(ℝ,A,α). WhenG is a Lie group, theC ^∞-elementsC ^∞(A), the analytic elementsC ^ω(A) as well as the entire analytic elementsC ^є(A) carry natural topologies making them algebras with aC*-enveloping algebra. Given a non-unitalC*-algebraA, an inductive system of idealsI _α is constructed satisfyingA =C*-ind limI _α; and the locally convex inductive limit ind limI _α is anm-convex algebra with theC*-enveloping algebraA and containing the Pedersen idealK _a ofA. Given generatorsG with weakly Banach admissible relationsR, we construct universal topological *-algebraA(G, R) and show that it has aC*-enveloping algebra if and only if (G, R) isC*-admissible.     

Movement of Intransitive Permutation Groups Having Maximum Degree

Let G be a permutation group on a set Ω with no fixed points in,and m be a positive integer.Then the movement of G is defined as move(G):=sup Γ {|Γg\Γ| | g ∈ G}.It was shown by Praeger that if move(G) = m,then |Ω| 3m + t-1,where t is the number of G-orbits on.In this paper,all intransitive permutation groups with degree 3m+t-1 which have maximum bound are classified.Indeed,a positive answer to her question that whether the upper bound |Ω| = 3m + t-1 for |Ω| is sharp for every t > 1 is given.     

Fault Tolerance of Cayley Graphs

It is a difficult problem in general to decide whether a Cayley graph Cay(G; S) is connected where G is an arbitrary finite group and S a subset of G. For example, testing primitivity of an element in a finite field is a special case of this problem but notoriously hard. In this paper, it is shown that if a Cayley graph Cay(G; S) is known to be connected then its fault tolerance can be determined in polynomial time in |S|log(|G|). This is accomplished by establishing a new structural result for Cayley graphs. This result also yields a simple proof of optimal fault tolerance for an infinite class of Cayley graphs, namely exchange graphs. We also use the proof technique for our structural result to give a new proof of a known result on quasiminimal graphs. Received March 10, 2006     

A pure quantum mechanical theory of parity effect in tunneling and evolution of spins

In recent years, the spin parity effect in magnetic macroscopic quantum tunneling has attracted extensive attention. Using the spin coherent-state path-integral method it is shown that if the HamiltonianH of a single-spin system hasM - fold rotational symmetry around z-axis, the tunneling amplitude 〈−S|e ^Ht |S〉 vanishes when S, the quantum number of spin, is not an integer multiple ofM/2, where |m〉 (m=-S, -S +1, ⋯, S) are the eigenstates of S^z. Not only is a pure quantum mechanical approach adopted to the above result, but also is extended to more general cases where the quantum system consists ofN spins, the quantum numbers of which can take any values, including the single-spin system, ferromagnetic particle and antiferromagnetic particle as particular instances, and where the states involved are not limited to the extreme ones. The extended spin parity effect is that if the Hamiltonian ℋ of the system ofN spins also has the above symmetry, then 〈m′_N⋯m′₂ m′₁|e^{−H t} |m ₁ m ₂⋯m _N vanishes when ∑ _i=1 ^N (m _i−m′₁) not an integer multiple ofM, where |m ₁ m ₂⋯m _N〉=∏ _α=1 ^N |m _a 〉 are the eigenstates of S _a ^z . In addition, it is argued that for large spin the above result, the so-called spin parity effect, does not mean the quenching of spin tunneling from the direction of ⊕-z to that of ±z. Project supported by the National Natural Science Foundation of China (Grant Nos. 19674002, 19677101).     

A poisson formula for solvable Lie groups

Given a probability measure μ on a locally compact second countable groupG the space of bounded μ-harmonic functions can be identified withL ^∞(η, α) where (η, α) is a BorelG-space with a σ-finite quasiinvariant measure α. Our goal is to show that when μ is an arbitrary spread out probability measure on a connected solvable Lie groupG then the μ-boundary (η, α) is a contractive homogeneous space ofG. Our approach is based on a study of a class of strongly approximately transitive (SAT) actions ofG. A BorelG-space η with a σ-finite quasiinvariant measure α is called SAT if it admits a probability measurev≪α, such that for every Borel set A with α(A)≠0 and every ε>0 there existsg∈G with ν(gA)>1−ε. Every μ-boundary is a standard SATG-space. We show that for a connected solvable Lie group every standard SATG-space is transitive, characterize subgroupsH⊆G such that the homogeneous spaceG/H is SAT, and establish that the following conditions are equivalent forG/H: (a)G/H is SAT; (b)G/H is contractive; (c)G/H is an equivariant image of a μ-boundary.     

Undirected power graphs of semigroups

The undirected power graph G(S) of a semigroup S is an undirected graph whose vertex set is S and two vertices a,b∈S are adjacent if and only if a≠b and a ^m =b or b ^m =a for some positive integer m. In this paper we characterize the class of semigroups S for which G(S) is connected or complete. As a consequence we prove that G(G) is connected for any finite group G and G(G) is complete if and only if G is a cyclic group of order 1 or p ^m . Particular attention is given to the multiplicative semigroup ℤ _n and its subgroup U _n , where G(U _n ) is a major component of G(ℤ _n ). It is proved that G(U _n ) is complete if and only if n=1,2,4,p or 2p, where p is a Fermat prime. In general, we compute the number of edges of G(G) for a finite group G and apply this result to determine the values of n for which G(U _n ) is planar. Finally we show that for any cyclic group of order greater than or equal to 3, G(G) is Hamiltonian and list some values of n for which G(U _n ) has no Hamiltonian cycle.