相关论文: Polynomial invariants of quantum codes

Let $G\subset SO(4)$ denote a finite subgroup containing the Heisenberg group. In these notes we classify all these groups, we find the dimension of the spaces of $G$-invariant polynomials and we give equations for the generators whenever…

The paper describes a method to determine symmetrized weight enumerators of $p^m$-linear codes based on the notion of a disjoint weight enumerator. Symmetrized weight enumerators are given for the lifted quadratic residue codes of length 24…

Geometric Invariant Theory gives a method for constructing quotients for group actions on algebraic varieties which in many cases appear as moduli spaces parametrizing isomorphism classes of geometric objects (vector bundles, polarized…

We consider geometric invariant theory for \emph{graded additive groups}, groups of the form $\mathbb{G}_a^r\rtimes_w\mathbb{G}_m$ such that the $\mathbb{G}_m$-action on $\mathbb{G}_a^r$ is a scalar multiplication with weight…

A conjecture of Kac now a theorem asserts that the polynomial now known as the Kac polynomial, which counts the isomorphism classes of absolutely indecomposable representations of a quiver over a finite field with a given dimension vector,…

Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…

This article is concerned with the Fourier coefficients of cusp forms (not necessarily eigenforms) of half-integer weight lying in the plus space. We give a soft proof that there are infinitely many fundamental discriminants $D$ such that…

The u-invariant of a field is the supremum of the dimensions of anisotropic quadratic forms over the field. We define corresponding u-invariants for hermitian and generalised quadratic forms over a division algebra with involution in…

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime power $q$, we construct some class of linear code over finite field $\mathbb{F}_q$ with defining set be the preimage of…

Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes…

Low check weight is practically crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we explore the theory of weight-constrained stabilizer…

Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, we determined the complete weight enumerator of two classes of p-ary linear codes constructed from defining set.…

Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…

The Equivalence Theorem states that, for a given weight on the alphabet, every linear isometry between linear codes extends to a monomial transformation of the entire space. This theorem has been proved for several weights and alphabets,…

We study the combinatorial function $L(k,q),$ the maximum number of nonzero weights a linear code of dimension $k$ over $\F_q$ can have. We determine it completely for $q=2,$ and for $k=2,$ and provide upper and lower bounds in the general…

We define invariants for colored oriented spatial graphs by generalizing CM invariants, which were defined via non-integral highest weight representations of $U_q(sl_2)$. We apply the same method to define Yokota's invariants, and we call…

The quantum analogues of classical variable-length codes are indeterminate-length quantum codes, in which codewords may exist in superpositions of different lengths. This paper explores some of their properties. The length observable for…

We investigate means to describe the non-local properties of quantum systems and to test if two quantum systems are locally equivalent. For this we consider quantum systems that consist of several subsystems, especially multiple qubits. We…

Let $q$ be a prime power and let $\mathcal{R}=\mathbb{F}_{q}[u_1,u_2, \cdots, u_k]/\langle f_i(u_i),u_iu_j-u_ju_i\rangle$ be a finite non-chain ring, where $f_i(u_i), 1\leq i \leq k$ are polynomials, not all linear, which split into…

We express the colored Jones polynomial as the inverse of the quantum determinant of a matrix with entries in the $q$-Weyl algebra of $q$-operators, evaluated at the trivial function (plus simple substitutions). The Kashaev invariant is…