English
Related papers

Related papers: Codes and modular curves

200 papers

The problem of compression in standard information theory consists of assigning codes as short as possible to numbers. Here we consider the problem of optimal coding -- under an arbitrary coding scheme -- and show that it predicts Zipf's…

Computation and Language · Computer Science 2020-09-24 Ramon Ferrer-i-Cancho , Christian Bentz , Caio Seguin

We prove that the KZ functor from a certain category of modules for the Cherednik algebra to finite dimensional modules over the Hecke algebra is essentially surjective. Then we begin to use this result to study the analog of category O for…

Representation Theory · Mathematics 2016-01-08 Daniel Thompson

We propose an axiomatic approach towards studying unlikely intersections by introducing the framework of distinguished categories. This includes commutative algebraic groups and mixed Shimura varieties. It allows us to define all basic…

Number Theory · Mathematics 2024-11-26 Fabrizio Barroero , Gabriel Andreas Dill

Quantum theory promises computational speed-ups over classical approaches. The celebrated Gottesman-Knill Theorem implies that the full power of quantum computation resides in the specific resource of "magic" states -- the secret sauce to…

Quantum Physics · Physics 2025-02-11 Xingjian Zhang , Zhaokai Pan , Guoding Liu

Here we present a new class of optimality for coding systems. Members of that class are displaced linearly from optimal coding and thus exhibit Zipf's law, namely a power-law distribution of frequency ranks. Within that class, Zipf's law,…

Computation and Language · Computer Science 2025-10-31 Ramon Ferrer-i-Cancho

A landmark result in the study of logics for formal verification is Janin & Walukiewicz's theorem, stating that the modal $\mu$-calculus ($\mu\mathrm{ML}$) is equivalent modulo bisimilarity to standard monadic second-order logic (here…

Logic in Computer Science · Computer Science 2018-09-12 Facundo Carreiro , Alessandro Facchini , Yde Venema , Fabio Zanasi

We study connections between self-inversive and self-reciprocal polynomials, reduction theory of binary forms, minimal models of curves, and formally self-dual codes. We prove that if $\mathcal X$ is a superelliptic curve defined over…

Complex Variables · Mathematics 2019-05-30 David Joyner , Tony Shaska

We define a natural quantum analogue for the ${\cal Z}$ algebra, and which we refer to as the ${\cal Z}_q$ algebra, by modding out the Heisenberg algebra from the quantum affine algebra $U_q(\hat{sl(2)})$ with level $k$. We discuss the…

q-alg · Mathematics 2009-10-28 A. Hamid Bougourzi , Luc Vinet

One of the most important and challenging problems in coding theory is to construct codes with best possible parameters and properties. The class of quasi-cyclic (QC) codes is known to be fertile to produce such codes. Focusing on QC codes…

Information Theory · Computer Science 2021-08-17 Dev Akre , Nuh Aydin , Matthew J. Harrington , Saurav R. Pandey

These are (not updated) notes from the lectures I gave in St.Petersburg in July of 2001. Their goal is to give an expository account of the proof of Kontsevich's combinatorial formula for intersections on moduli spaces of curves following…

Combinatorics · Mathematics 2007-05-23 Andrei Okounkov

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

Number Theory · Mathematics 2015-06-30 Tewodros Amdeberhan , Roberto Tauraso

Euclidean lattices occupy a central position in number theory, the geometry of numbers, and modern cryptography. In the present article, the theory of Euclidean lattices is employed to investigate normed $\mathbb{Z}$-modules of finite rank.…

Number Theory · Mathematics 2025-08-26 Mounir Hajli

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…

Logic · Mathematics 2013-08-30 Andre Nies

The ZX-Calculus is a graphical language for quantum mechanics. An axiomatisation has recently been proven to be complete for an approximatively universal fragment of quantum mechanics, the so-called Clifford+T fragment. We focus here on the…

Quantum Physics · Physics 2018-02-26 Emmanuel Jeandel , Simon Perdrix , Renaud Vilmart

We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…

Information Theory · Computer Science 2017-09-19 E. Martínez-Moro , A. Piñera-Nicolás , I. F. Rúa

Vector Quantization (VQ) underpins many modern generative frameworks such as VQ-VAE, VQ-GAN, and latent diffusion models. Yet, it suffers from the persistent problem of codebook collapse, where a large fraction of code vectors remains…

Computer Vision and Pattern Recognition · Computer Science 2026-02-24 Hao Lu , Onur C. Koyun , Yongxin Guo , Zhengjie Zhu , Abbas Alili , Metin Nafi Gurcan

We investigate the structure of Collatz path sequences $\{F^k(n)\}_{k=0}^{\infty}$ for positive integers $n$, where $F$ denotes the standard Collatz map. By classifying natural numbers into residue classes modulo~4, we establish that the…

General Mathematics · Mathematics 2026-03-31 Sawon Pratiher

The goal of this paper is to make a connection between tropical geometry, representations of quantum affine algebras, and scattering amplitudes in physics. The connection allows us to study important and difficult questions in these areas:…

Quantum Algebra · Mathematics 2024-04-16 Nick Early , Jian-Rong Li

This paper has two parts. The main goal, carried out in Part I, is to survey some recent work by the authors in which "forced" grading constructions have played a significant role in the representation theory of semisimple algebraic groups…

Representation Theory · Mathematics 2016-03-28 Brian Parshall , Leonard Scott

We show that under the proper forcing axiom the class of all Aronszajn lines behave like $\sigma$-scattered orders under the embeddability relation. In particular, we are able to show that the class of better quasi order labeled fragmented…

Logic · Mathematics 2020-03-30 Keegan Dasilva Barbosa
‹ Prev 1 3 4 5 6 7 10 Next ›