Enumeration of the BranchedmZp-Coverings of Closed Surfaces

In this paper, we enumerate the equivalence classes of regular branched coverings of surfaces whose covering transformation groups are the direct sum of m copies of Z_p, p prime.     

Proof of the impossibility of the fermat equation Xp + Yp = Zp for special values of p and of the more general equation bXn + cYn = dZn

This paper continues the search to determine for what exponents n Fermat's Last Theorem is true. The main theorem and Corollary 1 consider the set of prime exponents p for which mp + 1 is prime for certain even integers m and prove the truth of FLT in Case 1 for such primes p. The remaining theorems prove the inequality of the more general Fermat equation bXⁿ + cYⁿ = dZⁿ.     

Dimension of the crown Skn

In 1941, Dushnik and Miller introduced the concept of the dimension of a poset (X, P) as the minimum number of linear extensions of P whose intersection is exactly P. Although Dilworth has given a formula for the dimension of distributive lattices, the general problem of determining the dimension of a poset is quite difficult. An equally difficult problem is to classify those posets which are dimension irreducible, i.e., those posets for which the removal of any point lowers the dimension. In this paper, we construct for each n≥3, k≥0, a poset, called a crown and denoted S^k_n, for which the dimension is given by the formula $\text{2?(n+k)}\text{(k+2)}$. Furthermore, for each t≥3, we show that there are infinitely many crowns which are irreducible and have dimension t. We then demonstrate a method of combining a collection of irreducible crowns to form an irreducible poset whose dimension is the sum of the crowns in the collection. Finally, we construct some infinite crowns possessing combinatorial properties similar to finite crowns.     

Constructions of partitions of FqN into perfect q-ary codes

Given N = (q ^m − 1)/(q − 1), where q is a power of a prime, q > 2, we present two constructions of different partitions of the set F _q ^N of all q-ary length N vectors into perfect q-ary codes of length N. The lower bounds on the number of these partitions are presented.     

On the asymptotic behavior of xn+1=anxn/xn−1

We investigate the asymptotic behavior of solutions of a separable difference equation of the form

     

Automorphisms of Chevalley groups of types Al, Dl, El over local rings without 1/2

In this paper, we prove that every automorphism of a Chevalley group of type B _l , l ≥ 2, over a commutative local ring with 1/2 is standard, i.e., it is a composition of ring, inner, and central automorphisms.     

Approximation of M/M/s/K retrial queue with nonpersistent customers

We consider the M/M/s/K retrial queues in which a customer who is blocked to enter the service facility may leave the system with a probability that depends on the number of attempts of the customer to enter the service facility. Approximation formulae for the distributions of the number of customers in service facility, waiting time in the system and the number of retrials made by a customer during its waiting time are derived. Approximation results are compared with the simulation.     

Resolvable decomposition of Kn1

In this paper, we prove that $\text{K}{}_{\mathrm{n}}{}^1$ admits a resolvable decomposition into TT₃ or C₃ if and only if n ≡ 0 (mod. 3), n ≠ 6.     

Asymptotic behaviour of the loss probability of theM/G/1/K andG/M/1/K queues

This paper investigates the asymptotic behaviour of the loss probability of theM / G/1/K and G/M/1/K queues as the buffer size increases. It is shown that the loss probability approaches its limiting value, which depends on the offered load, with an exponential decay in essentially all cases. The value of the decay rate can be easily computed from the main queue parameters. Moreover, the close relation existing between the loss behaviour of the two examined queueing systems is highlighted and a duality concept is introduced. Finally some numerical examples are given to illustrate on the usefulness of the asymptotic approximation.     

Some results for the queues Mx/M/c and GIx/ G/c

We develop for the queue M^x/M/c an upper bound for the mean queue length and lower bounds for the delay probabilities (that of an arrival group and that of an arbitrary customer in the arrival group). An approximate formula is also developed for the general bulk-arrival queue GI^x/G/c. Preliminary numerical studies have indicated excellent performance of the results.     

Approximation of M/M/c retrial queue with PH-retrial times

