SearcharxivSearch

arXiv · 2509.00553

Bessmertny\u{i} realizations of symmetric multivariate rational matrix functions over any field

Abstract

In this paper, we prove the following. First, every square matrix whose entries are multivariable rational functions over a field $\mathbb{F}$ has a Bessmertny\u{i} realization, i.e., is the Schur complement of an affine linear square matrix pencil with coefficients in $\mathbb{F}$. Second, if the matrix is also symmetric and the characteristic of the field $\mathbb{F}$ is not two then it has a symmetric Bessmertny\u{i} realization (i.e., the pencil can be chosen to consist of symmetric matrices) and counterexamples are given to prove this statement is false in general for fields of characteristic two. Third, for fields of characteristic two (e.g., binary or Boolean field), we completely characterize those functions that have a symmetric Bessmertny\u{i} realization. Finally, analogous results hold when restricted to the class of homogeneous degree-one rational functions. To solve these realization problems, i.e., finding such structured Bessmertny\u{i} realizations for a given multivariate rational function, we use state-space methods from systems theory to produce realizations for algebraic operations on Schur complements such as sums, products, inverses, and symmetrization, which become the elementary building blocks of our constructions. Further complications arise over fields of characteristic two, so a large part of the paper is devoted to developing additional methods to decide if the symmetric realization problem can be solved and, if so, to construction the symmetric realization for a given symmetric rational matrix function. Our motivations are discussed in the context of multidimensional linear systems theory on generalizing state-space representations for rational functions including the Givone-Roesser and Fornasini-Marchesini realizations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jason Elsinger, Ian Orzel, Aaron Welters. 2025-08-30. Bessmertny\u{i} realizations of symmetric multivariate rational matrix functions over any field. https://arxiv.org/abs/2509.00553

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