相关论文: Polynomial invariants of quantum codes

By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study the largest minimum weight $d(n,k)$ among all binary linear complementary dual $[n,k]$ codes. We…

We study the polynomial functions on tensor states in $(C^n)^{\otimes k}$ which are invariant under $SU(n)^k$. We describe the space of invariant polynomials in terms of symmetric group representations. For $k$ even, the smallest degree for…

A differential calculus is set up on a deformation of the oscillator algebra. It is uniquely determined by the requirement of invariance under a seven-dimensional quantum group. The quantum space and its associated differential calculus are…

We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…

In the present paper, we introduce the concepts of Jacobi polynomials and intersection enumerators of codes over $\mathbb{F}_q$ and $\mathbb{Z}_{k}$ for arbitrary genus $g$. We also discuss the interrelation among them. Finally, we give the…

The $q$-binomial coefficients are q-analogues of the binomial coefficients, counting the number of $k$-dimensional subspaces in the $n$-dimensional vector space $\mathbb{F}^n_q$ over $\mathbb{F}_{q}$. In this paper, we define a Euclidean…

Weights of permutations were originally introduced by Dugan, Glennon, Gunnells, and Steingr\'imsson (Journal of Combinatorial Theory, Series A 164:24-49, 2019) in their study of the combinatorics of tiered trees. Given a permutation…

A binary extended 1-perfect code $\mathcal C$ folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for $\mathcal C$, distinguishes among the 361…

According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

These lecture notes cover 13 sessions and are presented as an e-print, intended to evolve over time. Quantum invariants do more than distinguish topological objects; they build bridges between topology, algebra, number theory and quantum…

The Ward numbers $W(n,k)$ combinatorially enumerate set partitions with block sizes $\geq 2$ and phylogenetic trees (total partition trees). We prove that $W(n,k)$ also counts \emph{increasing Schr\"oder trees} by verifying they satisfy…

We study the density of the weights of Generalized Reed--Muller codes. Let $RM_p(r,m)$ denote the code of multivariate polynomials over $\F_p$ in $m$ variables of total degree at most $r$. We consider the case of fixed degree $r$, when we…

We find the generating set of SL-invariant polynomials in four qubits that are also invariant under permutations of the qubits. The set consists of four polynomials of degrees 2,6,8, and 12, for which we find an elegant expression in the…

Let $\mathbb{F}_{q}$ be the finite field with an odd prime power $q$. In this paper, we construct a new isometric invariant of combinatorial type on $(\mathbb{F}^{n}_{q},\text{dot}_{n})$, where…

The quantum plane is the non-commutative polynomial algebra in variables $x$ and $y$ with $xy=qyx$. In this paper, we study the module variety of $n$-dimensional modules over the quantum plane, and provide an explicit description of its…

We develop explicit formulae for the eigenvalues of various invariants for highest weight irreducible representations of the quantum supergroup $U_q[gl(m|n)]$. The techniques employed make use of modified characteristic identity methods and…

With respect to the transversal gate group (an invariant of quantum codes), we demonstrate that non-additive codes can outperform stabilizer codes. We do this by constructing spin codes that correspond to permutation-invariant multiqubit…

We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…