On the existence of finite central groupoids of all possible ranks. I

The problem of determining the number of finite central groupoids (an algebraic system satisfying the identity (x · y) · (y ? z) = y) is equivalent to the problem of determining the number of solutions of the matrix equation A² = J, where A is a 0, 1 matrix and J is a matrix of 1's.The existence of solutions of A² = J of all ranks r, where $\text{n ? r ? [}\text{(n}{}^2\text{+ 1)}\text{2}\text{]}$, and A is n² × n², is proven. Since these are the only possible values, the question of existence solutions of all possible ranks is completely answered. The techniques and proofs are of a constructive nature.     

On the Courant-Fischer theory for Krein spaces

Let J=I_r⊕-I_n-r,0<r<n. An n×n complex matrix A is said to be J-Hermitian if JA=A^∗J. An extension of the classical theory of Courant and Fischer on the Rayleigh ratio of Hermitian matrices is stated for J-Hermitian matrices. Applications to the theory of small oscilations of a mechanical system are presented.     

On the matrix equation Am = λJ

In this paper, we will study the h-circulants which satisfy the matrix equation A^m = λJ of n × n matrices. We will determine all the (0, 1) h-circulant solutions for 0 < h < n so that h^m ≡ 0 (mod n).     

General frame constructions for Z-cyclic triplewhist tournaments

Frames are useful in dealing with resolvable designs such as resolvable balanced incomplete block designs and triplewhist tournaments. Z-cyclic triplewhist tournament frames are also useful in the constructions of Z-cyclic triplewhist tournaments. In this paper, the concept of an (h₁,h₂,…,hn;u)-regular Z-cyclic triplewhist tournament frame is defined, and used to establish several quite general recursive constructions for Z-cyclic triplewhist tournaments. As corollaries, we are able to unify many known constructions for Z-cyclic triplewhist tournaments. As an application, some new Z-cyclic triplewhist tournament frames and Z-cyclic triplewhist tournaments are obtained. The known existence results of such designs are then extended.     

Abeliants and their application to an elementary construction of Jacobians

The abeliant is a polynomial rule which to each n×n by n+2 array with entries in a commutative ring with unit associates an n×n matrix with entries in the same ring. The theory of abeliants, first introduced in an earlier paper of the author, is simplified and extended here. Now let J be the Jacobian of a nonsingular projective algebraic curve defined over an algebraically closed field. With the aid of the theory of abeliants we obtain explicit defining equations for J and its group law.     

An extension of Birkhoff’s theorem with an application to determinants

Let M_n(F) denote the algebra of n×n matrices over the field F of complex, or real, numbers. Given a self-adjoint involution J∈M_n(C), that is, J=J^*,J²=I, let us consider Cⁿ endowed with the indefinite inner product [,] induced by J and defined by [x,y]?〈Jx,y〉,x,y∈Cⁿ. Assuming that (r,n-r), 0?r?n, is the inertia of J, without loss of generality we may assume J=diag(j₁,?,j_n)=I_r⊕-I_n-r. For T=(|t_ik|²)∈M_n(R), the matrices of the form T=(|t_ik|²j_ij_k), with all line sums equal to 1, are called J-doubly stochastic matrices. In the particular case r∈{0,n}, these matrices reduce to doubly stochastic matrices, that is, non-negative real matrices with all line sums equal to 1. A generalization of Birkhoff’s theorem on doubly stochastic matrices is obtained for J-doubly stochastic matrices and an application to determinants is presented.     

A bound on the scrambling index of a primitive matrix using Boolean rank

The scrambling index of an n×n primitive matrix A is the smallest positive integer k such that A^k(A^t)^k=J, where A^t denotes the transpose of A and J denotes the n×n all ones matrix. For an m×n Boolean matrix M, its Boolean rank b(M) is the smallest positive integer b such that M=AB for some m×b Boolean matrix A and b×n Boolean matrix B. In this paper, we give an upper bound on the scrambling index of an n×n primitive matrix M in terms of its Boolean rank b(M). Furthermore we characterize all primitive matrices that achieve the upper bound.     

A note on a conjecture on permanents

Let Kn denote the set of all n × n nonnegative matrices whose entries have sum n, and let ϕ be a real function on K_n defined by ϕ (X) = Πⁿ_i=1Σⁿ_j=1x_ij + Πⁿ_j=1Σⁿ_i=1x_ij − per X for X = [x_ij] ϵ K_n. A matrix A ϵ K_n is called a ϕ -maximizing matrix on K_n if ϕ (A) ⩾ ϕ (X) for all X ϵ K_n. It is conjectured that J_n = [1/n]_{n × n} is the unique ϕ-maximizing matrix on K_n. In this note, the following are proved: (i) If A is a positive ϕ-maximizing matrix, then A = J_n. (ii) If A is a row stochastic ϕ-maximizing matrix, then A = J_n. (iii) Every row sum and every column sum of a ϕ-maximizing matrix lies between 1 − √2·n!/nⁿ and 1 + (n − 1)√2·n!/nⁿ. (iv) For any p.s.d. symmetric A ϵ K_n, ϕ (A) ⩽ 2 − n!/nⁿ with equality iff A = J_n. (v) ϕ attains a strict local maximum on K_n at J_n.     

