Symmetric products of surfaces and the cycle index

We study some of the combinatorial structures related to the signature ofG-symmetric products of (open) surfacesSP _G ^m (M)=M ^m/G whereG ⊂S _m.The attention is focused on the question, what information about a surfaceM can be recovered from a symmetric productSP ⁿ(M). The problem is motivated in part by the study of locally Euclidean topological commutative (m+k,m)-groups, [16]. Emphasizing a combinatorial point of view we express the signature Sign(SP _G ^m (M))in terms of the cycle index ofG, a polynomial which originally appeared in Pólya enumeration theory of graphs, trees, chemical structures etc. The computations are used to show that there exist punctured Riemann surfacesM _g,k,M _g′,k′such that the manifoldsSP ^m(M _g,k)andSP ^m(M)_g′,k′)are often not homeomorphic, although they always have the same homotopy type provided 2 _g +k=2 _g′ +k′ andk,k′≥1. Supported by the Serbian Ministry for Science and Technology, Grant No. 1643.     

Verifying Huppert’s Conjecture for <Superscript>2</Superscript><Emphasis Type="Italic">G</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">q</Emphasis><Superscript>2</Superscript>)

Let G be a finite group and cd(G) be the set of irreducible character degrees of G. Bertram Huppert conjectured that if H is a finite nonabelian simple group such that cd(G) = cd(H), then G ≅ H×A, where A is an abelian group. In this paper, we verify the conjecture for the twisted Ree groups ² G ₂(q ²) for q ² = 3^2m + 1, m ≥ 1. The argument involves verifying five steps outlined by Huppert in his arguments establishing his conjecture for many of the nonabelian simple groups.     

On some special measures on βG

LetG be a discrete abelian group,Ĝ the character group ofG, andl ^∞(G)^* the conjugate ofl ^∞(G) equipped with an Arens product. In many cases, we can find unitary functionsf such that χf is almost convergent to zero for all χ∈Ĝ. Some of these functions are then used to produce elements μ∈l ^∞(G)^* such that γμ=0 whenever γ is an annihilator ofC ₀(G). Regarded as Borel measures on βG, these elements satisfyxμ=0 for allx∈βG/G. They belong to the radical ofl ^∞(G)^*, and each of them generates a left ideal ofl ^∞(G)^* that contains no minimal left ideal.     

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 ⁻¹. 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 ⁻¹ 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.     

Division algebras with a projective basis

Letk be any field andG a finite group. Given a cohomology class α∈H ²(G,k ^*), whereG acts trivially onk ^*, one constructs the twisted group algebrak ^αG. Unlike the group algebrakG, the twisted group algebra may be a division algebra (e.g. symbol algebras, whereG⋞Z _n×Z_n). This paper has two main results: First we prove that ifD=k ^α G is a division algebra central overk (equivalentyD has a projectivek-basis) thenG is nilpotent andG’ the commutator subgroup ofG, is cyclic. Next we show that unless char(k)=0 and , the division algebraD=k ^α G is a product of cyclic algebras. Furthermore, ifD _p is ap-primary factor ofD, thenD _p is a product of cyclic algebras where all but possibly one are symbol algebras. If char(k)=0 and , the same result holds forD _p, p odd. Ifp=2 we show thatD ₂ is a product of quaternion algebras with (possibly) a crossed product algebra (L/k,β), Gal(L/k)⋞Z ₂×Z₂n.     

Large centralizers in finite solvable groups

In 1955 R. Brauer and K. A. Fowler showed that ifG is a group of even order >2, and the order |Z(G)| of the center ofG is odd, then there exists a strongly real) elementx∈G−Z whose centralizer satisfies|C _G(x)|>|G|^1/3. In Theorem 1 we show that every non-abeliansolvable groupG contains an elementx∈G−Z such that|C _G(x)|>[G:G′∩Z]^1/2 (and thus|C _G(x)|>|G|^1/3). We also note that if non-abelianG is either metabelian, nilpotent or (more generally) supersolvable, or anA-group, or any Frobenius group, then|C _G(x)|>|G|^1/2 for somex∈G−Z. In Theorem 2 we prove that every non-abelian groupG of orderp ^mqⁿ (p, q primes) contains a proper centralizer of order >|G|^1/2. Finally, in Theorem 3 we show that theaverage |C(x)|, x∈G, is ≧c|G| ^1/3 for metabelian groups, wherec is constant and the exponent 1/3 is best possible.     

