Extensions of the Erdös-Ko-Rado Theorem

An antichain of subsets of 1,2,...,n has the Erdös-Ko-Rado property if |A_i|?n/2 and A_i∩A_j≠Ø(i=j). This paper contains a number of results concerning the distribution of sizes of sets in such a family, and also in families where the restriction |A_i|?n/2 is removed.     

The Minimum Rank of a 3 × 3 Partial Block Matrix

After recalling the definition and some basic properties of finite hypergroups—a notion introduced in a recent paper by one of the authors—several non-trivial examples of such hypergroups are constructed. The examples typically consist of n n×n matrices, each of which is an appropriate polynomial in a certain tri-diagonal matrix. The crucial result required in the construction is the following: ‘let A be the matrix with ones on the super-and sub-diagonals, and with main diagonal given by a ₁…a _n which are non-negative integers that form either a non-decreasing or a symmetric unimodal sequence; then A_k =P_k (A) is a non-negative matrix, where p_k denotes the characteristic polynomial of the top k× k principal submatrix of A, for k=1,…,n. The matrices A_k as well as the eigenvalues of A, are explicitly described in some special cases, such as (i) a_i =0 for all ior (ii) a_i =0 for i<n and a_n =1. Characters ot finite abelian hypergroups are defined, and that naturally leads to harmonic analysis on such hypergroups.     

Least‐squares solutions of matrix inverse problem for bi‐symmetric matrices with a submatrix constraint

An n × n real matrix A = (a_ij)_{n × n} is called bi‐symmetric matrix if A is both symmetric and per‐symmetric, that is, a_ij = a_ji and a_ij = a_n+1?1,n+1?i (i, j = 1, 2,..., n). This paper is mainly concerned with finding the least‐squares bi‐symmetric solutions of matrix inverse problem AX = B with a submatrix constraint, where X and B are given matrices of suitable sizes. Moreover, in the corresponding solution set, the analytical expression of the optimal approximation solution to a given matrix A^* is derived. A direct method for finding the optimal approximation solution is described in detail, and three numerical examples are provided to show the validity of our algorithm. Copyright © 2007 John Wiley & Sons, Ltd.     

The property of being equationally Noetherian for some soluble groups

Let B be a class of groups A which are soluble, equationally Noetherian, and have a central series A = A₁ ⩾ A₂ ⩾ … A_n ⩾ … such that ⋂A_n = 1 and all factors A_n/A_n+1 are torsion-free groups; D is a direct product of finitely many cyclic groups of infinite or prime orders. We prove that the wreath product D ≀ A is an equationally Noetherian group. As a consequence we show that free soluble groups of arbitrary derived lengths and ranks are equationally Noetherian. Supported by RFBR grant No. 05-01-00292. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 46–59, January–February, 2007.     

Isomorphism and elementary equivalence of multilinear maps

In [14], we proved that two finitely generated finite-by-nilpotent groups G,H are elementarily equivalent if and only if Z×G and Z×H are isomorphic. In the present paper, we obtain similar characterizations of elementary equivalence for the following classes of structures:

1. the (n+2)-tuples (A ₁…,A _n+1,f),where n≥2 is an integerA ₁…,A _n+1 are disjoint finitely generated abelian groups and f A ₁×…×A _n →A _n+1: is a n-linear map;

2. the triples (A,B f), where n≥2 is an integerA,B are disjoint finitely generated abelian groups and f : A ⁿ →B is a n-linear map;

3. the couples (A,f), where n≥2 is an integerA is a finitely generated abelian group and f:A ⁿ →A is a n-linear map.

For each class, we show that elementary equivalence does not imply isomorphism. In particular, we give an example of two nonisomorphic finitely generated torsion-free Lie rings which are elementarily equivalent.     

Primitive systems of elements in the varieties A m A n : Criterion and inducing

LetA _n, n≥0, be a variety of all Abelian groups whose exponental divides n. We establish a criterion of being primitive for varieties of the formA _m A _n, and study into the question of inducing primitive systems of elements in free groups of these. The results obtained give a solution to the problem by Bachmuth and Mochizuki concerning the tame range of varietiesA _m A _n for the case where m is freed of squares, and lend support to the conjecture by Bryant and Gupta as to inducing primitive, systems for varieties likeA _pnA. This author’s part is supported by RFFR grant No. 99-01-00567. Translated fromAlgebra i Logika, Vol. 38, No. 5, pp. 513–530, September–October, 1999.     

Convergence in distribution of products of random matrices

Summary We consider a sequence A ₂, A ₂, ... of i.i.d. nonnegative matrices of size d × d, and investigate convergence in distribution of the product M _n: =A ₁ ... A _n. When d2 it is possible for M _n to converge in distribution (without normalization) to a distribution not concentrated on the zero matrix. Several equivalent conditions for this to happen are given. These lead to a fairly general family of examples. These conditions can also be used to determine when the a.s. limit of 1/nlogM _n equals the logarithm of the largest eigenvalue of E(A ₁).     

Convergence of the efficient sets

LetA _n,n=1, 2, ... be nonempty subsets of a linear metric spaceE andC _n, n=1, 2, ... convex cones ofE. We consider the efficient sets Min(A _n, C_n) and the aim of this paper is to show that under suitable conditions, the convergence ofA _n andC _n toA andC respectively, implies the convergence of Min(A _n,C _n) to Min(A, C). Several illustrative examples are given which clarify the results.     

The strong approximation of extremal processes

