Characteristic min-polynomial of a triangular and diagonal strictly double R-astic matrices

Siswanto Siswanto; Sahmura Maula Al Maghribi

doi:10.12688/f1000research.147931.1

Home Browse Characteristic min-polynomial of a triangular and diagonal strictly...

ALL Metrics

-

Views

-

Downloads

Get PDF

Get XML

Export

▬

✚

Research Article

Characteristic min-polynomial of a triangular and diagonal strictly double R-astic matrices

[version 1; peer review: awaiting peer review]

Siswanto Siswanto ¹, Sahmura Maula Al Maghribi¹

PUBLISHED 08 Jul 2024

Author details Author details

¹ Mathematics, Universitas Sebelas Maret, Surakarta, Central Java, 57126, Indonesia

Siswanto Siswanto
Roles: Conceptualization, Formal Analysis, Funding Acquisition, Methodology, Project Administration, Supervision, Writing – Review & Editing

Sahmura Maula Al Maghribi
Roles: Investigation, Validation, Visualization, Writing – Original Draft Preparation

OPEN PEER REVIEW

REVIEWER STATUS AWAITING PEER REVIEW

Abstract

Background

Determinant and characteristic polynomials are important concepts related to square matrices. Due to the absence of additive inverse in max-plus algebra, the determinant of a matrix over max-plus algebra can be represented by a permanent. In addition, there are several types of square matrices over max-plus algebra, including triangular and diagonal strictly double ℝ -astic matrices. A special formula has been devised to determine the permanent and characteristic max-polynomial of those matrices. Another algebraic structure that is isomorphic with max-plus algebra is min-plus algebra.

Methods

Min-plus algebra is the algebraic structure of triple ( ℝ ε ′ , ⊕ ′ , ⊗ ) . Furthermore, square matrices over min plus algebra are defined by the set of matrices sized n × n , the entries of which are the elements of ℝ ε ′ . Because these two algebraic structures are isomorphic, the permanent and characteristic min-polynomial can also be determined for each square matrix over min-plus algebra, as well as the types of matrices.

Results

In this paper, we find out the special formulas for determining the permanent and characteristic min-polynomial of the triangular matrix and the diagonal strictly double ℝ -astic matrix.

Conclusions

We show that the formula for determining the characteristic min-polynomial of the two matrices is the same, for each triangular matrix and strictly double ℝ -astic matrix A , χ A ( x ) = ⨁ r = 0 , 1 , … , n ′ δ n − r ⊗ n r .

Keywords

min-plus algebra; permanent; characteristic min-polynomial; triangular matrix; diagonal strictly double R-astic matrix

Corresponding author: Siswanto Siswanto

Competing interests: No competing interests were disclosed.

Grant information: Universitas Sebelas Maret through a Fundamental Research Grant scheme competition in 2024 with assignment agreement letter number 194.2/UN27.22/PT.01.03/2024
The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.

