Related papers: Constructing maximal pipedreams of double Grothend…

Gabidulin codes, serving as the rank-metric counterpart of Reed-Solomon codes, constitute an important class of maximum rank distance (MRD) codes. However, unlike the fruitful positive results about the list decoding of Reed-Solomon codes,…

In this paper we introduce a new type of code, called projective nested cartesian code. It is obtained by the evaluation of homogeneous polynomials of a fixed degree on a certain subset of $\mathbb{P}^n(\mathbb{F}_q)$, and they may be seen…

We develop a family of new combinatorial models for key polynomials. It is similar to the hybrid pipe dream model for Schubert polynomials defined recently by Knutson and Udell.

The method of partial derivatives is one of the most successful lower bound methods for arithmetic circuits. It uses as a complexity measure the dimension of the span of the partial derivatives of a polynomial. In this paper, we consider…

We comprehensively study weighted projective Reed-Muller (WPRM) codes on weighted projective planes $\mathbb{P}(1,a,b)$. We provide the universal Gr\"obner basis for the vanishing ideal of the set $Y$ of $\mathbb{F}_q$--rational points of…

The classical modular polynomial for $j$-invariants describes the relation between two elliptic curves connected by isogenies. This polynomial has been applied to various algorithms in computational number theory, such as point counting on…

Compared with classical block codes, efficient list decoding of rank-metric codes seems more difficult. Although the list decodability of random rank-metric codes and limits to list decodability have been completely determined, little work…

We prove a formula for the degrees of Ikeda and Naruse's $P$-Grothendieck polynomials using combinatorics of shifted tableaux. We show this formula can be used in conjunction with results of Hamaker, Marberg, and Pawlowski to obtain an…

The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…

The fact that Schubert polynomials are the weighted counting functions for reduced RC-graphs, also known as reduced pipe dreams, was established using their generating functions inside an appropriate Demazure algebra. Here we investigate…

In this paper, we study weight representations over the Schr{\"o}dinger Lie algebra $\mathfrak{s}_n$ for any positive integer $n$. It turns out that the algebra $\mathfrak{s}_n$ can be realized by polynomial differential operators. Using…

For a prime $p$ and nonnegative integers $j$ and $n$ let $\vartheta_p(j,n)$ be the number of entries in the $n$-th row of Pascal's triangle that are exactly divisible by $p^j$. Moreover, for a finite sequence $w=(w_{r-1}\cdots w_0)\neq…

The lifted multicut problem is a combinatorial optimization problem whose feasible solutions relate one-to-one to the decompositions of a graph $G = (V, E)$. Given an augmentation $\widehat{G} = (V, E \cup F)$ of $G$ and given costs $c \in…

Let $D = d_1, d_2, \ldots, d_n$ and $F = f_1, f_2,\ldots, f_n$ be two sequences of positive integers. We consider the following decision problems: is there a $i)$ multigraph, $ii)$ loopless multigraph, $iii)$ simple graph, $iv)$ connected…

A systematic way of constructing Grassmannian codes endowed with the subspace distance as lifts of matrix codes over the prime field $GF(p)$ is introduced. The matrix codes are $GF(p)$-subspaces of the ring $M_2(GF(p))$ of $2 \times 2$…

A filtration of a representation whose successive quotients are isomorphic to Demazure modules is called an excellent filtration. In this paper we study graded multiplicities in excellent filtrations of fusion products for the current…

We prove that twisted versions of Schubert polynomials defined by $\widetilde{\mathfrak S}_{w_0} = x_1^{n-1}x_2^{n-2} \cdots x_{n-1}$ and $\widetilde{\mathfrak S}_{ws_i} = (s_i+\partial_i)\widetilde{\mathfrak S}_w$ are monomial positive and…

Let $\mathfrak g$ be a simple Lie algebra with Cartan subalgebra $\mathfrak h$ and Weyl group $W$. We build up a graded map $(\mathcal H\otimes \bigwedge\mathfrak h\otimes \mathfrak h)^W\to (\bigwedge \mathfrak g\otimes \mathfrak…

Analysis of the Berlekamp-Massey-Sakata algorithm for decoding one-point codes leads to two methods for improving code rate. One method, due to Feng and Rao, removes parity checks that may be recovered by their majority voting algorithm.…

The notion of derivatives for smooth representations of GL(n) in the p-adic case was defined by J. Bernstein and A. Zelevinsky. In the archimedean case, an analog of the highest derivative was defined for irreducible unitary representations…