Related papers: Constructing maximal pipedreams of double Grothend…
Coverings of the Riemann sphere by itself, ramified over two points, are given by so-called Shabat polynomials. The correspondence between Grothendieck's dessins d'enfants and Belyi maps then implies a bijection between Shabat polynomials…
The interpolation step of Guruswami and Sudan's list decoding of Reed-Solomon codes poses the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is…
We study the Grothendieck group of the variety $X_{n,k}$ of spanning line configurations introduced by Pawlowski--Rhoades [arXiv:1711.08301] as a geometric model for the generalized coinvariant algebra $R_{n,k}$. Our first result is a…
We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…
In [KU23] were introduced hybrid pipe dreams interpolating between classic and bumpless pipe dreams, each hybridization giving a different formula for double Schubert polynomials. A bijective proof was given (following [GH23]) of the…
Motivated by polymer-based data-storage platforms that use chains of binary synthetic polymers as the recording media and read the content via tandem mass spectrometers, we propose a new family of codes that allows for both unique string…
Schubert polynomials $\mathfrak{S}_w$ are polynomial representatives for cohomology classes of Schubert varieties in a complete flag variety, while Grothendieck polynomials $\mathfrak{G}_w$ are analogous representatives for the $K$-theory…
A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…
Skew polynomial rings provide a fundamental example of noncommutative principal ideal domains. Special quotients of these rings yield matrix algebras that play a central role in the theory of rank-metric codes. Recent breakthroughs have…
Weighted enumeration of reduced pipe dreams (or rc-graphs) results in a combinatorial expression for Schubert polynomials. The duality between the set of reduced pipe dreams and certain antidiagonals has important geometric implications [A.…
We give an algebra-combinatorial constructions of (noncommutative) generating functions of double Schubert and double $\beta$-Grothendieck polynomials corresponding to the full flag varieties associated to the Lie groups of classical types…
In their study of infinite flag varieties, Lam, Lee, and Shimozono (2021) introduced bumpless pipe dreams in a new combinatorial formula for double Schubert polynomials. These polynomials are the TxT-equivariant cohomology classes of matrix…
We study the row-space partition and the pivot partition on the matrix space $\mathbb{F}_q^{n \times m}$. We show that both these partitions are reflexive and that the row-space partition is self-dual. Moreover, using various combinatorial…
We recall the lower-upper varieties from [Knutson '05] and give a formula for their equivariant cohomology classes, as a sum over generic pipe dreams. We recover as limits the classic and bumpless pipe dream formulae for double Schubert…
We give bijective proofs of Monk's rule for Schubert and double Schubert polynomials computed with bumpless pipe dreams. In particular, they specialize to bijective proofs of transition and cotransition formulas of Schubert and double…
Lam, Lee and Shimozono introduced the structure of bumpless pipedreams in their study of back stable Schubert calculus. They found that a specific family of bumpless pipedreams, called EG-pipedreams, can be used to interpret the…
Fix a probability $p\in(0,1)$. Let $s_i$ denote the transposition in the symmetric group $\mathfrak{S}_n$ that swaps $i$ and $i+1$. Given a word $\mathsf{w}$ over the alphabet $\{s_1,\ldots,s_{n-1}\}$, we can generate a random subword by…
Postnikov gave a parametrization for the totally non-negative Grassmannian using the matroid decomposition and associating a network with \reflectbox{L}-diagrams. Talaska and Williams extend this result to the entire Grassmannian by using…
We speed up existing decoding algorithms for three code classes in different metrics: interleaved Gabidulin codes in the rank metric, lifted interleaved Gabidulin codes in the subspace metric, and linearized Reed-Solomon codes in the…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…