Perimeter preserver of matrices over semifields

For a rank-1 matrix A = ab ^t, we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the linear operators which preserve the rank and perimeter of rank-1 matrices over semifields. That is, a linear operator T preserves the rank and perimeter of rank-1 matrices over semifields if and only if it has the form T(A) = U AV, or T(A) = U A ^t V with some invertible matrices U and V. This work was supported by the research grant of the Cheju National University in 2006.     

Column Ranks and Their Preservers of Matrices Over Max Algebra

The column rank of an m by n matrix A over max algebra is the weak dimension of the column space of A. We compare the column rank with rank of matrices over max algebra. We also characterize the linear operators which preserve the column rank of matrices over max algebra.     

Column Ranks and Their Preservers of Matrices Over Max Algebra

The column rank of an m by n matrix A over max algebra is the weak dimension of the column space of A. We compare the column rank with rank of matrices over max algebra. We also characterize the linear operators which preserve the column rank of matrices over max algebra.     

Generalized Hadamard Matrices

The paper studies a generalized Hadamard matrix H = (g _{i j}) of order n with entries gi j from a group G of order n. We assume that H satisfies: (i) For m k, G = {g _{m i} g k i ^-1 i = 1,...., n} (ii) g _1i = g _i1 = 1 for each i; (iii) g _ij ^-1 = g _ji for all i, j. Conditions (i) and (ii) occur whenever G is a(P, L) -transitivity for a projective plane of order n. Condition (iii) holds in the case that H affords a symmetric incidence matrix for the plane. The paper proves that G must be a 2-group and extends previous work to the case that n is a square.     

Q-Operator and the Drinfeld Equation

We show that the TQ equation is satisfied by the trace over the quantum space of the product of R-matrices intertwining two representations of the quantum double of the Borel subalgebra of the affine algebra (the standard two-dimensional and the N-dimensional cyclic representations).     

Pointwise and integral estimates for the B-Riesz potential in terms of B-maximal and B-fractional maximal functions

We study the maximal and fractional maximal functions and Riesz potentials that are generated by the generalized shift operator associated with the Laplace-Bessel operator. We obtain some pointwise and integral estimates that give a relation between the B-maximal and B-fractional maximal functions and B-Riesz potentials and extend the available results to the objects of a more general nature. Basing on these results, we prove interpolation theorems for the B-fractional maximal functions and B-Riesz potentials.     

The Subconstituent Algebra of an Association Scheme (Part III)

This is the continuation of an article from the previous issue. In this part, we focus on the thin P- and Q-polynomial association schemes. We provide some combinatorial characterizations of these objects and exhibit the known examples with diameter at least 6. For each example, we give the irreducible modules for the subconstituent algebra. We close with some conjectures and open problems.     

The Subconstituent Algebra of an Association Scheme, (Part I)

We introduce a method for studying commutative association schemes with many vanishing intersection numbers and/or Krein parameters, and apply the method to the P- and Q-polynomial schemes. Let Y denote any commutative association scheme, and fix any vertex x of Y. We introduce a non-commutative, associative, semi-simple -algebra T = T(x) whose structure reflects the combinatorial structure of Y. We call T the subconstituent algebra of Y with respect to x. Roughly speaking, T is a combinatorial analog of the centralizer algebra of the stabilizer of x in the automorphism group of Y.In general, the structure of T is not determined by the intersection numbers of Y, but these parameters do give some information. Indeed, we find a relation among the generators of T for each vanishing intersection number or Krein parameter.We identify a class of irreducible T-moduIes whose structure is especially simple, and say the members of this class are thin. Expanding on this, we say Y is thin if every irreducible T(y)-module is thin for every vertex y of Y. We compute the possible thin, irreducible T-modules when Y is P- and Q-polynomial. The ones with sufficiently large dimension are indexed by four bounded integer parameters. If Y is assumed to be thin, then sufficiently large dimension means dimension at least four.We give a combinatorial characterization of the thin P- and Q-polynomial schemes, and supply a number of examples of these objects. For each example, we show which irreducible T-modules actually occur.We close with some conjectures and open problems.     

The Subconstituent Algebra of an Association Scheme (Part II)

This is a continuation of an article from the previous issue. In this section, we determine the structure of a thin, irreducible module for the subconstituent algebra of a P- and Q- polynomial association scheme. Such a module is naturally associated with a Leonard system. The isomorphism class of the module is determined by this Leonard system, which in turn is determined by four parameters: the endpoint, the dual endpoint, the diameter, and an additional parameter f. If the module has sufficiently large dimension, the parameter f takes one of a certain set of values indexed by a bounded integer parameter e.     

