Related papers: Universal gradings of orders

This paper introduces and studies a particular subclasses of the class of commutative rings with finite Gorenstein global (resp., weak) dimensions.

This paper introduces and studies a particular subclass of the class of commutative rings with finite Gorenstein global dimension.

Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…

Meadows are a sort of commutative rings with a multiplicative identity element and a total multiplicative inverse operation. In this paper we study algebraic properties of common meadows, which are meadows that introduce, as the inverse of…

We consider fine G-gradings on M_n(C) (i.e. gradings of the matrix algebra over the complex numbers where each component is 1 dimensional). Groups which provide such a grading are known to be solvable. We consider the T-ideal of G-graded…

We formulate a notion of "geometric reductivity" in an abstract categorical setting which we refer to as adequacy. The main theorem states that the adequacy condition implies that the ring of invariants is finitely generated. This result…

We show that an infinite residually finite boundedly generated group has an infinite chain of finite index subgroups with ranks uniformly bounded, and give (sublinear) upper bounds on the ranks of arbitrary finite index subgroups of…

Let $\mathscr{C}$ be a small category. For every commutative ring $R$ with unity, we associate an $R\mathrm{-linear}$ abelian category with the universal homotopy category of $\mathscr{C}$, where we can do the corresponding homological…

Let $U$ be a unipotent group which is graded in the sense that it has an extension $H$ by the multiplicative group of the complex numbers such that all the weights of the adjoint action on the Lie algebra of $U$ are strictly positive. We…

We give a general constructive proof for hierarchical coordinatizations (Lagrange Decompositions) of permutation groups. The generalization originates from the investigation of how the subgroup chains of finite permutation groups yield…

In the last 60 years coding theory has been studied a lot over finite fields $\mathbb{F}_q$ or commutative rings $\mathcal{R}$ with unity. Although in $1993$, a study on the classification of the rings (not necessarily commutative or ring…

In the paper, we describe all total orders $\succ$ compatible with addition on additive subsemigroup $S$ of finite dimensional spaces over rational numbers. We provide a necessary and sufficient condition under which a finitely generated…

We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…

We study criteria for a ring - or more generally, for a small category - to be Gorenstein and for a module over it to be of finite projective dimension. The goal is to unify the universal coefficient theorems found in the literature and to…

Let $\Bbbk$ be an algebraically closed field and $\Lambda$ a generalized Brauer tree algebra over $\Bbbk$. We compute the universal deformation rings of the periodic string modules over $\Lambda$. Moreover, for a specific class of…

We consider the problem of classifying (possibly noncommutative) R-algebras of low rank over an arbitrary base ring R. We first classify algebras by their degree, and we relate the class of algebras of degree 2 to algebras with a standard…

Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…

We focus on working on incidence rings, a class of (possibly infinite) matrix rings indexed by ordered sets. Some general properties about them are given, including how they are always the inverse limit of finite matrix rings, giving a…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

In this paper we provide a complete algebraic characterization of elementary equivalence of rings with a finitely generated additive group in the language of pure rings. The rings considered are arbitrary otherwise.