ON THE ｛2｝－INVERSE AND SOME ORDERING PROPERTIES OF NONNEGATIVE DEFINITE MATRICES

ＥＲＫＫＩＰ．ＬＩＳＫＩ（ＤｅｐｅｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃａｌＳｃｉｅｎｃｅｓ，ＵｎｉｖｅｒｓｉｔｙｏｆＴａｍｐｅｒｓ，Ｆｉｎｌａｎｄ）ＷＡＮＧＳＯＮＧＧＵＩ（王松桂）（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，Ｂｅｉ...     

Inverses of Boolean matrices

For a Boolean matrix A, a g-inverse of A is a Boolean matrix G satisfying AGA=A, and a Vagner inverse is a g-inverse which in addition satisfies GAG=G. We give algorithms for finding all g-inverses, all Vagner inverses, and all of several other types of inverses including Moore-Penrose inverses. We give a criterion for a Boolean matrix to be regular, and criteria for the various types of inverse to exist. We count the numbers of Boolean matrices having Moore-Penrose and related types of inverses.     

The reverse order law for {1, 3, 4}-inverse of the product of two matrices

The relationship between {1, 3, 4}-inverses of AB and the product of {1, 3, 4}-inverses of A and B have been studied in this paper. The necessary and sufficient conditions for B{1,3,4}A{1,3,4}⊆(AB){1,3,4}, B{1,3,4}A{1,3,4}⊇(AB){1,3,4} and B{1,3,4}A{1,3,4}=(AB){1,3,4} are given.     

Generalized inverses of tensors via a general product of tensors

We define the {i}-inverse (i = 1, 2, 5) and group inverse of tensors based on a general product of tensors. We explore properties of the generalized inverses of tensors on solving tensor equations and computing formulas of block tensors. We use the {1}-inverse of tensors to give the solutions of a multilinear system represented by tensors. The representations for the {1}-inverse and group inverse of some block tensors are established.     

Full-rank representations of {2, 4}, {2, 3}-inverses and successive matrix squaring algorithm

We present the full-rank representations of {2, 4} and {2, 3}-inverses (with given rank as well as with prescribed range and null space) as particular cases of the full-rank representation of outer inverses. As a consequence, two applications of the successive matrix squaring (SMS) algorithm from [P.S. Stanimirovi?, D.S. Cvetkovi?-Ili?, Successive matrix squaring algorithm for computing outer inverses, Appl. Math. Comput. 203 (2008) 19-29] are defined using the full-rank representations of {2, 4} and {2, 3}-inverses. The first application is used to approximate {2, 4}-inverses. The second application, after appropriate modifications of the SMS iterative procedure, computes {2, 3}-inverses of a given matrix. Presented numerical examples clarify the purpose of the introduced methods.     

Degree Sum Conditions for Hamiltonicity on k-Partite Graphs

