Related papers: Note on E-polynomials associated to $\mathbb{Z}_4$…
We investigate actions of cyclic groups on polynomial rings with two variables, and the minimal free resolution of the corresponding invariant ring. In particular, we fully classify several cases, including the case the defining ideal has…
In this article it is determined which integral reflection representations of the symmetric groups and the primitive complex reflection groups of degree $2$ have rings of invariants which are isomorphic to polynomial rings.
A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter. We show that Delsarte's observation extends to codes over arbitrary…
We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…
Suppose that G is a linearly reductive group. We study the minimal free resolution of the invariant ring. If G is a finite linearly reductive group, then the ring of invariants is generated in degree at most |G|, the group order. We prove…
We give an algorithm allowing to construct bases of local unitary invariants of pure k-qubit states from the knowledge of polynomial covariants of the group of invertible local filtering operations. The simplest invariants obtained in this…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
Based on the generic construction of linear codes, we construct linear codes over the ring $\Bbb Z_4$ via posets of the disjoint union of two chains. We determine the Lee weight distributions of the quaternary codes. Moreover, we obtain…
The main theorem in this paper is a far-reaching generalization of Gleason's theorem on the weight enumerators of codes which applies to arbitrary-genus weight enumerators of self-dual codes defined over a large class of finite rings and…
We describe the ring of invariants for the finite orthogonal groups in odd dimension and even characteristic acting on the defining representation. We construct a minimal algebra generating set and describe the relations among the…
Let R be a ring, M a nonzero left R-module, X an infinite set, and E the endomorphism ring of the direct sum of copies of M indexed by X. Given two subrings S and S' of E, we will say that S is equivalent to S' if there exists a finite…
We describe the rings of invariants for the finite orthogonal groups of plus type in odd characteristic acting on the defining representations. We also describe the invariants of the corresponding Sylow subgroups in the defining…
Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^\alpha \times\Z_4^\beta$ that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each…
In this paper we study pairs of polynomials with a given factorization pattern and such that the degree of their difference attains its minimum. We call such pairs of polynomials Davenport--Zannier pairs, or DZ-pairs for short. The paper is…
Let $E$ be a elementary abelian $p$-group of order $q=p^n$. Let $W$ be a faithful indecomposable representation of $E$ with dimension 2 over a field $k$ of characteristic $p$, and let $V= S^m(W)$ with $m<q$. We prove that the rings of…
We investigate closure operators and describe their properties for $E$-combinations and $P$-combinations of structures and their theories. We prove, for $E$-combinations, that the existence of a minimal generating set of theories is…
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…
This article is a continuation of our recent work (Yin Chen and Runxuan Zhang, Shape enumerators of self-dual NRT codes over finite fields. SIAM J. Discrete Math. 38 (2024), no. 4, 2841-2854) in the setting of quantum error-correcting…
We consider the problem of computing succinct encodings of lists of generators for invariant rings for group actions. Mulmuley conjectured that there are always polynomial sized such encodings for invariant rings of…
For Poincare series of binary polyhedral groups and Coxeter polynomials there are obtained statements close to the Euclid algorithm and orthogonal polynomials theory: generalized Ebeling formula, decompositions into ramified continued…