More Like this

1. Extracting Topological Orders of Generalized Pauli Stabilizer Codes in Two Dimensions

   https://doi.org/10.1103/PRXQuantum.5.030328  

   Liang, Zijian; Xu, Yijia; Iosue, Joseph T; Chen, Yu-An (August 2024, PRX Quantum)

   In this paper, we introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the analysis of anyon excitations and string operators. The algorithm applies to ${\mathbb{Z}}_d$qudits, including instances where $d$is a nonprime number. This capability allows the identification of topological orders that differ from the ${\mathbb{Z}}_d$toric codes. It extends our understanding beyond the established theorem that Pauli stabilizer codes for ${\mathbb{Z}}_p$qudits (with $p$being a prime) are equivalent to finite copies of ${\mathbb{Z}}_p$toric codes and trivial stabilizers. The algorithm is designed to determine all anyons and their string operators, enabling the computation of their fusion rules, topological spins, and braiding statistics. The method converts the identification of topological orders into computational tasks, including Gaussian elimination, the Hermite normal form, and the Smith normal form of truncated Laurent polynomials. Furthermore, the algorithm provides a systematic approach for studying quantum error-correcting codes. We apply it to various codes, such as self-dual CSS quantum codes modified from the two-dimensional honeycomb color code and non-CSS quantum codes that contain the double semion topological order or the six-semion topological order. Published by the American Physical Society2024 

   more » « less
2. Wreath Macdonald polynomials as eigenstates

   https://doi.org/10.1007/s00029-025-01059-0  

   Wen, Joshua Jeishing (July 2025, Selecta Mathematica)

   Abstract We show that the wreath Macdonald polynomials for$$\mathbb {Z}/\ell \mathbb {Z}\wr \Sigma _n$$ $Z/\ell Z\wr {\Sigma }_n$, when naturally viewed as elements in the vertex representation of the quantum toroidal algebra$$U_{\mathfrak {q},\mathfrak {d}}(\ddot{\mathfrak {sl}}_\ell )$$ $U_{q,d}\left({\ddot{\mathrm{sl}}}_{\ell }\right)$, diagonalize its horizontal Heisenberg subalgebra. Our proof makes heavy use of shuffle algebra methods, and we also obtain a new proof of existence of wreath Macdonald polynomials. 

   more » « less
3. Higher order Kirillov--Reshetikhin modules for 𝐔 _q ( A _n ⁽¹⁾ ), imaginary modules and monoidal categorification

   https://doi.org/10.1515/crelle-2023-0068  

   Brito, Matheus; Chari, Vyjayanthi (October 2023, Journal für die reine und angewandte Mathematik (Crelles Journal))

   Abstract We study the family of irreducible modules for quantum affine $𝔰{𝔩}_{n+1}${\mathfrak{sl}_{n+1}}whose Drinfeld polynomials are supported on just one node of the Dynkin diagram. We identify all the prime modules in this family and prove a unique factorization theorem. The Drinfeld polynomials of the prime modules encode information coming from the points of reducibility of tensor products of the fundamental modules associated to $A_m${A_{m}}with $m\le n${m\leq n}. These prime modules are a special class of the snake modules studied by Mukhin and Young. We relate our modules to the work of Hernandez and Leclerc and define generalizations of the category ${\mathcal{𝒞}}^{-}${\mathscr{C}^{-}}. This leads naturally to the notion of an inflation of the corresponding Grothendieck ring. In the last section we show that the tensor product of a (higher order) Kirillov–Reshetikhin module with its dual always contains an imaginary module in its Jordan–Hölder series and give an explicit formula for its Drinfeld polynomial. Together with the results of [D. Hernandez and B. Leclerc,A cluster algebra approach toq-characters of Kirillov–Reshetikhin modules,J. Eur. Math. Soc. (JEMS) 18 2016, 5, 1113–1159] this gives examples of a product of cluster variables which are not in the span of cluster monomials. We also discuss the connection of our work with the examples arising from the work of [E. Lapid and A. Mínguez,Geometric conditions for $\mathrm{\square }$\square-irreducibility of certain representations of the general linear group over a non-archimedean local field,Adv. Math. 339 2018, 113–190]. Finally, we use our methods to give a family of imaginary modules in type $D_4${D_{4}}which do not arise from an embedding of $A_r${A_{r}}with $r\le 3${r\leq 3}in $D_4${D_{4}}. 

   more » « less
4. Modules over orders, conjugacy classes of integral matrices, and abelian varieties over finite fields

   https://doi.org/10.1007/s40993-024-00584-9  

   Marseglia, Stefano (March 2025, Research in Number Theory)

   Abstract We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the $$\mathbb {F}_q$$ $F_q$-isomorphism classes of abelian varieties over a finite field $$\mathbb {F}_q$$ $F_q$which belong to an isogeny class determined by a characteristic polynomial hof Frobenius when his ordinary, or qis prime and hhas no real roots. 

   more » « less
5. Evaluation codes arising from symmetric polynomials

   https://doi.org/10.1007/s10623-025-01637-5  

   Gatti, Barbara; Korchmáros, Gábor; Nagy, Gábor P; Pallozzi_Lavorante, Vincenzo; Schulte, Gioia (May 2025, Designs, Codes and Cryptography)

   Abstract Datta and Johnsen (Des Codes Cryptogr 91:747–761, 2023) introduced a new family of evaluation codes in an affine space of dimension$$\ge 2$$ $\ge 2$over a finite field$${\mathbb {F}}_q$$ $F_q$where linear combinations of elementary symmetric polynomials are evaluated on the set of all points with pairwise distinct coordinates. In this paper, we propose a generalization by taking low dimensional linear systems of symmetric polynomials. Computation for small values of$$q=7,9$$ $q=7,9$shows that carefully chosen generalized Datta–Johnsen codes$$\left[ \frac{1}{2}q(q-1),3,d\right] $$ $\left(\frac{1}{2},q,(q-1),,,3,,,d\right)$have minimum distancedequal to the optimal value minus 1. 

   more » « less