We consider the M/M/c retrial queues with PH-retrial times. Approximation formulae for the distribution of the number of customers in service facility and the mean number of customers in orbit are presented. Some numerical results are presented.     

Almost resolvable decomposition of Kn1

In this paper, we show that the complete symmetric directed graph with n vertices $\text{K}{}_{\mathrm{n}}{}^1$ admits an almost resolvable decomposition into TT₃ (the transitive tournament on 3 vertices) or C₃ (the directed cycle of length 3) if and only if n ≡ 1(mod 3).     

The least squares problem of the matrix equation A1X1B1^T ＋ A2X2B2^T = T

The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2B2^T - T｜｜F can also be regarded as the constrained LS problem minx=diag（x1,x2） ｜｜AXB^T -T｜｜F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ｜｜A1X1B1^T＋A2X2B2^T -T｜｜F is equivalent to min x=diag（x1 ,x2） ｜｜AXB^T - T｜｜F whose solutions are included in the solution set of unconstrained problem minx ｜｜AXB^T - T｜｜F. So the general solutions of min x1,x2 ｜｜A1X1B^T ＋ A2X2B2^T -T｜｜F are reconstructed by selecting the parameter matrix in that of minx ｜｜AXB^T - T｜｜F.     

Analysis of the MAP/G/1/N queue with multiple vacations

This paper deals with a batch service queue and multiple vacations. The system consists of a single server and a waiting room of finite capacity. Arrival of customers follows a Markovian arrival process (MAP). The server is unavailable for occasional intervals of time called vacations, and when it is available, customers are served in batches of maximum size ‘b’ with a minimum threshold value ‘a’. We obtain the queue length distributions at various epochs along with some key performance measures. Finally, some numerical results have been presented.     

Computation of cohomology groups of the Lie algebras of type Bn and Cn

We adduce the results of the numerical experiment in calculating the spaces of local deformations of classical Lie algebras of type B _n and C _n in characteristic p = 2. Original Russian Text ? D.V. Reshetnikov, 2009, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2009, No. 8, pp. 71–72.     

Decomposition of Km,n(Km,n1) into cycles (circuits) of length 2k

In this paper we give necessary and sufficient conditions in order that K_m,n ($\text{K}{}_{\mathrm{m,n}}{}^1$) admits a decomposition into 2k-cycles (2k-circuits). This answers conjectures of J. C. Bermond (Thesis, Paris XI (Orsay), 1975) and J. C. Bermond and V. Faber (J. Combinatorial Theory Ser. B21 (1976), 146–155).     

Existence of Dλ-cycles and Dλ-paths

A cycle of C of a graph G is called a D_λ-cycle if every component of G ? V(C) has order less than λ. A D_λ-path is defined analogously. In particular, a D₁-cycle is a hamiltonian cycle and a D₁-path is a hamiltonian path. Necessary conditions and sufficient conditions are derived for graphs to have a D_λ-cycle or D_λ-path. The results are generalizations of theorems in hamiltonian graph theory. Extensions of notions such as vertex degree and adjacency of vertices to subgraphs of order greater than 1 arise in a natural way.     

关于环Fpm+uFpm+u2Fpm上循环码的注记

本文研究了环F_p^m+uF_p^m+u²F_p^m上长度为p^s的循环码分类.通过建立环F_p^m+uF_p^m+u²F_p^m到环F_p^m+uF_p^m的同态,给出了环F_p^m+uF_p^m+u²F_p^m上长度为p^s的循环码的新分类方法.应用这种方法,得到了环F_p^m+uF_p^m+u²F_p^m长度为p^s的循环码的码词数.     

Automorphisms of elementary adjoint Chevalley groups of types Al, Dl, and El over local rings with 1/2

It is proved that every automorphism of an elementary adjoint Chevalley group of type A _l , D _l , or E _l over a local commutative ring with 1/2 is a composition of a ring automorphism and conjugation by some matrix from the normalizer of that Chevalley group in GL(V) (V is an adjoint representation space).