One of the earliest results about hamiltonian graphs was given by Dirac. He showed that if a graph G has order p and minimum degree at least \(\frac{p} {2}\) then G is hamiltonian. Moon and Moser showed that if G is a balanced bipartite graph (the two partite sets have the same order) with minimum degree more than \(\frac{p} {4}\) then G is hamiltonian. Recently their idea is generalized to k-partite graphs by Chen, Faudree, Gould, Jacobson, and Lesniak in terms of minimum degrees. In this paper, we generalize this result in terms of degree sum and the following result is obtained: Let G be a balanced k-partite graph with order kn. If for every pair of nonadjacent vertices u and v which are in different parts $$d(u) + d(v) > \left\{ {\begin{array}{*{20}c} {\left( {k - \frac{2} {{k + 1}}} \right)n} & {if k is odd} \\ {\left( {k - \frac{4} {{k + 2}}} \right)n} & {if k is even} \\ \end{array} } \right.,$$ then G is hamiltonian.     

More on generalized inverses of partitioned matrices with Banachiewicz–Schur forms

Necessary and sufficient conditions are derived for a 2-by-2 partitioned matrix to have {1}-, {1,2}-, {1,3}-, {1,4}-inverses and the Moore–Penrose inverse with Banachiewicz–Schur forms. As applications, the Banachiewicz–Schur forms of {1}-, {1,2}-, {1,3}-, {1,4}-inverses and the Moore–Penrose inverse of a 2-by-2 partitioned Hermitian matrix are also given.     

Comments on some recent results concerning {2, 3} and {2, 4}-generalized inverses

We give a comment on some recent results concerning the representations of generalized {2, 3} and {2, 4}-inverses. Shorter proofs of some previous results are presented.     

The least squares g-inverses for sum of matrices

In this article, we exhibit under suitable conditions a neat relationship between the least squares g-inverse for a sum of two matrices and the least squares g-inverses of the individual terms. We give a necessary and sufficient condition for the set equations (A?+?B){1,?3}?=?A{1,?3}?+?B{1,?3} and (A?+?B){1,?4}?=?A{1,?4}?+?B{1,?4}.     

On sum sets of sidon sets,II

LetG be a finite abelian group,G?{Z _n, Z₂?Z_2n}. Then every sequenceA={g ₁,...,g_t} of $t = \frac{{4\left| G \right|}}{3} + 1$ elements fromG contains a subsequenceB?A, |G|=|G| such that $\sum\nolimits_{g_i \in B^{g_i } } { = 0 (in G)} $ . This bound, which is best possible, extends recent results of [1] and [22] concerning the celebrated theorem of Erdös-Ginzburg-Ziv [21].     

Integer generalized inverses of incidence matrices

Graphical procedures are used to characterize the integral {1}- and {1, 2}-inverses of the incidence matrix A of a digraph, and to obtain a basis for the space of matrices X such that AXA = 0. These graphical procedures also produce the Smith canonical form of A and a full rank factorization of A using matrices with entries from {-1, 0, 1}. It is also shown how the results on incidence matrices of oriented graphs can be used to find generalized inverses of matrices of unoriented bipartite graphs.     

Rainbow Connection Number, Bridges and Radius

Let G be a connected graph. The notion of rainbow connection number rc(G) of a graph G was introduced by Chartrand et al. (Math Bohem 133:85–98, 2008). Basavaraju et al. (arXiv:1011.0620v1 [math.CO], 2010) proved that for every bridgeless graph G with radius r, ${rc(G)\leq r(r+2)}$ and the bound is tight. In this paper, we show that for a connected graph G with radius r and center vertex u, if we let D ^r  = {u}, then G has r?1 connected dominating sets ${ D^{r-1}, D^{r-2},\ldots, D^{1}}$ such that ${D^{r} \subset D^{r-1} \subset D^{r-2} \cdots\subset D^{1} \subset D^{0}=V(G)}$ and ${rc(G)\leq \sum_{i=1}^{r} \max \{2i+1,b_i\}}$ , where b _i is the number of bridges in E[D ⁱ , N(D ⁱ )] for ${1\leq i \leq r}$ . From the result, we can get that if ${b_i\leq 2i+1}$ for all ${1\leq i\leq r}$ , then ${rc(G)\leq \sum_{i=1}^{r}(2i+1)= r(r+2)}$ ; if b _i  > 2i + 1 for all ${1\leq i\leq r}$ , then ${rc(G)= \sum_{i=1}^{r}b_i}$ , the number of bridges of G. This generalizes the result of Basavaraju et al. In addition, an example is given to show that there exist infinitely graphs with bridges whose rc(G) is only dependent on the radius of G, and another example is given to show that there exist infinitely graphs with bridges whose rc(G) is only dependent on the number of bridges in G.     

On generalized inverses of Boolean Matrices

Generalized inverses of Boolean Matrices are defined and the general form of matrices having generalized inverses is determined. Some structure theorems are proved, from which, some known results are obtained as corollaries. An algorithm to compute a generalized inverse of a matrix, when it exists, is given. The existence of various types of g-inverses is also investigated. All the results are obtained first for the {0,1}-Boolean algebra and then extended to an arbitrary Boolean algebra.     

The Cohomology of Pro-p-Groups with Group Ring Coefficients and Virtual Poincare Duality

The relationship between the group-theoretic properties of a pro-p-group G and the G-module structure of the group $H^n (G,\mathbb{F}_q \left[\kern-0.15em\left[ G \right]\kern-0.15em\right])$ is studied. A necessary and sufficient condition for a pro-p-group G to contain an open Poincare subgroup of dimension n is obtained. This condition does not require that G have finite cohomological dimension and, therefore, applies to groups with torsion. Results concerning the possible values of $\dim _{\mathbb{F}p} H^n (G,\mathbb{F}_p \left[\kern-0.15em\left[ G \right]\kern-0.15em\right])$ are also obtained.     

Symmetric diameter two graphs with affine-type vertex-quasiprimitive automorphism group

We study the class of G-symmetric graphs Γ with diameter 2, where G is an affine-type quasiprimitive group on the vertex set of Γ. These graphs arise from normal quotient analysis as basic graphs in the class of symmetric diameter 2 graphs. It is known that ${G \cong V \rtimes G_0}$ , where V is a finite-dimensional vector space over a finite field and G ₀ is an irreducible subgroup of GL (V), and Γ is a Cayley graph on V. In particular, we consider the case where ${V = \mathbb {F}_p^d}$ for some prime p and G ₀ is maximal in GL (d, p), with G ₀ belonging to the Aschbacher classes ${\mathcal {C}_2, \mathcal {C}_4, \mathcal {C}_6, \mathcal {C}_7}$ , and ${\mathcal {C}_8}$ . For ${G_0 \in \mathcal {C}_i, i = 2,4,8}$ , we determine all diameter 2 graphs which arise. For ${G_0 \in \mathcal {C}_6, \mathcal {C}_7}$ we obtain necessary conditions for diameter 2, which restrict the number of unresolved cases to be investigated, and in some special cases determine all diameter 2 graphs.     

Binary Labeling of Graphs

Let G = (V, E) be a graph. A mapping f: E(G) → {0, l} ^m is called a mod 2 coding of G, if the induced mapping g: V(G) → {0, l} ^m , defined as \(g(v) = \sum\limits_{u \in V,uv \in E} {f(uv)}\) , assigns different vectors to the vertices of G. Note that all summations are mod 2. Let m(G) be the smallest number m for which a mod 2 coding of G is possible. Trivially, m(G) ≥ ?Log₂ |V|?. Recently, Aigner and Triesch proved that m(G) ≤ ?Log₂ |V|? + 4. In this paper, we determine m(G). More specifically, we prove that if each component of G has at least three vertices, then $$mG = \left\{ {\begin{array}{*{20}c} {k,} & {if \left| V \right| \ne 2^k - 2} \\ {k + 1,} & {else} \\ \end{array} ,} \right.$$ where k = ?Log₂ |V|?.     

Parabolic Singular Integrals in Probability Theory

The final aim of this work is to prove the Central Limit Theorem described in the motivations given below. The key for that is a Resolvant estimate, of the type of Theorem 1.1 in [21], adapted for the Parabolic Green function G(X, Y) which is the heat diffusion kernel in some domain Ω in time-space: i.e. we must estimate ${\int_{\Omega}\nabla_{Y}G(X, Y)\nabla_{Y}^{2}G(Y,Z)\;dY}The final aim of this work is to prove the Central Limit Theorem described in the motivations given below. The key for that is a Resolvant estimate, of the type of Theorem 1.1 in [21], adapted for the Parabolic Green function G(X, Y) which is the heat diffusion kernel in some domain Ω in time-space: i.e. we must estimate ò_W?_YG(X, Y)?_Y²G(Y,Z)  dY{\int_{\Omega}\nabla_{Y}G(X, Y)\nabla_{Y}^{2}G(Y,Z)\;dY}. Exactly as the estimate in [21] is based on [10] our estimate here is based on the main Theorem of this paper. This main theorem refers to rough singular integrals on the Gaussian potential on ∂Ω.     

Re-nnd generalized inverses

In this paper, we give some necessary and sufficient conditions for the existence of Re-nnd and nonnegative definite {1,3}$\{1,3\}$- and {1,4}$\{1,4\}$-inverses of a matrix A∈C^n×n$A\in {\mathbb{C}}^{n\times n}$ and completely described these sets. Moreover, we prove that the existence of nonnegative definite {1,3}$\{1,3\}$-inverse of a matrix A   is equivalent with the existence of its nonnegative definite {1,2,3}$\{1,2,3\}$-inverse and present the necessary and sufficient conditions for the existence of Re-nnd {1,3,4}$\{1,3,4\}$-inverse of A.     

On the residuality of mixing by convolutions probabilities

A probability measureμ on a locally compactσ — compact amenable Hausdorff groupG is called mixing by convolutions if for every pair of probabilitiesν ₁,ν ₂ onG we have: $$\mathop {\lim }\limits_{n \to \infty } \left\| {\left( {\nu _1 - \nu _2 } \right) \star \mu ^{ \star n} } \right\| = \mathop {\lim }\limits_{n \to \infty } \left\| {\left( {\nu _1 - \nu _2 } \right) \star \mu ^{ \star n} } \right\| = 0.$$ . It is proved that the set of all mixing by convolutions probabilities is a norm (variation) dense subset of the setP(G) of all probabilities onG. IfG is additionally second countable the mixing measures are residual inP(G).     

On the spectral radius of ‡-shape trees

Let A(G) be the adjacency matrix of G. The characteristic polynomial of the adjacency matrix A is called the characteristic polynomial of the graph G and is denoted by φ(G, λ) or simply φ(G). The spectrum of G consists of the roots (together with their multiplicities) λ ₁(G) ? λ ₂(G) ? … ? λ _n (G) of the equation φ(G, λ) = 0. The largest root λ ₁(G) is referred to as the spectral radius of G. A ?-shape is a tree with exactly two of its vertices having maximal degree 4. We will denote by G(l ₁, l ₂, … l ₇) (l ₁ ? 0, l _i ? 1, i = 2, 3, …, 7) a ?-shape tree such that $G\left( {l_1 ,l_2 , \ldots l_7 } \right) - u - v = P_{l_1 } \cup P_{l_2 } \cup \ldots P_{l_7 }$ , where u and v are the vertices of degree 4. In this paper we prove that ${{3\sqrt 2 } \mathord{\left/ {\vphantom {{3\sqrt 2 } 2}} \right. \kern-0em} 2} < \lambda _1 \left( {G\left( {l_1 ,l_2 , \ldots l_7 } \right)} \right) < {5 \mathord{\left/ {\vphantom {5 2}} \right. \kern-0em} 2}$ .