Related papers: The dual of an evaluation code
In this work, we study codes generated by elements that come from group matrix rings. We present a matrix construction which we use to generate codes in two different ambient spaces: the matrix ring $M_k(R)$ and the ring $R,$ where $R$ is…
This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory…
Multiplication by the pseudoscalar $\mathbf{I}$ has been traditionally used in geometric algebra to perform non-metric operations such as calculating coordinates and the regressive product. In algebras with degenerate metrics, such as…
The assumed hardness of the Linear Code Equivalence problem (LCE) lies at the core of the security of the LESS signature scheme and other signature schemes with advanced functionalities. The LCE problem asks to determine whether two linear…
The set of common roots of a finite set $I$ (it is an ideal) of homogeneous polynomials is known as projective algebraic set $V$. In this article I show how to dualize such projective algebraic sets $V$ by elimination of variables from a…
Alexander duality has, in the past, made its way into commutative algebra through Stanley-Reisner rings of simplicial complexes. This has the disadvantage that one is limited to squarefree monomial ideals. The notion of Alexander duality is…
We consider the problem of determining whether a monomial ideal is dominant. This property is critical for determining for which monomial ideals the Taylor resolution is minimal. We first analyze dominant ideals with a fixed least common…
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional…
The aim of this paper is to present a unified framework in the setting of Hilbert $C^*$-modules for the scalar- and vector-valued reproducing kernel Hilbert spaces and $C^*$-valued reproducing kernel spaces. We investigate conditionally…
In this article we develop a duality principle suitable for a large class of problems in optimization. The main result is obtained through basic tools of convex analysis and duality theory. We establish a correct relation between the…
We study geometric duality for convex vector optimization problems. For a primal problem with a $q$-dimensional objective space, we formulate a dual problem with a $(q+1)$-dimensional objective space. Consequently, different from an…
Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications…
We consider semi-infinite linear programs with countably many constraints indexed by the natural numbers. When the constraint space is the vector space of all real valued sequences, we show the finite support (Haar) dual is equivalent to…
We review the close relationship between abstract machines for (call-by-name or call-by-value) lambda-calculi (extended with Felleisen's C) and sequent calculus, reintroducing on the way Curien-Herbelin's syntactic kit expressing the…
The study of polarity in computation has revealed that an "ideal" programming language combines both call-by-value and call-by-name evaluation; the two calling conventions are each ideal for half the types in a programming language. But…
The main outcomes of the paper are divided into two parts. First, we present a new dual for quadratic programs, in which, the dual variables are affine functions, and we prove strong duality. Since the new dual is intractable, we consider a…
This paper presents a canonical dual method for solving a quadratic discrete value selection problem subjected to inequality constraints. The problem is first transformed into a problem with quadratic objective and 0-1 integer variables.…
In this contribution, we consider a zero-dimensional polynomial system in $n$ variables defined over a field $\mathbb{K}$. In the context of computing a Rational Univariate Representation (RUR) of its solutions, we address the problem of…
For an ideal $I$ in a Noetherian ring $R$, we introduce and study its conductor as a tool to explore the Rees algebra of $I$. The conductor of $I$ is an ideal $C(I)\subset R$ obtained from the defining ideals of the Rees algebra and the…
Duality of curves is one of the important aspects of the ``classical'' algebraic geometry. In this paper, using this foundation, the duality of tropical polynomials is constructed to introduce the duality of Non-Archimedean curves. Using…