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.     

EKR Sets for Large <Emphasis Type="Italic">n</Emphasis> and <Emphasis Type="Italic">r</Emphasis>

Let \(\mathcal {A}\subset \left( {\begin{array}{c}[n]\\ r\end{array}}\right) \) be a compressed, intersecting family and let \(X\subset [n]\). Let \(\mathcal {A}(X)=\{A\in \mathcal {A}:A\cap X\ne \emptyset \}\) and \(\mathcal {S}_{n,r}=\left( {\begin{array}{c}[n]\\ r\end{array}}\right) (\{1\})\). Motivated by the Erd?s–Ko–Rado theorem, Borg asked for which \(X\subset [2,n]\) do we have \(|\mathcal {A}(X)|\le |\mathcal {S}_{n,r}(X)|\) for all compressed, intersecting families \(\mathcal {A}\)? We call X that satisfy this property EKR. Borg classified EKR sets X such that \(|X|\ge r\). Barber classified X, with \(|X|\le r\), such that X is EKR for sufficiently large n, and asked how large n must be. We prove n is sufficiently large when n grows quadratically in r. In the case where \(\mathcal {A}\) has a maximal element, we sharpen this bound to \(n>\varphi ^{2}r\) implies \(|\mathcal {A}(X)|\le |\mathcal {S}_{n,r}(X)|\). We conclude by giving a generating function that speeds up computation of \(|\mathcal {A}(X)|\) in comparison with the naïve methods.     

Processes of <Emphasis Type="Italic">r</Emphasis><Superscript><Emphasis Type="Italic">t</Emphasis><Emphasis Type="Italic">h</Emphasis></Superscript> largest

For integers n ≥ r, we treat the rth largest of a sample of size n as an \(\mathbb {R}^{\infty }\)-valued stochastic process in r which we denote as M^(r). We show that the sequence regarded in this way satisfies the Markov property. We go on to study the asymptotic behavior of M^(r) as r → ∞, and, borrowing from classical extreme value theory, show that left-tail domain of attraction conditions on the underlying distribution of the sample guarantee weak limits for both the range of M^(r) and M^(r) itself, after norming and centering. In continuous time, an analogous process Y^(r) based on a two-dimensional Poisson process on \(\mathbb {R}_{+}\times \mathbb {R}\) is treated similarly, but we note that the continuous time problems have a distinctive additional feature: there are always infinitely many points below the rth highest point up to time t for any t >?0. This necessitates a different approach to the asymptotics in this case.     

Bidual of <Emphasis Type="Italic">r</Emphasis>-algebras

We prove that the order continuous bidual of an Archimedean r-algebra is a Dedekind complete r-algebra with respect to the Arens multiplications.     

