On Schurity of Finite Abelian Groups

A finite group G is called a Schur group, if any Schur ring over G is associated in a natural way with a subgroup of Sym(G) that contains all right translations. Recently, the authors have completely identified the cyclic Schur groups. In this article, it is shown that any abelian Schur group belongs to one of several explicitly given families only. In particular, any noncyclic abelian Schur group of odd order is isomorphic to ?₃ × ?_{3 ^k} or ?₃ × ?₃ × ? _p where k ≥ 1 and p is a prime. In addition, we prove that ?₂ × ?₂ × ? _p is a Schur group for every prime p.     

The domination numbers of the 5 × n and 6 × n grid graphs

The k × n grid graph is the product P_k × P_n of a path of length k ? 1 and a path of length n ? 1. We prove here formulas found by E. O. Hare for the domination numbers of P₅ × P_n and P₆ × P_n. © 1993 John Wiley & Sons, Inc.     

Units OF Z(G × C 2)

Abstract

In this paper, we are mainly interested in describing constructively u(Z(G × C ₂)), where u(ZG) has been described in some way. We first consider unitary units and prove that if u(ZG) is generated by unitary units, then U(Z(G × C₂)) is also generated by unitary units. Then we consider bicyclic units and ask the following question: If G has a normal complement generated by bicyclic units, does G × C ₂ also have a normal complement generated by bicyclic units? We give a negative answer to the above in general, showing that none of the normal complements of D ₈ × C ₂ × C ₂ is generated by bicyclic units, although a normal complement of D ₈ × C ₂ is indeed generated by bicyclic units.     

Reducible polar representations

In this paper the reducible polar representations of the compact connected Lie groups are classified. It turns out that there only exist “interesting” reducible polar representations of Lie groups of the types A ₃, A ₃×T ¹, B ₃, B ₃×T ¹, D ₄, D ₄×T ¹ and D ₄×A ₁. Up to equivalence, there is just one such representation of the first four Lie groups, there are three reducible polar representations of D ₄ and six of D ₄×T ¹ and D ₄×A ₁, respectively. From this follows immediately the classification of the compact connected subgroups of SO(n) which act transitively on products of spheres. Received: 28 April 2000     

Direct products of automorphism groups of graphs

In this article we study the product action of the direct product of automorphism groups of graphs. We generalize the results of Watkins [J. Combin Theory 11 (1971), 95–104], Nowitz and Watkins [Monatsh. Math. 76 (1972), 168–171] and W. Imrich [Israel J. Math. 11 (1972), 258–264], and we show that except for an infinite family of groups S_n × S_n, n≥2 and three other groups D₄ × S₂, D₄ × D₄ and S₄ × S₂ × S₂, the direct product of automorphism groups of two graphs is itself the automorphism group of a graph. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 26–36, 2009     

On <Emphasis Type="Italic">n</Emphasis> × <Emphasis Type="Italic">m</Emphasis>-valued Łukasiewicz-Moisil algebras

n×m-valued Łukasiewicz algebras with negation were introduced and investigated in [20, 22, 23]. These algebras constitute a non trivial generalization of n-valued Łukasiewicz-Moisil algebras and in what follows, we shall call them n×m-valued Łukasiewicz-Moisil algebras (or LM _n×m -algebras). In this paper, the study of this new class of algebras is continued. More precisely, a topological duality for these algebras is described and a characterization of LM _n×m -congruences in terms of special subsets of the associated space is shown. Besides, it is determined which of these subsets correspond to principal congruences. In addition, it is proved that the variety of LM _n×m -algebras is a discriminator variety and as a consequence, certain properties of the congruences are obtained. Finally, the number of congruences of a finite LM _n×m -algebra is computed.      

Linear operators preserving unitarily invariant norms of matrices

