English
Related papers

Related papers: A Galois Connection Approach to Wei-Type Duality T…

200 papers

We observe, utilize dualities in differential equations and differential inequalities, dualities between comparison theorems in differential equations, and obtain dualities in "swapping" comparison theorems in differential equations. These…

Differential Geometry · Mathematics 2021-04-13 Shihshu Walter Wei

We consider a complex of tori of length 2 defined over a number field k. We establish here some local and global duality theorems for the (\'etale or Galois) hypercohomology of such a complex. We prove the existence of a Poitou-Tate exact…

Number Theory · Mathematics 2009-06-19 Cyril Demarche

The Generalized Hamming weights and their relative version, which generalize the minimum distance of a linear code, are relevant to numerous applications, including coding on the wire-tap channel of type II, $t$-resilient functions,…

Information Theory · Computer Science 2024-11-21 Eduardo Camps-Moreno , Hiram H. López , Gretchen L. Matthews , Rodrigo San-José

A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs). Cohen…

Computational Complexity · Computer Science 2016-05-31 Peter Fulla , Stanislav Zivny

We study a dual pair of general linear Lie superalgebras in the sense of R. Howe. We give an explicit multiplicity-free decomposition of a symmetric and skew-symmetric algebra (in the super sense) under the action of the dual pair and…

Representation Theory · Mathematics 2007-05-23 Shun-Jen Cheng , Weiqiang Wang

A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown to be a Fourier…

Information Theory · Computer Science 2010-11-23 G. David Forney

This paper is dedicated to the differential Galois theory in the complex analytic context for Lie-Vessiot systems. Those are the natural generaliza- tion of linear systems, and the more general class of differential equations adimitting…

Classical Analysis and ODEs · Mathematics 2009-01-29 David Blázquez-Sanz , Juan José Morales-Ruiz

We develop a geometric approach toward an interplay between a pair of quantum Schur algebras of arbitrary finite type. Then by Beilinson-Lusztig-MacPherson's stabilization procedure in the setting of partial flag varieties of type A (resp.…

Representation Theory · Mathematics 2022-10-12 Li Luo , Zheming Xu

We introduce a general class of regular weight functions on finite abelian groups, and study the combinatorics, the duality theory, and the metric properties of codes endowed with such functions. The weights are obtained by composing a…

Information Theory · Computer Science 2017-11-01 Alberto Ravagnani

In this work, we explore the relationship between free resolution of some monomial ideals and Generalized Hamming Weights (GHWs) of binary codes. More precisely, we look for a structure smaller than the set of codewords of minimal support…

Information Theory · Computer Science 2022-04-01 Ignacio García-Marco , Irene Márquez-Corbella , Edgar Martínez-Moro , Yuriko Pitones

We develop an algebraic theory of supports for $R$-linear codes of fixed length, where $R$ is a finite commutative unitary ring. A support naturally induces a notion of generalized weights and allows one to associate a monomial ideal to a…

Information Theory · Computer Science 2022-01-19 Elisa Gorla , Alberto Ravagnani

We revisit the problem of Stone duality for lattices with various quasioperators, first studied in [14], presenting a fresh duality result. The new result is an improvement over that of [14] in two important respects. First, the…

Logic · Mathematics 2024-12-22 Chrysafis Hartonas

This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…

Optimization and Control · Mathematics 2024-10-02 Robert Ghrist , Julian Gould , Miguel Lopez

Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…

Information Theory · Computer Science 2025-11-25 Dongmei Huang , Qunying Liao , Sihem Mesnager , Gaohua Tang , Haode Yan

Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power…

Information Theory · Computer Science 2016-05-12 Ziling Heng , Qin Yue

The generalized Hamming weight (GHW) $d_r(C)$ of linear codes $C$ is a natural generalization of the minimum Hamming distance $d(C)(=d_1(C))$ and has become one of important research objects in coding theory since Wei's originary work [23]…

Information Theory · Computer Science 2014-10-13 Minghui Yang , Jin Li , Keqin Feng , Dongdai Lin

Since MacWilliams proved the original identity relating the Hamming weight enumerator of a linear code to the weight enumerator of its dual code there have been many different generalizations, leading to the development of $m$-tuple support…

Information Theory · Computer Science 2017-06-13 Nathan Kaplan

The lattice model of the Weil representation over non-archimedean local field $F$ of odd residual characteristic has been known for decades, and is used to prove the Howe duality conjecture for unramified dual pairs when the residue…

Representation Theory · Mathematics 2012-07-10 Shuichiro Takeda

Suppose $K/\mathbb{Q}_p$ is finite and $\overline{r}\colon G_K\to \mathrm{GL}_2(\overline{\mathbb{F}}_p)$ is a reducible Galois representation. In this paper we prove that we can use the results by the author in [Ste22] to obtain a…

Number Theory · Mathematics 2023-01-25 Misja F. A. Steinmetz

Universal security over a network with linear network coding has been intensively studied. However, previous linear codes used for this purpose were linear over a larger field than that used on the network. In this work, we introduce new…

Information Theory · Computer Science 2017-04-14 Umberto Martínez-Peñas , Ryutaroh Matsumoto