English
Related papers

Related papers: A Generalised Jordan Normal Form and Its Computati…

200 papers

We classify, up to isomorphism, the 2-dimensional algebras over a field K. We focuse also on the case of characteristic 2, identifying the matrices of GL(2,F_2) with the elements of the symmetric group S_3. The classification is then given…

Rings and Algebras · Mathematics 2017-07-03 Elisabeth Remm , Michel Goze

While studying some properties of linear operators in a Euclidean Jordan algebra, Gowda, Sznajder and Tao have introduced generalized lattice operations based on the projection onto the cone of squares. In two recent papers of the authors…

Rings and Algebras · Mathematics 2014-02-06 A. B. Németh , S. Z. Németh

We answer two questions posed 1998 in the book 'Arnolds problems'. First, over any field k there is a representative system for the similarity classes of nxn-matrices which is a finite disjoint union of affine subspaces. And second, for n>1…

Representation Theory · Mathematics 2025-02-18 Klaus Bongartz

In this paper, we compute all possible Jordan types of linear forms $\ell$ in any full Perazzo algebra $A$. In some cases we are also able to compute the corresponding Jordan degree type, which is a finer invariant.

Commutative Algebra · Mathematics 2025-11-03 Pedro Macias Marques , Rosa M. Miró-Roig , Josep Pérez

Let $N$ be a nilpotent matrix and consider vector fields $\dot\bx=N\bx+\bv(\bx)$ in normal form. Then $\bv$ is equivariant under the flow $e^{N^*t}$ for the inner product normal form or $e^{Mt}$ for the $\ssl_2$ normal form. These vector…

Dynamical Systems · Mathematics 2015-11-16 James Murdock

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…

Symbolic Computation · Computer Science 2016-07-22 Rui-Juan Jing , Chun-Ming Yuan , Xiao-Shan Gao

We prove that the closure of every Jordan class J in a semisimple simply connected complex group G at a point x with Jordan decomposition x = rv is smoothly equivalent to the union of closures of those Jordan classes in the centraliser of r…

Representation Theory · Mathematics 2020-10-12 Filippo Ambrosio , Giovanna Carnovale , Francesco Esposito

We describe the ternary and the generalized superderivations of finite-dimensional semisimple Jordan superalgebras over an algebraically closed field of characteristic zero and of finite-dimensional simple Jordan superalgebras with…

Rings and Algebras · Mathematics 2013-09-30 Alexey Shestakov

Matrix functions extend scalar function concepts to linear operators, offering a unified framework with broad applications in mathematics, science, and engineering. Classical definitions--via power series, spectral calculus, or Jordan…

Functional Analysis · Mathematics 2025-10-21 Shih-Yu Chang

The theories of $\pi$-points and modules of constant Jordan type have been a topic of much recent interest in the field of finite group scheme representation theory. These theories allow for a finite group scheme module $M$ to be restricted…

Representation Theory · Mathematics 2015-09-07 Andrew J. Talian

We present a new closed form for the interpolating polynomial of the general univariate Hermite interpolation that requires only calculation of polynomial derivatives, instead of derivatives of rational functions. This result is used to…

We initiate the study of modules of constant Jordan type for quantum complete intersections, and prove a range of basic properties. We then show that for these algebras, constant Jordan type is an invariant of Auslander-Reiten components.…

Rings and Algebras · Mathematics 2019-10-16 Petter Andreas Bergh , Karin Erdmann , David A. Jorgensen

The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f(x) = g(h(x)) in F[x] over a field F is well understood in…

Symbolic Computation · Computer Science 2020-01-01 Joachim von zur Gathen , Mark Giesbrecht , Konstantin Ziegler

Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…

K-Theory and Homology · Mathematics 2009-09-03 Ivo Herzog

We classify simple finite Jordan conformal superalgebras and establish preliminary results for the classification of simple finite Jordan pseudoalgebras.

Quantum Algebra · Mathematics 2008-05-06 Victor G. Kac , Alexander Retakh

The paper is devoted to the description of the varieties of complex 5-dimensional nilpotent Jordan superalgebras. We find all representatives for the isomorphism classes, using the Jordan normal form, results of simultaneous matrix…

Rings and Algebras · Mathematics 2026-04-17 Isabel Hernández , Laiz Valim da Rocha , Rodrigo Lucas Rodrigues

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem.…

Algebraic Geometry · Mathematics 2018-12-10 Bernard Mourrain , Simon Telen , Marc Van Barel

This paper completes description of categories of representations of finite-dimensional simple unital Jordan superalgebras over algebraically closed field of characteristic zero.

Representation Theory · Mathematics 2020-05-14 Iryna Kashuba , Vera Serganova

This work concerns in part the construction of conformal Jordan cells of infinite rank and their reductions to conformal Jordan cells of finite rank. It is also discussed how a procedure similar to Lie algebra contractions may reduce a…

High Energy Physics - Theory · Physics 2009-11-10 Jorgen Rasmussen

We introduce a new canonical form of lattices called the systematic normal form (SNF). We show that for every lattice there is an efficiently computable "nearby" SNF lattice, such that for any lattice one can solve lattice problems on its…

Computational Complexity · Computer Science 2016-04-27 Lior Eldar , Peter W. Shor