The Maximal and Minimal Ranks of Some Expressions of Generalized Inverses of Matrices

In this paper, we first determine the maximal and minimal ranks of A — BXC with respect to X. Using those results, we then find the maximal and minimal ranks of the expressions AA^– — A^– A — BB^– A — AC^– C and B^– BA — ACC^– with respect to the choice of generalized inverses A^–, B^– and C^–. In particular, we consider the commutativity of A and A^–, A^k and A^–.The research of the author was supported in part by the Natural Sciences and Engineering Research Council of Canada.     

Continuation of a linear operator to an involution operator

A bounded linear operatorA:X→X in a linear topological spaceX is called ap-involution operator,p≥2, ifA ^p=I, whereI is the identity operator. In this paper, we describe linearp-involution operators in a linear topological space over the field ℂ and prove that linear operators can be continued to involution operators. Translated fromMatematicheskie Zametki, Vol. 61, No. 5, pp. 671–676, May, 1997. Translated by M. A. Shishkova     

Ranks of q-Ary 1-Perfect Codes

The rank of a q-ary code C of length n, r(C), isthe dimension of the subspace spanned by C. We establish the existence of q-ary 1-perfectcodes of length for m 4 and r(C)= n – m + s for each s {1,,m}. This is a generalization of the binary case proved by Etzion and Vardy in[4].     

Graceful Signed Graphs

A (p, q)-sigraph S is an ordered pair (G, s) where G = (V, E) is a (p, q)-graph and s is a function which assigns to each edge of G a positive or a negative sign. Let the sets E ⁺ and E ^– consist of m positive and n negative edges of G, respectively, where m + n = q. Given positive integers k and d, S is said to be (k, d)-graceful if the vertices of G can be labeled with distinct integers from the set {0, 1, ..., k + (q – 1)d such that when each edge uv of G is assigned the product of its sign and the absolute difference of the integers assigned to u and v the edges in E ⁺ and E ^– are labeled k, k + d, k + 2d, ..., k + (m – 1)d and –k, – (k + d), – (k + 2d), ..., – (k + (n – 1)d), respectively.In this paper, we report results of our preliminary investigation on the above new notion, which indeed generalises the well-known concept of (k, d)-graceful graphs due to B. D. Acharya and S. M. Hegde.     

A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T,M,S)-Nets of Low Strength

The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.     

The Parameters of Bipartite Q-polynomial Distance-Regular Graphs

Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Suppose ₀, ₁, ..., _D is a Q-polynomial ordering of the eigenvalues of . This sequence is known to satisfy the recurrence _{i – 1} – _i + _{i + 1} = 0 (0 > i > D), for some real scalar . Let q denote a complex scalar such that q + q ^–1 = . Bannai and Ito have conjectured that q is real if the diameter D is sufficiently large.We settle this conjecture in the bipartite case by showing that q is real if the diameter D 4. Moreover, if D = 3, then q is not real if and only if ₁ is the second largest eigenvalue and the pair (, k) is one of the following: (1, 3), (1, 4), (1, 5), (1, 6), (2, 4), or (2, 5). We observe that each of these pairs has a unique realization by a known bipartite distance-regular graph of diameter 3.     

The existence and uniqueness of solution and the convergence of a multi-step iterative algorithm for a system of variational inclusions with (<Emphasis Type="Italic">A</Emphasis>, <Emphasis Type="Italic">η</Emphasis>, <Emphasis Type="Italic">m</Emphasis>)-accretive operators

In this paper, we introduce and study a new system of variational inclusions with (A, η, m)-accretive operators which contains variational inequalities, variational inclusions, systems of variational inequalities and systems of variational inclusions in the literature as special cases. By using the resolvent technique for the (A, η, m)-accretive operators, we prove the existence and uniqueness of solution and the convergence of a new multi-step iterative algorithm for this system of variational inclusions in real q-uniformly smooth Banach spaces. The results in this paper unifies, extends and improves some known results in the literature.      

On the existence of optimal controls for nonlinear infinite dimensional systems

We consider nonlinear systems with a priori feedback. We establish the existence of admissible pairs and then we show that the Lagrange optimal control problem admits an optimal pair. As application we work out in detail two examples of optimal control problems for nonlinear parabolic partial differential equations.