English
Related papers

Related papers: Canonical Decompositions of Affine Permutations, A…

200 papers

A decreasing Cartesian code is defined by evaluating a monomial set closed under divisibility on a Cartesian set. Some well-known examples are the Reed-Solomon, Reed-Muller, and (some) toric codes. The affine permutations consist of the…

Combinatorics · Mathematics 2024-05-15 Eduardo Camps-Moreno , Hiram H. López , Eliseo Sarmiento , Ivan Soprunov

We use k-Schur functions to get the minimal boundary of the k-bounded partition poset. This permits to describe the central random walks on affine Grassmannian elements of type A and yields a polynomial expression for their drift. We also…

Combinatorics · Mathematics 2020-01-29 Cédric Lecouvey , Pierre Tarrago

We give several explicit combinatorial formulas for the expansion of k-Schur functions indexed by maximal rectangles in terms of the standard basis of the affine nilCoxeter algebra. Using our result, we also show a commutation relation of…

Combinatorics · Mathematics 2016-11-08 Chris Berg , Nantel Bergeron , Hugh Thomas , Mike Zabrocki

We give a new description of the Pieri rule for k-Schur functions using the Bruhat order on the affine type-A Weyl group. In doing so, we prove a new combinatorial formula for representatives of the Schubert classes for the cohomology of…

Combinatorics · Mathematics 2016-05-19 Avinash J. Dalal , Jennifer Morse

The $k$-Young lattice $Y^k$ is a partial order on partitions with no part larger than $k$. This weak subposet of the Young lattice originated from the study of the $k$-Schur functions(atoms) $s_\lambda^{(k)}$, symmetric functions that form…

Combinatorics · Mathematics 2007-05-23 L. Lapointe , J. Morse

In this paper, we obtain affine analogues of Gindikin-Karpelevich formula and Casselman-Shalika formula as sums over Kashiwara-Lusztig's canonical bases. Suggested by these formulas, we define natural $q$-deformation of arithmetical…

Representation Theory · Mathematics 2012-03-26 Henry H. Kim , Kyu-Hwan Lee

In this paper, we establish a lemma in algebraic coding theory that frequently appears in the encoding and decoding of, e.g., Reed-Solomon codes, algebraic geometry codes, and affine variety codes. Our lemma corresponds to the…

Information Theory · Computer Science 2016-11-17 Hajime Matsui

Let $G$ be a simple algebraic group of type $A$ or $D$ defined over $\C$ and $T$ be a maximal torus of $G$. For a dominant coweight $\lambda$ of $G$, the $T$-fixed point subscheme $(\bar{Gr}_G^\lambda)^T$ of the Schubert variety…

Representation Theory · Mathematics 2008-11-20 Xinwen Zhu

We study combinatorial aspects of the Schubert calculus of the affine Grassmannian Gr associated with SL(n,C). Our main results are: 1) Pieri rules for the Schubert bases of H^*(Gr) and H_*(Gr), which expresses the product of a special…

Combinatorics · Mathematics 2008-11-23 Thomas Lam , Luc Lapointe , Jennifer Morse , Mark Shimozono

Higher-order Fourier analysis, developed over prime fields, has been recently used in different areas of computer science, including list decoding, algorithmic decomposition and testing. We extend the tools of higher-order Fourier analysis…

Data Structures and Algorithms · Computer Science 2015-05-05 Arnab Bhattacharyya , Abhishek Bhowmick

We give a simple characterization of the highest weight vertices in the crystal graph of the level l Fock spaces. This characterization is based on the notion of totally periodic symbols viewed as affine analogues of reverse lattice words…

Representation Theory · Mathematics 2012-02-14 Nicolas Jacon , Cédric Lecouvey

We study k-Schur functions characterized by k-tableaux, proving combinatorial properties such as a k-Pieri rule and a k-conjugation. This new approach relies on developing the theory of k-tableaux, and includes the introduction of a…

Combinatorics · Mathematics 2007-05-23 Luc Lapointe , Jennifer Morse

We apply down operators in the affine nilCoxeter algebra to yield explicit combinatorial expansions for certain families of non-commutative k-Schur functions. This yields a combinatorial interpretation for a new family of…

Combinatorics · Mathematics 2012-08-27 Chris Berg , Franco Saliola , Luis Serrano

In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of…

Information Theory · Computer Science 2023-02-13 José Joaquín Bernal , Juan Jacobo Simón

We use Nakajima's geometric approach to representations of quantum affine algebras and recent results on explicit descriptions of specific canonical basis elements, to derive closed positive formulas for certain decomposition numbers of…

Quantum Algebra · Mathematics 2026-05-22 Xin Fang , Deniz Kus , Markus Reineke

This is an expository introduction to fusion rules for affine Kac-Moody algebras, with major focus on the algorithmic aspects of their computation and the relationship with tensor product decompositions. Many explicit examples are included…

Quantum Algebra · Mathematics 2007-05-23 Alex J. Feingold

We survey the main results of approximation theory for adaptive piecewise polynomial functions. In such methods, the partition on which the piecewise polynomial approximation is defined is not fixed in advance, but adapted to the given…

Numerical Analysis · Mathematics 2015-03-17 Albert Cohen , Jean-Marie Mirebeau

Building on prior work, we analyze the decomposition of the restriction of an irreducible representation of SL_2(k), for k a p-adic field of odd residual characteristic, to a maximal compact subgroup K. The pattern of the decomposition…

Representation Theory · Mathematics 2012-06-05 Monica Nevins

The Demazure character formula is applied to the Verlinde formula for affine fusion rules. We follow Littelmann's derivation of a generalized Littlewood-Richardson rule from Demazure characters. A combinatorial rule for affine fusions does…

High Energy Physics - Theory · Physics 2009-10-30 M. A. Walton

Adaptive spectral (AS) decompositions associated with a piecewise constant function $u$ yield small subspaces where the characteristic functions comprising $u$ are well approximated. When combined with Newton-like optimization methods for…

Numerical Analysis · Mathematics 2022-07-05 Daniel H. Baffet , Yannik G. Gleichmann , Marcus J. Grote
‹ Prev 1 2 3 10 Next ›