Search arXivSearch

arXiv · 2604.08137

On the Drazin Index of an Anti-Triangular Block Matrix

Abstract

The Drazin index is a fundamental invariant in the analysis of singular matrices and their generalized inverses. While sharp results are available for block triangular matrices, the corresponding theory for anti-triangular block matrices is less developed. In this paper, we study matrices of the form \[ M=\begin{bmatrix} A & B \\ C & 0 \end{bmatrix}, \] under algebraic constraints on the blocks. Building on additive decompositions involving von Neumann inverses, we relate the Drazin index of $M$ to invariance properties of the index and minimal polynomial of expressions of the form $A^{2}A^{-}+I-AA^{-}$. This connection provides an effective mechanism to control the index of $M$ through suitable factorizations and associated block products. As a consequence, we derive explicit lower and upper bounds for $i(M)$ in terms of $i(A)$ and $i(BC)$, and characterize situations in which these bounds are attained. Under additional annihilation or orthogonality conditions on the blocks, we obtain closed-form representations for the Drazin inverse of $M$. Applications to adjacency matrices of directed graphs illustrate the sharpness of the bounds and the applicability of the results to structured matrices arising in graph-theoretic settings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Faustino Maciala, Xavier Mary, C. Mendes Araújo, Pedro Patrício. 2026-07-24. On the Drazin Index of an Anti-Triangular Block Matrix. https://arxiv.org/abs/2604.08137

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO