SearcharxivSearch

arXiv · 2303.07809

Eventual cone invariance revisited

Abstract

We consider finite-dimensional real vector spaces $X$ ordered by a closed cone $X_+$ with non-empty interior and study eventual nonnegativity of matrix semigroups $(e^{tA})_{t \ge 0}$ with respect to this cone. Our first contribution is the observation that, for general cones, one needs to distinguish between different notions of eventual nonnegativity: (i) uniform eventual nonnegativity means that $e^{tA}$ maps $X_+$ into $X_+$ for all sufficiently large times $t$; (ii) individual eventual nonnegativity means that for each $x \in X_+$ the vector $e^{tA}x$ is in $X_+$ for all $t$ larger than an $x$-dependent time $t_0$; and (iii) weak eventual nonnegativity means that for each $x \in X_+$ and each functional $x'$ in the dual cone $X'_+$ the value $\langle x', e^{tA} x \rangle$ is in $[0,\infty)$ for all $t$ larger than an $x$- and $x'$-dependent time $t_0$. Until now, only the first of these notions has been studied in the literature. We demonstrate by examples that, somewhat surprisingly for finite-dimensional spaces, all three notions are different. Our second contribution is to show that typical Perron-Frobenius like properties remain valid under the weakest of the above notions. Third, we study a strengthened form of the above mentioned concepts, namely eventual positivity. We prove that uniform, individual and weak versions of this property are - in contrast to the nonnegative case - equivalent, and that they can be characterized by spectral properties.

Explore related subjects

Keep this discovery

BibTeXRIS

Jochen Glück, Julian Hölz. 2023-03-14. Eventual cone invariance revisited. https://doi.org/10.1016/j.laa.2023.06.014

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

KEEP EXPLORING

Related papers

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

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

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