Quaternionic Starters

Let m be an integer, m 2 and set n = 2^m. Let G be a non-cyclic group of order 2n admitting a cyclic subgroup of order n. We prove that G always admits a starter and so there exists a one–factorization of K_2n admitting G as an automorphism group acting sharply transitively on vertices. For an arbitrary even n > 2 we also show the existence of a starter in the dicyclic group of order 2n.Research performed within the activity of INdAM–GNSAGA with the financial support of the Italian Ministry MIUR, project Strutture Geometriche, Combinatoria e loro Applicazioni     

A new efficient presentation for PSL(2,5) and the structure of the groups G(3,m,n)

G(3, m, n) is the group presented by . In this paper, we study the structure of G(3, m, n). We also give a new efficient presentation for the Projective Special Linear group PSL(2, 5) and in particular we prove that PSL(2, 5) is isomorphic to G(3, m, n) under certain conditions.     

On Finite Groups with a Given Number of Centralizers

For a finite group G, let Cent(G) denote the set of centralizers of single elements of G and #Cent(G) = |Cent(G)|. G is called an n-centralizer group if #Cent(G) = n, and a primitive n-centralizer group if #Cent(G) = #Cent(G/Z(G)) = n. In this paper, we compute #Cent(G) for some finite groups G and prove that, for any positive integer n 2, 3, there exists a finite group G with #Cent(G) = n, which is a question raised by Belcastro and Sherman [2]. We investigate the structure of finite groups G with #Cent(G) = 6 and prove that, if G is a primitive 6-centralizer group, then G/Z(G) A₄, the alternating group on four letters. Also, we prove that, if G/Z(G) A₄, then #Cent(G) = 6 or 8, and construct a group G with G/Z(G) A₄ and #Cent(G) = 8.This research was in part supported by a grant from IPM.2000 Mathematics Subject Classification: 20D99, 20E07     

Valuations on arithmetic surfaces

In this paper, we give the definition of the height of a valuation and the definition of the big field Cp,G, where p is a prime and GR is an additive subgroup containing 1. We conclude that Cp,G is a field and Cp,G is algebraically closed. Based on this the author obtains the complete classification of valuations on arithmetic surfaces. Furthermore, for any m ≤n∈ Z, let Vm,n be an R-vector space of dimension n-m + 1, whose coordinates are indexed from m to n. We generalize the definition of Cp,G, where p i...     

Erd?s-Ko-Rado theorem for irreducible imprimitive reflection groups

Let Ω be a finite set, and let G be a permutation group on Ω. A subset H of G is called intersecting if for any σ, π ∈ H, they agree on at least one point. We show that a maximal intersecting subset of an irreducible imprimitive reflection group G(m, p, n) is a coset of the stabilizer of a point in {1, …, n} provided n is sufficiently large.     

On the parity of crossing numbers

For an integer n ? 1, a graph G has an n-constant crossing number if, for any two good drawings ? and ?′ of G in the plane, μ(?) ≡ μ(?′) (mod n), where μ(?) is the number of crossings in ?. We prove that, except for trivial cases, a graph G has n-constant crossing number if and only if n = 2 and G is either K_p or K_q,r, where p, q, and r are odd.     

Convergence in homogeneous random graphs

For a sequence p? = (p(1), p(2), ‥ .), let G(n, p?) denote the random graph with vertex set {1, 2, ‥ ., n} in which two vertices i, j are adjacent with probability p(|i ? j|), independently for each pair. We study how the convergence of probabilities of first order properties of G(n, p?), can be affected by the behaviour of p? and the strength of the language we use.     

On finite groups with non-subnormal subgroups

For a finite group G, let n(G) denote the number of conjugacy classes of non-subnormal subgroups of G. In this paper, we show that a finite group G satisfying n(G)≤2|π(G)| is solvable, and for a finite non-solvable group G, n(G) = 2|π(G)|+1 if and only if G?A₅.     

The Basis Number of Some Special Non-Planar Graphs

The basis number of a graph G was defined by Schmeichel to be the least integer h such that G has an h-fold basis for its cycle space. He proved that for m, n 5, the basis number b(K _m,n ) of the complete bipartite graph K _m,n is equal to 4 except for K _6,10, K _5,n and K _6,n with n = 5, 6, 7, 8. We determine the basis number of some particular non-planar graphs such as K _5,n and K _6,n , n = 5, 6, 7, 8, and r-cages for r = 5, 6, 7, 8, and the Robertson graph.     

CLASSIFICATION OF COMPLETE 5-PARTITE GRAPHS AND CHROMATICITY OF 5-PARTITE GRAPHSWITH 5n VERTICES