On the characteristic polynomial of supermatrices

We prove that the coefficients of the so-called right 2-characteristic polynomial of a supermatrix over a Grassmann algebraG=G ₀⊕G ₁ are in the even componentG ₀ ofG. As a consequence, we obtain that the algebra ofn×n supermatrices is integral of degreen ² overG ₀. Partially supported by OTKA of Hungary, grant no. T16432.     

Disjoint homotopic paths and trees in a planar graph

In this paper we describe a polynomial-time algorithm for the following problem:given: a planar graphG embedded in ℝ², a subset {I ₁, …,I _p} of the faces ofG, and pathsC ₁, …,C _k inG, with endpoints on the boundary ofI ₁ ∪ … ∪I _p; find: pairwise disjoint simple pathsP ₁, …,P _k inG so that, for eachi=1, …,k, P _i is homotopic toC _i in the space ℝ²\(I ₁ ∪ … ∪I _p). Moreover, we prove a theorem characterizing the existence of a solution to this problem. Finally, we extend the algorithm to disjoint homotopic trees. As a corollary we derive that, for each fixedp, there exists a polynormial-time algorithm for the problem:given: a planar graphG embedded in ℝ² and pairwise disjoint setsW ₁, …,W _k of vertices, which can be covered by the boundaries of at mostp faces ofG;find: pairwise vertex-disjoint subtreesT ₁, …,T _k ofG whereT _i (i=1, …, k).     

The theory of stationary point processes

An axiomatic formulation is presented for point processes which may be interpreted as ordered sequences of points randomly located on the real line. Such concepts as forward recurrence times and number of points in intervals are defined and related in set-theoretic Note that for α∈A,G ^α may not coverG _α as a convex subgroup and so we cannot use Theorem 1.1 to prove this result. Moreover, all that we know about theG ^α/G_α is that each is an extension of a trivially ordered subgroup by a subgroup ofR. ItB is a plenary subset ofA, then there exists av-isomorphism μ ofG intoV(B, G ^β/G_β), but whether or not μ is ano-isomorphism is not known. Presently at Massachusetts Institute of Technology, Lexington, Mass., U.S.A. This work was supported by the National Aeronautics and Space Administration under research grant NsG-2-59     

Semilinear elliptic equations with uniform blow-up on the boundary

We prove the existence and the uniqueness of a solutionu of−Lu+h|u| ^α-1u=f in some open domain ℝ^d, whereL is a strongly elliptic operator,f a nonnegative function, and α>1, under the assumption that ∂G is aC ² compact hypersurface, lim _x→∂G (dist(x, ∂G))^2α/(α-1) f(x)=0, and lim _x→∂G u(x)=∞.     

Graphs whose every transitive orientation contains almost every relation

Given a graphG onn vertices and a total ordering ≺ ofV(G), the transitive orientation ofG associated with ≺, denotedP(G; ≺), is the partial order onV(G) defined by settingx<y inP(G; ≺) if there is a pathx=x ₁ x ₂…x _r=y inG such thatx ₁ ≺x _j for 1≦i<j≦r. We investigate graphsG such that every transitive orientation ofG contains ₂ ⁿ −o(n ²) relations. We prove that almost everyG _n,p satisfies this requirement if , but almost noG _n,p satisfies the condition if (pn log log logn)/(logn log logn) is bounded. We also show that every graphG withn vertices and at mostcn logn edges has some transitive orientation with fewer than ₂ ⁿ −δ(c)n ² relations. Partially supported by MCS Grant 8104854.     

On pro-p-groups with a single defining relator

We find necessary and sufficient conditions for the factor groups of the derived series of a pro-p-group with a single defining relation to be torsion free. For such groupsG we prove that the group algebra ℤ _pG is a domain and the cohomological dimension ofG is at most 2.     

On galois groups and their maximal 2-subgroups

LetG be a finite group of even order, having a central element of order 2 which we denote by −1. IfG is a 2-group, letG be a maximal subgroup ofG containing −1, otherwise letG be a 2-Sylow subgroup ofG. LetH=G/{±1} andH=G/{±1}. Suppose there exists a regular extensionL ₁ of ℚ(T) with Galois groupG. LetL be the subfield ofL ₁ fixed byH. We make the hypothesis thatL ₁ admits a quadratic extensionL ₂ which is Galois overL of Galois groupG. IfG is not a 2-group we show thatL ₁ then admits a quadratic extension which is Galois over ℚ(T) of Galois groupG and which can be given explicitly in terms ofL ₂. IfG is a 2-group, we show that there exists an element α ε ℚ(T) such thatL ₁ admits a quadratic extension which is Galois over ℚ(T) of Galois groupG if and only if the cyclic algebra (L/ℚ(T).a) splits. As an application of these results we explicitly construct several 2-groups as Galois groups of regular extensions of ℚ(T).     

