Representations and cohomology for Frobenius-Lusztig kernels

Let U_ζ be the quantum group (Lusztig form) associated to the simple Lie algebra g, with parameter ζ specialized to an ?-th root of unity in a field of characteristic p>0. In this paper we study certain finite-dimensional normal Hopf subalgebras U_ζ(G_r) of U_ζ, called Frobenius-Lusztig kernels, which generalize the Frobenius kernels G_r of an algebraic group G. When r=0, the algebras studied here reduce to the small quantum group introduced by Lusztig. We classify the irreducible U_ζ(G_r)-modules and discuss their characters. We then study the cohomology rings for the Frobenius-Lusztig kernels and for certain nilpotent and Borel subalgebras corresponding to unipotent and Borel subgroups of G. We prove that the cohomology ring for the first Frobenius-Lusztig kernel is finitely-generated when g has type A or D, and that the cohomology rings for the nilpotent and Borel subalgebras are finitely-generated in general.     

Optimally small sumsets in finite abelian groups

Let G be a finite abelian group of order g. We determine, for all 1?r,s?g, the minimal size μ_G(r,s)=min|A+B| of sumsets A+B, where A and B range over all subsets of G of cardinality r and s, respectively. We do so by explicit construction. Our formula for μ_G(r,s) shows that this function only depends on the cardinality of G, not on its specific group structure. Earlier results on μ_G are recalled in the Introduction.     

Confidence intervals for marginal parameters under fractional linear regression imputation for missing data

Item nonresponse occurs frequently in sample surveys and other applications. Imputation is commonly used to fill in the missing item values in a random sample {Y_i;i=1,…,n}. Fractional linear regression imputation, based on the model with independent zero mean errors ?_i, is used to create one or more imputed values in the data file for each missing item Y_i, where {X_i,i=1,…,n}, is observed completely. Asymptotic normality of the imputed estimators of the mean μ=E(Y), distribution function θ=F(y) for a given y, and qth quantile θ_q=F^-1(q),0<q<1 is established, assuming that Y is missing at random (MAR) given X. This result is used to obtain normal approximation (NA)-based confidence intervals on μ,θ and θ_q. In the case of θ_q, a Bahadur-type representation and Woodruff-type confidence intervals are also obtained. Empirical likelihood (EL) ratios are also obtained and shown to be asymptotically scaled variables. This result is used to obtain asymptotically correct EL-based confidence intervals on μ,θ and θ_q. Results of a simulation study on the finite sample performance of NA-based and EL-based confidence intervals are reported.     

Cyclotomic Solomon algebras

This paper introduces an analogue of the Solomon descent algebra for the complex reflection groups of type G(r,1,n). As with the Solomon descent algebra, our algebra has a basis given by sums of ‘distinguished’ coset representatives for certain ‘reflection subgroups.’ We explicitly describe the structure constants with respect to this basis and show that they are polynomials in r. This allows us to define a deformation, or q-analogue, of these algebras which depends on a parameter q. We determine the irreducible representations of all of these algebras and give a basis for their radicals. Finally, we show that the direct sum of cyclotomic Solomon algebras is canonically isomorphic to a concatenation Hopf algebra.     

Strong law for the bootstrap

Let X₁, X₂, X₃, … be i.i.d. r.v. with E|X₁| < ∞, E X₁ = μ. Given a realization X = (X₁,X₂,…) and integers n and m, construct Y_n,i, i = 1, 2, …, m as i.i.d. r.v. with conditional distribution $\text{P}{}^1\text{(Y}{}_{\mathrm{n,i}}\text{= X}{}_{\mathrm{j}}\text{) =}\text{1}\text{n}$ for 1 ? j ? n. ($\text{P}{}^1$ denotes conditional distribution given X). Conditions relating the growth rate of m with n and the moments of X₁ are given to ensure the almost sure convergence of $\text{(}\text{1}\text{m}\text{)Σ}{}^{\mathrm{m}}{}_{\mathrm{i=1}}\text{Y}{}_{\mathrm{n,i}}$ toμ. This equation is of some relevance in the theory of Bootstrap as developed by Efron (1979) and Bickel and Freedman (1981).     

Integral trees of diameter 6

A graph G is called integral if all eigenvalues of its adjacency matrix A(G) are integers. In this paper, the trees T(p,q)•T(r,m,t) and K_1,s•T(p,q)•T(r,m,t) of diameter 6 are defined. We determine their characteristic polynomials. We also obtain for the first time sufficient and conditions for them to be integral. To do so, we use number theory and apply a computer search. New families of integral trees of diameter 6 are presented. Some of these classes are infinite. They are different from those in the existing literature. We also prove that the problem of finding integral trees of diameter 6 is equivalent to the problem of solving some Diophantine equations. We give a positive answer to a question of Wang et al. [Families of integral trees with diameters 4, 6 and 8, Discrete Appl. Math. 136 (2004) 349-362].     

