Related papers: On affine variety codes from the Klein quartic
We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…
We prove lower bounds for the minimum distance of algebraic geometry codes over surfaces whose canonical divisor is either nef or anti-strictly nef and over surfaces without irreducible curves of small genus. We sharpen these lower bounds…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
We develop three approaches of combinatorial flavour to study the structure of minimal codes and cutting blocking sets in finite geometry, each of which has a particular application. The first approach uses techniques from algebraic…
We study the Jordan-Hoelder series for nearby cycles on certain Shimura varieties and Rapoport-Zink local models, and on finite-dimensional pieces of Beilinson's deformation of the affine Grassmannian to the affine flag variety (and their…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
In this paper, we study a class of linear codes defined by characteristic functions of certain subsets of a finite field. We derive a sufficient and necessary condition for such a code to be a minimal linear code by a character-theoretical…
An important breakthrough in understanding the geometry of Schubert varieties was the introduction of the notion of Frobenius split varieties and the result that the flag varieties G/P are Frobenius split. The aim of this article is to give…
In his classical paper [5], Koornwinder studied a family of orthogonal polynomials of two variables, derived from symmetric polynomials. This family possesses a rare property that orthogonal polynomials of degree $n$ have $n(n+1)/2$ real…
In this paper we present three related results on the subject of fields of parametrization. Let C be a rational curve over a field of characteristic zero. Let K be a field finitely generated over Q, such that it is a field of definition of…
This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is complete, in the sense that a $(\!(n, K, {\delta})\!)_2$…
We prove that every filtered fiber functor on the category of dualizable representations of a smooth affine group scheme with enough dualizable representations comes from a graded fiber functor.
Quantum affine reflection algebras are coideal subalgebras of quantum affine algebras that lead to trigonometric reflection matrices (solutions of the boundary Yang-Baxter equation). In this paper we use the quantum affine reflection…
We definitively establish that the theory of symmetric Macdonald polynomials aligns with quantum and affine Schubert calculus using a discovery that distinguished weak chains can be identified by chains in the strong (Bruhat) order poset on…
The Kuperberg Program asks to find presentations of planar algebras and use these presentations to prove results about their corresponding categories purely diagrammatically. This program has been completed for index less than 4 and is…
Quantum error-correcting codes with good parameters can be constructed by evaluating polynomials at the roots of the polynomial trace. In this paper, we propose to evaluate polynomials at the roots of trace-depending polynomials (given by a…
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
In this article, we construct infinite families of quaternary (that is, over the ring $\mathbb{Z}_4$) $\mathcal{C}_{D}$-codes, where the defining set $D$ is derived utilizing a two-generator simplicial complex, and determine their Lee…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.