Weighted enumerations on projective reflection groups

Projective reflection groups have been recently defined by the second author. They include a special class of groups denoted G(r,p,s,n) which contains all classical Weyl groups and more generally all the complex reflection groups of type G(r,p,n). In this paper we define some statistics analogous to descent number and major index over the projective reflection groups G(r,p,s,n), and we compute several generating functions concerning these parameters. Some aspects of the representation theory of G(r,p,s,n), as distribution of one-dimensional characters and computation of Hilbert series of invariant algebras, are also treated.     

Reflection subgroups and sub-root systems of the imprimitive complex reflection groups

Based on a graph-theoretic analysis, we determine all the irreducible reflection subgroups of the imprimitive complex reflection groups G(m, p, n), and describe the irreducible subsystems of all possible types in the root system R(m, p, n) of G(m, p, n).     

Extensions and the Induced Characters of Cyclic p-Groups

For a prime p, we denote by B_n the cyclic group of order pⁿ. Let φ be a faithful irreducible character of B_n, where p is an odd prime. We study the p-group G containing B_n such that the induced character φ^G is also irreducible. The purpose of this article is to determine the subgroup N_G(N_G(B_n)) of G under the hypothesis [N_G(B_n):B_n]⁴ ≦ pⁿ.     

On upper domination Ramsey numbers for graphs

The classical Ramsey number r(m,n) can be defined as the smallest integer p such that in every two-coloring (R,B) of the edges of K_p, β(B)⩾m or β(R)⩾n, where β(G) denotes the independence number of a graph G. We define the upper domination Ramsey number u(m,n) as the smallest integer p such that in every two-coloring (R,B) of the edges of K_p, Γ(B)⩾m or Γ(R)⩾n, where Γ(G) is the maximum cardinality of a minimal dominating set of a graph G. The mixed domination Ramsey number v(m,n) is defined to be the smallest integer p such that in every two-coloring (R,B) of the edges of K_p, Γ(B)⩾m or β(R)⩾n. Since β(G)⩽Γ(G) for every graph G, u(m,n)⩽v(m,n)⩽r(m,n). We develop techniques to obtain upper bounds for upper domination Ramsey numbers of the form u(3,n) and mixed domination Ramsey numbers of the form v(3,n). We show that u(3,3)=v(3,3)=6, u(3,4)=8, v(3,4)=9, u(3,5)=v(3,5)=12 and u(3,6)=v(3,6)=15.     

Topology of random clique complexes

In a seminal paper, Erd?s and Rényi identified a sharp threshold for connectivity of the random graph G(n,p). In particular, they showed that if p?logn/n then G(n,p) is almost always connected, and if p?logn/n then G(n,p) is almost always disconnected, as n→∞.The clique complexX(H) of a graph H is the simplicial complex with all complete subgraphs of H as its faces. In contrast to the zeroth homology group of X(H), which measures the number of connected components of H, the higher dimensional homology groups of X(H) do not correspond to monotone graph properties. There are nevertheless higher dimensional analogues of the Erd?s-Rényi Theorem.We study here the higher homology groups of X(G(n,p)). For k>0 we show the following. If p=n^α, with α<−1/k or α>−1/(2k+1), then the kth homology group of X(G(n,p)) is almost always vanishing, and if −1/k<α<−1/(k+1), then it is almost always nonvanishing.We also give estimates for the expected rank of homology, and exhibit explicit nontrivial classes in the nonvanishing regime. These estimates suggest that almost all d-dimensional clique complexes have only one nonvanishing dimension of homology, and we cannot rule out the possibility that they are homotopy equivalent to wedges of a spheres.     

Nonsoluble length of finite groups with restrictions on Sylow subgroups

By 𝔛(n) we denote the variety of all groups satisfying the law [x,y]ⁿ≡1, that is, groups with commutators of order dividing n. Let p be a prime and G a finite group whose Sylow p-subgroups have normal series of length k all of whose quotients belong to 𝔛(n). We show that the non-p-soluble length λ_p(G) of G is bounded in terms of k and n only (Theorem 1.2). In the case where p is odd, a stronger result is obtained (Theorem 1.3).     

Groups with the same prime graph as the orthogonal group B n (3)

