English
Related papers

Related papers: Equivariant theory for codes and lattices I

200 papers

In this paper, we prove the $\ell$-adic abelian class field theory for henselian regular local rings of equi-characteristic assuming the surjectivity of Galois symbol maps, which is a $\ell$-adic variant of a result of Matsumi [13].

Number Theory · Mathematics 2007-09-25 Kanetomo Sato

The Witten index for certain supersymmetric lattice models treated by de Boer, van Eerten, Fendley, and Schoutens, can be formulated as a topological invariant of simplicial complexes arising as independence complexes of graphs. We prove a…

Strongly Correlated Electrons · Physics 2008-05-16 Alexander Engstrom

We prove a Hitchin-Kobayashi correspondence for affine vortices generalizing a result of Jaffe-Taubes for the action of the circle on the affine line. Namely, suppose a compact Lie group K has a Hamiltonian action on a Kaehler manifold X…

Symplectic Geometry · Mathematics 2016-08-17 Sushmita Venugopalan , Christopher T. Woodward

We study the global analogue of the Fargues-Fontaine curve over function fields $F$. We prove some foundational results about its moduli of $G$-bundles $\operatorname{Bun}_{G,F}$, which is a geometrization of the global Kottwitz set…

Number Theory · Mathematics 2026-02-06 Siyan Daniel Li-Huerta

We prove a generalization of the fundamental theorem of algebraic K-theory for Verdier-localizing functors by extending the proof for algebraic K-theory of spaces to the realm of stable $\infty$-categories. The formula behaves much better…

K-Theory and Homology · Mathematics 2023-12-06 Victor Saunier

We present the lattice structure of Feynman diagram renormalization in physical QFTs from the viewpoint of Dyson-Schwinger-Equations and the core Hopf algebra of Feynman diagrams. The lattice structure encapsules the nestedness of diagrams.…

High Energy Physics - Theory · Physics 2022-02-21 Michael Borinsky , Dirk Kreimer

We consider the question of determining the higher weights or the generalized Hamming weights of affine Grassmann codes and their duals. Several initial as well as terminal higher weights of affine Grassmann codes of an arbitrary level are…

Information Theory · Computer Science 2018-01-30 Mrinmoy Datta , Sudhir R. Ghorpade

Lattices and partially ordered sets have played an increasingly important role in coding theory, providing combinatorial frameworks for studying structural and algebraic properties of error-correcting codes. Motivated by recent works…

Information Theory · Computer Science 2026-01-13 Jessica Bariffi , Drisana Bhatia , Giuseppe Cotardo , Violetta Weger

The local Gauss law of quantum chromodynamics on a finite lattice is investigated. It is shown that it implies a gauge invariant, additive law giving rise to a gauge invariant ${\mathbb Z}_3$-valued global charge in QCD. The total charge…

High Energy Physics - Theory · Physics 2009-11-07 J. Kijowski , G. Rudolph

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

Combinatorics · Mathematics 2018-02-21 Akihiro Higashitani , Mikiya Masuda

We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C.…

Information Theory · Computer Science 2013-08-27 Cicero Carvalho

We prove that any map between projection lattices of $AW^\ast$-algebras $A$ and $B$, where $A$ has no Type $I_2$ direct summand, that preserves orthocomplementation and suprema of arbitrary elements, is a restriction of a normal Jordan…

Operator Algebras · Mathematics 2014-08-21 Jan Hamhalter

We describe genus g>1 potentials of semisimple Frobenius structures. Our formula can be considered as a definition in the axiomatic context of Frobenius manifolds. In Gromov-Witten theory, it becomes a conjecture expressing higher genus…

Algebraic Geometry · Mathematics 2007-05-23 Alexander Givental

The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we…

Information Theory · Computer Science 2015-04-07 Maosheng Xiong , Shuxing Li , Gennian Ge

We develop the theory of generalized bi-Hamiltonian reduction. Applying this theory to a suitable loop algebra we recover a generalized Drinfeld-Sokolov reduction. This gives a way to construct new examples of algebraic Frobenius manifolds.

Exactly Solvable and Integrable Systems · Physics 2009-11-13 Yassir Ibrahim Dinar

The MacWilliams' Extension Theorem is a classical result by Florence Jessie MacWilliams. It shows that every linear isometry between linear block-codes endowed with the Hamming distance can be extended to a linear isometry of the ambient…

Information Theory · Computer Science 2023-04-27 Elisa Gorla , Flavio Salizzoni

In this paper, the MacWilliams theorem is stated for codes over finite field with four-dimensional modulo metrics.

Information Theory · Computer Science 2014-10-21 Murat Guzeltepe , Mehmet Ozen

The Jacobi system with matrix-valued coefficients and with the spectral parameter depending on a matrix-valued weight factor is considered on the full-line lattice. The scattering from the full-line lattice is expressed in terms of the…

Mathematical Physics · Physics 2026-04-22 Tuncay Aktosun , Abdon E. Choque-Rivero , Vassilis G. Papanicolaou , Mehmet Unlu , Ricardo Weder

In this paper, with the help of the theory of matrices and finite fields we generalize Zolotarev's theorem to an arbitrary finite dimensional vector space over $\mathbb{F}_q$, where $\mathbb{F}_q$ denotes the finite field with $q$ elements.

Number Theory · Mathematics 2021-01-28 Hai-Liang Wu , Li-Yuan Wang

We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O'Sullivan based on Gr\"obner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander. By using the same…

Information Theory · Computer Science 2012-10-09 Olav Geil , Ryutaroh Matsumoto , Diego Ruano
‹ Prev 1 8 9 10 Next ›