On the abelianizations of congruence subgroups of Aut(<Emphasis Type="Italic">F</Emphasis><Subscript>2</Subscript>)

Let F _n be the free group of rank n, and let Aut⁺(F _n ) be its special automorphism group. For an epimorphism π : F _n → G of the free group F _n onto a finite group G we call the standard congruence subgroup of Aut⁺(F _n ) associated to G and π. In the case n = 2 we fully describe the abelianization of Γ⁺(G, π) for finite abelian groups G. Moreover, we show that if G is a finite non-perfect group, then Γ⁺(G, π) ≤ Aut⁺(F ₂) has infinite abelianization.     

On the torsion in K_2 of a field

For a field F,let Gn(F) = {{a,Φn(a)} ∈ K2(F) | a,Φn(a) ∈ F*},where Φn(x) is the n-th cyclotomic polynomial.At first,by using Faltings' theorem on Mordell conjecture it is proved that if F is a number field and if n = 4,8,12 is a positive integer having a square factor then Gn(F) is not a subgroup of K2(F),and then by using the results of Manin,Grauert,Samuel and Li on Mordell conjecture theorem for function fields,a similar result is established for function fields over an algebraically closed field.     

Some Elements of Finite Order in K2Q

Let K2 be the Milnor functor and let Фn （x）∈ Q[X] be the n-th cyclotomic polynomial. Let Gn（Q） denote a subset consisting of elements of the form {a, Фn（a）}, where a ∈ Q^＊ and {, } denotes the Steinberg symbol in K2Q. J. Browkin proved that Gn（Q） is a subgroup of K2Q if n = 1,2, 3, 4 or 6 and conjectured that Gn（Q） is not a group for any other values of n. This conjecture was confirmed for n =2^T 3S or n = p^r, where p ≥ 5 is a prime number such that h（Q（ζp）） is not divisible by p. In this paper we confirm the conjecture for some n, where n is not of the above forms, more precisely, for n = 15, 21,33, 35, 60 or 105.     

Note making a <Emphasis Type="Italic">K</Emphasis><Subscript>4</Subscript>-free graph bipartite

We show that every K ₄-free graph G with n vertices can be made bipartite by deleting at most n ²/9 edges. Moreover, the only extremal graph which requires deletion of that many edges is a complete 3-partite graph with parts of size n/3. This proves an old conjecture of P. Erdős. Research supported in part by NSF CAREER award DMS-0546523, NSF grant DMS-0355497, USA-Israeli BSF grant, and by an Alfred P. Sloan fellowship.     

Characterization of finite simple group <Emphasis Type="Italic">D</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>(2)

Let G be a finite group, and let π _e (G) be the spectrum of G, that is, the set of all element orders of G. In 1987, Shi Wujie put forward the following conjecture. If G is a finite group and M is a non-abelian simple group, then G ≅ M if and only if |G| = |M| and π _e (G) = π _e (M). In this short paper, we prove that if G is a finite group, then G ≅ M if and only if |G| = |M| and π _e (G) = π _e (M), where M = D _n (2) and n is even.     

Kostka-Foulkes Polynomials Cyclage Graphs and Charge Statistic for the Root System <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

We establish a Morris type recurrence formula for the root system C_n. Next we introduce cyclage graphs for the corresponding Kashiwara-Nakashimas tableaux and use them to define a charge statistic. Finally we conjecture that this charge may be used to compute the Kostka-Foulkes polynomials for type C_n.     

Coxeter group actions on <Subscript>4</Subscript><Emphasis Type="Italic">F</Emphasis><Subscript>3</Subscript>(1) hypergeometric series

In this paper we investigate a certain linear combination K([(x)\vec])=K(a;b,c,d;e,f,g)K(\vec{x})=K(a;b,c,d;e,f,g) of two Saalschutzian hypergeometric series of type ₄ F ₃(1). We first show that K([(x)\vec])K(\vec{x}) is invariant under the action of a certain matrix group G _K , isomorphic to the symmetric group S ₆, acting on the affine hyperplane V={(a,b,c,d,e,f,g)∈ℂ⁷:e+f+g−a−b−c−d=1}. We further develop an algebra of three-term relations for K(a;b,c,d;e,f,g). We show that, for any three elements μ ₁,μ ₂,μ ₃ of a certain matrix group M _K , isomorphic to the Coxeter group W(D ₆) (of order 23040) and containing the above group G _K , there is a relation among K(m₁[(x)\vec])K(\mu_{1}\vec{x}), K(m₂[(x)\vec])K(\mu_{2}\vec{x}), and K(m₃[(x)\vec])K(\mu_{3}\vec{x}), provided that no two of the μ _j ’s are in the same right coset of G _K in M _K . The coefficients in these three-term relations are seen to be rational combinations of gamma and sine functions in a,b,c,d,e,f,g.     