Let F _{m × n} be the set of all m × n matrices over the field F = C or R Denote by U_n (F) the group of all n × n unitary or orthogonal matrices according as F = C or F-R. A norm N() on F m ×n, is unitarily invariant if N(UAV) = N(A): for all A ∈ F _m×n U ∈ U _m (F). and V ∈ U_n (F). We characterize those linear operators T F _{m × n} → F _{m × n} which satisfy N (T(A)) = N(A)for all A ∈ F _{m × n}

for a given unitarily invariant norm N(). It is shown that the problem is equivalent to characterizing those operators which preserve certain subsets in F _{m × n} To develop the theory we prove some results concerning unitary operators on F _{m × n} which are of independent interest.     

The singular values of the hadamard product of a positive semidefinite and a skew-symmetric matrix

Let σ₁(X)≤ · ≤ σ_N(X)≤0 denote the ordered singular values ofan n × n matrix X and let α₁ (X) ≤ α₂(X)≤ · ≤ α_n(X) denote its ordered main diagonal entries (assuming that they are real). Let B be any complex n × n skew-symmetric matrix and ||.|| any unitarily invariant norm. It is shown that for any rea positive semidefinite n × n matrix A.     

On the crossing number of cm × cn

We show that the M-crossing number cr_M(C_m × C_n) of C_m × C_n behaves asymptotically according to lim_n→∞ {cr_M(C_m × C_n)/((m − 2)n)} = 1, for each m ≥ 3. This result reinforces the conjecture cr(C_m × C_n) = (m − 2)n if 3 ≤ m ≤ n, which has been proved only for m ≤ 6. © 1998 John Wiley & Sons, Inc. J. Graph Theory 28: 163–170, 1998     

Estimation for the Distribution of Two-dimensional Discrete Scan Statistics

This paper concerns the application of the method introduced in (Haiman, Extremes, 3:349–361, 2000) to estimate the distribution of two-dimensional discrete scan statistics. This method makes it possible to establish sharp bounds for the estimation errors. The method involves the estimation by simulation of the distribution of scan statistics for the particular rectangle sets of size 2×2, 2×3, 3×3, where the unit is the (m ₁×m ₂) dimension of the rectangular scanning window, m ₁, m ₂ ∈ℕ. We perform several numerical applications and compare our results with results obtained by other authors.      

On some subsets of Schechter's essential spectrum of a matrix operator and application to transport operator