Minimum Hellinger distance estimation in a two-sample semiparametric model

We investigate the estimation problem of parameters in a two-sample semiparametric model. Specifically, let X₁,…,X_n be a sample from a population with distribution function G and density function g. Independent of the X_i’s, let Z₁,…,Z_m be another random sample with distribution function H and density function h(x)=exp[α+r(x)β]g(x), where α and β are unknown parameters of interest and g is an unknown density. This model has wide applications in logistic discriminant analysis, case-control studies, and analysis of receiver operating characteristic curves. Furthermore, it can be considered as a biased sampling model with weight function depending on unknown parameters. In this paper, we construct minimum Hellinger distance estimators of α and β. The proposed estimators are chosen to minimize the Hellinger distance between a semiparametric model and a nonparametric density estimator. Theoretical properties such as the existence, strong consistency and asymptotic normality are investigated. Robustness of proposed estimators is also examined using a Monte Carlo study.     

New upper bounds for Estrada index of bipartite graphs

Suppose G is a graph and λ₁,λ₂,…,λ_n are the eigenvalues of G. The Estrada index EE(G) of G is defined as the sum of e^λ_i, 1≤i≤n. In this paper some new upper bounds for the Estrada index of bipartite graphs are presented. We apply our result on a (4,6)-fullerene to improve our bound given in an earlier paper.     

On the Steinhaus property in topological groups

Let G be a locally compact Abelian group and μ a Haar measure on G. We prove: (a) If G is connected, then the complement of a union of finitely many translates of subgroups of G with infinite index is μ-thick and everywhere of second category. (b) Under a simple (and fairly general) assumption on G, for every cardinal number m such that ℵ₀?m?|G| there is a subgroup of G of index m that is μ-thick and everywhere of second category. These results extend theorems by Muthuvel and Erd?s-Marcus, respectively. (b) also implies a recent theorem by Comfort-Raczkowski-Trigos stating that every nondiscrete compact Abelian group G admits ²|G|-many μ-nonmeasurable dense subgroups.     

Soluble groups with their centralizer factor groups of bounded rank

For a group class X, a group G is said to be a CX-group if the factor group G/C_G(g^G)∈X for all g∈G, where C_G(g^G) is the centralizer in G of the normal closure of g in G. For the class F_f of groups of finite order less than or equal to f, a classical result of B.H. Neumann [Groups with finite classes of conjugate elements, Proc. London Math. Soc. 1 (1951) 178-187] states that if G∈CF_f, the commutator group G^′ belongs to F_f^′ for some f^′ depending only on f. We prove that a similar result holds for the class , the class of soluble groups of derived length at most d which have Prüfer rank at most r. Namely, if , then for some r^′ depending only on r. Moreover, if , then for some r^′ and f^′ depending only on r,d and f.     

4-regular claw-free IM-extendable graphs

A graph G is induced matching extendable (shortly, IM-extendable), if every induced matching of G is included in a perfect matching of G. A graph G is claw-free, if G does not contain any induced subgraph isomorphic to K_1,3. The kth power of a graph G, denoted by G^k, is the graph with vertex set V(G) in which two vertices are adjacent if and only if the distance between them in G is at most k. In this paper, the 4-regular claw-free IM-extendable graphs are characterized. It is shown that the only 4-regular claw-free connected IM-extendable graphs are , and T_r, r?2, where T_r is the graph with 4r vertices u_i,v_i,x_i,y_i, 1?i?r, such that for each i with 1?i?r, {u_i,v_i,x_i,y_i} is a clique of T_r and . We also show that a 4-regular strongly IM-extendable graph must be claw-free. As a consequence, the only 4-regular strongly IM-extendable graphs are K₄×K₂, and .     

Flexible modeling based on copulas in nonparametric median regression

Consider the model Y=m(X)+ε, where m(⋅)=med(Y|⋅) is unknown but smooth. It is often assumed that ε and X are independent. However, in practice this assumption is violated in many cases. In this paper we propose modeling the dependence between ε and X by means of a copula model, i.e. (ε,X)∼C_θ(F_ε(⋅),F_X(⋅)), where C_θ is a copula function depending on an unknown parameter θ, and F_ε and F_X are the marginals of ε and X. Since many parametric copula families contain the independent copula as a special case, the so-obtained regression model is more flexible than the ‘classical’ regression model.We estimate the parameter θ via a pseudo-likelihood method and prove the asymptotic normality of the estimator, based on delicate empirical process theory. We also study the estimation of the conditional distribution of Y given X. The procedure is illustrated by means of a simulation study, and the method is applied to data on food expenditures in households.     

More on decompositions of edge-colored complete graphs