Copyright: © 2024 Siswanto S and Al Maghribi SM. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to cite: Siswanto S and Al Maghribi SM. Characteristic min-polynomial of a triangular and diagonal strictly double R-astic matrices [version 1; peer review: awaiting peer review]. F1000Research 2024, 13:771 (https://doi.org/10.12688/f1000research.147931.1) First published: 08 Jul 2024, 13:771 (https://doi.org/10.12688/f1000research.147931.1) Latest published: 08 Jul 2024, 13:771 (https://doi.org/10.12688/f1000research.147931.1)

1. Introduction

Let $ℝ_{ε} = ℝ \cup {- \infty}$ , with $ℝ$ being a set of all real numbers. Max-plus algebra is defined as the set of $ℝ_{ε}$ that uses maximum $(\oplus)$ and addition $(\otimes)$ binary operations.¹ The algebraic structure of triple $(ℝ_{ε}, \oplus, \otimes)$ is an idempotent semifield. In the application, max-plus algebra can be used to model and analyze a production system. Then, a square matrix in which its components are the element of $ℝ_{ε}$ is called matrix over max-plus algebra, denoted $ℝ_{ε}^{n \times n}$ . In linear algebra, determinant and characteristic polynomials are important concepts related to square matrices. However, due to the absence of additive inverse, the determinant in max-plus algebra can be represented by permanent. Let $A \in ℝ_{ε}^{n \times n}$ , then its permanent is formulated by $perm (A) = ⨁_{σ \in P_{n}} a_{1 σ (1)} \otimes a_{2 σ (2)} \otimes \dots \otimes a_{nσ (n)}$ , where $P_{n}$ is the set of all permutations of the set ${1, 2, \dots, n} .$ ² Then, the characteristic max-polynomial of $A$ is formulated by $χ_{A} (x) = perm (A \oplus x \otimes I)$ , where $I$ is identity matrix over max-plus algebra.¹

Furthermore, there is another algebraic structure that is isomorphic with max-plus algebra, namely min-plus algebra. Min-plus algebra is defined as the set of $ℝ_{ε^{'}} = ℝ \cup {ε^{'}}$ , where $ℝ$ being a set of all real numbers and $ε^{'} = + \infty$ endowed with minimum $(\oplus^{'})$ and addition $(\otimes)$ binary operations.³ Min-plus algebra can be used to determine the shortest path of a route. Similarly, consider the set of matrices sized $n \times n$ , the entries of which are the elements of $ℝ_{ε^{'}}$ . This set is known as the set of square matrices over min-plus algebra. The permanent and characteristic min-polynomials in min-plus algebra have also been determined by Siswanto et al.⁴ and Watanabe et al.⁵

In addition to discussing square matrices in general, some researchers also discuss special matrices. Research from Jafari and Hosseinyazdi⁶ has found the special formulas for determining characteristic max-polynomials of triangular matrices and diagonal strictly double $ℝ$ -astic matrices. According to Jafari and Hosseinyazdi’s research and the min-plus algebraic structure, this research will discuss the characteristic min-polynomials of triangular matrices and diagonal strictly double $ℝ$ -astic matrices.

2. Methods

This research method was a literature review by using references to linear algebra, max-plus algebra, and min-plus algebra in books, journals, or articles. The aim of this review is to expand the research on min-plus algebra based on research in linear algebra and max-plus algebra, and also determine the connections between them.

The research begins by defining the triangular matrix and strictly double $ℝ$ -astic matrix over min-plus algebra according to Jafari and Hosseinyazdi’s research on max-plus algebra. Next, we try to find the special formula for determining the permanent of those matrices. After we find its special formula, we will simplify the way to determine the characteristic min-polynomial of normal square matrices over min-plus algebra for triangular matrix and strictly double $ℝ$ -astic matrix.

Also in this section, we give a short introduction to the min-plus algebra and square matrix over min-plus algebra. The min-plus algebra is defined as the set of $ℝ_{ε^{'}} = ℝ \cup {ε^{'}}$ , where $ℝ$ being a set of all real numbers and $ε^{'} = + \infty$ endowed with minimum $(\oplus^{'})$ and addition $(\otimes)$ binary operations so that every $a, b \in ℝ_{ε^{'}}$ applies

a \oplus^{'} b = min (a, b) and a \otimes b = a + b

Following³ for $a, b, c, x, y \in ℝ_{ε^{'}}$ , both operations $\oplus^{'}$ and $\otimes$ are associative, we have $(a \oplus^{'} b) \oplus^{'} c = a \oplus^{'} (b \oplus^{'} c)$ and $(a \otimes b) \otimes c = a \otimes (b \otimes c)$ . These operations are also commutative, we have $a \oplus^{'} b = b \oplus^{'} a$ and $a \otimes b = b \otimes a$ . We have the identity element $ε^{'} = + \infty$ with respect to $\oplus^{'}$ such that $a \oplus^{'} ε^{'} = a = ε^{'} \oplus^{'} a$ . Then we have the identity element $e = 0$ with respect to $\otimes$ such that $a \otimes e = a = e \otimes a$ . And if $x \neq ε^{'}$ , there exist the unique inverse $y = - x$ of $x$ with respect to $\otimes$ , we have $x \otimes y = e$ . But for the $\oplus^{'}$ operation, there is no unique inverse. However, the minimum operation is idempotent, we have $a \oplus^{'} a = a$ . Based on this description, the algebraic structure of min-plus algebra is idempotent semifield.

Definition 2.1:

For $x \in ℝ_{ε^{'}}$ and $k \in ℕ$ , the $k$ -power of $x$ is defined by

\begin{array}{c} \underset{⏟}{x^{\otimes k} = x \otimes \dots \otimes x .} \\ k times \end{array}

We defined square matrix over min-plus algebra, denoted by $ℝ_{ε^{'}}^{n \times n}$ , as the set of all $n \times n$ matrices with entries in $ℝ_{ε^{'}}$ for positive integers $n$ . We define the several operations in $ℝ_{ε^{'}}^{n \times n}$ according to.⁷

(1) If $A$ and $B \in ℝ_{ε^{'}}^{n \times n}$ then ${(A \oplus^{'} B)}_{ij} = min {a_{ij}, b_{ij}}$ .
(2) If $A$ and $B \in ℝ_{ε^{'}}^{n \times n}$ then ${(A \otimes B)}_{ij} = ⨁_{k = 1}^{' n} (a_{ik} \otimes b_{kj})$ .
(3) If $A \in ℝ_{ε^{'}}^{n \times n}$ and $α \in ℝ_{ε^{'}}$ then we have ${(α \otimes A)}_{ij} = α \otimes a_{ij}$ .
(4) We have an identity matrix over min-plus algebra with respect to $\otimes$ , where
$I = (\begin{matrix} 0 & \dots & ε^{'} \\ ⋮ & ⋱ & ⋮ \\ ε^{'} & \dots & 0 \end{matrix}),$

such that $A \otimes I = A = I \otimes A$ .

(5) Given $A \in ℝ_{ε^{'}}^{n \times n}$ and $k \in ℕ$ , the $k$ -power of $A$ is defined by
$\begin{array}{c} \underset{⏟}{A^{\otimes k} = A \otimes \dots \otimes A .} \\ k times \end{array}$

The following is the definition of the formula for determining the permanent and characteristic min-polynomials according to.⁴^,⁵

Definition 2.2:

For a matrix $A \in ℝ_{ε^{'}}^{n \times n}$ the permanent of $A$ is defined as

perm (A) = ⨁_{σ \in P_{n}}^{'} ⨂_{i = 1}^{n} (a_{iσ (i)})

with

σ

and

P_{n}

is a set of all permutations from

{1, 2, \dots, n}

.

Definition 2.3:

Let $A \in ℝ_{ε^{'}}^{n \times n}$ . Then the characteristic min-polynomial of $A$ is defined to be

χ {}_{A}{(x)} = perm (I \otimes x \oplus^{'} A) .

3. Characteristic min-polynomial of a triangular matrix

Definition 3.1:

Let $A \in ℝ_{ε^{'}}^{n \times n}$ . The square matrix $A$ is called triangular matrix if all entries of above or below diagonal are equal to $ε^{'}$ .

Theorem 3.1:

If $A \in ℝ_{ε^{'}}^{n \times n}$ then the permanent of the triangular matrix $A$ is

perm (A) = a_{11} \otimes a_{22} \otimes a_{33} \otimes \dots \otimes a_{nn} .

Proof:

The theorem will be proved for the upper triangular matrix using induction.

(1) For $n = 2$ , we have
$A = (\begin{matrix} a_{11} & a_{12} \\ ε^{'} & a_{22} \end{matrix}) .$

So, it has been proven true that

\begin{array}{l} perm (A) = perm (\begin{matrix} a_{11} & a_{12} \\ ε^{'} & a_{22} \end{matrix}) \\ = (a_{11} \otimes a_{22}) \oplus^{'} (a_{12} \otimes ε^{'}) \\ = (a_{11} \otimes a_{22}) \oplus^{'} ε^{'} \\ = a_{11} \otimes a_{22} \end{array}

(2) Suppose this is true for an upper triangular matrix $A$ sized $(n - 1) \times (n - 1)$ . Then, consider $A$ as an $n \times n$ matrix. The permanent matrix $A$ can be calculated by expanding $perm (A)$ along the first column. The purpose of this expansion is to eliminate the elements in the first column one by one, along with the removal of rows and columns according to the location of the elements. We have
$\begin{array}{l} perm (A) = (\begin{array}{l} \begin{array}{l} a_{11} & a_{12} \\ ε^{'} & a_{22} \end{array} & \begin{array}{l} \dots & a_{1 n} \\ \dots & a_{2 n} \end{array} \\ \begin{array}{l} ⋮ & ⋮ \\ ε^{'} & ε^{'} \end{array} & \begin{array}{l} ⋱ & ⋮ \\ \dots & a_{nn} \end{array} \end{array}) \\ = a_{11} \otimes perm (\begin{array}{l} \begin{array}{l} a_{22} & a_{23} \\ ε^{'} & a_{33} \end{array} & \begin{array}{l} \dots & a_{2 n} \\ \dots & a_{3 n} \end{array} \\ \begin{array}{l} ⋮ & ⋮ \\ ε^{'} & ε^{'} \end{array} & \begin{array}{l} ⋱ & ⋮ \\ \dots & a_{nn} \end{array} \end{array}) \oplus^{'} \\ \begin{array}{l} ε^{'} \otimes perm (\begin{array}{l} \begin{array}{l} a_{12} & a_{13} \\ ε^{'} & a_{33} \end{array} & \begin{array}{l} \dots & a_{1 n} \\ \dots & a_{3 n} \end{array} \\ \begin{array}{l} ⋮ & ⋮ \\ ε^{'} & ε^{'} \end{array} & \begin{array}{l} ⋱ & ⋮ \\ \dots & a_{nn} \end{array} \end{array}) \oplus^{'} \dots \oplus^{'} \\ ε^{'} \otimes perm (\begin{array}{l} a_{12} & a_{13} & \dots & a_{1 n} \\ a_{22} & a_{23} & \dots & a_{2 n} \\ ⋮ & ⋮ & ⋱ & ⋮ \\ ε^{'} & \dots & a_{(n - 1) (n - 1)} & a_{(n - 1) n} \end{array}) \\ \begin{array}{l} = (a_{11} \otimes a_{22} \otimes \dots \otimes a_{nn}) \oplus^{'} ε^{'} \oplus^{'} \dots \oplus^{'} ε^{'} \\ = a_{11} \otimes a_{22} \otimes \dots \otimes a_{nn} . \end{array} \end{array} \end{array}$

∎

Theorem 3.2:

If $A \in ℝ_{ε^{'}}^{n \times n}$ then the characteristic min-polynomial of the triangular matrix $A$ is

χ_{A} (x) = ⨁_{r = 0}^{' n} δ_{n - r} \otimes n^{r}

where

δ_{0} = 0

, and

δ_{n - r}

, for

r = 0, 1, \dots, n - 1

is the sum of the

n - r

smallest diagonal elements.

Proof:

The theorem will be proved for the upper triangular matrix. First, we recall the formula for determining the characteristic min-polynomial of a square matrix. Then, apply the formula to the triangular matrix. We have

χ_{A} (x) = perm (I \otimes x \oplus^{'} A) = perm (\begin{matrix} x \oplus^{'} a_{11} & \dots & a_{1 n} \\ ⋮ & ⋱ & ⋮ \\ ε^{'} & \dots & x \oplus^{'} a_{nn} \end{matrix}) .

The matrix $I \otimes x \oplus^{'} A$ is also the upper triangular matrix. So, based on Theorem 1, we obtained

(1)

χ_{A} (x) = (x \oplus^{'} a_{11}) \otimes (x \oplus^{'} a_{22}) \otimes \dots \otimes (x \oplus^{'} a_{nn}) .

Furthermore, equation (1) can be written as

\begin{matrix} χ_{A} (x) = x^{n} \oplus^{'} (a_{11} \oplus^{'} a_{22} \oplus^{'} \dots \oplus^{'} a_{nn}) \otimes x^{n - 1} \oplus^{'} [(a_{11} \otimes a_{22}) \oplus^{'} \dots \oplus^{'} \\ (a_{11} \otimes a_{nn}) \oplus^{'} (a_{22} \otimes a_{33}) \oplus^{'} \dots \oplus^{'} (a_{22} \otimes a_{nn}) \oplus^{'} \dots \oplus^{'} \\ \begin{matrix} (a_{(n - 1) (n - 1)} \otimes a_{nn})] \otimes x^{n - 2} \oplus^{'} [(a_{11} \otimes a_{22} \otimes a_{33}) \oplus^{'} \dots \oplus^{'} \\ (a_{11} \otimes a_{22} \otimes a_{nn}) \oplus^{'} (a_{22} \otimes a_{33} \otimes a_{44}) \oplus^{'} \dots \oplus^{'} \\ \begin{matrix} (a_{22} \otimes a_{33} \otimes a_{nn}) \oplus^{'} \dots \oplus^{'} (a_{(n - 2) (n - 2)} \otimes a_{(n - 1) (n - 1)} \otimes a_{nn})] \otimes \\ x^{n - 3} \oplus^{'} \dots \oplus^{'} (a_{11} \otimes a_{22} \otimes \dots \otimes a_{nn}) \end{matrix} \end{matrix} \end{matrix}

or it can be simplified to

(2)

\begin{matrix} χ_{A} (x) = x^{n} \oplus^{'} ⨁_{r = 0}^{' n} a_{ii} \otimes x^{n - 1} \oplus^{'} ⨁_{ij \in C_{2}^{N}}^{'} (a_{ii} \otimes a_{jj}) \otimes x^{n - 2} \oplus^{'} \\ ⨁_{ijk \in C_{3}^{N}}^{'} (a_{ii} \otimes a_{jj} \otimes a_{kk}) \otimes x^{n - 3} \oplus^{'} \dots \oplus^{'} (a_{11} \otimes \dots \otimes a_{nn}) \end{matrix}

where

N = {1, 2, \dots, n}

. The equation (2) also can be written as

(3)

χ_{A} (x) = x^{n} \oplus^{'} δ_{1} \otimes x^{n - 1} \oplus^{'} δ_{2} \otimes x^{n - 2} \oplus^{'} δ_{3} \otimes x^{n - 3} \oplus^{'} \dots \oplus^{'} δ_{n}

where

δ_{1} = ⨁_{r = 0, \dots, n}^{'} a_{ii}

,

δ_{2} = ⨁_{ij \in C_{2}^{N}}^{'} (a_{ii} \otimes a_{jj})

,

δ_{3} = ⨁_{ijk \in C_{3}^{N}}^{'} (a_{ii} \otimes a_{jj} \otimes a_{kk})

, and

δ_{n} = (a_{11} \otimes \dots \otimes a_{nn})

. In addition, it can be known that

δ_{1}

is the smallest diagonal element,

δ_{2}

is the result of the sum of 2 smallest diagonal elements,

δ_{3}

is the result of the sum of 3 smallest diagonal elements, and

δ_{n}

is the result of the sum of all diagonal elements. If the index

n

in

δ

is converted to

n - r

, the characteristic min-polynomial of the triangular matrix in (3) can be simplified to

χ_{A} (x) = ⨁_{r = 0}^{' n} δ_{n - r} \otimes n^{r} .

∎

4. Characteristic min-polynomial of a diagonal strictly double $ℝ$ -astic matrix

Definition 4.1:

Let $A \in ℝ_{ε^{'}}^{n \times n}$ . A square matrix A is diagonal strictly double $ℝ$ -astic, if it satisfies

(1) $a_{ij} \leq + \infty,$
(2) on each row and on each column of $A$ , there is only one finite element, and
(3) the finite element on (2) is the diagonal element on the matrix $A$ .

Theorem 4.1:

If $A \in ℝ_{ε^{'}}^{n \times n}$ then the permanent of the diagonal strictly double $ℝ$ -astic matrix $A$ is

perm (A) = a_{11} \otimes a_{22} \otimes a_{33} \otimes \dots \otimes a_{nn} .

Proof:

The theorem will be proved using induction.

(1) For $n = 2$ , we have
$A = (\begin{matrix} a_{11} & ε^{'} \\ ε^{'} & a_{22} \end{matrix}) .$

So, it has been proven true that

\begin{matrix} perm (A) = perm (\begin{matrix} a_{11} & ε^{'} \\ ε^{'} & a_{22} \end{matrix}) \\ = (a_{11} \otimes a_{22}) \oplus^{'} (ε^{'} \otimes ε^{'}) \\ \begin{matrix} = (a_{11} \otimes a_{22}) \oplus^{'} ε^{'} \\ = a_{11} \otimes a_{22} \end{matrix} \end{matrix}

(2) Suppose this is true for a diagonal strictly double $ℝ$ -astic matrix $A$ sized $(n - 1) \times (n - 1)$ . Then, consider $A$ as an $n \times n$ matrix. The permanent matrix $A$ can be calculated by expanding $perm (A)$ along the first column. The purpose of this expansion is to eliminate the elements in the first column one by one, along with the removal of rows and columns according to the location of the elements. We have
$\begin{array}{l} perm (A) = (\begin{array}{l} \begin{array}{l} a_{11} & ε^{'} \\ ε^{'} & a_{22} \end{array} & \begin{array}{l} \dots & ε^{'} \\ \dots & ε^{'} \end{array} \\ \begin{array}{l} ⋮ & ⋮ \\ ε^{'} & ε^{'} \end{array} & \begin{array}{l} ⋱ & ⋮ \\ \dots & a_{nn} \end{array} \end{array}) \\ = a_{11} \otimes perm (\begin{array}{l} \begin{array}{l} a_{22} & ε^{'} \\ ε^{'} & a_{33} \end{array} & \begin{array}{l} \dots & ε^{'} \\ \dots & ε^{'} \end{array} \\ \begin{array}{l} ⋮ & ⋮ \\ ε^{'} & ε^{'} \end{array} & \begin{array}{l} ⋱ & ⋮ \\ \dots & a_{nn} \end{array} \end{array}) \oplus^{'} \\ \begin{array}{l} ε^{'} \otimes perm (\begin{array}{l} \begin{array}{l} ε^{'} & ε^{'} \\ ε^{'} & a_{33} \end{array} & \begin{array}{l} \dots & ε^{'} \\ \dots & ε^{'} \end{array} \\ \begin{array}{l} ⋮ & ⋮ \\ ε^{'} & ε^{'} \end{array} & \begin{array}{l} ⋱ & ⋮ \\ \dots & a_{nn} \end{array} \end{array}) \oplus^{'} \dots \oplus^{'} \\ ε^{'} \otimes perm (\begin{array}{l} \begin{array}{l} ε^{'} & ε^{'} \\ a_{22} & ε^{'} \end{array} & \begin{array}{l} \dots & ε^{'} \\ \dots & ε^{'} \end{array} \\ \begin{array}{l} ⋮ & ⋮ \\ ε^{'} & ε^{'} \end{array} & \begin{array}{l} ⋱ & ⋮ \\ \dots & a_{(n - 1) (n - 1)} \end{array} \end{array}) \\ \begin{array}{l} = (a_{11} \otimes a_{22} \otimes \dots \otimes a_{nn}) \oplus^{'} ε^{'} \oplus^{'} \dots \oplus^{'} ε^{'} \\ = a_{11} \otimes a_{22} \otimes \dots \otimes a_{nn} . \end{array} \end{array} \end{array}$

∎

Theorem 4.2:

If $A \in ℝ_{ε^{'}}^{n \times n}$ then the characteristic min-polynomial of the diagonal strictly double $ℝ$ -astic matrix $A$ is

χ_{A} (x) = ⨁_{r = 0}^{' n} δ_{n - r} \otimes n^{r}

where

δ_{0} = 0

, and

δ_{n - r}

, for

r = 0, 1, \dots, n - 1

is the sum of the

n - r

smallest diagonal elements.

Proof:

First, we recall the formula for determining the characteristic min-polynomial of a square matrix. Then, apply the formula to the diagonal strictly double $ℝ$ -astic matrix. We have

χ_{A} (x) = perm (I \otimes x \oplus^{'} A) = perm (\begin{matrix} x \oplus^{'} a_{11} & \dots & ε^{'} \\ ⋮ & ⋱ & ⋮ \\ ε^{'} & \dots & x \oplus^{'} a_{nn} \end{matrix}) .

The matrix $I \otimes x \oplus^{'} A$ is also the diagonal strictly double $ℝ$ -astic matrix. So, based on Theorem 3, we obtained

(4)

χ_{A} (x) = (x \oplus^{'} a_{11}) \otimes (x \oplus^{'} a_{22}) \otimes \dots \otimes (x \oplus^{'} a_{nn}) .

Furthermore, equation (4) can be written as

\begin{matrix} χ_{A} (x) = x^{n} \oplus^{'} (a_{11} \oplus^{'} a_{22} \oplus^{'} \dots \oplus^{'} a_{nn}) \otimes x^{n - 1} \oplus^{'} [(a_{11} \otimes a_{22}) \oplus^{'} \dots \oplus^{'} \\ (a_{11} \otimes a_{nn}) \oplus^{'} (a_{22} \otimes a_{33}) \oplus^{'} \dots \oplus^{'} (a_{22} \otimes a_{nn}) \oplus^{'} \dots \oplus^{'} \\ \begin{matrix} (a_{(n - 1) (n - 1)} \otimes a_{nn})] \otimes x^{n - 2} \oplus^{'} [(a_{11} \otimes a_{22} \otimes a_{33}) \oplus^{'} \dots \oplus^{'} \\ (a_{11} \otimes a_{22} \otimes a_{nn}) \oplus^{'} (a_{22} \otimes a_{33} \otimes a_{44}) \oplus^{'} \dots \oplus^{'} \\ \begin{matrix} (a_{22} \otimes a_{33} \otimes a_{nn}) \oplus^{'} \dots \oplus^{'} (a_{(n - 2) (n - 2)} \otimes a_{(n - 1) (n - 1)} \otimes a_{nn})] \otimes \\ x^{n - 3} \oplus^{'} \dots \oplus^{'} (a_{11} \otimes a_{22} \otimes \dots \otimes a_{nn}) \end{matrix} \end{matrix} \end{matrix}

or it can be simplified to

(5)

\begin{matrix} χ_{A} (x) = x^{n} \oplus^{'} ⨁_{r = 0}^{' n} a_{ii} \otimes x^{n - 1} \oplus^{'} ⨁_{ij \in C_{2}^{N}}^{'} (a_{ii} \otimes a_{jj}) \otimes x^{n - 2} \oplus^{'} \\ ⨁_{ijk \in C_{3}^{N}}^{'} (a_{ii} \otimes a_{jj} \otimes a_{kk}) \otimes x^{n - 3} \oplus^{'} \dots \oplus^{'} (a_{11} \otimes \dots \otimes a_{nn}) \end{matrix}

where

N = {1, 2, \dots, n}

. The equation (5) also can be written as

(6)

χ_{A} (x) = x^{n} \oplus^{'} δ_{1} \otimes x^{n - 1} \oplus^{'} δ_{2} \otimes x^{n - 2} \oplus^{'} δ_{3} \otimes x^{n - 3} \oplus^{'} \dots \oplus^{'} δ_{n}

where

δ_{1} = ⨁_{r = 0, \dots, n}^{'} a_{ii}

,

δ_{2} = ⨁_{ij \in C_{2}^{N}}^{'} (a_{ii} \otimes a_{jj})

,

δ_{3} = ⨁_{ijk \in C_{3}^{N}}^{'} (a_{ii} \otimes a_{jj} \otimes a_{kk})

, and

δ_{n} = (a_{11} \otimes a_{22} \otimes \dots \otimes a_{nn})

. In addition, it can be known that

δ_{1}

is the smallest diagonal element,

δ_{2}

is the result of the sum of 2 smallest diagonal elements,

δ_{3}

is the result of the sum of 3 smallest diagonal elements, and

δ_{n}

is the result of the sum of all diagonal elements. If the index

n

in

δ

is converted to

n - r

, the characteristic min-polynomial of the diagonal strictly double

ℝ

-astic matrix in (6) can be simplified to

χ_{A} (x) = ⨁_{r = 0}^{' n} δ_{n - r} \otimes n^{r} .

∎

5. Conclusions

It can be concluded that the permanent of a triangular matrix and a diagonal strictly double $ℝ$ -astic matrix is the same, which is the product (concerning the $\otimes$ operation) of its diagonal entries. Furthermore, the formula for determining the characteristic min-polynomial of these matrices is the same too. This formula is more concise than the formula for determining the characteristic min-polynomial of normal square matrix.

Data availability statement

No data are associated with this article.

Acknowledgements

The author would like to thank Universitas Sebelas Maret and the students who are members of the algebra research team for their joint discussions.

References

1. Butkovic P: Max-linear Systems: Theory and Algorithms. London: Springer; 2010. Publisher Full Text
2. Yonggu K, Hee SH: Eigenspaces of Max-Plus Matrices: An Overview. J. Hist. Math. 2018; 31(1): 1–17.
3. Watanabe S, Watanabe Y: Min-Plus Algebra and Networks. Research Institute for Mathematical Sciences Kyoto University. 2014; 47: 41–54.
4. Siswanto, A Gusmizain, Wibowo S: Determinant of a matrix over min-plus algebra. J. Discret. Math. Sci. Cryptogr. 2021; 24(6): 1829–1835. Publisher Full Text
5. Watanabe S, Tozuka Y, Watanabe Y, et al.: Two characteristic polynomials corresponding to graphical networks over min-plus algebra. ArXiv. 2017; 1–16.
6. Jafari F, Hosseinyazdi M: Characteristic Max-Polynomial of a Triangular and Certain Strictly Double R-astic Matrices. Int. J. Pure Appl. Sci. Technol. 2012; 8(1): 47–56.
7. Nowak AW: The Tropical Eigenvalue-Vector Problem from Algebraic, Graphical, and Computational Perspectives, Honors Theses, Bates College.2014.

Comments on this article Comments (0)

Version 1

VERSION 1 PUBLISHED 08 Jul 2024

Author details Author details

¹ Mathematics, Universitas Sebelas Maret, Surakarta, Central Java, 57126, Indonesia

Siswanto Siswanto
Roles: Conceptualization, Formal Analysis, Funding Acquisition, Methodology, Project Administration, Supervision, Writing – Review & Editing

Sahmura Maula Al Maghribi
Roles: Investigation, Validation, Visualization, Writing – Original Draft Preparation

Competing interests

No competing interests were disclosed.

Grant information

Universitas Sebelas Maret through a Fundamental Research Grant scheme competition in 2024 with assignment agreement letter number 194.2/UN27.22/PT.01.03/2024
The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.

Article Versions (1)

version 1

Published: 08 Jul 2024, 13:771

https://doi.org/10.12688/f1000research.147931.1

Copyright

© 2024 Siswanto S and Al Maghribi SM. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Download

Export To

metrics

	Views	Downloads
F1000Research	-	-
PubMed Central Data from PMC are received and updated monthly.	-	-

Citations

0

SEE MORE DETAILS

CITE

how to cite this article

Siswanto S and Al Maghribi SM. Characteristic min-polynomial of a triangular and diagonal strictly double R-astic matrices [version 1; peer review: awaiting peer review]. F1000Research 2024, 13:771 (https://doi.org/10.12688/f1000research.147931.1)

NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article.

track

receive updates on this article

Track an article to receive email alerts on any updates to this article.

Open Peer Review

Comments on this article Comments (0)

Version 1

VERSION 1 PUBLISHED 08 Jul 2024

Open Peer Review

Reviewer Status

AWAITING PEER REVIEW

Comments on this article

All Comments(0)

Add a comment

Sign up for content alerts

Browse by related subjects

[1] 1. Butkovic P: Max-linear Systems: Theory and Algorithms. London: Springer; 2010. Publisher Full Text

[2] 2. Yonggu K, Hee SH: Eigenspaces of Max-Plus Matrices: An Overview. J. Hist. Math. 2018; 31(1): 1–17.

[3] 3. Watanabe S, Watanabe Y: Min-Plus Algebra and Networks. Research Institute for Mathematical Sciences Kyoto University. 2014; 47: 41–54.

[4] 4. Siswanto, A Gusmizain, Wibowo S: Determinant of a matrix over min-plus algebra. J. Discret. Math. Sci. Cryptogr. 2021; 24(6): 1829–1835. Publisher Full Text

[5] 5. Watanabe S, Tozuka Y, Watanabe Y, et al.: Two characteristic polynomials corresponding to graphical networks over min-plus algebra. ArXiv. 2017; 1–16.

[6] 6. Jafari F, Hosseinyazdi M: Characteristic Max-Polynomial of a Triangular and Certain Strictly Double R-astic Matrices. Int. J. Pure Appl. Sci. Technol. 2012; 8(1): 47–56.

[7] 7. Nowak AW: The Tropical Eigenvalue-Vector Problem from Algebraic, Graphical, and Computational Perspectives, Honors Theses, Bates College.2014.

Characteristic min-polynomial of a triangular and diagonal strictly double R-astic matrices

Abstract

Background

Methods

Results

Conclusions

Keywords

1. Introduction

2. Methods

Definition 2.1:

Definition 2.2:

Definition 2.3:

3. Characteristic min-polynomial of a triangular matrix

Definition 3.1:

Theorem 3.1:

Proof:

Theorem 3.2:

Proof:

(1)

(2)

(3)

4. Characteristic min-polynomial of a diagonal strictly double ℝ-astic matrix

Definition 4.1:

Theorem 4.1:

Proof:

Theorem 4.2:

Proof:

(4)

(5)

(6)

5. Conclusions

Data availability statement

Acknowledgements

References

Comments on this article Comments (0)

Open Peer Review

Comments on this article Comments (0)

Open Peer Review

Reviewer Status

Comments on this article

Browse by related subjects

Competing Interests Policy

Stay Updated

4. Characteristic min-polynomial of a diagonal strictly double $ℝ$ -astic matrix