This paper is devoted to the investigation of the essential approximate point spectrum and the essential defect spectrum of a 2 × 2 block operator matrix on a product of Banach spaces. The obtained results are applied to a two‐group transport operators with general boundary conditions in the Banach space L_p ([–a, a ] × [–1, 1]) × L_p ([–a, a ] × [–1, 1]), a > 0, p ≥ 1 (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The inverse problem of bisymmetric matrices with a submatrix constraint

An n×n real matrix A is called a bisymmetric matrix if A=A^T and A=S_nAS_n, where S_n is an n×n reverse unit matrix. This paper is mainly concerned with solving the following two problems: Problem I Given n×m real matrices X and B, and an r×r real symmetric matrix A₀, find an n×n bisymmetric matrix A such that where A([1: r]) is a r×r leading principal submatrix of the matrix A. Problem II Given an n×n real matrix A^*, find an n×n matrix  in S_E such that where ∥·∥ is Frobenius norm, and S_E is the solution set of Problem I. The necessary and sufficient conditions for the existence of and the expressions for the general solutions of Problem I are given. The explicit solution, a numerical algorithm and a numerical example to Problem II are provided. Copyright © 2003 John Wiley & Sons, Ltd.     

Direct products of cyclic semigroups an unions of groups

We consider direct productsS×U_eεE G _e=S ₁×…×S _n × U_eεE G _e of non-group finite cyclic semigroupsS _i, 1 ≤i ≤n, and finite unions of finite groups U_eεE G _e We prove that if such a semigroup is isomorphic to another of the same form, sayT×U _fεF H _f =T ₁×…×U _fεF H _f , whereT _j are non-group cyclic semigroups, 1≤j≤l, and U _fεF H _f is a union of groups, thenS is isomorphic toT and U_eεE G _e is isomorphic to U_fεF H _f . We then determine when a finite semigroup has such a decomposition and show how the direct factors can be found.     

Failure of cancellation conditions for additive linear orders

Coordinate independence assumptions, also known as cancellation conditions, play a central role in the representational theory of measurement for an ordering relation ≻ on a finite Cartesian product set A₁ × A₂ × ··· × A_m. A sequence of increasingly complex cancellation conditions is known to be sufficient for additive representability in the form (a₁, a₂, ⋖ a_m) ≻ (b₁, b₂, ⋖ b_m) ⇔ ∑_i v(a_i) > &sum_i v(b_i). A longstanding open problem is to determine the simplest subset of cancellation conditions as a function of the size of A₁ × ··· × A_m that is violated by every order ≻ that is not additively representable. This article proves a lower bound on minimum subset sufficiency when all A_i are binary. We conjecture that this lower bound, which is very near to a known upper bound, is the exact minimum. The binary-factors version of the problem is reformulated under a first-order independence assumption by a map from ≻ on {0,1}^m into a subset L of {1,0,−1}^m that is referred to as an additive linear order. The lower bound is then established by examples of additive linear orders on {1,0,−1}^m that exhibit worst-case failures of cancellation. © 1997 John Wiley & Sons, Inc. J Combin Designs 5:353–365, 1997     

Characterizations of new Cohen summing bilinear operators

We prove two characterizations of new Cohen summing bilinear operators. The first one is: Let X, Y and Z be Banach spaces, 1 < p < ∞, V : X × Y → Z a bounded linear operator and n ≥ 2 a natural number. Then V is new Cohen p-summing if and only if for all Banach spaces X₁,?…?, X_n and all p-summing operators U : X₁ × · · · × X_n → X, the operator V ? (U, I_Y) : X₁ × · · · × X_n × Y → Z is -summing. The second result is: Let H be a Hilbert space,, Y, Z Banach spaces and V : H × Y → Z a bounded bilinear operator and 1 < p < ∞. Then V is new Cohen p-summing if and only if for all Banach spaces E and all p-summing operators U : E → H, the operator V ? (U, I_Y) is (p, p*)-dominated.     

Resolvable packings of Kv with K2 × Kc's

The study of resolvable packings of K_v with K_r × K_c's is motivated by the use of DNA library screening. We call such a packing a (v, K_r × K_c, 1)‐RP. As usual, a (v, K_r × K_c, 1)‐RP with the largest possible number of parallel classes (or, equivalently, the largest possible number of blocks) is called optimal. The resolvability implies v ≡ 0 (mod rc). Let ρ be the number of parallel classes of a (v, K_r × K_c, 1)‐RP. Then we have ρ ≤ ?(v‐1)/(r + c ? 2)?. In this article, we present a number of constructive methods to obtain optimal (v, K₂ × K_c, 1)‐RPs meeting the aforementioned bound and establish some existence results. In particular, we show that an optimal (v, K₂ × K₃, 1)‐RP meeting the bound exists if and only if v ≡ 0 (mod 6). © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 177–189, 2009     

Dual pairs correspondences ofE 8,4 andE 7,4

In this paper we state and prove the dual pairs correspondences of Spin(4,4)×Spin(8) inE _8,4 andF _4,4×SU₂ and Spin(4,4)×SU ₂ ³ inE _7,4. For the first dual pair, every finite dimensional representation of Spin(8) occurs and each corresponds with finite but unbounded multiplicity to a quaternionic representation of Spin(4,4) having the same infinitesimal character. For the other two dual pairs the correspondences are one to one.     

Units of ℤ(Cp × C2) and ℤ(Cp × C2 × C2)

The goal of this article is to describe a multiplicatively independent set, which generates the group of units of the integral group ring ?G, where G is either the cyclic group of order 2p or C₂ × C₂ × C_p, for a prime number p that satisfies some suitable conditions that will be specified later.