Semistability of Frobenius Direct Image of Representations of Cotangent Bundles

Let k be an algebraically closed field of characteristic p > 0, X a smooth projective variety over k with a fixed ample divisor H, F_X : X → X the absolute Frobenius morphism on X. Let E be a rational GL_n(k)-bundle on X, and ρ : GL_n(k) → GL_m(k) a rational GL_n(k)-representation of degree at most d such that ρ maps the radical RGL_n(k)) of GL_n(k) into the radical R(GL_m(k)) of GL_m(k). We show that if \(F_X^{N*}(E)\) is semistable for some integer \(N \ge {\max {_{0 < r < m}}}(_r^m) \cdot {\log _p}(dr)\), then the induced rational GL_m(k)-bundle E(GL_m(k)) is semistable. As an application, if dimX = n, we get a sufficient condition for the semistability of Frobenius direct image \(F_{X*}(\rho*(\Omega_X^1))\), where \(\rho*(\Omega_X^1)\) is the vector bundle obtained from \(\Omega_X^1\) via the rational representation ρ.     

Super (<Emphasis Type="Italic">a</Emphasis>, <Emphasis Type="Italic">d</Emphasis>)-edge-antimagic total labelings of complete bipartite graphs

An (a, d)-edge-antimagic total labeling of a graph G is a bijection f from V(G) ∪ E(G) onto {1, 2,…,|V(G)| + |E(G)|} with the property that the edge-weight set {f(x) + f(xy) + f(y) | xy ∈ E(G)} is equal to {a, a + d, a + 2d,...,a + (|E(G)| ? 1)d} for two integers a > 0 and d ? 0. An (a, d)-edge-antimagic total labeling is called super if the smallest possible labels appear on the vertices. In this paper, we completely settle the problem of the super (a, d)-edge-antimagic total labeling of the complete bipartite graph K_m,n and obtain the following results: the graph K_m,n has a super (a, d)-edge-antimagic total labeling if and only if either (i) m = 1, n = 1, and d ? 0, or (ii) m = 1, n ? 2 (or n = 1 and m ? 2), and d ∈ {0, 1, 2}, or (iii) m = 1, n = 2 (or n = 1 and m = 2), and d = 3, or (iv) m, n ? 2, and d = 1.     

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

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.     

Fast Algorithm of Square Rooting in Some Finite Fields of Odd Characteristic

It was proved that the complexity of square root computation in the Galois field GF(3^s), s = 2^kr, is equal to O(M(2^k)M(r)k + M(r) log₂r) + 2^kkr^1+o(1), where M (n) is the complexity of multiplication of polynomials of degree n over fields of characteristics 3. The complexity of multiplication and division in the field GF(3^s) is equal to O(M(2^k)M(r)) and O(M(2^k)M(r)) + r^1+o(1), respectively. If the basis in the field GF(3^r) is determined by an irreducible binomial over GF(3) or is an optimal normal basis, then the summands 2^kkr^1+o(1) and r^1+o(1) can be omitted. For M(n) one may take n log₂nψ(n) where ψ(n) grows slower than any iteration of the logarithm. If k grow and r is fixed, than all the estimates presented here have the form O_r (M (s) log ₂s) = s (log ₂s)²ψ(s).     

Representations of the general linear group over symmetry classes of polynomials

Let V be the complex vector space of homogeneous linear polynomials in the variables x₁,..., x _m . Suppose G is a subgroup of S _m , and χ is an irreducible character of G. Let H _d (G, χ) be the symmetry class of polynomials of degree d with respect to G and χ.

For any linear operator T acting on V, there is a (unique) induced operator K _χ (T) ∈ End(H _d (G, χ)) acting on symmetrized decomposable polynomials by

$${K_\chi }\left( T \right)\left( {{f_1} * {f_2} * \cdots * {f_d}} \right) = T{f_1} * T{f_2} * \cdots * T{f_d}.$$

In this paper, we show that the representation T ? K _χ (T) of the general linear group GL(V) is equivalent to the direct sum of χ(1) copies of a representation (not necessarily irreducible) T ? B _χ ^G (T).

     

Linear preservers of row-dense matrices

