On the Algebraic Combinatorics of Injections and its Applications to Injection Codes
Peter J. Dukes, Ferdinand Ihringer, Nathan Lindzey

TL;DR
This paper explores the algebraic combinatorics of injections between finite sets, providing new formulas for spherical functions and applying these to improve bounds on injection codes.
Contribution
It introduces a novel combinatorial formula for spherical functions of a specific Gelfand pair and applies it to enhance linear programming bounds for injection codes.
Findings
New combinatorial formula for spherical functions
Improved Delsarte bounds on injection code sizes
Enhanced understanding of algebraic structures in combinatorics
Abstract
We consider the algebraic combinatorics of the set of injections from a -element set to an -element set. In particular, we give a new combinatorial formula for the spherical functions of the Gelfand pair . We use this combinatorial formula to give new Delsarte linear programming bounds on the size of codes over injections.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
