<Emphasis Type="Italic">X</Emphasis>-decomposable finite groups for <Emphasis Type="Italic">X</Emphasis>={1, <Emphasis Type="Italic">m</Emphasis>, <Emphasis Type="Italic">m</Emphasis> + 1, <Emphasis Type="Italic">m</Emphasis> + 2}

A normal subgroup N of a finite group G is called n-decomposable in G if N is the union of n distinct G-conjugacy classes. We study the structure of nonperfect groups in which every proper nontrivial normal subgroup is m-decomposable, m+1-decomposable, or m+2-decomposable for some positive integer m. Furthermore, we give classification for the soluble case.     

The Center of <Emphasis Type="Italic">Dist</Emphasis> (<Emphasis Type="Italic">GL</Emphasis>(<Emphasis Type="Italic">m</Emphasis>|<Emphasis Type="Italic">n</Emphasis>)) in Positive Characteristic

The purpose of this paper is to investigate central elements in distribution algebras D i s t(G) of general linear supergroups G = G L(m|n). As an application, we compute explicitly the center of D i s t(G L(1|1)) and its image under Harish-Chandra homomorphism.     

On (<Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">m</Emphasis>)-semigroups

We generalize Green’s lemma and Green’s theorem for usual binary semigroups to (n,m)-semigroups, define and describe the regularity for an element of an (n,m)-semigroup, give some criteria for an element of an (n,m)-semigroup to be invertible, and further apply the invertibility for (n,m)-semigroups to (n,m)-groups and give some equivalent characterizations for (n,m)-groups. We establish Hosszú-Gluskin theorems for (n,m)-semigroups in two cases, as generalizations of the corresponding theorems for n-groups.     

The Existence of LHMTS(<Emphasis Type="Italic">m</Emphasis><Superscript><Emphasis Type="Italic">v</Emphasis></Superscript>) and LHDTS(<Emphasis Type="Italic">m</Emphasis><Superscript><Emphasis Type="Italic">v</Emphasis></Superscript>)

In this article, we establish the existence of an LHMTS(m^v) for v ≡ 2 (mod 6) and m≡ 3 (mod 6). Thus there exists an LHMTS(m^v) if and only if v(v-1)m² ≡ 0 (mod 3) except possibly for v=6, m≡ 1, 5 (mod 6) and m≠1. In the similar way, the existence of LHDTS(m^v) is completely determined, i.e., there exists an LHDTS(m^v) if and only if v(v-1)m² ≡ 0 (mod 3).     

Largest <Emphasis Type="Italic">H</Emphasis>-eigenvalue of uniform <Emphasis Type="Italic">s</Emphasis>-hypertrees

The k-uniform s-hypertree G = (V,E) is an s-hypergraph, where 1 ≤ s ≤ k - 1; and there exists a host tree T with vertex set V such that each edge of G induces a connected subtree of T. In this paper, some properties of uniform s-hypertrees are establised, as well as the upper and lower bounds on the largest H-eigenvalue of the adjacency tensor of k-uniform s-hypertrees in terms of the maximal degree Δ. Moreover, we also show that the gap between the maximum and the minimum values of the largest H-eigenvalue of k-uniform s-hypertrees is just Θ(Δ ^s/k ).     

Rate of convergence to stationarity of the system <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">N</Emphasis>/<Emphasis Type="Italic">N</Emphasis>+<Emphasis Type="Italic">R</Emphasis>

We consider the M/M/N/N+R service system, characterized by N servers, R waiting positions, Poisson arrivals and exponential service times. We discuss representations and bounds for the rate of convergence to stationarity of the number of customers in the system, and study its behaviour as a function of R, N and the arrival rate λ, allowing λ to be a function of N.     

Tight sets,weighted <Emphasis Type="Italic">m</Emphasis>-covers,weighted <Emphasis Type="Italic">m</Emphasis>-ovoids,and minihypers

Minihypers are substructures of projective spaces introduced to study linear codes meeting the Griesmer bound. Recently, many results in finite geometry were obtained by applying characterization results on minihypers (De Beule et al. 16:342–349, 2008; Govaerts and Storme 4:279–286, 2004; Govaerts et al. 28:659–672, 2002). In this paper, using characterization results on certain minihypers, we present new results on tight sets in classical finite polar spaces and weighted m-covers, and on weighted m-ovoids of classical finite generalized quadrangles. The link with minihypers gives us characterization results of i-tight sets in terms of generators and Baer subgeometries contained in the Hermitian and symplectic polar spaces, and in terms of generators for the quadratic polar spaces. We also present extendability results on partial weighted m-ovoids and partial weighted m-covers, having small deficiency, to weighted m-covers and weighted m-ovoids of classical finite generalized quadrangles. As a particular application, we prove in an alternative way the extendability of 53-, 54-, and 55-caps of PG(5,3), contained in a non-singular elliptic quadric Q⁻(5,3), to 56-caps contained in this elliptic quadric Q⁻(5,3).      

A Family of Binary (<Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">m</Emphasis>,<Emphasis Type="Italic">s</Emphasis>)-Nets of Strength 5

(t,m,s)-Nets were defined by Niederreiter [Monatshefte fur Mathematik, Vol. 104 (1987) pp. 273–337], based on earlier work by Sobol’ [Zh. Vychisl Mat. i mat. Fiz, Vol. 7 (1967) pp. 784–802], in the context of quasi-Monte Carlo methods of numerical integration. Formulated in combinatorial/coding theoretic terms a binary linear (m−k,m,s)₂-net is a family of ks vectors in F₂^m satisfying certain linear independence conditions (s is the length, m the dimension and k the strength: certain subsets of k vectors must be linearly independent). Helleseth et al. [5] recently constructed (2r−3,2r+2,2^r−1)₂-nets for every r. In this paper, we give a direct and elementary construction for (2r−3,2r+2,2^r+1)₂-nets based on a family of binary linear codes of minimum distance 6.Communicated by: T. Helleseth     

Some aspects of <Emphasis Type="Italic">m</Emphasis>-adic analysis and its applications to <Emphasis Type="Italic">m</Emphasis>-adic stochastic processes

In this paper we consider a generalization of analysis on p-adic numbers field to the m case of m-adic numbers ring. The basic statements, theorems and formulas of p-adic analysis can be used for the case of m-adic analysis without changing. We discuss basic properties of m-adic numbers and consider some properties of m-adic integration and m-adic Fourier analysis. The class of infinitely divisible m-adic distributions and the class of m-adic stochastic Levi processes were introduced. The special class of m-adic CTRW process and fractional-time m-adic random walk as the diffusive limit of it is considered. We found the asymptotic behavior of the probability measure of initial distribution support for fractional-time m-adic random walk.     

The <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/1+<Emphasis Type="Italic">G</Emphasis> queue revisited

We consider an M/G/1 queue with the following form of customer impatience: an arriving customer balks or reneges when its virtual waiting time, i.e., the amount of work seen upon arrival, is larger than a certain random patience time. We consider the number of customers in the system, the maximum workload during a busy period, and the length of a busy period. We also briefly treat the analogous model in which any customer enters the system and leaves at the end of his patience time or at the end of his virtual sojourn time, whichever occurs first.     

On the Riesz means of coefficients of <Emphasis Type="Italic">m</Emphasis>th symmetric power <Emphasis Type="Italic">L</Emphasis>-functions

Let c _n be the Fourier coefficients of L(sym ^m   f, s), and Δρ(x; sym ^m   f) be the error term in the asymptotic formula for ∑ _n≪x c _n . In this paper, we study the Riesz means of Δρ(x; sym ^m   f) and obtain a truncated Voronoi-type formula under the hypothesis Nice(m, f).     

The Geometry of <Emphasis Type="Italic">m</Emphasis>-Hyperconvex Domains

We study the geometry of m-regular domains within the Caffarelli–Nirenberg–Spruck model in terms of barrier functions, envelopes, exhaustion functions, and Jensen measures. We prove among other things that every m-hyperconvex domain admits an exhaustion function that is negative, smooth, strictly m-subharmonic, and has bounded m-Hessian measure.     

The classification of filiform Leibniz superalgebras of nilindex <Emphasis Type="Italic">n</Emphasis> + <Emphasis Type="Italic">m</Emphasis>

In this work the classification of filiform Leibniz superalgebras of nilindex n ＋ m, where n and m （m≠0） are dimensions of even and odd parts, respectively, is obtained.     

Selberg＇s Normal Density Theorem for Automorphic L-Functions for GLm

Let π be an irreducible unitary cuspidal representation of GLm（AQ） with m ≥ 2, and L（s, Tr） the L-function attached to π. Under the Generalized Riemann Hypothesis for L（s,π）, we estimate the normal density of primes in short intervals for the automorphic L-function L（s, π）. Our result generalizes the corresponding theorem of Selberg for the Riemann zeta-function.     

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

     

Cubic and higher degree bounds for codes and (<Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">m</Emphasis>, <Emphasis Type="Italic">s</Emphasis>)-nets

The Plotkin bound and the quadratic bound for codes and (t, m, s)-nets can be obtained from the linear programming bound using certain linear and quadratic polynomials, respectively. We extend this approach by considering cubic and higher degree polynomials to find new explicit bounds as well as new non-existence results for codes and (t, m, s)-nets.     

Eigenvalues of the Manifold Sp（n）/U（n）

In this paper, we give the eigenvalues of the manifold Sp(n)/U(n). We prove that an eigenvalue λ _s (f ₂, f ₂, …, f _n ) of the Lie group Sp(n), corresponding to the representation with label (f ₁, f ₂, ..., f _n ), is an eigenvalue of the manifold Sp(n)/U(n), if and only if f ₁, f ₂, …, f _n are all even.     

Further Results for the Queueing System <Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript>/<Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">c</Emphasis>

For the multi-channel bulk-arrival queue, M ^x /M/c, Abol'nikov and Kabak independently obtained steady state results. In this paper the results of these authors are extended, corrected and simplified. A number of measures of efficiency are calculated for three cases where the arrival group size has: (i) a constant value, (ii) a geometric distribution, or (iii) a positive Poisson distribution. The paper also shows how to calculate fractiles for both the queue length and the waiting time distribution. Examples of extensive numerical results for certain measures of efficiency are presented in tabular and chart form.     

Cyclotomic Hecke Algebras of <Emphasis Type="Italic">G</Emphasis>(<Emphasis Type="Italic">r</Emphasis>, <Emphasis Type="Italic">p</Emphasis>, <Emphasis Type="Italic">n</Emphasis>)

In this note, we find a monomial basis of the cyclotomic Hecke algebra \({\mathcal{H}_{r,p,n}}\) of G(r,p,n) and show that the Ariki-Koike algebra \({\mathcal{H}_{r,n}}\) is a free module over \({\mathcal{H}_{r,p,n}}\), using the Gröbner-Shirshov basis theory. For each irreducible representation of \({\mathcal{H}_{r,p,n}}\), we give a polynomial basis consisting of linear combinations of the monomials corresponding to cozy tableaux of a given shape.     

Equivariant Classification of <Emphasis Type="Italic">b</Emphasis><Superscript><Emphasis Type="Italic">m</Emphasis></Superscript>-symplectic Surfaces

Inspired by Arnold’s classification of local Poisson structures [1] in the plane using the hierarchy of singularities of smooth functions, we consider the problem of global classification of Poisson structures on surfaces. Among the wide class of Poisson structures, we consider the class of b^m-Poisson structures which can be also visualized using differential forms with singularities as b^m-symplectic structures. In this paper we extend the classification scheme in [24] for b^m-symplectic surfaces to the equivariant setting. When the compact group is the group of deck-transformations of an orientable covering, this yields the classification of these objects for nonorientable surfaces. The paper also includes recipes to construct b^m-symplectic structures on surfaces. The feasibility of such constructions depends on orientability and on the colorability of an associated graph. The desingularization technique in [10] is revisited for surfaces and the compatibility with this classification scheme is analyzed in detail.