Let M_m,n be the set of all m × n real matrices. A matrix A ∈ M_m,n is said to be row-dense if there are no zeros between two nonzero entries for every row of this matrix. We find the structure of linear functions T: M_m,n → M_m,n that preserve or strongly preserve row-dense matrices, i.e., T(A) is row-dense whenever A is row-dense or T(A) is row-dense if and only if A is row-dense, respectively. Similarly, a matrix A ∈ M_n,m is called a column-dense matrix if every column of A is a column-dense vector. At the end, the structure of linear preservers (strong linear preservers) of column-dense matrices is found.     

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

On dihedrants admitting arc-regular group actions

We consider Cayley graphs Γ over dihedral groups, dihedrants for short, which admit an automorphism group G acting regularly on the arc set of Γ. We prove that, if D _2n ≤G≤Aut(Γ) is a regular dihedral subgroup of G of order 2n such that any of its index 2 cyclic subgroups is core-free in G, then Γ belongs to the family of graphs of the form \((K_{n_{1}}\otimes\cdots\otimes K_{n_{\ell}})[K_{m}^{\mathrm{c}}]\), where 2n=n ₁???n _? m, and the numbers n _i are pairwise coprime. Applications to 1-regular dihedrants and Cayley maps on dihedral groups are also given.     

On the Characterizability of the Automorphism Groups of Sporadic Simple Groups by Their Element Orders

For G a finite group, π _e (G) denotes the set of orders of elements in G. If Ω is a subset of the set of natural numbers, h(Ω) stands for the number of isomorphism classes of finite groups with the same set Ω of element orders. We say that G is k-distinguishable if h(π _e (G)) = k < ∞, otherwise G is called non-distinguishable. Usually, a 1-distinguishable group is called a characterizable group. It is shown that if M is a sporadic simple group different from M ₁₂, M ₂₂, J ₂, He, Suz, M ^c L and O′N, then Aut(M) is characterizable by its element orders. It is also proved that if M is isomorphic to M ₁₂, M ₂₂, He, Suz or O′N, then h(π _e (Aut(M))) ∈¸ {1,∞}.     

Distance domination of generalized de Bruijn and Kautz digraphs

Let G = (V,A) be a digraph and k ≥ 1 an integer. For u, v ∈ V, we say that the vertex u distance k-dominate v if the distance from u to v at most k. A set D of vertices in G is a distance k-dominating set if each vertex of V D is distance k-dominated by some vertex of D. The distance k-domination number of G, denoted by γ _k (G), is the minimum cardinality of a distance k-dominating set of G. Generalized de Bruijn digraphs G _B (n, d) and generalized Kautz digraphs G _K (n, d) are good candidates for interconnection networks. Denote Δ _k := (∑ _j=0 ^k d ^j )^?1. F. Tian and J. Xu showed that ?nΔ _k ? γ _k (G _B (n, d)) ≤?n/d ^k? and ?nΔ _k ? ≤ γ _k (G _K (n, d)) ≤ ?n/d ^k ?. In this paper, we prove that every generalized de Bruijn digraph G _B (n, d) has the distance k-domination number ?nΔ _k ? or ?nΔ _k ?+1, and the distance k-domination number of every generalized Kautz digraph G _K (n, d) bounded above by ?n/(d ^k?1+d ^k )?. Additionally, we present various sufficient conditions for γ _k (G _B (n, d)) = ?nΔ _k ? and γ _k (G _K (n, d)) = ?nΔ _k ?.     

Properties of element orders in covers for L<Subscript>n</Subscript>(<Emphasis Type="Italic">q</Emphasis>) and U<Subscript>n</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

We show that if a finite simple group G, isomorphic to PSL_n(q) or PSU_n(q) where either n ≠ 4 or q is prime or even, acts on a vector space over a field of the defining characteristic of G; then the corresponding semidirect product contains an element whose order is distinct from every element order of G. We infer that the group PSL_n(q), n ≠ 4 or q prime or even, is recognizable by spectrum from its covers thus giving a partial positive answer to Problem 14.60 from the Kourovka Notebook.     

On a classical theorem on the diameter and minimum degree of a graph