Let G be a family of graphs whose edges are colored with elements from a set R of r colors. We assume no two vertices of G are joined by more than one edge of color i for any i∈R, for each G∈G. will denote the complete graph with r edges joining any pair of distinct vertices, one of each of the r colors. We describe necessary and asymptotically sufficient conditions on n for the existence of a family D of subgraphs of , each of which is an isomorphic copy of some graph in G, so that each edge of appears in exactly one of the subgraphs in D.     

Polyhedral groups and graph amalgamation products

A polyhedral group G is defined to be the orientation-preserving subgroup of a discrete reflection group acting on hyperbolic 3-space $\text{H}$³, and having a fundamental polyhedron of finite volume. A special presentation for G is obtained from the geometry of the polyhedron. This gives G the structure of a graph amalgamation product, and which, in some cases, splits as a free product with amalgamation. The simplest examples of polyhedral groups are the so-called tetrahedral groups. Other examples are given amongst the the groups PGL(2,O_m), where O_m is the ring of algebraic integers in the quadratic imaginary field $\text{Q(}\text{-m}\text{)}$, m>0.     

A multiplicative inequality for vertex Folkman numbers

Let G be a graph and a₁,…,a_r be positive integers. The symbol G→(a₁,…,a_r) denotes that in every r-coloring of the vertex set V(G) there exists a monochromatic a_i-clique of color i for some i∈{1,…,r}. The vertex Folkman numbers F(a₁,…,a_r;q)=min{|V(G)|:G→(a₁,…,a_r) and K_q?G} are considered. Let a_i, b_i, c_i, i∈{1,…,r}, s, t be positive integers and c_i=a_ib_i, 1?a_i?s,1?b_i?t. Then we prove that

F(c₁,c₂,…,c_r;st+1)?F(a₁,a₂,…,a_r;s+1)F(b₁,b₂,…,b_r;t+1).     

The Erd?s-Ginzburg-Ziv theorem for dihedral groups

Let n≥23 be an integer and let D_2n be the dihedral group of order 2n. It is proved that, if g₁,g₂,…,g_3n is a sequence of 3n elements in D_2n, then there exist 2n distinct indices i₁,i₂,…,i_2n such that g_i1g_i2?g_i2n=1. This result is a sharpening of the famous Erd?s-Ginzburg-Ziv theorem for G=D_2n.     

Groups with a positive law on commutators

Let p be a prime number and let G be a finitely generated group that is residually a finite p-group. We prove that if G satisfies a positive law on all elements of the form [a,b][c,d]ⁱ, a,b,c,d∈G and i?0, then the entire derived subgroup G^′ satisfies a positive law. In fact, G^′ is an extension of a nilpotent group by a locally finite group of finite exponent.     

Indecomposable modules over one-dimensional Noetherian rings

In this article we consider finitely generated torsion-free modules over certain one-dimensional commutative Noetherian rings R. We assume there exists a positive integer N_R such that, for every indecomposable R-module M and for every minimal prime ideal P of R, the dimension of M_P, as a vector space over the field R_P, is less than or equal to N_R. If a nonzero indecomposable R-module M is such that all the localizations M_P as vector spaces over the fields R_P have the same dimension r, for every minimal prime P of R, then r=1,2,3,4 or 6. Let n be an integer ≥8. We show that if M is an R-module such that the vector space dimensions of the M_P are between n and 2n−8, then M decomposes non-trivially. For each n≥8, we exhibit a semilocal ring and an indecomposable module for which the relevant dimensions range from n to 2n−7. These results require a mild equicharacteristic assumption; we also discuss bounds in the non-equicharacteristic case.     

Relatively pseudocomplemented semilattices amalgamate strongly

Letk be any finite or infinite cardinal andS _ω the symmetric group of denumerable infinite degree. It is shown that fori<k ifG _i is thei-th row of a matrix whose columns are allk-termed sequences of elements ofS _ω in each of which all but a finite number of terms are equal to the identity ofS _ω thenG _i 's (withG _i ⁻¹ 's defined in an obvious way and with coordinatewise multiplication amongG _i 's andG _i ⁻¹'s) generate the Free Group onk free generatorsG _i . Analogously, Free Abelian and other types of free groups are also constructed. Presented by L. Fuchs.     

Abelian groups admitting a Fréchet-Urysohn pseudocompact topological group topology

We show that every Abelian group G with r₀(G)=|G|=|G|^ω admits a pseudocompact Hausdorff topological group topology T such that the space (G,T) is Fréchet-Urysohn. We also show that a bounded torsion Abelian group G of exponent n admits a pseudocompact Hausdorff topological group topology making G a Fréchet-Urysohn space if for every prime divisor p of n and every integer k≥0, the Ulm-Kaplansky invariant f_p,k of G satisfies (f_p,k)^ω=f_p,k provided that f_p,k is infinite and f_p,k>f_p,i for each i>k.Our approach is based on an appropriate dense embedding of a group G into a Σ-product of circle groups or finite cyclic groups.