Related papers: A straightening algorithm for row-convex tableaux
We introduce loop spaces (in the sense of derived algebraic geometry) into the representation theory of reductive groups. In particular, we apply the theory developed in our previous paper arXiv:1002.3636 to flag varieties, and obtain new…
This paper introduces a structured decoding framework for the Voynich Manuscript, based on mathematical rhythm, symbolic transformation, and glyph-level recursion. Rather than interpret symbols phonetically, this method decodes them by…
A wide class of skew derivations on degree-one generalized Weyl algebras $R(a,\varphi)$ over a ring $R$ is constructed. All these derivations are twisted by a degree-counting extensions of automorphisms of $R$. It is determined which of the…
We give a systematic development of the application of matrix norms to rapid mixing in spin systems. We show that rapid mixing of both random update Glauber dynamics and systematic scan Glauber dynamics occurs if any matrix norm of the…
Suppose $\mu$ is a partition of $n$ and $\lambda$ a composition of $n$, and let $S^\mu$, $M^\lambda$ denote the Specht module and permutation module defined by Dipper and James for the Iwahori--Hecke algebra $\mathscr{H}_n$ of the symmetric…
We introduce a new row insertion algorithm on decreasing tableaux and increasing tableaux, generalizing Edelman-Greene (EG) row insertion. Our row insertion algorithm is a nontrivial variation of Hecke column insertion which generalizes EG…
We introduce a generalization of degenerate affine Hecke algebra, called wreath Hecke algebra, associated to an arbitrary finite group G. The simple modules of the wreath Hecke algebra and of its associated cyclotomic algebras are…
We present a new algorithm for computing a truncated Markov basis of a lattice. In general, this new algorithm is faster than existing methods. We then extend this new algorithm so that it solves the linear integer feasibility problem with…
We introduce a new basis for the polynomial ring which lifts the complete homogeneous symmetric polynomials while retaining representation theoretic significance. Using a specialized RSK algorithm we give an explicit nonnegative expansion…
This is a companion article to my papers on Kazhdan-Lusztig polynomials and character formulae for the Lie superalgebras gl(m|n) (much revised!) and q(n). The goal is to develop the general theory of tilting modules for Lie superalgebras,…
This work aims at the precise and efficient computation of the x-ray projection of an image represented by a linear combination of general shifted basis functions that typically overlap. We achieve this with a suitable adaptation of ray…
In this paper, we propose a successive pseudo-convex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems. The stationary points are obtained by solving a sequence of…
Lie algebra expansion is a technique to generate new Lie algebras from a given one. In this paper, we apply the method of Lie algebra expansion to superstring $\sigma$-models with a $\mathbb{Z}_4$ coset target space. By applying the Lie…
Splint of root system for simple Lie algebra appears naturally in studies of (regular) embeddings of reductive subalgebras. Splint can be used to construct branching rules. We demonstrate that splint properties implementation drastically…
Recurrent relations for branching coefficients in affine Lie algebras integrable highest weight modules are studied. The decomposition algorithm based on the injection fan technique is developed for the case of an arbitrary reductive…
This paper proposes and develops a new Newton-type algorithm to solve subdifferential inclusions defined by subgradients of extended-real-valued prox-regular functions. The proposed algorithm is formulated in terms of the second-order…
Work of Gaetz, Pechenik, Pfannerer, Striker, and Swanson (2024) introduced promotion permutations for a rectangular standard Young tableau $T$. These promotion permutations encode important features of $T$ and its orbit under…
We study support $\tau$-tilting modules over preprojective algebras of Dynkin type. We classify basic support $\tau$-tilting modules by giving a bijection with elements in the corresponding Weyl groups. Moreover we show that they are in…
If one attaches shifted copies of a skew tableau to the right of itself and rectifies, at a certain point the copies no longer experience vertical slides, a phenomenon called tableau stabilization. While tableau stabilization was originally…
We focus on \emph{row sampling} based approximations for matrix algorithms, in particular matrix multipication, sparse matrix reconstruction, and \math{\ell_2} regression. For \math{\matA\in\R^{m\times d}} (\math{m} points in \math{d\ll m}…