Let G be a finite group. The prime graph of G is denoted by Γ(G). It is proved in [1] that if G is a finite group such that Γ(G) = Γ(B _p (3)), where p > 3 is an odd prime, then G ? B _p (3) or C _p (3). In this paper we prove the main result that if G is a finite group such that Γ(G) = Γ(B _n (3)), where n ≥ 6, then G has a unique nonabelian composition factor isomorphic to B _n (3) or C _n (3). Also if Γ(G) = Γ(B ₄(3)), then G has a unique nonabelian composition factor isomorphic to B ₄(3), C ₄(3), or ² D ₄(3). It is proved in [2] that if p is an odd prime, then B _p (3) is recognizable by element orders. We give a corollary of our result, generalize the result of [2], and prove that B _2k+1(3) is recognizable by the set of element orders. Also the quasirecognition of B _2k (3) by the set of element orders is obtained.     

Odd prime values of the Ramanujan tau function

We study the odd prime values of the Ramanujan tau function, which form a thin set of large primes. To this end, we define LR(p,n):=τ(p ^n?1) and we show that the odd prime values are of the form LR(p,q) where p,q are odd primes. Then we exhibit arithmetical properties and congruences of the LR numbers using more general results on Lucas sequences. Finally, we propose estimations and discuss numerical results on pairs (p,q) for which LR(p,q) is prime.     

Polynomials on graphs

Let G be a simple graph with adjacency matrix A, and p(x) a polynomial with rational coefficients. If p(A) is the adjacency matrix of a graph, we denote that graph by p(G). We consider the question: Given a graph G, which polynomials p(x) give rise to a graph p(G) and what are those graphs? We give a complete answer if G is a distance-regular graph. We then derive some general relations between the polynomials p(x), the spectrum of A, and the automorphism group of G.     

Colored-descent representations of complex reflection groups <Emphasis Type="Italic">G</Emphasis>(<Emphasis Type="Italic">r,p, n</Emphasis>)

We study the complex reflection groups G(r, p, n). By considering these groups as subgroups of the wreath products , and by using Clifford theory, we define combinatorial parameters and descent representations of G(r, p, n), previously known for classical Weyl groups. One of these parameters is the flag major index, which also has an important role in the decomposition of these representations into irreducibles. A Carlitz type identity relating the combinatorial parameters with the degrees of the group, is presented.     

Optimal Embeddings of Spaces of Generalized Smoothness in the Critical Case

We study necessary and sufficient conditions for embeddings of Besov and Triebel-Lizorkin spaces of generalized smoothness B^(n/p,Y)_p,q(\mathbbRⁿ)B^{(n/p,\Psi)}_{p,q}(\mathbb{R}^{n}) and F^(n/p,Y)_p,q(\mathbbRⁿ)F^{(n/p,\Psi)}_{p,q}(\mathbb{R}^{n}), respectively, into generalized H?lder spaces L_￥,r^m(·)( \mathbb Rⁿ)\Lambda_{\infty,r}^{\mu(\cdot)}(\ensuremath {\ensuremath {\mathbb {R}}^{n}}). In particular, we are able to characterize optimal embeddings for this class of spaces provided q>1. These results improve the embedding assertions given by the continuity envelopes of B^(n/p,Y)_p,q(\mathbbRⁿ)B^{(n/p,\Psi)}_{p,q}(\mathbb{R}^{n}) and F^(n/p,Y)_p,q(\mathbbRⁿ)F^{(n/p,\Psi)}_{p,q}(\mathbb{R}^{n}), which were obtained recently solving an open problem of D.D. Haroske in the classical setting.     

Relèvements des revêtements de courbes faiblement ramifiés

Let X be a smooth projective curve over a perfect field of characteristic p>0 and G a finite group of automorphism of X. Let ν(X,G) be the characteristic of the versal equivariant deformation ring R(X,G) of (X,G). When the ramification is weak (i.e., all second ramification groups are trivial), we prove that ν(X,G) ∈ {0,p} and we compute R(X,G).

---

Résumé Soit X une courbe projective lisse sur un corps parfait de caractéristique p>0 et G un groupe fini d'automorphismes de X. Nous considérons la caractéristique ν(X,G) de l'anneau versel R(X,G) de déformations équivariantes de (X,G). Dans le cas d'une ramification faible (où tous les seconds groupes de ramification sont triviaux), nous démontrons que ν(X,G) ∈ {0,p} et nous calculons R(X,G).

     

Hopf Modules and Representations of Finite Wreath Products