Many-Particle Models with Two Constants of Interaction

We discuss integrable models of quantum field theory and statistical mechanics. The dynamics and kinematics of these models are defined by Hamiltonians with symmetries determined by Lie algebras. The paper is devoted to the characterization of models such that the root vectors of their symmetry algebras run two orbits under the action of the Weyl group. Such properties possess root systems of the type B _N , C _N , and G ₂. The main focus is on models with the symmetry of algebras B _N . In this case the main characteristics of the process are obtained from the system of Yang-Baxter equation and the reflection equations.We consider the Calogero-Moser and Calogero-Sutherland models and also the formalisms of the Lax and Dunkl operators. The connection between these formalisms and method of describing these models in terms of the generalized Knizhnik-Zamolodchikov equations with the system of roots of the type B _N by the example of the Gaudin model with reflection are discussed. Examples of many-particle systems that interact with each other with reflections are presented.__________Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 10, Suzdal Conference-4, 2003.     

A New Method for Finding the Characteristic Roots of E<Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>/E<Subscript><Emphasis Type="Italic">m</Emphasis></Subscript>/1 Queues

In 1953, Smith (Proc Camb Philos Soc 49:449–461, 1953), and, following him, Syski (1960) suggested a method to find the waiting time distribution for one server queues with Erlang-n arrivals and Erlang-m service times by using characteristic roots. Syski shows that these roots can be determined from a very simple equation, but an equation of degree n + m. Syski also shows that almost all of the characteristic roots are complex. In this paper, we derive a set of equations, one for each complex root, which can be solved by Newton’s method using real arithmetic. This method simplifies the programming logic because it avoids deflation and the subsequent polishing of the roots. Using the waiting time distribution, Syski then derived the distribution of the number in the system after a departure. E _n /E _m /1 queues can also formulated as quasi birth-death (QBD) processes, and in this case, the characteristic roots discussed by Syski are closely related to the eigenvalues of the QBD process. The QBD process provides information about the number in system at random times, but they are much more difficult to formulate and solve.     

Uniquely <Emphasis Type="Italic">C</Emphasis><Subscript>4</Subscript>-Saturated Graphs

