相关论文: A straightening algorithm for row-convex tableaux
The Day Reflection Theorem gives conditions under which a reflective subcategory of a closed monoidal category can be equipped with a closed monoidal structure in such a way that the reflection adjunction becomes a monoidal adjunction. We…
We construct a quadratic basis of generators of matrix-extended $\mathcal{W}_{1+\infty}$ using a generalization of the Miura transformation. This makes it possible to conjecture a closed-form formula for the operator product expansions…
In this paper, we firstly extend a result of Bonin, Shapiro and Simion by giving the distribution of the major index over generalized Schr\"{o}der paths. Then by providing a bijection between generalized Schr\"{o}der paths and…
We consider global efficiency of algorithms for minimizing a sum of a convex function and a composition of a Lipschitz convex function with a smooth map. The basic algorithm we rely on is the prox-linear method, which in each iteration…
In this paper, we study Thrall's problem for the higher Lie modules $L_\lambda$. Our main result provides a tableau-theoretic description of the Schur expansion of the character of $L_\lambda$ when $\lambda$ has two rows, thereby solving…
For any given symmetrizable Cartan matrix $C$ with a symmetrizer $D$, Gei\ss~ et al. (2016) introduced a generalized preprojective algebra $\Pi(C, D)$. We study tilting modules and support $\tau$-tilting modules for the generalized…
Using the vertex operator representations for symplectic and orthogonal Schur functions, we define two families of symmetric functions and show thatthey are the skew symplectic and skew orthogonal Schur polynomials defined implicitly by…
We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it…
We develop a rewriting theory suitable for diagrammatic algebras and lay down the foundations of a systematic study of their higher structures. In this paper, we focus on the question of finding bases. As an application, we give the first…
Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…
We start with a small paradigm shift about group representations, namely the observation that restriction to a subgroup can be understood as an extension-of-scalars. We deduce that, given a group $G$, the derived and the stable categories…
We consider a new kind of straight and shifted plane partitions/Young tableaux --- ones whose diagrams are no longer of partition shape, but rather Young diagrams with boxes erased from their upper right ends. We find formulas for the…
In this paper, we let $\Hecke$ be the Hecke algebra associated with a finite Coxeter group $W$ and with one-parameter, over the ring of scalars $\Alg=\mathbb{Z}(q, q^{-1})$. With an elementary method, we introduce a cellular basis of…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
In many learning tasks, structural models usually lead to better interpretability and higher generalization performance. In recent years, however, the simple structural models such as lasso are frequently proved to be insufficient.…
We present the plactic algebra on an arbitrary alphabet set $A$ by row generators and column generators respectively. We give Gr\"{o}bner-Shirshov bases for such presentations. In the case of column generators, a finite Gr\"{o}bner-Shirshov…
In this paper, we consider a class of structured nonconvex nonsmooth optimization problems, in which the objective function is formed by the sum of a possibly nonsmooth nonconvex function and a differentiable function whose gradient is…
We state and prove a stratification result that allows us to classify the tensor ideal localizing subcategories for the stable module category $\text{Stab}(\mathcal{C}_{(\mathfrak{g}, \mathfrak{g}_{\bar 0})})$ of Lie superalgbera…
Schubert polynomials are a basis for the polynomial ring that represent Schubert classes for the flag manifold. In this paper, we introduce and develop several new combinatorial models for Schubert polynomials that relate them to other…
A new algorithm is presented for computing a direct solution to a system of consistent linear equations. It produces a minimum norm particular solution, a generalized inverse (of type {124}), and a null space projection operator. In…