For a finite group G and nonnegative integer n ≥ 0, one may consider the associated tower \(G \wr S_{n} := S_{n} \ltimes G^{n}\) of wreath product groups. Zelevinsky associated to such a tower the structure of a positive self-adjoint Hopf algebra (PSH-algebra) R(G) on the direct sum over integers n ≥ 0 of the Grothendieck groups K ₀(R e p?G?S _n ). In this paper, we study the interaction via induction and restriction of the PSH-algebras R(G) and R(H) associated to finite groups H ? G. A class of Hopf modules over PSH-algebras with a compatibility between the comultiplication and multiplication involving the Hopf k ^{t h} -power map arise naturally and are studied independently. We also give an explicit formula for the natural PSH-algebra morphisms R(H) → R(G) and R(G) → R(H) arising from induction and restriction. In an appendix, we consider a family of subgroups of wreath product groups analogous to the subgroups G(m, p, n) of the wreath product cyclotomic complex reflection groups G(m, 1, n).     

Binding number and minimum degree for the existence of (g,f,n)-critical graphs

Let G be a graph of order p. The binding number of G is defined as $\mbox{bind}(G):=\min\{\frac{|N_{G}(X)|}{|X|}\mid\emptyset\neq X\subseteq V(G)\,\,\mbox{and}\,\,N_{G}(X)\neq V(G)\}$ . Let g(x) and f(x) be two nonnegative integer-valued functions defined on V(G) with g(x)≤f(x) for any x∈V(G). A graph G is said to be (g,f,n)-critical if G?N has a (g,f)-factor for each N?V(G) with |N|=n. If g(x)≡a and f(x)≡b for all x∈V(G), then a (g,f,n)-critical graph is an (a,b,n)-critical graph. In this paper, several sufficient conditions on binding number and minimum degree for graphs to be (a,b,n)-critical or (g,f,n)-critical are given. Moreover, we show that the results in this paper are best possible in some sense.     

Periods in missing lengths of rainbow cycles

A cycle in an edge‐colored graph is said to be rainbow if no two of its edges have the same color. For a complete, infinite, edge‐colored graph G, define Then ??(G) is a monoid with respect to the operation n°m=n+ m?2, and thus there is a least positive integer π(G), the period of ??(G), such that ??(G) contains the arithmetic progression {N+ kπ(G)|k?0} for some sufficiently large N. Given that n∈??(G), what can be said about π(G)? Alexeev showed that π(G)=1 when n?3 is odd, and conjectured that π(G) always divides 4. We prove Alexeev's conjecture: Let p(n)=1 when n is odd, p(n)=2 when n is divisible by four, and p(n)=4 otherwise. If 2<n∈??(G) then π(G) is a divisor of p(n). Moreover, ??(G) contains the arithmetic progression {N+ kp(n)|k?0} for some N=O(n²). The key observations are: If 2<n=2k∈??(G) then 3n?8∈??(G). If 16≠n=4k∈??(G) then 3n?10∈??(G). The main result cannot be improved since for every k>0 there are G, H such that 4k∈??(G), π(G)=2, and 4k+ 2∈??(H), π(H)=4. © 2009 Wiley Periodicals, Inc. J Graph Theory     

A note on acyclic edge coloring of complete bipartite graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (2-colored) cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a^′(G). Let Δ=Δ(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by K_n,n. Alon, McDiarmid and Reed observed that a^′(K_p−1,p−1)=p for every prime p. In this paper we prove that a^′(K_p,p)≤p+2=Δ+2 when p is prime. Basavaraju, Chandran and Kummini proved that a^′(K_n,n)≥n+2=Δ+2 when n is odd, which combined with our result implies that a^′(K_p,p)=p+2=Δ+2 when p is an odd prime. Moreover we show that if we remove any edge from K_p,p, the resulting graph is acyclically Δ+1=p+1-edge-colorable.     

Set-theoretic complete intersection monomial curves in $${\mathbb{P}^n}$$

In this paper, we give a sufficient numerical criterion for a monomial curve in a projective space to be a set-theoretic complete intersection. Our main result generalizes a similar statement proven by Keum for monomial curves in three-dimensional projective space. We also prove that there are infinitely many set-theoretic complete intersection monomial curves in the projective n?space for any suitably chosen n ? 1 integers. In particular, for any positive integers p, q, where gcd(p, q) = 1, the monomial curve defined by p, q, r is a set-theoretic complete intersection for every \({r \geq pq( q - 1)}\).