For a graph G,P(G,λ)denotes the chromatic polynomial of G. Two graphs G and H are said to be chromatically equivalent,denoted by G-H,if P(G,λ)=p(H,λ). Let[G]= {H|H-G}. If [G]={G},then G is said to be chromatically unique. For a complete 5-partite graph G with 5n vertices, define θ(G)=(a(G,6)-2^n 1-2^n-1 5)/2n-2,where a(G,6) denotes the number of 6-independent partitions of G. In this paper, the authors show that θ(G)≥0 and determine all graphs with θ(G)= 0, 1, 2, 5/2, 7/2, 4, 17/4. By using these results the chromaticity of 5-partite graphs of the form G-S with θ(G)=0,1,2,5/2,7/2,4,17/4 is investigated,where S is a set of edges of G. Many new chromatically unique 5-partite graphs are obtained.     

Hamilton cycles in strong products of graphs

We prove that the strong product of any n connected graphs of maximum degree at most n contains a Hamilton cycle. In particular, G^Δ(G) is hamiltonian for each connected graph G, which answers in affirmative a conjecture of Bermond, Germa, and Heydemann. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 299–321, 2005     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

Nilpotent 1‐factorizations of the complete graph

For which groups G of even order 2n does a 1‐factorization of the complete graph K_2n exist with the property of admitting G as a sharply vertex‐transitive automorphism group? The complete answer is still unknown. Using the definition of a starter in G introduced in 4 , we give a positive answer for new classes of groups; for example, the nilpotent groups with either an abelian Sylow 2‐subgroup or a non‐abelian Sylow 2‐subgroup which possesses a cyclic subgroup of index 2. Further considerations are given in case the automorphism group G fixes a 1‐factor. © 2005 Wiley Periodicals, Inc. J Combin Designs     

Equitable coloring of random graphs

An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exists an equitable coloring of a graph G with k colors is said to be the equitable chromatic number of G and is denoted by χ₌(G). The least positive integer k such that for any k′ ≥ k there exists an equitable coloring of a graph G with k′ colors is said to be the equitable chromatic threshold of G and is denoted by χ₌*(G). In this paper, we investigate the asymptotic behavior of these coloring parameters in the probability space G(n,p) of random graphs. We prove that if n^?1/5+? < p < 0.99 for some 0 < ?, then almost surely χ(G(n,p)) ≤ χ₌(G(n,p)) = (1 + o(1))χ(G(n,p)) holds (where χ(G(n,p)) is the ordinary chromatic number of G(n,p)). We also show that there exists a constant C such that if C/n < p < 0.99, then almost surely χ(G(n,p)) ≤ χ₌(G(n,p)) ≤ (2 + o(1))χ(G(n,p)). Concerning the equitable chromatic threshold, we prove that if n^?(1??) < p < 0.99 for some 0 < ?, then almost surely χ(G(n,p)) ≤ χ₌* (G(n,p)) ≤ (2 + o(1))χ(G(n,p)) holds, and if < p < 0.99 for some 0 < ?, then almost surely we have χ(G(n,p)) ≤ χ₌*(G(n,p)) = O_?(χ(G(n,p))). © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009     

Dimension Theory and Nonstable K1 of Quadratic Modules

Employing Bak's dimension theory, we investigate the nonstable quadratic K-group K _1,2n (A, ) = G _2n (A, )/E _2n (A, ), n 3, where G _2n (A, ) denotes the general quadratic group of rank n over a form ring (A, ) and E _2n (A, ) its elementary subgroup. Considering form rings as a category with dimension in the sense of Bak, we obtain a dimension filtration G _2n (A, ) G _2n ⁰(A, ) ; G _2n ¹(A, ) ... E _2n (A, ) of the general quadratic group G _2n (A, ) such that G _2n (A, )/G _2n ⁰(A, ) is Abelian, G _2n ⁰(A, ) G _2n ¹(A, ) ... is a descending central series, and G _2n ^d(A)(A, ) = E _2n (A, ) whenever d(A) = (Bass–Serre dimension of A) is finite. In particular K _1,2n (A, ) is solvable when d(A) < .     

On the Upper Bounds of the Numbers of Perfect Matchings in Graphs with Given Parameters

