Linear equations over finite abelian groups
One of the oldest problems in algebra is the solution of a system of linear equations over certain domains. The Gaussian elimination algorithm provides an effective solution over fields. The Smith normal form algorithm yields a method over the integers. Here we consider another variation of this theme. Let A be a finite (additive) abelian group, let αi,j ∈ End(A) for 1 ≤ i ≤ n and 1 ≤ j ≤ m and let b1, . . . , bm ∈ A. Then we want to determine the set S of all (x1, . . . , xn) ∈ A n with
Solving linear equations over finitely generated abelian groups
We discuss various methods and their effectiveness for solving linear equations over finitely generated abelian groups. More precisely, if $\varphi\colon G\to H$ is a homomorphism of finitely generated abelian groups and $b\in H$, we discuss various algorithms for checking whether $b\in \im\varphi$ holds and if so, for computing a pre-image of $b$ in $G$ together with the kernel of $\varphi$.
A Liouville’s Formula for Systems with Reflection
In this work, we derived an Abel–Jacobi–Liouville identity for the case of two-dimensional linear systems of ODEs (ordinary differential equations) with reflection. We also present a conjecture for the general case and an application to coupled harmonic oscillators.