More Like this

1. Torsion phenomena for zero-cycles on a product of curves over a number field

   https://doi.org/10.1007/s40993-024-00519-4  

   Gazaki, Evangelia; Love, Jonathan (March 2024, Research in Number Theory)

   Abstract For a smooth projective varietyXover an algebraic number fieldka conjecture of Bloch and Beilinson predicts that the kernel of the Albanese map ofXis a torsion group. In this article we consider a product$$X=C_1\times \cdots \times C_d$$ $X=C_1\times \cdots \times C_d$of smooth projective curves and show that if the conjecture is true for any subproduct of two curves, then it is true forX. For a product$$X=C_1\times C_2$$ $X=C_1\times C_2$of two curves over$$\mathbb {Q} $$ $Q$with positive genus we construct many nontrivial examples that satisfy the weaker property that the image of the natural map$$J_1(\mathbb {Q})\otimes J_2(\mathbb {Q})\xrightarrow {\varepsilon }{{\,\textrm{CH}\,}}_0(C_1\times C_2)$$ $J_1\left(Q\right)\otimes J_2\left(Q\right)\stackrel{\epsilon }{\to }{\text{CH}}_0(C_1\times C_2)$is finite, where$$J_i$$ $J_i$is the Jacobian variety of$$C_i$$ $C_i$. Our constructions include many new examples of non-isogenous pairs of elliptic curves$$E_1, E_2$$ $E_1,E_2$with positive rank, including the first known examples of rank greater than 1. Combining these constructions with our previous result, we obtain infinitely many nontrivial products$$X=C_1\times \cdots \times C_d$$ $X=C_1\times \cdots \times C_d$for which the analogous map$$\varepsilon $$ $\epsilon$has finite image. 

   more » « less
2. Higher-group symmetry of (3+1)D fermionic $$\mathbb{Z}_2$$ gauge theory: Logical CCZ, CS, and T gates from higher symmetry

   https://doi.org/10.21468/SciPostPhys.16.5.122  

   Barkeshli, Maissam; Hsin, Po-Shen; Kobayashi, Ryohei (January 2024, SciPost Physics)

   It has recently been understood that the complete global symmetry of finite group topological gauge theories contains the structure of a higher-group. Here we study the higher-group structure in (3+1)D\mathbb{Z}_2 ${\mathbb{Z}}_2$gauge theory with an emergent fermion, and point out that pumping chiralp+ip $p+ip$topological states gives rise to a\mathbb{Z}_{8} ${\mathbb{Z}}_8$0-form symmetry with mixed gravitational anomaly. This ordinary symmetry mixes with the other higher symmetries to form a 3-group structure, which we examine in detail. We then show that in the context of stabilizer quantum codes, one can obtain logical CCZ and CS gates by placing the code on a discretization ofT^3 $T^3$(3-torus) andT^2 \rtimes_{C_2} S^1 $T^2{⋊}_{C_2}{S}^1$(2-torus bundle over the circle) respectively, and pumpingp+ip $p+ip$states. Our considerations also imply the possibility of a logicalT $T$gate by placing the code on\mathbb{RP}^3 ${ℝ\mathbb{P}}^3$and pumping ap+ip $p+ip$topological state. 

   more » « less
3. More on codes for combinatorial composite DNA

   https://doi.org/10.1007/s10623-025-01634-8  

   Ye, Zuo; Sabary, Omer; Gabrys, Ryan; Yaakobi, Eitan; Elishco, Ohad (May 2025, Designs, Codes and Cryptography)

   Abstract In this paper, we focus on constructing unique-decodable and list-decodable codes for the recently studied (t, e)-composite-asymmetric error-correcting codes ((t, e)-CAECCs). Let$$\mathcal {X}$$ $X$be an$$m \times n$$ $m\times n$binary matrix in which each row has Hamming weightw. If at mosttrows of$$\mathcal {X}$$ $X$contain errors, and in each erroneous row, there are at mosteoccurrences of$$1 \rightarrow 0$$ $1\to 0$errors, we say that a (t, e)-composite-asymmetric error occurs in$$\mathcal {X}$$ $X$. For general values ofm, n, w, t, ande, we propose new constructions of (t, e)-CAECCs with redundancy at most$$(t-1)\log (m) + O(1)$$ $(t-1)log\left(m\right)+O\left(1\right)$, whereO(1) is independent of the code lengthm. In particular, this yields a class of (2, e)-CAECCs that are optimal in terms of redundancy. Whenmis a prime power, the redundancy can be further reduced to$$(t-1)\log (m) - O(\log (m))$$ $(t-1)log\left(m\right)-O(log(m\left)\right)$. To further increase the code size, we introduce a combinatorial object called a weak$$B_e$$ $B_e$-set. When$$e = w$$ $e=w$, we present an efficient encoding and decoding method for our codes. Finally, we explore potential improvements by relaxing the requirement of unique decoding to list-decoding. We show that when the list size ist! or an exponential function oft, there exist list-decodable (t, e)-CAECCs with constant redundancy. When the list size is two, we construct list-decodable (3, 2)-CAECCs with redundancy$$\log (m) + O(1)$$ $log\left(m\right)+O\left(1\right)$. 

   more » « less
4. 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
5. The immersion poset on partitions

   https://doi.org/10.1007/s10801-025-01380-z  

   Johnston, Lisa; Kenepp, David; Nguyen, Evuilynn; Paul, Digjoy; Schilling, Anne; Simone, Mary_Claire; Zhou, Regina (February 2025, Journal of Algebraic Combinatorics)

   Abstract We introduce the immersion poset$$({\mathcal {P}}(n), \leqslant _I)$$ $(P\left(n\right),{⩽}_I)$on partitions, defined by$$\lambda \leqslant _I \mu $$ $\lambda {⩽}_I\mu$if and only if$$s_\mu (x_1, \ldots , x_N) - s_\lambda (x_1, \ldots , x_N)$$ $s_{\mu }(x_1,\dots ,x_N)-s_{\lambda }(x_1,\dots ,x_N)$is monomial-positive. Relations in the immersion poset determine when irreducible polynomial representations of$$GL_N({\mathbb {C}})$$ $G{L}_N\left(C\right)$form an immersion pair, as defined by Prasad and Raghunathan [7]. We develop injections$$\textsf{SSYT}(\lambda , \nu ) \hookrightarrow \textsf{SSYT}(\mu , \nu )$$ $\mathrm{SSYT}(\lambda ,\nu )\hookrightarrow \mathrm{SSYT}(\mu ,\nu )$on semistandard Young tableaux given constraints on the shape of$$\lambda $$ $\lambda$, and present results on immersion relations among hook and two column partitions. The standard immersion poset$$({\mathcal {P}}(n), \leqslant _{std})$$ $(P\left(n\right),{⩽}_{\mathrm{std}})$is a refinement of the immersion poset, defined by$$\lambda \leqslant _{std} \mu $$ $\lambda {⩽}_{\mathrm{std}}\mu$if and only if$$\lambda \leqslant _D \mu $$ $\lambda {⩽}_D\mu$in dominance order and$$f^\lambda \leqslant f^\mu $$ $f^{\lambda }⩽f^{\mu }$, where$$f^\nu $$ $f^{\nu }$is the number of standard Young tableaux of shape$$\nu $$ $\nu$. We classify maximal elements of certain shapes in the standard immersion poset using the hook length formula. Finally, we prove Schur-positivity of power sum symmetric functions on conjectured lower intervals in the immersion poset, addressing questions posed by Sundaram [12]. 

   more » « less