Related papers: Determining cyclicity of finite modules

Let $S_1, \cdots, S_N$ simple finite-dimensional modules of a quantum affine algebra. We prove that if $S_i\otimes S_j$ is cyclic for any $i < j$ (i.e. generated by the tensor product of the highest weight vectors), then $S_1\otimes \cdots…

Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…

An integer $a$ is a quadratic nonresidue for a prime $p$ if $x^2 \equiv a \bmod p$ has no solution. Quadratic nonresidues may be found by probabilistic methods in polynomial time. However, without assuming the Generalized Riemann…

The mod 2 cohomology algebra of the holomorph of any finite cyclic group whose order is a power of 2 is determined.

A commutative ring R has finite rank r, if each ideal of R is generated at most by r elements. A commutative ring R has the r-generator property, if each finitely generated ideal of R can be generated by r elements. Such rings are closely…

We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…

We develop cycle index generating functions for orthogonal groups in even characteristic, and give some enumerative applications. A key step is the determination of the values of the complex linear-Weil characters of the finite symplectic…

Designing a deterministic polynomial time algorithm for factoring univariate polynomials over finite fields remains a notorious open problem. In this paper, we present an unconditional deterministic algorithm that takes as input an…

We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…

A binary linear code $C$ is a $\mathbb{Z}_2$-double cyclic code if the set of coordinates can be partitioned into two subsets such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be…

We give a partial solution a question of Grigorchuk, Nekrashevych, Sushchanskii and \v{S}uni\'k by giving an algorithm to test whether a finite state element of an infinite iterated (permutational) wreath product $\hat G = \mathbb…

We study the cyclic $U(\mathfrak{gl}_n)$-module generated by the $l$-th power of the $\alpha$-determinant. When $l$ is a non-negative integer, for all but finite exceptional values of $alpha$, one shows that this cyclic module is isomorphic…

We prove a recursive formula for the exterior and symmetric powers of modules for a cyclic 2-group. This makes computation straightforward. Previously, a complete description was only known for cyclic groups of prime order.

This paper deals with some results concerning finitely generated coreduced comultiplication modules over a commutative ring.

We prove that the theory of all modules over the ring of algebraic integers is decidable.

Quasi-polycyclic (QP for short) codes over a finite chain ring $R$ are a generalization of quasi-cyclic codes, and these codes can be viewed as an $R[x]$-submodule of $\mathcal{R}_m^{\ell}$, where $\mathcal{R}_m:= R[x]/\langle f\rangle$,…

We prove several results detecting ciclicity or nilpotency of a finite group $G$ in terms of inequalities involving the orders of the elements of $G$ and the orders of the elements of the cyclic group of order $|G|$. We prove that, among…

We prove the finite generation of canonical rings of projective variety of general type defined over complex numbers.

Two-dimensional cyclic codes of length $n=\ell s$ over the finite field $\mathbb{F}$ are ideals of the polynomial ring $\frac{\mathbb{F}[x,y]}{< x^{s}-1,y^{\ell}-1 >}$. The aim of this paper, is to present a novel method to study the…

Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…