Related papers: Algorithms for commutative algebras over the ratio…
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…
The existence of ideal objects, such as maximal ideals in nonzero rings, plays a crucial role in commutative algebra. These are typically justified using Zorn's lemma, and thus pose a challenge from a computational point of view. Giving a…
For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…
We consider the algorithmic problem of computing a primitive idempotent of a central simple algebra over the field of rational functions over a finite field. The algebra is given by a set of structure constants. The problem is reduced to…
The main goal of the paper is the discussion of a deeper interaction between matrix theory over polynomial rings over a field and typical methods of commutative algebra and related algebraic geometry. This is intended in the sense of…
We describe the primitive central idempotents of the group algebra over a number field of finite monomial groups. We give also a description of the Wedderburn decomposition of the group algebra over a number field for finite strongly…
Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…
In this paper, we introduce a method computing the primitive decomposition of idempotents of any semisimple finite group algebra based on its matrix representations and Wedderburn decomposition. Particularly, we use this method to calculate…
Efficient methods for computing with matrices over finite fields often involve randomised algorithms, where matrices with a certain property are sought via repeated random selection. Complexity analyses for these algorithms require…
In this paper we develop an axiomatic setup for algorithmic homological algebra of Abelian categories. This is done by exhibiting all existential quantifiers entering the definition of an Abelian category, which for the sake of…
Recently, M. Kompatscher proved that for each finite supernilpotent algebra $\mathbf{A}$ in a congruence modular variety, there is a polynomial time algorithm to solve polynomial equations over this algebra. Let $\mu$ be the maximal arity…
It is a fundamental result in commutative algebra and invariant theory that a finitely generated graded module over a commutative finitely generated graded algebra has rational Hilbert series, and consequently the Hilbert series of the…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…
We study the set of algebraic objects known as vanishing polynomials (the set of polynomials that annihilate all elements of a ring) over general commutative rings with identity. These objects are of special interest due to their close…
We consider the Clifford algebra and the Clifford group associated with any quadratic module, degenerate or not, over an arbitrary commutative ring with 1. We determine some of the important subalgebras of the Clifford algebra under some…
A very first step to develop non-commutative algebraic geometry is the arithmetic of polynomials in non-commuting variables over a commutative field, that is, the study of elements in free associative algebras. This investigation is…
This paper continues a research program on constructive investigations of non-commutative Ore localizations, initiated in our previous papers, and particularly touches the constructiveness of arithmetics within such localizations. Earlier…