Summary If X ₁, X ₂, ..., are i.i.d. random variables and Y _n =Max(X ₁, ..., X _n ); if for some sequences A _n , B_n, n=1, 2, ..., E _n (t)=A_nY_[nt]+B_n is such that E _n (1) weakly converges to a non degenerate limit distribution, then we prove that it is possible to construct a sequence of replicates of extremal processes E ⁽ⁿ⁾(t) on the same probability space, such that d(E _n (.), E ⁽ⁿ⁾(.))0 a.s., with the Levy metric. We give the rates of consistency of the approximations.     

Universally equivalent solvable groups

Every group that is finitely presented in the varietyA ⁿ of solvable groups. and is universally equivalent to a free group F_r(A ⁿ) in this variety, is embedded in the Cartesian degree of F₂(A ⁿ). All subgroups on a set of two generators in that Cartesian degree which are universally equivalent to F₂(A ⁿ) are determined. Free solvable and nilpotent groups are proved universally equivalent. Supported by RFFR grant No. 99-01-00567, and through the RP “Universities of Russia. Fundamental Research.” Translated fromAlgebra i Logika, Vol. 39, No. 2, pp. 227–240, March–April, 2000.     

Sequences of Endomorphism Groups of Abelian Groups

In the paper, Problem 18.3 of the book “Abelian groups” (2015) by L. Fuchs is solved in the case of Abelian groups with finite p-ranks. For an Abelian group A, a sequence of groups (A_n) is considered, where A₀ = A and A_n+1 = End A_n. It is shown that, if all p-ranks of the group A are finite, then this sequence can stabilize either after A₀ or after A₁.

     

Generalization of Strang's Preconditioner with Applications to Toeplitz Least Squares Problems

In this paper, we propose a method to generalize Strang's circulant preconditioner for arbitrary n-by-n matrices A_n. The th column of our circulant preconditioner Sn is equal to the th column of the given matrix A_n. Thus if A_n is a square Toeplitz matrix, then Sn is just the Strang circulant preconditioner. When Sn is not Hermitian, our circulant preconditioner can be defined as . This construction is similar to the forward-backward projection method used in constructing preconditioners for tomographic inversion problems in medical imaging. We show that if the matrix A_n has decaying coefficients away from the main diagonal, then is a good preconditioner for An. Comparisons of our preconditioner with other circulant-based preconditioners are carried out for some 1-D Toeplitz least squares problems: min ∥ b - Ax∥₂. Preliminary numerical results show that our preconditioner performs quite well, in comparison to other circulant preconditioners. Promising test results are also reported for a 2-D deconvolution problem arising in ground-based atmospheric imaging.     

Monotonicity of permanents of direct sums of doubly stochastic matrices

Let Ωn be the set of all n × n doubly stochastic matrices, let J_n be the n × n matrix all of whose entries are 1/n and let σ _k (A) denote the sum of the permanent of all k × k submatrices of A. It has been conjectured that if A ε Ω _n and A ≠ J_J then g_A,k (θ) ? σ _k ((1 θ)J_n 1 θA) is strictly increasing on [0,1] for k = 2,3,…,n. We show that if A = A ₁ ⊕ ⊕A_t (t ≥ 2) is an n × n matrix where A_i for i = 1,2, …,t, and if for each i g_Ai,ki (θ) is non-decreasing on [0.1] for k_t = 2,3,…,n_i , then g_A,k (θ) is strictly increasing on [0,1] for k = 2,3,…,n.     

Grassmannians of 2-Sided Vector Spaces

Let k ? K be an extension of fields, and let A ? M _n (K) be a k-algebra. We study parameter spaces of m-dimensional subspaces of K ⁿ which are invariant under A. The space  _A (m, n), whose R-rational points are A-invariant, free rank m summands of R ⁿ , is well known. We construct a distinct parameter space,  _A (m, n), which is a fiber product of a Grassmannian and the projectivization of a vector space. We then study the intersection  _A (m, n) ∩  _A (m, n), which we denote by  _A (m, n). Under suitable hypotheses on A, we construct affine open subschemes of  _A (m, n) and  _A (m, n) which cover their K-rational points. We conclude by using  _A (m, n),  _A (m, n), and  _A (m, n) to construct parameter spaces of 2-sided subspaces of 2-sided vector spaces.     

On semidefinite linear complementarity problems

Given a linear transformation L:? ⁿ →? ⁿ and a matrix Q∈? ⁿ , where ? ⁿ is the space of all symmetric real n×n matrices, we consider the semidefinite linear complementarity problem SDLCP(L,? ⁿ ₊,Q) over the cone ? ⁿ ₊ of symmetric n×n positive semidefinite matrices. For such problems, we introduce the P-property and its variants, Q- and GUS-properties. For a matrix A∈R ^n×n , we consider the linear transformation L _A :? ⁿ →? ⁿ defined by L _A (X):=AX+XA ^T and show that the P- and Q-properties for L _A are equivalent to A being positive stable, i.e., real parts of eigenvalues of A are positive. As a special case of this equivalence, we deduce a theorem of Lyapunov. Received: March 1999 / Accepted: November 1999?Published online April 20, 2000     

Primes in the semigroup of non-negative matrices

A matrix A in the semigroup N _n of non-negative n×nmatrices is prime if A is not monomial and A=BC,B CεN _n implies that either B or C is monomial. One necessary and another sufficient condition are given for a matrix in N _n to be prime. It is proved that every prime in N _n is completely decomposable.