Related papers: Computing generators of free modules over orders i…

We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the…

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…

Let D be a central simple algebra of prime degree over a field and let E be an SL_1(D)-torsor. We determine the complete motivic decomposition of certain compactifications of E. We also compute the Chow ring of E.

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

In this work, we extend modular techniques for computing Gr\"obner bases involving rational coefficients to (two-sided) ideals in free algebras. We show that the infinite nature of Gr\"obner bases in this setting renders the classical…

Let $L_n$ be a simplest cubic field with Galois group $G=\rm{Gal} (L_n/\mathbb Q)$. The associated order is denoted as ${\cal A}_{L_n/\mathbb Q}:= \{ x\in {\mathbb Q} [G] \, |\, x \cdot \cal{O}_{L_n} \subset {\cal O}_{L_n } \}$, where…

In this paper, we present several algorithms for dealing with graded components of Laurent polynomial rings. To be more precise, let $S$ be the Laurent polynomial ring $k[x_1,...,x_{r},x_{r+1}^{\pm 1},..., x_n^{\pm 1}]$, $k$ algebraicaly…

For an algebraically closed field K, let G be a finite abelian group of K-linear automorphisms of a finite-dimensional path algebra KQ of a quiver Q. Under certain assumptions on the action of G, we show the existence of a certain kind of…

It is shown that the methods and algorithms, developed in (A. Capani et al., Computing minimal finite free resolutions, {\it Journal of Pure and Applied Algebra}, (117& 118)(1997), 105 -- 117; M. Kreuzer and L. Robbiano, {\it Computational…

Let $K$ be an extension of $\mathbb{Q}$ and $A/K$ an elliptic curve. If $\mathrm{Gal}(\bar K/K)$ is finitely generated, then $A$ is of infinite rank over $K$. In particular, this implies the $g=1$ case of the Junker-Koenigsmann conjecture.…

Constructive proofs of fact that a stably free left $S$-module $M$ with rank$(M)\geq$sr$(S)$ is free, where sr$(S)$ denotes the stable rank of an arbitrary ring $S$, were developed in some articles. Additionally, in such papers, are…

We give an algorithm to determine finitely many generators for a subgroup of finite index in the unit group of an integral group ring $\mathbb{Z} G$ of a finite nilpotent group $G$, this provided the rational group algebra $\mathbb{Q} G$…

We consider the problem of computing the rank of an m x n matrix A over a field. We present a randomized algorithm to find a set of r = rank(A) linearly independent columns in \~O(|A| + r^\omega) field operations, where |A| denotes the…

In this paper we develop a general method to prove independence of algebraic monodromy groups in compatible systems of representations, and we apply it to deduce independence results for compatible systems both in automorphic and in…

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…

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…

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

There are well known algorithms to compute the class group of the maximal order $\mathcal{O}_K$ of a number field $K$ and the group of invertible ideal classes of a non-maximal order $R$. In this paper we explain how to compute also the…

We consider the problem of computing the monic gcd of two polynomials over a number field L = Q(alpha_1,...,alpha_n). Langemyr and McCallum have already shown how Brown's modular GCD algorithm for polynomials over Q can be modified to work…

We give an explicit and character-free construction of a complete set of orthogonal primitive idempotents of a rational group algebra of a finite nilpotent group and a full description of the Wedderburn decomposition of such algebras. An…