Let φ(G),κ(G),α(G),χ(G),cl(G),diam(G)denote the number of perfect matchings,connectivity,independence number,chromatic number,clique number and diameter of a graph G,respectively.In this note,by constructing some extremal graphs,the following extremal problems are solved:1.max{φ(G):|V(G)|=2n,κ(G)≤k}=k[(2n-3)!!],2.max{φ(G):|V(G)|=2n,α(G)≥k}=[multiply from i=0 to k-1(2n-k-i)[(2n-2k-1)!!],3.max{φ(G):|V(G)|=2n,χ(G)≤k}=φ(T_(k,2n))T_(k,2n)is the Turán graph,that is a complete k-partite graphon 2n vertices in which all parts are as equal in size as possible,4.max{φ(G):|V(G)|=2n,cl(G)=2}=n1,5.max{φ(G):|V(G)|=2n,diam(G)≥2}=(2n-2)(2n-3)[(2n-5)!!],max{φ(G):|V(G)|=2n,diam(G)≥3}=(n-1)~2[(2n-5)!!].     

The Decomposition Dimension of Graphs

 For an ordered k-decomposition ? = {G ₁, G ₂,…,G _k } of a connected graph G and an edge e of G, the ?-representation of e is the k-tuple r(e|?) = (d(e, G ₁), d(e, G ₂),…,d(e, G _k )), where d(e, G _i ) is the distance from e to G _i . A decomposition ? is resolving if every two distinct edges of G have distinct representations. The minimum k for which G has a resolving k-decomposition is its decomposition dimension dec(G). It is shown that for every two positive integers k and n≥ 2, there exists a tree T of order n with dec(T) = k. It is also shown that dec(G) ≤n for every graph G of order n≥ 3 and that dec(K _n ) ≤⌊(2n + 5)/3⌋ for n≥ 3. Received: June 17, 1998 Final version received: August 10, 1999     

Mean-Field Conditions for Percolation on Finite Graphs

Let {G _n } be a sequence of finite transitive graphs with vertex degree d = d(n) and |G _n | = n. Denote by p ^t (v, v) the return probability after t steps of the non-backtracking random walk on G _n . We show that if p ^t (v, v) has quasi-random properties, then critical bond-percolation on G _n behaves as it would on a random graph. More precisely, if $\mathop {\rm {lim\, sup\,}} \limits_{n} n^{1/3} \sum\limits_{t = 1}^{n^{1/3}} {t{\bf p}^t(v,v) < \infty ,}$ then the size of the largest component in p-bond-percolation with ${p =\frac{1+O(n^{-1/3})}{d-1}}Let {G _n } be a sequence of finite transitive graphs with vertex degree d = d(n) and |G _n | = n. Denote by p ^t (v, v) the return probability after t steps of the non-backtracking random walk on G _n . We show that if p ^t (v, v) has quasi-random properties, then critical bond-percolation on G _n behaves as it would on a random graph. More precisely, if

lim sup  n n1/3 ?t = 1n1/3 tpt(v,v) < ￥,\mathop {\rm {lim\, sup\,}} \limits_{n} n^{1/3} \sum\limits_{t = 1}^{n^{1/3}} {t{\bf p}^t(v,v) < \infty ,}      19. On Finite n-Acentralizer Groups      Mohammad Mehdi Nasrabadi  Ali Gholamian 《代数通讯》2013,41(2):378-383 Let G be a group and Aut(G) be the group of automorphisms of G. Then the Acentralizer of an automorphism α ∈Aut(G) in G is defined as C G (α) = {g ∈ G∣α(g) = g}. For a finite group G, let Acent(G) = {C G (α)∣α ∈Aut(G)}. Then for any natural number n, we say that G is n-Acentralizer group if |Acent(G)| =n. We show that for any natural number n, there exists a finite n-Acentralizer group and determine the structure of finite n-Acentralizer groups for n ≤ 5.      20. On a Function Related to Multinomial Coefficients (I)      Yong Gao Chen  Chun Gang Ji 《数学学报(英文版)》2002,18(4):647-660 Let F p,t (n) denote the number of the coefficients of (x 1+1x 2+...+x t ) j , 0 ≤j≤n− 1, which are not divisible by the prime p. Define G p,t (n) = F p,t /n θ and β(p,t) = lim infF p,t )(n)/n θ, where θ = (log)/(log p). In this paper, we mainly prove that G p,t can be extended to a continuous function on ℝ+, and the function G p,t is nowhere monotonic. Both the set of differential points of the function G p,t and the set of non-differential points of the function G p,t are dense in ℝ+. Received February 18, 2000, Accepted December 7, 2000

On Finite n-Acentralizer Groups

Let G be a group and Aut(G) be the group of automorphisms of G. Then the Acentralizer of an automorphism α ∈Aut(G) in G is defined as C _G (α) = {g ∈ G∣α(g) = g}. For a finite group G, let Acent(G) = {C _G (α)∣α ∈Aut(G)}. Then for any natural number n, we say that G is n-Acentralizer group if |Acent(G)| =n. We show that for any natural number n, there exists a finite n-Acentralizer group and determine the structure of finite n-Acentralizer groups for n ≤ 5.     

On a Function Related to Multinomial Coefficients (I)

Let F _p,t (n) denote the number of the coefficients of (x ₁+1x ₂+...+x _t ) ^j , 0 ≤j≤n− 1, which are not divisible by the prime p. Define G _p,t (n) = F _p,t /n ^θ and β(p,t) = lim infF _p,t )(n)/n ^θ, where θ = (log)/(log p). In this paper, we mainly prove that G _p,t can be extended to a continuous function on ℝ⁺, and the function G _p,t is nowhere monotonic. Both the set of differential points of the function G _p,t and the set of non-differential points of the function G _p,t are dense in ℝ⁺. Received February 18, 2000, Accepted December 7, 2000