Classical Codes and Chiral CFTs at Higher Genus

• URL: http://arxiv.org/abs/2112.05168v2
• Date: Fri, 29 Apr 2022 18:12:58 GMT
• Title: Classical Codes and Chiral CFTs at Higher Genus
• Authors: Johan Henriksson, Ashish Kakkar, Brian McPeak
• Abstract summary: We derive explicit expressions for the higher genus partition functions of a specific class of CFTs: code CFTs. This work provides a step towards a full understanding of the constraints from higher genus modular invariance on 2d CFTs.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Higher genus modular invariance of two-dimensional conformal field theories (CFTs) is a largely unexplored area. In this paper, we derive explicit expressions for the higher genus partition functions of a specific class of CFTs: code CFTs, which are constructed using classical error-correcting codes. In this setting, the $\mathrm{Sp}(2g,\mathbb Z)$ modular transformations of genus $g$ Riemann surfaces can be recast as a simple set of linear maps acting on $2^g$ polynomial variables, which comprise an object called the code enumerator polynomial. The CFT partition function is directly related to the enumerator polynomial, meaning that solutions of the linear constraints from modular invariance immediately give a set of seemingly consistent partition functions at a given genus. We then find that higher genus constraints, plus consistency under degeneration limits of the Riemann surface, greatly reduces the number of possible code CFTs. This work provides a step towards a full understanding of the constraints from higher genus modular invariance on 2d CFTs.

Related papers

• A new multivariate primitive from CCZ equivalence [1.8024397171920885]
  Two secret affine invertible $mathcal S,mathcal T$ are applied to a set of $mathcalF$. The equivalences $mathcal G$ and $mathcal F$ are said to be affine equivalent.
  arXiv  Detail & Related papers  (2024-05-31T16:15:02Z)
• On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors [1.249418440326334]
  We characterize maximal families over the binary field $mathbbF$. Our findings prompt several more open questions, which we plan to address in an extended version of this work.
  arXiv  Detail & Related papers  (2024-05-14T16:30:28Z)
• Simple Multigraph Convolution Networks [49.19906483875984]
  Existing multigraph convolution methods either ignore the cross-view interaction among multiple graphs, or induce extremely high computational cost due to standard cross-view operators. This paper proposes a Simple Multi Convolution Networks (SMGCN) which first extracts consistent cross-view topology from multigraphs including edge-level and subgraph-level topology, then performs expansion based on raw multigraphs and consistent topologies. In theory, SMGCN utilizes the consistent topologies in expansion rather than standard cross-view expansion, which performs credible cross-view spatial message-passing, and effectively reduces the complexity of standard expansion.
  arXiv  Detail & Related papers  (2024-03-08T03:27:58Z)
• Agnostically Learning Multi-index Models with Queries [54.290489524576756]
  We study the power of query access for the task of agnostic learning under the Gaussian distribution. We show that query access gives significant runtime improvements over random examples for agnostically learning MIMs.
  arXiv  Detail & Related papers  (2023-12-27T15:50:47Z)
• Non-rational Narain CFTs from codes over $F_4$ [0.0]
  We construct a map between a class of codes over $F_4$ and a family of non-rational Narain CFTs. This construction is complementary to a recently introduced relation between quantum stabilizer codes and a class of rational Narain theories.
  arXiv  Detail & Related papers  (2021-07-06T18:00:06Z)
• Bilinear Classes: A Structural Framework for Provable Generalization in RL [119.42509700822484]
  Bilinear Classes is a new structural framework which permits generalization in reinforcement learning. The framework incorporates nearly all existing models in which a sample complexity is achievable. Our main result provides an RL algorithm which has sample complexity for Bilinear Classes.
  arXiv  Detail & Related papers  (2021-03-19T16:34:20Z)
• Finite-Function-Encoding Quantum States [52.77024349608834]
  We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions. We investigate some of their structural properties.
  arXiv  Detail & Related papers  (2020-12-01T13:53:23Z)
• On Polynomial Approximations for Privacy-Preserving and Verifiable ReLU Networks [6.130998208629276]
  We propose a degree-2 activation function with a first order term and empirically show that it can lead to much better models. Our proposed function improves the test accuracy by up to 10.4% compared to the square function.
  arXiv  Detail & Related papers  (2020-11-11T03:32:22Z)
• On Function Approximation in Reinforcement Learning: Optimism in the Face of Large State Spaces [208.67848059021915]
  We study the exploration-exploitation tradeoff at the core of reinforcement learning. In particular, we prove that the complexity of the function class $mathcalF$ characterizes the complexity of the function. Our regret bounds are independent of the number of episodes.
  arXiv  Detail & Related papers  (2020-11-09T18:32:22Z)
• Quantum stabilizer codes, lattices, and CFTs [0.0]
  We show that quantum error-correcting codes, those of the stabilizer type, are related to Lorentzian lattices and non-chiral CFTs. More specifically, real self-dual stabilizer codes can be associated with even self-dual Lorentzian lattices. We dub the resulting theories code CFTs and study their properties.
  arXiv  Detail & Related papers  (2020-09-02T18:00:01Z)
• Exponentially Weighted l_2 Regularization Strategy in Constructing Reinforced Second-order Fuzzy Rule-based Model [72.57056258027336]
  In the conventional Takagi-Sugeno-Kang (TSK)-type fuzzy models, constant or linear functions are usually utilized as the consequent parts of the fuzzy rules. We introduce an exponential weight approach inspired by the weight function theory encountered in harmonic analysis.
  arXiv  Detail & Related papers  (2020-07-02T15:42:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.