On the n-minimal subgroups

Let G be a finite group and n be a positive integer. An n-minimal subgroup H of G is called to be exactly n-minimal if no proper subgroup of H is n-minimal. In this paper, we study the solvability of G under the assumption that all exactly n-minimal subgroups of G are S-permutable.     

Classification of real Nash fibre bundles

Let G be a compact subgroup of an orthogonal group and X an affine, real, semialgebraic Nash variety. A principal Nash G-bundle over X is said to be strongly Nash if it is induced, up to Nash equivalences, of some universal bundle under a Nash map. Not all Nash bundles are strongly Nash and we denote by S(X, G) the class of strongly Nash G-bundles over X. The principal aim of this paper is to prove the following classification theorem: two bundles of S(X, G) are Nash equivalent if and only if they are topologically equivalent; more,there exists a bijection between the family of the classes of Nash equivalent bundles of S(X, G) and , where is the sheaf of germs of the continous maps from X to G. This result leads to find the largest class of principal Nash G-bundles over X in which the topological equivalence always implies the Nash one. Well, we prove that this class is exactly S(X, G). Research partially supported by M.I.U.R.     

A Bijection for the Alperin Weight Conjecture in <Emphasis Type="Italic">S</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

The Alperin weight conjecture states that if G is a finite group and p is a prime, then the number of irreducible Brauer characters of a group G should be equal to the number of conjugacy classes of p-weights of G. This conjecture is known to be true for the symmetric group S _n , however there is no explicit bijection given between the two sets. In this paper we develop an explicit bijection between the p-weights of S _n and a certain set of partitions that is known to have the same cardinality as the irreducible Brauer characters of S _n . We also develop some properties of this bijection, especially in relation to a certain class of partitions whose corresponding Specht modules over fields of characteristic p are known to be irreducible.     

Minimal forms wit respect to function fields of conics

Summary LetF be a field of characteristic ≠2, and let ϱ be an anisotropic conic overF. Anisotropic quadratic forms φ overF which become isotropic over the function fieldF(ϱ), but which do not contain proper subforms becoming isotropic, are calledF(ϱ)-minimal forms. It is investigated how upper bounds for the dimension ofF(ϱ)-minimal forms depend on certain properties and invariants of the fieldF. The existence of fieldsF and conics ϱ such thatF containsF(ϱ)-minimal forms of arbitrarily large (odd) dimension is proved. During the work on this article, the first author was a postdoc at the Institute for Experimental Mathematics, University of Essen, Germany, supported by a grant from the Deutsche Forschungsgemeinschaft This article was processed by the author using the LATEX style filecljour1 from Springer-Verlag.     

Computation of weight lattices of <Emphasis Type="Italic">G</Emphasis>-varieties

Let G be a connected reductive group. To any irreducible G-variety, one assigns the lattice consisting of all weights of B-semiinvariant rational functions on X, where B is a Borel subgroup of G. This lattice is called the weight lattice of X. We establish algorithms for computing weight lattices for homogeneous spaces and affine homogeneous vector bundles. For affine homogeneous spaces of rank rkG we present a more or less explicit computation. Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 60, Algebra, 2008.     

On the prime graph of <Emphasis Type="Italic">PSL</Emphasis>(2, <Emphasis Type="Italic">p</Emphasis>) where <Emphasis Type="Italic">p</Emphasis> > 3 is a prime number

Let G be a finite group. We define the prime graph Γ(G) as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p, q are joined by an edge if there is an element in G of order pq. Recently M. Hagie [5] determined finite groups G satisfying Γ(G) = Γ(S), where S is a sporadic simple group. Let p > 3 be a prime number. In this paper we determine finite groups G such that Γ(G) = Γ(PSL(2, p)). As a consequence of our results we prove that if p > 11 is a prime number and p ≢ 1 (mod 12), then PSL(2, p) is uniquely determined by its prime graph and so these groups are characterizable by their prime graph. The third author was supported in part by a grant from IPM (No. 84200024).     

A conic bundle description of Moishezon twistor spaces without effective divisors of degree one

In [K2] Moishezon twistor spaces over the connected sum (), which do not contain effective divisors of degree one, were constructed as deformations of the twistor spaces introduced in [LeB]. We study their structure for by constructing a modification which is a conic bundle over . We show that they are rational. In case n = 4 we give explicit equations for such conic bundles and use them to construct explicit birational maps between these conic bundles and . Received October 8, 1996; in final form May 16, 1997     

Disconnected Equivariant Rational Homotopy Theory

We present a variant of the disconnected equivariant rational homotopy theory to complete the result shown in [8]. For a finite group G let O(G) be the category of its canonical orbits. We prove that the category O(G)-DGA _Q of O(G)S-complete differential graded algebras over the rationals is a closed model category, where S runs over all O(G)-sets. Then, by means of the equivariant KS-minimal models, we show that the homotopy category of O(G)-DGA _Q is equivalent to the rational homotopy category of G-nilpotent disconnected simplicial sets provided G is a finite Hamiltonian group.     

Evasive random walks and the clairvoyant demon

A pair of random walks (R, S) on the vertices of a graph G is successful if two tokens moving one at a time can be scheduled (moving only one token at a time) to travel along R and S without colliding. We consider questions related to P. Winkler's clairvoyant demon problem, which asks whether for random walks R and S on G, Pr[(R, S)is successful] >0. We introduce the notion of an evasive walk on G: a walk S so that for a random walk R on G, Pr[(R, S)is successful] >0. We characterize graphs G having evasive walks, giving explicit constructions on such G. Also, we show that on a cycle, the tokens must collide quickly with high probability. © 2002 Wiley Periodicals, Inc. Random Struct. Alg. 20: 220–229, 2002     

Cyclability of 3‐connected graphs

