Linear stationary control systems over a Boolean semiring: Geometric properties and the isomorphism problem

In the present paper, we consider linear stationary dynamical systems over a Boolean semiring B. We analyze the complete observability, identifiability, reachability, and controllability of such systems. We define the notion of a “graph of modules” of completely controllable, completely reachable Boolean linear stationary systems by analogy with the spaces of modules in the case of systems over fields. We give a graph-theoretic interpretation of systems of this class. We solve the isomorphism problem in this class of systems.     

Linear recurring sequences over modules

The aim of this paper is to extend some fundamental and applied results of the theory of linear recurring sequences over fields to the case of polylinear recurring sequences over rings and modules. Quasi-Frobenius modules and Galois rings play a very special role in this project.     

Linear recurring sequences over rings and modules

To the 80th anniversary of the birth of Alexander Illarionovich Uzkow (1913–1990)     

On matrices over an arbitrary semiring and their generalized inverses

In this paper, we consider matrices with entries from a semiring S. We first discuss some generalized inverses of rectangular and square matrices. We establish necessary and sufficient conditions for the existence of the Moore–Penrose inverse of a regular matrix. For an m×n$m\times n$ matrix A  , an n×m$n\times m$ matrix P and a square matrix Q of order m, we present necessary and sufficient conditions for the existence of the group inverse of QAP   with the additional property that P(QAP)^#Q$P{(QAP)}^{\mathrm{\#}}Q$ is a {1,2}$\{1,2\}$ inverse of A  . The matrix product used here is the usual matrix multiplication. The result provides a method for generating elements in the set of {1,2}$\{1,2\}$ inverses of an m×n$m\times n$ matrix A starting from an initial {1} inverse of A  . We also establish a criterion for the existence of the group inverse of a regular square matrix. We then consider a semiring structure (_Mm×n(S),+,°)$({\mathbf{M}}_{m\times n}(\mathbf{S}),+,°)$ made up of m×n$m\times n$ matrices with the addition defined entry-wise and the multiplication defined as in the case of the Hadamard product of complex matrices. In the semiring (_Mm×n(S),+,°)$({\mathbf{M}}_{m\times n}(\mathbf{S}),+,°)$, we present criteria for the existence of the Drazin inverse and the Moore–Penrose inverse of an m×n$m\times n$ matrix. When S is commutative, we show that the Hadamard product preserves the Hermitian property, and provide a Schur-type product theorem for the product A°(CC^?)$A°(C{C}^{?})$ of a positive semidefinite n×n$n\times n$ matrix A   and an n×n$n\times n$ matrix C.     

Flat modules and rings finitely generated as modules over their center

A module is called distributive (is said to be a chain module) if the lattice of all its submodules is distributive (is a chain). Let a ringA be a finitely generated module over its unitary central subringR. We prove the equivalence of the following conditions:

1. A is a right or left distributive semiprime ring;
2. for any maximal idealM of a subringR central inA, the ring of quotientsA _M is a finite direct product of semihereditary Bézout domains whose quotient rings by the Jacobson radicals are finite direct products of skew fields;
3. all right ideals and all left ideals of the ringA are flat (right and left) modules over the ringA, andA is a distributive ring, without nonzero nilpotent elements, all of whose quotient rings by prime ideals are semihereditary orders in skew fields.

     

Linear maps that strongly preserve regular matrices over the Boolean algebra

The set of all m × n Boolean matrices is denoted by $ \mathbb{M} $ \mathbb{M} _m,n . We call a matrix A ∈ $ \mathbb{M} $ \mathbb{M} _m,n regular if there is a matrix G ∈ $ \mathbb{M} $ \mathbb{M} _n,m such that AGA = A. In this paper, we study the problem of characterizing linear operators on $ \mathbb{M} $ \mathbb{M} _m,n that strongly preserve regular matrices. Consequently, we obtain that if min{m, n} ⩽ 2, then all operators on $ \mathbb{M} $ \mathbb{M} _m,n strongly preserve regular matrices, and if min{m, n} ⩾ 3, then an operator T on $ \mathbb{M} $ \mathbb{M} _m,n strongly preserves regular matrices if and only if there are invertible matrices U and V such that T(X) = UXV for all X ε $ \mathbb{M} $ \mathbb{M} _m,n , or m = n and T(X) = UX ^T V for all X ∈ $ \mathbb{M} $ \mathbb{M} _n .     

Boolean techniques for matroidal decomposition of independence systems and applications to graphs

The problem of decomposing an independence system into the set-theoretic union of matroids is considered in the first part of this paper and a Boolean procedure is proposed for finding the prime matroidal components of such a decomposition. The second part of the paper deals with the special case of the independence system of all stable sets of a graph, characterizes the graphs whose family of stable sets is the set-theoretic union of two matroids, produces a class of perfect graphs of matroidal number k and gives for graphs an accelerated version of the general decomposition technique.     

Linear stationary surface waves over a rough bottom

We consider the linear formulation of the 3-dimensional problem of a stationary flow with a free surface over a rough bottom of an irrotational capillary heavy ideal incompressible fluid. For fast near-critical flows we derive an approximate equation for the free surface elevation. We express a fundamental solution to the problem in terms of contour integrals and establish its asymptotic behavior at large distances from the origin.     

Latroids and their representation by codes over modules

