On perfect codes in the hamming schemes H(n, q) with q arbitrary

For each e ? 3, there are at most finitely many nontrivial perfect e-codes in the Hamming schemes H(n, q) where n and q are arbitrary.     

Characterization of H(n, q) by the parameters

Distance-regular graphs which have the same parameters as the Hamming scheme H(n, q) are classified. If q ≠ 4, H(n, q) is the only such graph. If q = 4, there are precisely $\text{[}\text{n}\text{2}\text{]}$ (isomorphism classes of) such graphs other than H(n, q).     

Orthogonal resolutions of lines in AG(n,q)

A resolution of the lines of AG(n,q) is a partition of the lines classes (called resolution classes) such that every point of the geometry is on exactly one line of each resolution class. Two resolutions R,R' of AG(n,q) are orthogonal if any resolution class from R has at most one line in common with any class from R'. In this paper, we construct orthogonal resolutions on AG(n,q) for all n=2ⁱ⁺¹, i=1,2,…, and all q>2 a prime power. The method involves constructing AG(n,q) from a finite projective plane of order q^n-1 and using the structure of the plane to display the orthogonal resolutions.     

The embedding of (0, α)-geometries in PG(n, q): part II

In Part I we obtained results about the embedding of (0, α)-geometries in PG(3, q). Here we determine all (0, α)-geometries with q+1 points on a line, which are embedded in PG(n, q), n>3 and q>2. As a particular case all semi partial geometries with parameters s=q,t,α(>1),μ, which are embeddable in PG(n, q), q≠2, are obtained. We also prove some theorems about the embedding of (0, 2)-geometries in PG(n, 2): we show that without loss of generality we may restrict ourselves to reduced (0, 2)-geometries, we determine all (0, 2)-geometries in PG(4, 2), and we describe an unusual embedding of U_2,3(9) in PG(5, 2).     

Group gradings on the superalgebras M(m,n), A(m,n) and P(n)

We classify gradings by arbitrary abelian groups on the classical simple Lie superalgebras $P(n)$, $n\ge 2$, and on the simple associative superalgebras $M(m,n)$, $m,n\ge 1$, over an algebraically closed field: fine gradings up to equivalence and G-gradings, for a fixed group G, up to isomorphism. As a corollary, we also classify up to isomorphism the G-gradings on the classical Lie superalgebra $A(m,n)$ that are induced from G-gradings on $M(m+1,n+1)$. In the case of Lie superalgebras, the characteristic is assumed to be 0.     

On caps with weighted points in PG(t, q)

In this note the study of caps with weighted points inPG(t,q), t?2, is investigated. Some relations between parameters of a(k>,nf)-cap and its characters are found. Monoidal caps are also considered and some examples are given. Finally, the(k,n;f)-caps of type (0,n>) are characterized.     

On properties of discrete (r, q) and (s, T) inventory systems

We consider single-item (r, q) and (s, T) inventory systems with integer-valued demand processes. While most of the inventory literature studies continuous approximations of these models and establishes joint convexity properties of the policy parameters in the continuous space, we show that these properties no longer hold in the discrete space, in the sense of linear interpolation extension and L^?-convexity. This nonconvexity can lead to failure of optimization techniques based on local optimality to obtain the optimal inventory policies. It can also make certain comparative properties established previously using continuous variables invalid. We revise these properties in the discrete space.     

Sharp regularity for functionals with (p,q) growth

We prove regularity theorems for minimizers of integral functionals of the Calculus of Variations

     

Enumeration of (p,q)-parking functions

Parking functions are central in many aspects of combinatorics. We define in this communication a generalization of parking functions which we call (p₁,…,p_k)-parking functions. We give a characterization of them in terms of parking functions and we show that they can be interpreted as recurrent configurations in the sandpile model for some graphs. We also establish a correspondence with a Lukasiewicz language, which enables to enumerate (p₁,…,p_k)-parking functions as well as increasing ones.     

L-Poisson integral representations of solutions of the Hua system on the bounded symmetric domain SU(n,n)/S(U(n)×U(n))

Let positive definite} be the matrix ball of rank n and let H_D be the associated Hua operator. For a complex number λ, such that Reiλ>n−1 we give a necessary and sufficient condition on solutions F of the following Hua system of differential equations on D:

     

On completely reducible solvable subgroups of GL(n, Δ)

Let Δ be a finite field and denote by GL(n, Δ) the group ofn×n nonsingular matrices defined over Δ. LetR⊆GL(n, Δ) be a solvable, completely reducible subgroup of maximal order. For |Δ|≧2, |Δ|≠3 we give bounds for |R| which improve previous ones. Moreover for |Δ|=3 or |Δ|>13 we determine the structure ofR, in particular we show thatR is unique, up to conjugacy. This work is part of a Ph.D. thesis done at the Hebrew University under the supervision of Professor A. Mann.     

Ordering trees with n vertices and matching number q by their largest Laplacian eigenvalues

Denote by T_n,q the set of trees with n vertices and matching number q. Guo [On the Laplacian spectral radius of a tree, Linear Algebra Appl. 368 (2003) 379-385] gave the tree in T_n,q with the greatest value of the largest Laplacian eigenvalue. In this paper, we give another proof of this result. Using our method, we can go further beyond Guo by giving the tree in T_n,q with the second largest value of the largest Laplacian eigenvalue.     

Linear operators preserving the (p,q)-numerical range

Let $\text{C}{}_{\mathrm{n\times n}}$ and $\text{H}{}_{\mathrm{n}}$ denote respectively the space of n×n complex matrices and the real space of n×n hermitian matrices. Let p,q,n be positive integers such that p?q?n. For $\text{A?}\text{C}{}_{\mathrm{n\times n}}$, the (p,q)-numerical range of A is the set

$\text{W}{}_{\mathrm{p,q}}\text{(A)={trC}{}_{\mathrm{p}}\text{(J}{}_{\mathrm{q}}\text{UAU}{}^1\text{):U}\text{unitary}\text{}}$

, where C_p(X) is the pth compound matrix of X, and Jq is the matrix I_q?O_n-q. Let $\text{L}$ denote $\text{H}$_n or $\text{C}{}_{\mathrm{n\times n}}$. The problem of determining all linear operators T: $\text{L}$→$\text{L}$ such that

$\text{W}{}_{\mathrm{p,q}}\text{(T(A))=W}{}_{\mathrm{p,q}}\text{(A)}\text{for all}\text{A?}\text{L}$

is treated in this paper.     

One-Dimensional Representations of U (p,q) and the Howe Correspondence

We explicitly determine the theta lifts of all one-dimensional representations of U (p,q) in terms of Langlands parameters, and determine exactly which lifts are unitary. Moreover, we show that such a lift is unitary if and only if it is a weakly fair derived functor module of the form A_q(λ). Finally, we show that the correspondence of unitary representations behaves well with respect to associated cycles.     

On the uniqueness of the graphs G(n, k) of the Johnson schemes

T. A. Dowling (J. Combin. Theory6 (1969), 251–263) proved the uniqueness of the graphs G(n, k) of the Johnson schemes for n > 2k(k ? 1) + 4. We improve this result by showing the uniqueness of G(n, k) for n > 4k.