A subset S of vertices of a graph G is called cyclable in G if there is in G some cycle containing all the vertices of S. We denote by α(S, G) the number of vertices of a maximum independent set of G[S]. We prove that if G is a 3‐connected graph or order n and if S is a subset of vertices such that the degree sum of any four independent vertices of S is at least n + 2α(S, G) −2, then S is cyclable. This result implies several known results on cyclability or Hamiltonicity. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 191–203, 2000     

Regular interval Cantor sets of <Emphasis Type="Italic">S</Emphasis><Superscript>1</Superscript> and minimality

It is known that not every Cantor set of S ¹ is C ¹-minimal. In this work we prove that every member of a subfamily of what we here call regular interval Cantor set is not C ¹-minimal. We also prove that no member of a class of Cantor sets that includes this subfamily is C ^1+∈-minimal, for any ∈ > 0. Partially supported by CNPq-Brasil and PEDECIBA-Uruguay.     

On packing 3‐vertex paths in a graph

Let G be a connected graph and let eb(G) and λ(G) denote the number of end‐blocks and the maximum number of disjoint 3‐vertex paths Λ in G. We prove the following theorems on claw‐free graphs: (t1) if G is claw‐free and eb(G) ≤ 2 (and in particular, G is 2‐connected) then λ(G) = ⌊| V(G)|/3⌋; (t2) if G is claw‐free and eb(G) ≥ 2 then λ(G) ≥ ⌊(| V(G) | − eb(G) + 2)/3 ⌋; and (t3) if G is claw‐free and Δ^*‐free then λ(G) = ⌊| V(G) |/3⌋ (here Δ^* is a graph obtained from a triangle Δ by attaching to each vertex a new dangling edge). We also give the following sufficient condition for a graph to have a Λ‐factor: Let n and p be integers, 1 ≤ p ≤ n − 2, G a 2‐connected graph, and |V(G)| = 3n. Suppose that G − S has a Λ‐factor for every S ⊆ V(G) such that |S| = 3p and both V(G) − S and S induce connected subgraphs in G. Then G has a Λ‐factor. © 2001 John Wiley & Sons, Inc. J Graph Theory 36: 175–197, 2001     

Hitting times for random walks on subdivision and triangulation graphs

Let G be a connected graph. The subdivision graph of G, denoted by S(G), is the graph obtained from G by inserting a new vertex into every edge of G. The triangulation graph of G, denoted by R(G), is the graph obtained from G by adding, for each edge uv, a new vertex whose neighbours are u and v. In this paper, we first provide complete information for the eigenvalues and eigenvectors of the probability transition matrix of a random walk on S(G) (res. R(G)) in terms of those of G. Then we give an explicit formula for the expected hitting time between any two vertices of S(G) (res. R(G)) in terms of those of G. Finally, as applications, we show that, the relations between the resistance distances, the number of spanning trees and the multiplicative degree-Kirchhoff index of S(G) (res. R(G)) and G can all be deduced from our results directly.     

Characterizing compact Clifford semigroups that embed into convolution and functor-semigroups

We study algebraic and topological properties of the convolution semigroup of probability measures on a topological groups and show that a compact Clifford topological semigroup S embeds into the convolution semigroup P(G) over some topological group G if and only if S embeds into the semigroup exp(G)\exp(G) of compact subsets of G if and only if S is an inverse semigroup and has zero-dimensional maximal semilattice. We also show that such a Clifford semigroup S embeds into the functor-semigroup F(G) over a suitable compact topological group G for each weakly normal monadic functor F in the category of compacta such that F(G) contains a G-invariant element (which is an analogue of the Haar measure on G).     

Line-primitive Linear Spaces with Fang-Li Parameter gcd（k,r） at Most 12

Let G be a subgroup of the automorphism group of a non-trivial finite linear space S. In this paper we prove that if G is line-primitive with Fang-Li parameter gcd(k, r) = 11 and 12, then G is also point-primitive. This extends the results of Fang and Li (1993) and Li and Liu (2001) which combined gives the result for gcd(k, r) ≤ 10.     

Multiplicative Invariants and Semigroup Algebras

Let G be a finite group acting by automorphism on a lattice A, and hence on the group algebra S=k[A]. The algebra of G-invariants in S is called an algebra of multiplicative invariants. We present an explicit version of a result of Farkas stating that multiplicative invariants of finite reflection groups are semigroup algebras.     

Bounds on the <Emphasis Type="Italic">k</Emphasis>-tuple domatic number of a graph

Let k be a positive integer, and let G be a simple graph with vertex set V (G). A vertex of a graph G dominates itself and all vertices adjacent to it. A subset S ⊆ V (G) is a k-tuple dominating set of G if each vertex of V (G) is dominated by at least k vertices in S. The k-tuple domatic number of G is the largest number of sets in a partition of V (G) into k-tuple dominating sets.     

Torsion completeness of <Emphasis Type="Italic">p</Emphasis>-primary components in modular group rings of <Emphasis Type="Italic">p</Emphasis>-reduced Abelian groups

Let G be a p-reduced Abelian group and R a commutative unital ring of prime characteristic p such that for each natural number i the subring $ R^{p^i } $ R^{p^i } has nilpotent elements. It is shown that if S(RG) is the normalized Sylow p-group in the group ring RG, then S(RG) is torsion-complete if and only if G is a bounded p-group. This strengthens our former results on this subject.     

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.     

Some finiteness results for groups with bounded algebraic entropy

We prove that the number of elements of any generating set S of a discrete group G is bounded from above if we assume that the algebraic entropy of G with respect to S is smaller than some universal constant and the existence of a finite index subgroup of G with hyperbolicity properties. We deduce some finiteness results for the pairs (G, S) when G is a word-hyperbolic group or the fundamental group of a compact Riemannian manifold.