It has been known for some time that there is a connection between linear codes over fields and matroids represented over fields. In fact a generator matrix for a linear code over a field is also a representation of a matroid over that field. There are intimately related operations of deletion, contraction, minors and duality on both the code and the matroid. The weight enumerator of the code is an evaluation of the Tutte polynomial of the matroid, and a standard identity relating the Tutte polynomials of dual matroids gives rise to a MacWilliams identity relating the weight enumerators of dual codes. More recently, codes over rings and modules have been considered, and MacWilliams type identities have been found in certain cases.

In this paper we consider codes over rings and modules with code duality based on a Morita duality of categories of modules. To these we associate latroids, defined here. We generalize notions of deletion, contraction, minors and duality, on both codes and latroids, and examine all natural relations among these.

We define generating functions associated with codes and latroids, and prove identities relating them, generalizing above-mentioned generating functions and identities.

     

Boolean planarity characterization of graphs

Although many criteria for testing the planarity of a graph have been found since the beginning of the thirties, this paper presents a new criterion described by Boolean technique which is proved in an independent way without any use of the criteria obtained before. This research was supported by the U.S. National Science Foundation under Grant Number ECS 85 03212 and by the National Natural Science Foundation of China as well. And, the author is greatly indebted to Professor Peter L. Hammer for many helpful discussions, suggestions, and comments.     

Linear systems over localizations of rings

We describe a method for solving linear systems over the localization of a commutative ring R at a multiplicatively closed subset S that works under the following hypotheses: the ring R is coherent, i.e., we can compute finite generating sets of row syzygies of matrices over R, and there is an algorithm that decides for any given finitely generated ideal \(I \subseteq R\) the existence of an element r in \(S \cap I\) and in the affirmative case computes r as a concrete linear combination of the generators of I.     

Linear dynamical systems over finite rings

The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the elementary divisors of the linear function, and the problem of determining whether the system is a fixed point system can be answered by computing and factoring the system's characteristic polynomial and minimal polynomial. It has become clear recently that the study of finite linear dynamical systems must be extended to embrace finite rings. The difficulty of dealing with an arbitrary finite commutative ring is that it lacks of unique factorization. In this paper, an efficient algorithm is provided for analyzing the cycle structure of a linear dynamical system over a finite commutative ring. In particular, for a given commutative ring R such that $|R|=q$, where q is a positive integer, the algorithm determines whether a given linear system over $R^n$ is a fixed point system or not in time $O(n^3\log (n\log (q)))$.     

Linear operators that preserve Boolean rank of Boolean matrices

The Boolean rank of a nonzero m × n Boolean matrix A is the minimum number k such that there exist an m× k Boolean matrix B and a k × n Boolean matrix C such that A = BC. In the previous research L. B. Beasley and N. J. Pullman obtained that a linear operator preserves Boolean rank if and only if it preserves Boolean ranks 1 and 2. In this paper we extend this characterizations of linear operators that preserve the Boolean ranks of Boolean matrices. That is, we obtain that a linear operator preserves Boolean rank if and only if it preserves Boolean ranks 1 and k for some 1 < k ? m.     

Coloring infinite graphs and the Boolean prime ideal theorem

It is shown that the following theorem holds in set theory without AC: There is a functionG which assigns to each Boolean algebraB a graphG(B) such that (1) ifG(B) is 3-colorable then there is a prime ideal inB and (2) every finite subgraph ofG(B) is 3-colorable. The proof uses a combinatorial lemma on finite graphs.     

Abelian groups as endomorphic modules over their endomorphism ring

Let R be an associative ring with a unit and N be a left R-module. The set M _R(N) = {f: N → N | f(rx) = rf(x), r ∈ R, x ∈ N} is a near-ring with respect to the operations of addition and composition and contains the ring E _R(N) of all endomorphisms of the R-module N. The R-module N is endomorphic if M _R(N) = E _R(N). We call an Abelian group endomorphic if it is an endomorphic module over its endomorphism ring. In this paper, we find endomorphic Abelian groups in the classes of all separable torsion-free groups, torsion groups, almost completely decomposable torsion-free groups, and indecomposable torsion-free groups of rank 2. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 13, No. 1, pp. 229–233, 2007.     

Abelian groups flat as modules over their endomorphism ring

Let R be a commutative ring with identity and let M be an R-module. We examine the situation where for each prime ideal ρof R the set of all ρ-prime submodules of M is finite. In case R is Noetherian and M is finitely generated, we prove that this condition is equivalent to there being a positive integer n such that for every prime ideal ρ of R, the number of ρ-prime submodules of Mis less than or equal to n. We further show that in this case, there is at most one ρ-prime submodule for all but finitely many prime ideals ρ of R.     

Summand absorbing submodules of a module over a semiring

An R-module V over a semiring R lacks zero sums (LZS) if $x+y=0$ implies $x=y=0$. More generally, we call a submodule W of V “summand absorbing” (SA) in V if $?x,y\in V:x+y\in W?x\in W,y\in W$. These arise in tropical algebra and modules over idempotent semirings, as well as modules over semirings of sums of squares. We explore the lattice of finite sums of SA-submodules, obtaining analogs of the Jordan–Hölder theorem, the noetherian theory, and the lattice-theoretic Krull dimension. We pay special attention to finitely generated SA-submodules, and describe their explicit generation.     

The zero divisor graphs of Boolean posets

In this paper, it is proved that if B is a Boolean poset and S is a bounded pseudocomplemented poset such that S\Z(S) = {1}, then Γ(B) ≌ Γ(S) if and only if B ≌ S. Further, we characterize the graphs which can be realized as zero divisor graphs of Boolean posets.