Facets of the <Emphasis Type="Italic">r</Emphasis>-Stable (<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">k</Emphasis>)-Hypersimplex

Let k, n, and r be positive integers with k < n and \({r \leq \lfloor \frac{n}{k} \rfloor}\). We determine the facets of the r-stable n, k-hypersimplex. As a result, it turns out that the r-stable n, k-hypersimplex has exactly 2n facets for every \({r < \lfloor \frac{n}{k} \rfloor}\). We then utilize the equations of the facets to study when the r-stable hypersimplex is Gorenstein. For every k > 0 we identify an infinite collection of Gorenstein r-stable hypersimplices, consequently expanding the collection of r-stable hypersimplices known to have unimodal Ehrhart \({\delta}\)-vectors.     

The probability that <Emphasis Type="Italic">r</Emphasis> elements of a rank <Emphasis Type="Italic">n</Emphasis> free group generate a rank <Emphasis Type="Italic">r</Emphasis> subgroup

Granted the three integers n ≥ 2, r, and R, consider all ordered tuples of r elements of length at most R in the free group F _n . Calculate the number of those tuples that generate in F _n a rank r subgroup and divide it by the number of all tuples under study. As R → ∞, the limit of the ratio is known to exist and equal 1 (see [1]). We give a simple proof of this result.     

The maximum and minimum degree of the random <Emphasis Type="Italic">r</Emphasis>-uniform <Emphasis Type="Italic">r</Emphasis>-partite hypergraphs

In this paper we consider the random r-uniform r-partite hypergraph model H(n ₁, n ₂, ···, n _r; n, p) which consists of all the r-uniform r-partite hypergraphs with vertex partition {V ₁, V ₂, ···, V _r} where |V _i| = n _i = n _i(n) (1 ≤ i ≤ r) are positive integer-valued functions on n with n ₁ +n ₂ +···+n _r = n, and each r-subset containing exactly one element in V _i (1 ≤ i ≤ r) is chosen to be a hyperedge of H _p ∈ H (n ₁, n ₂, ···, n _r; n, p) with probability p = p(n), all choices being independent. Let

$${\Delta _{{V_1}}} = {\Delta _{{V_1}}}\left( H \right)$$

and

$${\delta _{{V_1}}} = {\delta _{{V_1}}}\left( H \right)$$

be the maximum and minimum degree of vertices in V ₁ of H, respectively;

$${X_{d,{V_1}}} = {X_{d,{V_1}}}\left( H \right),{Y_{d,{V_1}}} = {Y_{d,{V_1}}}\left( H \right)$$

,

$${Z_{d,{V_1}}} = {Z_{d,{V_1}}}\left( H \right)and{Z_{c,d,{V_1}}} = {Z_{c,d,{V_1}}}\left( H \right)$$

be the number of vertices in V ₁ of H with degree d, at least d, at most d, and between c and d, respectively. In this paper we obtain that in the space H(n ₁, n ₂, ···, n _r; n, p),

$${X_{d,{V_1}}},{Y_{d,{V_1}}},{Z_{d,{V_1}}}and{Z_{c,d,{V_1}}}$$

all have asymptotically Poisson distributions. We also answer the following two questions. What is the range of p that there exists a function D(n) such that in the space H(n ₁, n ₂, ···, n _r; n, p),

$$\mathop {\lim }\limits_{n \to \infty } P\left( {{\Delta _{{V_1}}} = D\left( n \right)} \right) = 1$$

? What is the range of p such that a.e., H _p ∈ H (n ₁, n ₂, ···, n _r; n, p) has a unique vertex in V ₁ with degree

$${\Delta _{{V_1}}}\left( {{H_p}} \right)$$

? Both answers are p = o (log n ₁/N), where

$$N = \mathop \prod \limits_{i = 2}^r {n_i}$$

. The corresponding problems on

$${\delta _{{V_i}}}\left( {{H_p}} \right)$$

also are considered, and we obtained the answers are p ≤ (1 + o(1))(log n ₁/N) and p = o (log n ₁/N), respectively.

     

Elementary criteria for irreducibility of <Emphasis Type="Italic">f</Emphasis>(<Emphasis Type="Italic">X</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript>)

In this paper, very simple sufficient conditions for the irreducibility of f(X ^r ) over an arbitrary unique factorization domain Z are established.     

<Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript> convergence for <Emphasis Type="Italic">B</Emphasis>-valued random elements

The paper investigates L ^p convergence and Marcinkiewicz-Zygmund strong laws of large numbers for random elements in a Banach space under the condition that the Banach space is of Rademacher type p, 1 < p < 2. The paper also discusses L ^r convergence and L ^r bound for random elements without any geometric restriction condition on the Banach space.     

Characterizations of <Emphasis Type="Italic">r</Emphasis>-Convex Functions

This paper discusses some properties of r-convexity and its relations with some other types of convexity. A characterization of convex functions in terms of r-convexity is given without assuming differentiability. The concept of strict r-convexity is introduced. For a twice continuously differentiable function f, it is shown that the strict r-convexity of f is equivalent to a certain condition on ∇ ² f. Further, it is shown that this condition is satisfied by quasiconvex functions satisfying a less stringent condition.     

Kernels and <Emphasis Type="Italic">p</Emphasis>-Kernels of <Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript>-ary 1-Perfect Codes

The rank of a q-ary code C is the dimension of the subspace spanned by C. The kernel of a q-ary code C of length n can be defined as the set of all translations leaving C invariant. Some relations between the rank and the dimension of the kernel of q-ary 1-perfect codes, over as well as over the prime field , are established. Q-ary 1-perfect codes of length n=(q^m − 1)/(q − 1) with different kernel dimensions using switching constructions are constructed and some upper and lower bounds for the dimension of the kernel, once the rank is given, are established.Communicated by: I.F. Blake     

Maximal regular subsemibands of finite order-preserving transformation semigroups <Emphasis Type="Italic">K</Emphasis>(<Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">r</Emphasis>)

Let O _n be the order-preserving transformation semigroup on X _n . For an arbitrary integer r such that 1≤r≤n−2, we completely describe the maximal regular subsemibands of the semigroup K(n,r)={α∈O _n :|im(α)|≤r}. We also formulate the cardinal number of such subsemigroups.     

<Emphasis Type="Italic">r</Emphasis>-Tuple almost product structures

A generalization of an almost product structure and an almost complex structure on smooth manifolds is constructed. The set of tensor differential invariants of type (2, 1) and the set of differential 2-forms for such structures are constructed. We show how these tensor invariants can be used to solve the classification problem for Monge–Ampère equations and Jacobi equations.     

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.     

<Emphasis Type="Italic">r</Emphasis>-Minimal submanifolds in space forms

Let be an n-dimensional compact, possibly with boundary, submanifold in an (n + p)-dimensional space form R ^n+p (c). Assume that r is even and , in this paper we introduce rth mean curvature function S _r and (r + 1)-th mean curvature vector field . We call M to be an r-minimal submanifold if on M, we note that the concept of 0-minimal submanifold is the concept of minimal submanifold. In this paper, we define a functional of , by calculation of the first variational formula of J _r we show that x is a critical point of J _r if and only if x is r-minimal. Besides, we give many examples of r-minimal submanifolds in space forms. We calculate the second variational formula of J _r and prove that there exists no compact without boundary stable r-minimal submanifold with in the unit sphere S ^n+p . When r = 0, noting S ₀ = 1, our result reduces to Simons’ result: there exists no compact without boundary stable minimal submanifold in the unit sphere S ^n+p .      

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

     

A lower bound for the <Emphasis Type="Italic">r</Emphasis>-order of a matrix modulo <Emphasis Type="Italic">N</Emphasis>

For a positive integer N, we define the N-rank of a non singular integer d × d matrix A to be the maximum integer r such that there exists a minor of order r whose determinant is not divisible by N. Given a positive integer r, we study the growth of the minimum integer k, such that A ^k − I has N-rank at most r, as a function of N. We show that this integer k goes to infinity faster than log N if and only if for every eigenvalue λ which is not a root of unity, the sum of the dimensions of the eigenspaces relative to eigenvalues which are multiplicatively dependent with λ and are not roots of unity, plus the dimensions of the eigenspaces relative to eigenvalues which are roots of unity, does not exceed d − r − 1. This result will be applied to recover a recent theorem of Luca and Shparlinski [6] which states that the group of rational points of an ordinary elliptic curve E over a finite field with q ⁿ elements is almost cyclic, in a sense to be defined, when n goes to infinity. We will also extend this result to the product of two elliptic curves over a finite field and show that the orders of the groups of rational points of two non isogenous elliptic curves are almost coprime when n approaches infinity. Author’s address: Dipartimento di Matematica e Informatica, Via Delle Scienze 206, 33100 Udine, Italy     

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.     

On <Emphasis Type="Italic">r</Emphasis>-recognition by prime graph of <Emphasis Type="Italic">B</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(3) where <Emphasis Type="Italic">p</Emphasis> is an odd prime

Let G be a finite group. The prime graph Γ(G) of G is defined as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p and p′ are joined by an edge if there is an element in G of order pp′. We denote by k(Γ(G)) the number of isomorphism classes of finite groups H satisfying Γ(G) = Γ(H). Given a natural number r, a finite group G is called r-recognizable by prime graph if k(Γ(G)) =  r. In Shen et al. (Sib. Math. J. 51(2):244–254, 2010), it is proved that if p is an odd prime, then B _p (3) is recognizable by element orders. In this paper as the main result, we show that if G is a finite group such that Γ(G) = Γ(B _p (3)), where p > 3 is an odd prime, then \({G\cong B_p(3)}\) or C _p (3). Also if Γ(G) = Γ(B ₃(3)), then \({G\cong B_3(3), C_3(3), D_4(3)}\), or \({G/O_2(G)\cong {\rm Aut}(^2B_2(8))}\). As a corollary, the main result of the above paper is obtained.     

On the depth <Emphasis Type="Italic">r</Emphasis> Bernstein projector

In this paper we prove an explicit formula for the Bernstein projector to representations of depth \(\le r\). As a consequence, we show that the depth zero Bernstein projector is supported on topologically unipotent elements and it is equal to the restriction of the character of the Steinberg representation. As another application, we deduce that the depth r Bernstein projector is stable. Moreover, for integral depths our proof is purely local.