For a fixed graph H, a graph G is uniquely H-saturated if G does not contain H, but the addition of any edge from [`(G)]{\overline{G}} to G completes exactly one copy of H. Using a combination of algebraic methods and counting arguments, we determine all the uniquely C ₄-saturated graphs; there are only ten of them.     

Degree sum of a pair of independent edges and <Emphasis Type="Italic">Z</Emphasis><Subscript>3</Subscript>-connectivity

Let G be a 2-edge-connected simple graph on n vertices. For an edge e = uv ∈ E(G), define d(e) = d(u) + d(v). Let F denote the set of all simple 2-edge-connected graphs on n ≥ 4 vertices such that G ∈ F if and only if d(e) + d(e’) ≥ 2n for every pair of independent edges e, e’ of G. We prove in this paper that for each G ∈ F, G is not Z ₃-connected if and only if G is one of K _2,n?2, K _3,n?3, K _2,n?2 ⁺ , K _3,n?3 ⁺ or one of the 16 specified graphs, which generalizes the results of X. Zhang et al. [Discrete Math., 2010, 310: 3390–3397] and G. Fan and X. Zhou [Discrete Math., 2008, 308: 6233–6240].     

Representations of algebraic groups of type <Emphasis Type="Italic">D</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> in characteristic 2 with small weight multiplicities

Lower estimates for the mazimal weight multiplicities in irreducible representations of algebraic groups of type D _n in characteristic 2 are found. lf n ≥ 8, then either such a multiplicity is at least n—4— [n]₄, where [n]₄ is the residue of n modulo 4, or all of its weight multiplicities arc equal to 1. For groups of types B _n and D _n in odd characteristic and of type C _n , in characteristics greater than 7, similar results were obtained earlier. Bibliography: 11 titles.     

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.     

On hamiltonicity of <Emphasis Type="Italic">P</Emphasis><Subscript>3</Subscript>-dominated graphs

We introduce a new class of graphs which we call P ₃-dominated graphs. This class properly contains all quasi-claw-free graphs, and hence all claw-free graphs. Let G be a 2-connected P ₃-dominated graph. We prove that G is hamiltonian if α(G ²) ≤ κ(G), with two exceptions: K _2,3 and K _1,1,3. We also prove that G is hamiltonian, if G is 3-connected and |V(G)| ≤ 5δ(G) − 5. These results extend known results on (quasi-)claw-free graphs. This paper was completed when both authors visited the Center for Combinatorics, Nankai University, Tianjin. They gratefully acknowledge the hospitality and support of the Center for Combinatorics and Nankai University. The work of E.Vumar is sponsored by SRF for ROCS, REM.     

Note edge-colourings of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n,n</Emphasis></Subscript> with no long two-coloured cycles

Consider the set of all proper edge-colourings of a graph G with n colours. Among all such colourings, the minimum length of a longest two-coloured cycle is denoted L(n, G). The problem of understanding L(n, G) was posed by Häggkvist in 1978 and, specifically, L(n, K _n,n ) has received recent attention. Here we construct, for each prime power q ≥ 8, an edge-colouring of K _n,n with n colours having all two-coloured cycles of length ≤ 2q ², for integers n in a set of density 1 ? 3/(q ? 1). One consequence is that L(n, K _n,n ) is bounded above by a polylogarithmic function of n, whereas the best known general upper bound was previously 2n ? 4.     

The Number of Spanning Trees in <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>-Complements of Quasi-Threshold Graphs

In this paper we examine the classes of graphs whose K_n-complements are trees or quasi-threshold graphs and derive formulas for their number of spanning trees; for a subgraph H of K_n, the K_n-complement of H is the graph K_n–H which is obtained from K_n by removing the edges of H. Our proofs are based on the complement spanning-tree matrix theorem, which expresses the number of spanning trees of a graph as a function of the determinant of a matrix that can be easily constructed from the adjacency relation of the graph. Our results generalize previous results and extend the family of graphs of the form K_n–H admitting formulas for the number of their spanning trees.Final version received: March 18, 2004     

On the b-Coloring of Cographs and <Emphasis Type="Italic">P</Emphasis><Subscript>4</Subscript>-Sparse Graphs

A b-coloring of a graph is a coloring such that every color class admits a vertex adjacent to at least one vertex receiving each of the colors not assigned to it. The b-chromatic number of a graph G, denoted by χ _b (G), is the maximum number t such that G admits a b-coloring with t colors. A graph G is b-continuous if it admits a b-coloring with t colors, for every . We define a graph G to be b-monotonic if χ _b (H ₁) ≥ χ _b (H ₂) for every induced subgraph H ₁ of G, and every induced subgraph H ₂ of H ₁. In this work, we prove that P ₄-sparse graphs (and, in particular, cographs) are b-continuous and b-monotonic. Besides, we describe a dynamic programming algorithm to compute the b-chromatic number in polynomial time within these graph classes. Flavia Bonomo: Partially supported by ANPCyT PICT-2007-00533 and PICT-2007-00518, and UBACyT Grants X069 and X606 (Argentina). Guillermo Durán: Partially supported by FONDECyT Grant 1080286 and Millennium Science Institute “Complex Engineering Systems” (Chile), and ANPCyT PICT-2007-00518 and UBACyT Grant X069 (Argentina). Javier Marenco: Partially supported by ANPCyT PICT-2007-00518 and UBACyT Grant X069 (Argentina).     

Representations of algebraic groups of type <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> with small weight multiplicities

Lower estimates for the maximal weight multiplicities in irreducible representations of the algebraic groups of type C _n in characteristic p ≤ 7 are found. If n ≥ 8 and p ≠ 2 , then for an irreducible representation either such a multiplicity is at least n− 4 − [n]₄,where [n]₄ is the residue of n modulo 4, or all the weight multiplicities are equal to 1.For p = 2, the situation is more complicated, and for every n and l there exists a class of representations with the maximal weight multiplicity equal to 2 ^l . For symplectic groups in characteristic p > 7 and spinor groups similar results were obtained earlier. Bibliography: 15 titles.     

Towards the Hurwitz Generation of G<Subscript>sc</Subscript>(E<Subscript>6</Subscript>, <Emphasis Type="Italic">q</Emphasis>)

The paper is devoted to the problem concerning the Hurwitz generation of the group G_sc(E₆, q). All possibilities for Hurwitz generators, except for just one, are excluded. Bibliography: 25 titles.__________Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 305, 2003, pp. 228–237.