Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2310.05257

Linear algebra over T-pairs

Marianne Akian·Stephane Gaubert·Louis Rowen
View original source ↗Read source document ↗Export metadata ↓

Abstract

This is part of an ongoing project to find a general algebraic framework for semiring theory. The structure theory of semirings is quite challenging, largely because of the lack of negation, and such basic properties such as unique factorization of polynomials, multiplicativity of determinants, and the characteristic polynomial of a matrix, all fail. (In fact in the max-plus algebra, the sum of two nonzero elements is never zero!) Consequently 0 is replaced by a distinguished T-submodule $ A_0$ of $ A,$ and $( A, A_0)$ is called a ``pair.'' This paper treats linear algebra over a (not necessarily distributive) semiring pair, with a range of applications to tropical algebra as well as related areas such as hyperrings and fuzzy rings. We turn to matrices and the question of whether the row rank, column rank, and submatrix rank of a matrix are equal. The submatrix rank is less than or equal to the row rank and the column rank in many cases, including ``metatangible pairs'' with unique negation, but there is a counterexample to equality, discovered some time ago by the second author, which we provide in a more general setting (``pairs of the second kind'') that includes the hyperfield of signs. We do find situations when equality holds, encompassing results by Akian, Gaubert, Guterman, Izhakian, Knebusch, and Rowen, including versions of Cramer's rule. We pay special attention to the question of Baker and Zhang whether $n+1$ vectors of length $n$ need be dependent. At the conclusion of the main part, we consider surpassing relations, which permit us to tighten our results. The categorical setting is given in the appendix.

Explore related subjects

math.RAmath.AC

Keep this discovery

BibTeXRIS

Marianne Akian, Stephane Gaubert, Louis Rowen. 2023-10-08. Linear algebra over T-pairs. https://arxiv.org/abs/2310.05257

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

KEEP EXPLORING

Related papers

arXiv2026

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA↗
arXiv2026

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA↗
arXiv2026

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA↗