Equational Noetherianness of rigid soluble groups

A group G is said to be rigid if it contains a normal series of the form G = G ₁ > G ₂ > … > G _m  > G _m + 1 = 1, whose quotients G _i /G _i + 1 are Abelian and are torsion free as right Z[G/G _i ]-modules. In studying properties of such groups, it was shown, in particular, that the above series is defined by the group uniquely. It is known that finitely generated rigid groups are equationally Noetherian: i.e., for any n, every system of equations in x ₁, …, x _n over a given group is equivalent to some of its finite subsystems. This fact is equivalent to the Zariski topology being Noetherian on G ⁿ , which allowed the dimension theory in algebraic geometry over finitely generated rigid groups to have been constructed. It is proved that every rigid group is equationally Noetherian. Supported by RFBR (project No. 09-01-00099) and by the Russian Ministry of Education through the Analytical Departmental Target Program (ADTP) “Development of Scientific Potential of the Higher School of Learning” (project No. 2.1.1.419). Translated from Algebra i Logika, Vol. 48, No. 2, pp. 258–279, March–April, 2009.     

Primitive permutation groups of simple diagonal type

LetG be a finite primitive group such that there is only one minimal normal subgroupM inG, thisM is nonabelian and nonsimple, and a maximal normal subgroup ofM is regular. Further, letH be a point stabilizer inG. ThenH∩M is a (nonabelian simple) common complement inM to all the maximal normal subgroups ofM, and there is a natural identification ofM with a direct powerT ^m of a nonabelian simple groupT in whichH∩M becomes the “diagonal” subgroup ofT ^m: this is the origin of the title. It is proved here that two abstractly isomorphic primitive groups of this type are permutationally isomorphic if (and obviously only if) their point stabilizers are abstractly isomorphic. GivenT ^m, consider first the set of all permutational isomorphism classes of those primitive groups of this type whose minimal normal subgroups are abstractly isomorphic toT ^m. Secondly, form the direct productS _m×OutT of the symmetric group of degreem and the outer automorphism group ofT (so OutT=AutT/InnT), and consider the set of the conjugacy classes of those subgroups inS _m×OutT whose projections inS _m are primitive. The second result of the paper is that there is a bijection between these two sets. The third issue discussed concerns the number of distinct permutational isomorphism classes of groups of this type, which can fall into a single abstract isomorphism class.     

The character table of the group GL 2(Q) when extended by a certain group of order two

LetG denote either of the groupsGL ₂(q) or SL₂(q). Then θ :G →G given by θ(A) = (A ^t)^t, whereA ^t denotes the transpose of the matrixA, is an automorphism ofG. Therefore we may form the groupG.θ> which is the split extension of the groupG by the cyclic group θ of order 2. Our aim in this paper is to find the complex irreducible character table ofG. θ.     

Computing the genus of the 2-amalgamations of graphs

The above authors [2] and S. Stahl [3] have shown that if a graphG is the 2-amalgamation of subgraphsG ₁ andG ₂ (namely ifG=G ₁∪G ₂ andG ₁∩G ₂={x, y}, two distinct points) then the orientable genus ofG,γ(G), is given byγ(G)=γ(G ₁)+γ(G ₂)+ε, whereε=0,1 or −1. In this paper we sharpen that result by giving a means by whichε may be computed exactly. This result is then used to give two irreducible graphs for each orientable surface.     

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).     

On the structure of linear graphs

Denote byG(n; m) a graph ofn vertices andm edges. We prove that everyG(n; [n ²/4]+1) contains a circuit ofl edges for every 3 ≦l<c ₂ n, also that everyG(n; [n ²/4]+1) contains ak _e(u _n, u_n) withu _n=[c ₁ logn] (for the definition ofk _e(u _n, u_n) see the introduction). Finally fort>t ₀ everyG(n; [tn ^3/2]) contains a circuit of 2l edges for 2≦l<c ₃ t ². This work was done while the author received support from the National Science Foundation, N.S.F. G.88.