Related papers: Constructive Arithmetics in Ore Localizations of D…

P. M. Cohn showed in 1971 that given a ring $R$, to describe, up to isomorphism, a division ring $D$ generated by a homomorphic image of $R$ is equivalent to specifying the set of square matrices over $R$ which map to singular matrices over…

This article is a survey of closure operations on ideals in commutative rings, with an emphasis on structural properties and on using tools from one part of the field to analyze structures in another part. The survey is broad enough to…

We introduce a new point of view to present classical notions related to set-theoretic solutions of the Yang-Baxter equation: left skew braces, dirings, left skew rings. The idea is to replace the single multiplication on a left near-ring…

In arXiv:2511.04191 we constructed schemes of objects in small categories which contained a set of basepoints with local representing (localizing) objects. Here we prove that the category $\cat{Rings}$ of associative rings with unit has a…

Let $C$ be a symmetrizable generalized Cartan matrix with symmetrizer $D$ and orientation $\Omega$. In previous work we associated an algebra $H$ to this data, such that the locally free $H$-modules behave in many aspects like…

This article discusses a way for uniquely setting up the valuations for the minimal generators of the maximal ideal of a one dimensional complete reduced and irreducible local algebra over an algebraically closed field, when treated as a…

A ring $R$ is called a left APP-ring if the left annihilator $l_{R}(Ra)$ is right $s$-unital as an ideal of $R$ for any $a\in R$. Let $R$ be a ring, $(S,\leq)$ a strictly ordered monoid and $\omega:S\longrightarrow {\rm End}(R)$ a monoid…

An ordered semiring is a commutative semiring equipped with a compatible preorder. Ordered semirings generalise both distributive lattices and commutative rings, and provide a convenient framework to unify certain aspects of lattice theory…

Several algorithms with an approximation guarantee of $O(\log n)$ are known for the Set Cover problem, where $n$ is the number of elements. We study a generalization of the Set Cover problem, called the Partition Set Cover problem. Here,…

This paper introduces cutting planes that involve minimal structural assumptions, enabling the generation of strong polyhedral relaxations for a broad class of problems. We consider valid inequalities for the set $S\cap P$, where $S$ is a…

The aim of this article is to describe necessary and sufficient conditions for simplicity of Ore extension rings, with an emphasis on differential polynomial rings. We show that a differential polynomial ring, R[x;id,\delta], is simple if…

The sinkless orientation problem plays a key role in understanding the foundations of distributed computing. The problem can be used to separate two fundamental models of distributed graph algorithms, LOCAL and SLOCAL: the locality of…

Given a monoid $S$ with $E$ any non-empty subset of its idempotents, we present a novel one-sided version of idempotent completion we call left $E$-completion. In general, the construction yields a one-sided variant of a small category…

Earlier, Lunts and Rosenberg studied a notion of compatibility of endofunctors with localization functors, with an application to the study of differential operators on noncommutative rings and schemes. Another compatibility -- of Ore…

This paper is a sequel to "Computing diagonal form and Jacobson normal form of a matrix using Groebner bases", J. of Symb. Computation, 46 (5), 2011. We present a new fraction-free algorithm for the computation of a diagonal form of a…

Much research in stringology focuses on structures that can, in a way, ``grasp'' repeats (substrings that occur multiple times) as, for example, the so-called runs, a.k.a. maximal repetitions, compactly describe all tandem repeats. In this…

We propose a localized divide and conquer algorithm for inverse factorization $S^{-1} = ZZ^*$ of Hermitian positive definite matrices $S$ with localized structure, e.g. exponential decay with respect to some given distance function on the…

This study introduces the reader to the theory of approximating the solution(s) of a non-linear, second order, ordinary differential equation (ODE) with piecewise polynomial functions by using the collocation method. It then focuses on the…

Let A be an integral domain with field of fractions K. We investigate the structure of the overrings B of A (contained in K) that are well-centered on A in the sense that each principal ideal of B is generated by an element of A. We…

We describe the support of $F$-finite $F$-modules over polynomial rings $R$ of prime characteristic. Our description yields an algorithm to compute the support of such modules; the complexity of our algorithm is also analyzed. To the best…