In this work, we obtain good upper bounds for the diameter of any graph in terms of its minimum degree and its order, improving a classical theorem due to Erd¨os, Pach, Pollack and Tuza.We use these bounds in order to study hyperbolic graphs(in the Gromov sense). To compute the hyperbolicity constant is an almost intractable problem, thus it is natural to try to bound it in terms of some parameters of the graph. Let H(n, δ_0) be the set of graphs G with n vertices and minimum degree δ_0, and J(n, Δ) be the set of graphs G with n vertices and maximum degree Δ. We study the four following extremal problems on graphs: a(n, δ_0) = min{δ(G) | G ∈ H(n, δ_0)}, b(n, δ_0) = max{δ(G) |G ∈ H(n, δ_0)}, α(n, Δ) = min{δ(G) | G ∈ J(n, Δ)} and β(n, Δ) = max{δ(G) | G ∈ J(n, Δ)}. In particular, we obtain bounds for b(n, δ_0) and we compute the precise value of a(n, δ_0), α(n, Δ) andβ(n, Δ) for all values of n, δ_0 and Δ, respectively.     

Peixoto graph of Morse-Smale diffeomorphisms on manifolds of dimension greater than three

Let M ⁿ be a closed orientable manifold of dimension greater than three and G ₁(M ⁿ ) be the class of orientation-preserving Morse-Smale diffeomorphisms on M ⁿ such that the set of unstable separatrices of every f ∈ G ₁(M ⁿ ) is one-dimensional and does not contain heteroclinic orbits. We show that the Peixoto graph is a complete invariant of topological conjugacy in G ₁(M ⁿ ).     

Length-type parameters of finite groups with almost unipotent automorphisms

Let α be an automorphism of a finite group G. For a positive integer n, let E _G,n (α) be the subgroup generated by all commutators [...[[x,α],α],…,α] in the semidirect product G 〈α〉 over x ∈ G, where α is repeated n times. By Baer’s theorem, if E _G,n (α)=1, then the commutator subgroup [G,α] is nilpotent. We generalize this theorem in terms of certain length parameters of E _G,n (α). For soluble G we prove that if, for some n, the Fitting height of E _G,n (α) is equal to k, then the Fitting height of [G,α] is at most k + 1. For nonsoluble G the results are in terms of the nonsoluble length and generalized Fitting height. The generalized Fitting height h*(H) of a finite group H is the least number h such that F _h* (H) = H, where F ₀* (H) = 1, and F _i+1* (H) is the inverse image of the generalized Fitting subgroup F*(H/F _i *(H)). Let m be the number of prime factors of the order |α| counting multiplicities. It is proved that if, for some n, the generalized Fitting height E _G,n (α) of is equal to k, then the generalized Fitting height of [G,α] is bounded in terms of k and m. The nonsoluble length λ(H) of a finite group H is defined as the minimum number of nonsoluble factors in a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. It is proved that if λE _G,n (α)= k, then the nonsoluble length of [G,α] is bounded in terms of k and m. We also state conjectures of stronger results independent of m and show that these conjectures reduce to a certain question about automorphisms of direct products of finite simple groups.     

<Emphasis Type="Bold">K</Emphasis><Subscript>0</Subscript> of Semiartinian Von Neumann Regular Rings. Direct Finiteness Versus Unit-Regularity

If R is a regular and semiartinian ring, it is proved that the following conditions are equivalent: (1) R is unit-regular, (2) every factor ring of R is directly finite, (3) the abelian group K _O(R) is free and admits a basis which is in a canonical one to one correspondence with a set of representatives of simple right R-modules. For the class of semiartinian and unit-regular rings the canonical partial order of K _O(R) is investigated. Starting from any partially ordered set I, a special dimension group G(I) is built and a large class of semiartinian and unit-regular rings is shown to have the corresponding K _O(R) order isomorphic to G(P r i m _R ), where P r i m _R is the primitive spectrum of R. Conversely, if I is an artinian partially ordered set having a finite cofinal subset, it is proved that the dimension group G(I) is realizable as K _O(R) for a suitable semiartinian and unit-regular ring R.     