Two-sided hyperbolic SVD

In this paper, we propose the two-sided hyperbolic SVD (2HSVD) for square matrices, i.e., A=UΣV^[∗], where U and V^[∗] are J-unitary (J=diag(±1)) and Σ is a real diagonal matrix of “double-hyperbolic” singular values. We show that, with some natural conditions, such decomposition exists without the use of hyperexchange matrices. In other words, U and V^[∗] are really J-unitary with regard to J and not some matrix which is permutationally similar to matrix J. We provide full characterization of 2HSVD and completely relate it to the semidefinite J-polar decomposition.     

Universal spaces for homotopy limits of modules over coaugmented functors (I)

For a coaugmented functor J on spaces, we consider J-modules and finite J-limits. The former are spaces X which are retracts of JX via the natural map. The latter are homotopy limits of J-modules arranged in diagrams whose shape is finite dimensional. Familiar examples are generalised Eilenberg MacLane spaces, which are the SP^∞-modules. Finite SP^∞-limits are nilpotent spaces with a very strong finiteness property. We show that the cofacial Bousfield-Kan construction of the functors J_n is universal for finite J-limits in the sense that every map X→Y where Y is a finite J-limit, factors through such natural map X→J_nX, for some n<∞.     

A matrix perturbation method for computing the steady-state probability distributions of probabilistic Boolean networks with gene perturbations

Modeling genetic regulatory interactions is an important issue in systems biology. Probabilistic Boolean networks (PBNs) have been proved to be a useful tool for the task. The steady-state probability distribution of a PBN gives important information about the captured genetic network. The computation of the steady-state probability distribution involves the construction of the transition probability matrix of the PBN. The size of the transition probability matrix is 2ⁿ×2ⁿ where n is the number of genes. Although given the number of genes and the perturbation probability in a perturbed PBN, the perturbation matrix is the same for different PBNs, the storage requirement for this matrix is huge if the number of genes is large. Thus an important issue is developing computational methods from the perturbation point of view. In this paper, we analyze and estimate the steady-state probability distribution of a PBN with gene perturbations. We first analyze the perturbation matrix. We then give a perturbation matrix analysis for the captured PBN problem and propose a method for computing the steady-state probability distribution. An approximation method with error analysis is then given for further reducing the computational complexity. Numerical experiments are given to demonstrate the efficiency of the proposed methods.     

Subnormal structure of non-stable unitary groups over rings

Let R be a commutative ring with identity in which 2 is invertible. Let H denote a subgroup of the unitary group U(2n,R,Λ) with n≥4. H is normalized by EU(2n,J,Γ^J) for some form ideal (J,Γ^J) of the form ring (R,Λ). The purpose of the paper is to prove that H satisfies a “sandwich” property, i.e. there exists a form ideal (I,Γ^I) such that

EU(2n,IJ⁸Γ^J,Γ)⊆H⊆CU(2n,I,Γ^I).     

Approximation and asymptotics of eigenvalues of unbounded self-adjoint Jacobi matrices acting in <Emphasis Type="Italic">l</Emphasis><Superscript>2</Superscript> by the use of finite submatrices

We consider the problem of approximation of eigenvalues of a self-adjoint operator J defined by a Jacobi matrix in the Hilbert space l ²(ℕ) by eigenvalues of principal finite submatrices of an infinite Jacobi matrix that defines this operator. We assume the operator J is bounded from below with compact resolvent. In our research we estimate the asymptotics (with n → ∞) of the joint error of approximation for the eigenvalues, numbered from 1 to N; of J by the eigenvalues of the finite submatrix J _n of order n × n; where N = max{k ∈ ℕ: k ≤ rn} and r ∈ (0; 1) is arbitrary chosen. We apply this result to obtain an asymptotics for the eigenvalues of J. The method applied in this research is based on Volkmer’s results included in [23].     

The primitive Boolean matrices with the second largest scrambling index by Boolean rank

The scrambling index of an n × n primitive Boolean matrix A is the smallest positive integer k such that A ^k (A ^T) ^k = J, where A ^T denotes the transpose of A and J denotes the n×n all ones matrix. For an m×n Boolean matrix M, its Boolean rank b(M) is the smallest positive integer b such that M = AB for some m × b Boolean matrix A and b×n Boolean matrix B. In 2009, M. Akelbek, S. Fital, and J. Shen gave an upper bound on the scrambling index of an n×n primitive matrix M in terms of its Boolean rank b(M), and they also characterized all primitive matrices that achieve the upper bound. In this paper, we characterize primitive Boolean matrices that achieve the second largest scrambling index in terms of their Boolean rank.     

Strong convergence theorems for maximal monotone mappings in Banach spaces

