Related papers: The dual of an evaluation code
Explicit bases for the subfield subcodes of projective Reed-Muller codes over the projective plane and their duals are obtained. In particular, we provide a formula for the dimension of these codes. For the general case over the projective…
The classical Reed-Muller codes over a finite field $\mathbb{F}_q$ are based on evaluations of $m$-variate polynomials of degree at most $d$ over a product set $U^m$, for some $d$ less than $|U|$. Because of their good distance properties,…
Classical primal-dual affine programming takes place over finite dimensional real vector spaces. This results in beautiful duality theory, connecting the optimal solu- tions of the primal maximization problem and the dual minimization…
Consider a sequence of AG codes evaluating at a set of evaluation points $P_1,\dots,P_n$ the functions having only poles at a defining point $Q$, with the sequence of codes satisfying the isometry-dual condition (i.e. containing at the same…
Let G be a complex semisimple Lie group. The aim of this article is to compare two basis for G-modules, namely the standard monomial basis and the dual canonical basis. In particular, we give a sufficient condition for a standard monomial…
Macaulay Duality, between quotients of a polynomial ring over a field, annihilated by powers of the variables, and finitely generated submodules of the ring's graded dual, is generalized over any Noetherian ring, and used to provide…
There are several ways to define program equivalence for functional programs with algebraic effects. We consider two complementing ways to specify behavioural equivalence. One way is to specify a set of axiomatic equations, and allow proof…
We study commutative algebras with Gorenstein duality, i.e. algebras $A$ equipped with a non-degenerate bilinear pairing such that $\langle ac,b\rangle=\langle a,bc\rangle$ for any $a,b,c\in A$. If an algebra $A$ is Artinian, such pairing…
In this paper we study duality for evaluation codes on intersections of d hypersurfaces with given d-dimensional Newton polytopes, so called toric complete intersection codes. In particular, we give a condition for such a code to be…
In this paper semirings with an idempotent addition are considered. These algebraic structures are endowed with a partial order. This allows to consider residuated maps to solve systems of inequalities $A \otimes X \preceq B$. The purpose…
For equality-constrained linear mixed-integer programs (MIP) defined by rational data, it is known that the subadditive dual is a strong dual and that there exists an optimal solution of a particular form, termed generator subadditive…
We describe an algorithm for computing Macaulay dual spaces for multi-graded ideals. For homogeneous ideals, the natural grading is inherited by the Macaulay dual space which has been leveraged to develop algorithms to compute the Macaulay…
Algebraic-geometric codes can be constructed by evaluating a certain set of functions on a set of distinct rational points of an algebraic curve. The set of functions that are evaluated is the linear space of a given divisor or,…
We show that every finite Boolean combination of polynomial equalities and inequalities in C^n admits two uniform normal forms: an $\exists\forall$ form and a $\forall\exists$ form, each using a single polynomial equation. Both forms use…
In this review we present hyper-dual numbers as a tool for the automatic differentiation of computer programs via operator overloading. We start with a motivational introduction into the ideas of algorithmic differentiation. Then we…
An uniform LP duality is an useful property of conic matrix systems. A consistent linear conic optimization problem yields uniform LP duality if for any linear cost function, for which the primal problem has finite optimal value, the…
The binary Reed-Muller codes can be characterized as the radical powers of a modular algebra. We use the Groebner bases to decode these codes.
A flag of codes $C_0 \subsetneq C_1 \subsetneq \cdots \subsetneq C_s \subseteq {\mathbb F}_q^n$ is said to satisfy the {\it isometry-dual property} if there exists ${\bf x}\in (\mathbb{F}_q^*)^n$ such that the code $C_i$ is {\bf…
This paper addresses the study of algebraic versions of Farkas lemma and strong duality results in the very broad setting of infinite-dimensional conic linear programming in dual pairs of vector spaces. To this end, purely algebraic…
The aim of this work is to use linear programming and polyhedral geometry to prove a duality formula for the ic-resurgence of edge ideals. We show that the ic-resurgence of the edge ideal $I$ of a clutter $\mathcal{C}$ and the ic-resurgence…