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

We derive a rigorous, quantum mechanical map of fermionic creation and annihilation operators to continuous Cartesian variables that exactly reproduces the matrix structure of the many-fermion problem. We show how our scheme can be used to…

Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…

We characterize the $k$-Schur functions as the graded characters of simple objects in an additive module category. This confirms a set of conjectures formulated in the Ph.D. thesis of Chen, written under the direction of Mark Haiman, and…

The aim of this paper is to establish a canonical decomposition of operator-valued strong $L^2$-functions by the aid of the Beurling-Lax-Halmos Theorem which characterizes the shift-invariant subspaces of vector-valued Hardy space. This…

We determine the graded decompositions of fusion products of finite-dimensional irreducible representations for simple Lie algebras of rank two. Moreover, we give generators and relations for these representations and obtain as a…

We prove that a $k$-regulous function defined on a two-dimensional non-singular affine variety can be extended to an ambient variety. Additionally we derive some results concerning sums of squares of $k$-regulous functions; in particular we…

Cylindric skew Schur functions, a generalization of skew Schur functions, are closely related to the famous problem finding a combinatorial formula for the 3-point Gromov-Witten invariants of Grassmannian. In this paper, we prove cylindric…

We discuss a decomposition formula of simple products of fermion correlation functions with cyclic constrains and its applications to spin sums of super string amplitudes. Based on some facts which are noted or derived in this paper, we…

We show that the principal types of the closed terms of the affine fragment of $\lambda$-calculus, with respect to a simple type discipline, are structurally isomorphic to their interpretations, as partial involutions, in a natural Geometry…

Finitely generated Z-modules have canonical decompositions. When such modules are given in a finitely presented form there is a classical algorithm for computing a canonical decomposition. This is the algorithm for computing the Smith…

We develop an invariant deformation theory, in a form accessible to practice, for affine schemes $W$ equipped with an action of a reductive algebraic group $G$. Given the defining equations of a $G$-invariant subscheme $X \subset W$, we…

A general formula for the canonical partition function for a system obeying any statistics based on the permutation group is derived. The formula expresses the canonical partition function in terms of sums of Schur functions. The only…

We construct $p$-adic $L$-functions associated with $p$-refined cohomological cuspidal Hilbert modular forms over any totally real field under a mild hypothesis. Our construction is canonical, varies naturally in $p$-adic families, and does…

q-Deformed harmonic oscillator algebra for real and root of unity values of the deformation parameter is discussed by using an extension of the number concept proposed by Gauss, namely the Q-numbers. A study of the reducibility of the Fock…

We introduce affine Stanley symmetric functions for the special orthogonal groups, a class of symmetric functions that model the cohomology of the affine Grassmannian, continuing the work of Lam and Lam, Schilling, and Shimozono on the…

We construct the Schubert basis of the torus-equivariant K-homology of the affine Grassmannian of a simple algebraic group G, using the K-theoretic NilHecke ring of Kostant and Kumar. This is the K-theoretic analogue of a construction of…

We introduce a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We study pattern avoidance in bounded affine permutations. In particular, we show…

A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…

We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…

We present a construction of subspace codes along with an efficient algorithm for list decoding from both insertions and deletions, handling an information-theoretically maximum fraction of these with polynomially small rate. Our…