Related papers: Linear systems over localizations of rings
In this book i treat linear algebra over division ring. A system of linear equations over a division ring has properties similar to properties of a system of linear equations over a field. However, noncommutativity of a product creates a…
This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the…
This paper presents a novel approach to constructing finite generating sets for infinitely generated ideals. By integrating algebraic and computational techniques, we provide a method to identify finite generators, demonstrated through…
We solve a special type of linear systems with coefficients in multivariate polynomial rings. These systems arise in the computation of parametric Bernstein-Sato polynomials associated with certain hypergeometric ideals in the Weyl algebra.
We study ideal-simple commutative semirings and summarize the results giving their classification, in particular when they are finitely generated. In the principal case of (para)semifields, we then consider their minimal number of…
We obtain results describing the behavior of the action of rotation generators on polynomials over a commutative ring. We also explore harmonic polynomials in a purely algebraic setting.
We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…
Let $A$ be a finite dimensional algebra over an algebraically closed field. We present a relationship between simple-minded systems and coherent rings.
The integral cohomology ring of the complement of an arrangement of linear subspaces of a finite dimensional complex projective space is determined by combinatorial data, i.e. the intersection poset and the dimension function.
We investigate ideal-semisimple and congruence-semisimple semirings. We give several new characterizations of such semirings using e-projective and e-injective semimodules. We extend several characterizations of semisimple rings to (not…
Let S be a subring of the ring R. We investigate the question of whether S intersected by U(R) is equal to U(S) holds for the units. In many situations our answer is positive. There is a special emphasis on the case when R is a full matrix…
Mathematical optimization is ubiquitous in modern applications. However, in practice, we often need to use nonlinear optimization models, for which the existing optimization tools such as Cplex or Gurobi may not be directly applicable and…
In this work we present an algorithm to construct sparse-paving matroids over finite set $S$. From this algorithm we derive some useful bounds on the cardinality of the set of circuits of any Sparse-Paving matroids which allow us to prove…
Given rings $R \subseteq S$, consider the division closure $DC(R,S)$ and the rational closure $RC(R,S)$ of R in S. If S is commutative, then $DC(R,S)=RC(R,S)=RT^{-1}$, where $T = \{t\in R : t^{-1} \in S\}$. We show that this is also true if…
We address two aspects of finitely generated modules of finite projective dimension over local rings and their connection in between: embeddability and grade of order ideals of minimal generators of syzygies. We provide a solution of the…
We prove that we can always construct strongly minimal linearizations of an arbitrary rational matrix from its Laurent expansion around the point at infinity, which happens to be the case for polynomial matrices expressed in the monomial…
Let $L$ be a distributive lattice and $R(L)$ the associated Hibi ring. We compute $\reg R(L)$ when $L$ is a planar lattice and give a lower bound for $\reg R(L)$ when $L$ is non-planar, in terms of the combinatorial data of $L.$ As a…
In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…
In this paper, we study local systems of locally finite associative algebras over fields of characteristic p\ge0. We describe the perfect local systems and study the relation between them and their corresponding locally finite associative…