Let E be a uniformly convex and 2-uniformly smooth real Banach space with dual E^∗. Let be a Lipschitz continuous monotone mapping with A⁻¹(0)≠∅. For given u,x₁∈E, let {xn} be generated by the algorithm xn+1:=βnu+(1−βn)(xn−αnAJxn), n?1, where J is the normalized duality mapping from E into E^∗ and {λn} and {θn} are real sequences in (0,1) satisfying certain conditions. Then it is proved that, under some mild conditions, {xn} converges strongly to x^∗∈E where Jx^∗∈A⁻¹(0). Finally, we apply our convergence theorems to the convex minimization problems.     

An analogue of group divisible designs for Moore graphs

We study graphs whose adjacency matrix S of order n satisfies the equation S + S² = J ? K + kI, where J is a matrix of order n of all 1's, K is the direct sum on $\text{n}\text{l}$ matrices of order l of all 1's, and I is the identity matrix. Moore graphs are the only solutions to the equation in the case l = 1 for which K = I. In the case k = l we can obtain Moore graphs from a solution S by a bordering process analogous to obtaining (ν, κ, λ)-designs from some group divisible designs. Other parameters are rare. We are able to find one new interesting graph with parameters k = 6, l = 4 on n = 40 vertices. We show that it has a transitive automorphism group isomorphic to C₄ × S₅.     

Optimal successive overrelaxation iterative methods for P-cyclic matrices

Summary We consider linear systems whose associated block Jacobi matricesJ _p are weakly cyclic of indexp. In a recent paper, Pierce, Hadjidimos and Plemmons [13] proved that the block two-cyclic successive overrelaxation (SOR) iterative method is numerically more effective than the blockq-cyclic SOR-method, 2<qp, if the eigenvalues ofJ _p ^p are either all non-negative or all non-positive. Based on the theory of stationaryp-step methods, we give an alternative proof of their theorem. We further determine the optimal relaxation parameter of thep-cyclic SOR method under the assumption that the eigenvalues ofJ _p ^p are contained in a real interval, thereby extending results due to Young [19] (for the casep=2) and Varga [15] (forp>2). Finally, as a counterpart to the result of Pierce, Hadjidimos and Plemmons, we show that, under this more general assumption, the two-cyclic SOR method is not always superior to theq-cyclic SOR method, 2<qp.Dedicated to R. S. Varga on the occasion of his 60th birthdayResearch supported in part by the Deutsche Forschungsgemeinschaft     

Extremes of conditioned elliptical random vectors

Let {X_n,n?1} be iid elliptical random vectors in R^d,d≥2 and let I,J be two non-empty disjoint index sets. Denote by X_n,I,X_n,J the subvectors of X_n with indices in I,J, respectively. For any a∈R^d such that a_J is in the support of X_1,J the conditional random sample X_n,I|X_n,J=a_J,n≥1 consists of elliptically distributed random vectors. In this paper we investigate the relation between the asymptotic behaviour of the multivariate extremes of the conditional sample and the unconditional one. We show that the asymptotic behaviour of the multivariate extremes of both samples is the same, provided that the associated random radius of X₁ has distribution function in the max-domain of attraction of a univariate extreme value distribution.     

Jordan-Ketten und realisierungen rationaler matrizen

If the inverse of a square polynomial matrix L(s) is proper rational, then L(s)^-1 can be written as C(sI–J)^-1B. The result of this note states that if J is an nXn Jordan matrix, with n=degreedetL(s), then C consists of Jordan chains of L(s), and B^T of Jordan chains of L(s)^T. This is a generalization of the fact that each matrix which transforms a complex matrix A into Jordan form is made up of eigenvectors and generalized eigenvectors of A. The proof of our result relies on the realization theory of rational matrices.     

On the existence of graphs of diameter two and defect two

In the context of the degree/diameter problem, the ‘defect’ of a graph represents the difference between the corresponding Moore bound and its order. Thus, a graph with maximum degree d and diameter two has defect two if its order is n=d²−1. Only four extremal graphs of this type, referred to as (d,2,2)-graphs, are known at present: two of degree d=3 and one of degree d=4 and 5, respectively. In this paper we prove, by using algebraic and spectral techniques, that for all values of the degree d within a certain range, (d,2,2)-graphs do not exist.The enumeration of (d,2,2)-graphs is equivalent to the search of binary symmetric matrices A fulfilling that AJ_n=dJ_n and A²+A+(1−d)I_n=J_n+B, where J_n denotes the all-one matrix and B is the adjacency matrix of a union of graph cycles. In order to get the factorization of the characteristic polynomial of A in Q[x], we consider the polynomials F_i,d(x)=f_i(x²+x+1−d), where f_i(x) denotes the minimal polynomial of the Gauss period , being ζ_i a primitive ith root of unity. We formulate a conjecture on the irreducibility of F_i,d(x) in Q[x] and we show that its proof would imply the nonexistence of (d,2,2)-graphs for any degree d>5.