English
Related papers

Related papers: Harder-Narasimhan theory for linear codes

200 papers

We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. We show that for {\em every} code, the ratio of its list decoding radius to its minimum distance…

Information Theory · Computer Science 2008-11-27 Parikshit Gopalan , Venkatesan Guruswami , Prasad Raghavendra

The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…

Information Theory · Computer Science 2022-12-08 Chao Liu , Dabin Zheng , Xiaoqiang Wang

We compute the Harder-Narasimhan filtration of vector bundles $f_*\mathcal O_Y$ for certain finite morphisms $f\,:\,Y\,\longrightarrow\, X$ and in some other cases.

Algebraic Geometry · Mathematics 2026-04-27 Indranil Biswas , Manish Kumar , A. J. Parameswaran

Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…

Logic · Mathematics 2023-11-08 Robert Goldblatt

The Galois hull of a linear code is the intersection of itself and its Galois dual code, which has aroused the interest of researchers in these years. In this paper, we study Galois hulls of linear codes. Firstly, the symmetry of the…

Information Theory · Computer Science 2023-01-12 Yang Li , Shixin Zhu

This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…

Category Theory · Mathematics 2020-04-21 Gregory Henselman-Petrusek

We show how to construct Hamiltonian lattice theories with one exact supersymmetry on arbitrary triangulations of curved space in any number of dimensions. Both bosons and fermions satisfy discrete K\"{a}hler-Dirac equations. The…

High Energy Physics - Theory · Physics 2026-01-06 David Berenstein , Simon Catterall

We study the semistability of quiver representations from an algorithmic perspective. We present efficient algorithms for several fundamental computational problems on the semistability of quiver representations: deciding the semistability…

Optimization and Control · Mathematics 2025-05-13 Yuni Iwamasa , Taihei Oki , Tasuku Soma

This work investigates the structure of rank-metric codes in connection with concepts from finite geometry, most notably the $q$-analogues of projective systems and blocking sets. We also illustrate how to associate a classical…

Combinatorics · Mathematics 2021-06-24 Gianira N. Alfarano , Martino Borello , Alessandro Neri , Alberto Ravagnani

In this paper we study the relationship between three compactifications of the moduli space of Hermitian-Yang-Mills connections on a fixed Hermitian vector bundle over a projective algebraic manifold of arbitrary dimension. Via the…

Differential Geometry · Mathematics 2021-07-21 Daniel Greb , Benjamin Sibley , Matei Toma , Richard Wentworth

In this paper, we present a generalization of Hayden's theorem [7, Theorem 4.2] for $G$-codes over finite Frobenius rings. A lattice theoretical form of this generalization is also given. Moreover, Astumi's MacWilliams identity [1, Theorem…

Combinatorics · Mathematics 2023-09-11 Himadri Shekhar Chakraborty , Tsuyoshi Miezaki

The purpose of this paper is to establish several new results about the Hodge theory of Lagrangian fibrations on (not necessarily compact) holomorphic symplectic manifolds. Let $M$ be a holomorphic symplectic manifold of dimension $2n$ that…

Algebraic Geometry · Mathematics 2026-03-17 Christian Schnell

The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. In this paper, we investigate the generalized Hamming weights of two classes of linear codes constructed from defining sets and determine them completely…

Information Theory · Computer Science 2019-05-08 Gaopeng Jian

We construct a discrete subset of Narain CFTs from quantum stabilizer codes with qudit (including qubit) systems whose dimension is a prime number. Our construction exploits three important relations. The first relation is between qudit…

High Energy Physics - Theory · Physics 2023-05-01 Kohki Kawabata , Tatsuma Nishioka , Takuya Okuda

We give an example of an orthogonal bundle where the Harder-Narasimhan filtration, with respect to Gieseker semistability, of its underlying vector bundle does not correspond to any parabolic reduction of the orthogonal bundle. A similar…

Algebraic Geometry · Mathematics 2017-07-11 Indranil Biswas , Alfonso Zamora

In this survey we provide an overview of some recent developments in the construction of moduli spaces using stack-theoretic techniques. We will also explain the analogue of Harder-Narasimhan stratifications for general stacks, known as…

Algebraic Geometry · Mathematics 2023-09-22 Tomás L. Gómez , Andres Fernández Herrero , Alfonso Zamora

We generalize the tensor product theory for modules for a vertex operator algebra previously developed in a series of papers by the first two authors to suitable module categories for a ``conformal vertex algebra'' or even more generally,…

Quantum Algebra · Mathematics 2007-05-23 Yi-Zhi Huang , James Lepowsky , Lin Zhang

For a polarized family of complex projective manifolds, we study the asymptotic distribution of Harder-Narasimhan slopes of direct image sheaves associated with high tensor powers of the polarization. We establish a theorem of…

Algebraic Geometry · Mathematics 2024-02-21 Siarhei Finski

We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…

Information Theory · Computer Science 2016-12-06 Jin Li , Aixian Zhang , Keqin Feng

Tensor-network methods enable probing dynamics of strongly interacting quantum many-body systems, including gauge theories, via Hamiltonian simulation, hence bypassing sign problems. They also have the potential to inform efficient…

High Energy Physics - Lattice · Physics 2025-02-18 Emil Mathew , Navya Gupta , Saurabh V. Kadam , Aniruddha Bapat , Jesse Stryker , Zohreh Davoudi , Indrakshi Raychowdhury