Saved in:
Bibliographic Details
Main Authors: Mou, Chenqi, Shang, Weifeng
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2407.10927
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914871554080768
author Mou, Chenqi
Shang, Weifeng
author_facet Mou, Chenqi
Shang, Weifeng
contents Puzzles are a versatile combinatorial tool to interpret the Littlewood-Richardson coefficients for Grassmannians. In this paper, we propose the concept of puzzle ideals whose varieties one-one correspond to the tilings of puzzles and present an algebraic framework to construct the puzzle ideals which works with the Knutson-Tao-Woodward puzzle and its $T$-equivariant and $K$-theoretic variants for Grassmannians. For puzzles for which one side is free, we propose the side-free puzzle ideals whose varieties one-one correspond to the tilings of side-free puzzles, and the elimination ideals of the side-free puzzle ideals contain all the information of the structure constants for Grassmannians with respect to the free side. Besides the underlying algebraic importance of the introduction of these puzzle ideals is the computational feasibility to find all the tilings of the puzzles for Grassmannians by solving the defining polynomial systems, demonstrated with illustrative puzzles via computation of Gröbner bases.
format Preprint
id arxiv_https___arxiv_org_abs_2407_10927
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Puzzle Ideals for Grassmannians
Mou, Chenqi
Shang, Weifeng
Combinatorics
Symbolic Computation
Commutative Algebra
05E14 (Primary) 13F20, 14N15 (Secondary)
Puzzles are a versatile combinatorial tool to interpret the Littlewood-Richardson coefficients for Grassmannians. In this paper, we propose the concept of puzzle ideals whose varieties one-one correspond to the tilings of puzzles and present an algebraic framework to construct the puzzle ideals which works with the Knutson-Tao-Woodward puzzle and its $T$-equivariant and $K$-theoretic variants for Grassmannians. For puzzles for which one side is free, we propose the side-free puzzle ideals whose varieties one-one correspond to the tilings of side-free puzzles, and the elimination ideals of the side-free puzzle ideals contain all the information of the structure constants for Grassmannians with respect to the free side. Besides the underlying algebraic importance of the introduction of these puzzle ideals is the computational feasibility to find all the tilings of the puzzles for Grassmannians by solving the defining polynomial systems, demonstrated with illustrative puzzles via computation of Gröbner bases.
title Puzzle Ideals for Grassmannians
topic Combinatorics
Symbolic Computation
Commutative Algebra
05E14 (Primary) 13F20, 14N15 (Secondary)
url https://arxiv.org/abs/2407.10927