相关论文: Canonical Decompositions of Affine Permutations, A…

We develop a new method for obtaining branching rules for affine Kac-Moody Lie algebras at negative integer levels. This method uses fusion rules for vertex operator algebras of affine type. We prove that an infinite family of ordinary…

Given a finite set $W$ in $\bar{k}^n$ where $\bar{k}$ is the algebraic closure of a field $k$ one would like to determine if $W$ can be decomposed as $\prod_{i=1}^n V_i$ where $V_i \subset \bar{k}$ under a linear transformation, that is,…

We obtain some simple relations between decomposition numbers of quantized Schur algebras at an n-th root of unity (over a field of characteristic 0). These relations imply that every decomposition number for such an algebra occurs as a…

In this paper we study sums of powers of affine functions in (mostly) one variable. Although quite simple, this model is a generalization of two well-studied models: Waring decomposition and sparsest shift. For these three models there are…

In [4] we describe a variation of the classical permutation decoding algorithm that can be applied to any binary affine-invariant code; in particular, it can be applied to first-order Reed-Muller codes successfully. In this paper we study…

We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…

The restriction of a supercuspidal representation of SL_2(k), for k a local nonarchimedean field, to a maximal compact subgroup decomposes as a multiplicity-free direct sum of irreducible representations. We explicitly describe this…

We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $\alpha$-admissible unit…

A permutation code is a nonlinear code whose codewords are permutation of a set of symbols. We consider the use of permutation code in the deletion channel, and consider the symbol-invariant error model, meaning that the values of the…

Let $G$ denote the unramified quasi-split unitary group $\mathbb{U}(1,1)(F)$ over a $p$-adic field $F$ with residual characteristic $p \neq 2$. In this paper, we first construct a large family of irreducible representations of the maximal…

We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum…

We introduce an algebraic model, based on the determinantal expansion of the product of two matrices, to test combinatorial reductions of set functions. Each term of the determinantal expansion is deformed through a monomial factor in d…

Confirming a conjecture of Mark Shimozono, we identify polynomial representatives for the Schubert classes of the affine Grassmannian as the k-Schur functions in homology and affine Schur functions in cohomology. Our results rely on Kostant…

We give a new interpretation of the shifted Littlewood-Richardson coefficients $f_{\lambda\mu}^\nu$ ($\lambda,\mu,\nu$ are strict partitions). The coefficients $g_{\lambda\mu}$ which appear in the decomposition of Schur $Q$-function…

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

The shifted fractional trapezoidal rule (SFTR) with a special shift is adopted to construct a finite difference scheme for the time-fractional Allen-Cahn (tFAC) equation. Some essential key properties of the weights of SFTR are explored for…

In this paper, a lemma in algebraic coding theory is established, which is frequently appeared in the encoding and decoding for algebraic codes such as Reed-Solomon codes and algebraic geometry codes. This lemma states that two vector…

Littlewood-Richardson rule gives the decomposition formula for the multiplication of two Schur functions, while the decomposition formula for the multiplication of two Hall-Littlewood functions or two universal characters is also given by…

Invariance with respect to linear or affine transformations of the domain is arguably the most common symmetry exhibited by natural algebraic properties. In this work, we show that any low complexity affine-invariant property of…

We prove a combinatorial rule for a complete decomposition, in terms of Langlands parameters, for representations of p-adic $GL_n$ that appear as parabolic induction from a large family (ladder representations). Our rule obviates the need…