Related papers: Linear systems over localizations of rings
This paper shows how techniques for linear dynamical systems can be used to reason about the behavior of general loops. We present two main results. First, we show that every loop that can be expressed as a transition formula in linear…
In applications like medical imaging, error correction, and sensor networks, one needs to solve large-scale linear systems that may be corrupted by a small number of arbitrarily large corruptions. We consider solving such large-scale…
We study integrality over rings (all commutative in this paper) and over ideal semifiltrations (a generalization of integrality over ideals). We begin by reproving classical results, such as a version of the "faithful module" criterion for…
When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B_1,..., B_p, we can apply A to a random vector and solve a linear system to recover this linear combination. The same technique can…
The aim of this article is to employ the Lazy Set algorithm as an example for a mathematical framework for proving the linearizability of distributed systems. The proof in this approach is divided into two stages of lower and higher…
The notion of a glider representation of a chain of normal subgroups of a group is defined by a new structure, i.e. a fragment for a suitable filtration on the group ring. This is a special case of general glider representations defined for…
A central problem of linear algebra is solving linear systems. Regarding linear systems as equations over general semirings (V,otimes,oplus,0,1) instead of rings or fields makes traditional approaches impossible. Earlier work shows that the…
We discuss the relationship between quaternion algebras and quadratic forms with a focus on computational aspects. Our basic motivating problem is to determine if a given algebra of rank 4 over a commutative ring R embeds in the 2x2-matrix…
In this paper, the concept of matrix splitting is introduced to solve a large sparse ill-posed linear system via Tikhonov's regularization. In the regularization process, we convert the ill-posed system to a well-posed system. The…
Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by…
In this paper we present a novel method for the numerical solution of linear transport equations, which is based on ridgelets. Such equations arise for instance in radiative transfer or in phase contrast imaging. Due to the fact that…
Let $R$ be a commutative unital ring. A well-known factorization problem is whether any matrix in $\mathrm{SL}_n(R)$ is a product of elementary matrices with entries in $R$. To solve the problem, we use two approaches based on the notion of…
An element $a\in R$ is provided that there exists an idempotent $e\in R$ such that $a-e\in U(R), ae=ea$ and $eae\in J(eRe)$. In this article, we investigate strongly rad-clean matrices over a commutative local ring. We completely determine…
A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry,…
In this paper, we develop a representation-theoretic formulation of discrete-time linear systems. We show that such systems are naturally viewed as representations of time groups acting on vector spaces, thereby endowing the state space…
In this paper we prove that if $R$ is a commutative refinement ring and $M$, $N$ are two $R$-modules then, $M\cong N$ if and only if for every maximal ideal $m$ of $R$, $M_m\cong N_m$. We prove if $R$ is a refinement ring, then every…
We provide a sufficient condition for a polynomial ring, not necessarily commutative, to have a first-order definition for the rational integers.
Let $R$ be a finite ring and $r \in R$. The aim of this paper is to study the probability that the commutator of a randomly chosen pair of elements of $R$ equals $r$.
Composing systems is a fundamental concept in modern control systems, yet it remains challenging to formally analyze how controllers designed for individual subsystems can differ from controllers designed for the composition of those…
We investigate the presence of localized solutions in models described by a single real scalar field with generalized dynamics. The study offers a method to solve very intricate nonlinear ordinary differential equations, and we illustrate…