Engel-type subgroups and length parameters of finite groups

Let g be an element of a finite group G. For a positive integer n, let E _n (g) be the subgroup generated by all commutators [...[[x, g], g],..., g] over x ∈ G, where g is repeated n times. By Baer’s theorem, if E _n (g) = 1, then g belongs to the Fitting subgroup F(G). We generalize this theorem in terms of certain length parameters of E _n (g). For soluble G we prove that if, for some n, the Fitting height of E _n (g) is equal to k, then g belongs to the (k+1)th Fitting subgroup F_k+1(G). For nonsoluble G the results are in terms of nonsoluble length and generalized Fitting height. The generalized Fitting height h*(H) of a finite group H is the least number h such that F_h* (H) = H, where F₀* (H) = 1, and F_i+1(H)* is the inverse image of the generalized Fitting subgroup F*(H/F*_i (H)). Let m be the number of prime factors of |g| counting multiplicities. It is proved that if, for some n, the generalized Fitting height of E _n (g) is equal to k, then g belongs to F*_f(k,m)(G), where f(k, m) depends only on k and m. The nonsoluble length λ(H) of a finite group H is defined as the minimum number of nonsoluble factors in a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. It is proved that if λ(E _n (g)) = k, then g belongs to a normal subgroup whose nonsoluble length is bounded in terms of k and m. We also state conjectures of stronger results independent of m and show that these conjectures reduce to a certain question about automorphisms of direct products of finite simple groups.     

Non-generic unramified representations in metaplectic covering groups

Let G^(r) denote the metaplectic covering group of the linear algebraic group G. In this paper we study conditions on unramified representations of the group G^(r) not to have a nonzero Whittaker function. We state a general Conjecture about the possible unramified characters χ such that the unramified subrepresentation of \(Ind_{{B^{\left( r \right)}}}^{{G^{\left( r \right)}}}{X^{\delta _B^{1/2}}}\) will have no nonzero Whittaker function. We prove this Conjecture for the groups GL _n ^{( r)} with r ≥ n ? 1, and for the exceptional groups G ₂ ^{( r)} when r ≠ 2.     

(<Emphasis Type="Italic">m</Emphasis>,<Emphasis Type="Italic">r</Emphasis>)-central Riordan arrays and their applications

For integers m > r ≥ 0, Brietzke (2008) defined the (m, r)-central coefficients of an infinite lower triangular matrix G = (d, h) = (d_n,k)_n,k∈N as d_{mn+r,(m?1)n+r}, with n = 0, 1, 2,..., and the (m, r)-central coefficient triangle of G as

$${G^{\left( {m,r} \right)}} = {\left( {{d_{mn + r,\left( {m - 1} \right)n + k + r}}} \right)_{n,k \in \mathbb{N}}}.$$

It is known that the (m, r)-central coefficient triangles of any Riordan array are also Riordan arrays. In this paper, for a Riordan array G = (d, h) with h(0) = 0 and d(0), h′(0) ≠ 0, we obtain the generating function of its (m, r)-central coefficients and give an explicit representation for the (m, r)-central Riordan array G^(m,r) in terms of the Riordan array G. Meanwhile, the algebraic structures of the (m, r)-central Riordan arrays are also investigated, such as their decompositions, their inverses, and their recessive expressions in terms of m and r. As applications, we determine the (m, r)-central Riordan arrays of the Pascal matrix and other Riordan arrays, from which numerous identities are constructed by a uniform approach.

     

Designs associated with maximum independent sets of a graph

A (v, β _o , μ)-design over regular graph G = (V, E) of degree d is an ordered pair D = (V, B), where |V| = v and B is the set of maximum independent sets of G called blocks such that if i, j ∈ V, i ≠ j and if i and j are not adjacent in G then there are exactly μ blocks containing i and j. In this paper, we study (v, β _o , μ)-designs over the graphs K _n × K _n , T(n)-triangular graphs, L ₂(n)-square lattice graphs, Petersen graph, Shrikhande graph, Clebsch graph and the Schläfli graph and non-existence of (v, β _o , μ)-designs over the three Chang graphs T ₁(8), T ₂(8) and T ₃(8).