相关论文: A straightening algorithm for row-convex tableaux

We generalize Fulton's determinantal construction of Schur modules to the skew setting, providing an explicit and functorial presentation using only elementary linear algebra and determinantal identities, in parallel with the partition…

There are several isomorphic constructions for the irreducible polynomial representations of the general linear group in characteristic zero. The two most well-known versions are called Schur modules and Weyl modules. Steven Sam used a Weyl…

The skew Schubert polynomials are those which are indexed by skew elements of the Weyl group, in the sense of arXiv:0812.0639. We obtain tableau formulas for the double versions of these polynomials in all four classical Lie types, where…

In bracket algebra, the calculation of invariant division and invariant Gr\"{o}bner basis proposed in \cite{li 2014} rely on straightening algorithm. Until now, there are at least three different types of straightening algorithms, among…

Stretching is a new sparse matrix method that makes matrices sparser by making them larger. Stretching has implications for computational complexity theory and applications in scientific and parallel computing. It changes matrix sparsity…

We present an effective algorithm for computing the standard cohomology spaces of finitely generated Lie (super) algebras over a commutative field K of characteristic zero. In order to reach explicit representatives of some generators of…

Building on the work [18], where some standard basis for the queer $q$-Schur superalgebra $\mathcal{Q}_q(n,r;R)$ is defined by a labelling set of matrices and their associated double coset representatives, we investigate the matrix…

We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…

A key problem in statistics and machine learning is the determination of network structure from data. We consider the case where the structure of the graph to be reconstructed is known to be scale-free. We show that in such cases it is…

We present an abstract framework for the axiomatic study of diagram algebras. Algebras that fit this framework possess analogues of both the Murphy and seminormal bases of the Hecke algebras of the symmetric groups. We show that the…

We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…

The present paper deals with the representation theory of the reflection equation algebra, connected with a Hecke type R-matrix. Up to some reasonable additional conditions the R-matrix is arbitrary (not necessary originated from quantum…

In this note, we formulate and prove branching rules of simple polynomial modules for the Lie superalgebra $\mathfrak{gl}(m|n)$. Our branching rules depend on the conjugacy class of the Borel subalgebra. A Gelfand-Tsetlin basis of a…

We provide an algorithmic framework for the computation of explicit representing matrices for all irreducible representations of a generalized symmetric group $\Grin_n$, i.e., a wreath product of cyclic group of order $r$ with the symmetric…

We introduce a new approach to spectral sparsification that approximates the quadratic form of the pseudoinverse of a graph Laplacian restricted to a subspace. We show that sparsifiers with a near-linear number of edges in the dimension of…

This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…

This paper is devoted to the question of constructing a higher order Faber spline basis for the sampling discretization of functions with higher regularity than Lipschitz. The basis constructed in this paper has similar properties as the…

We use twisted sheaves and their moduli spaces to study the Brauer group of a scheme. In particular, we (1) show how twisted methods can be efficiently used to re-prove the basic facts about the Brauer group and cohomological Brauer group…

The main objective of this paper is to give a rigorous treatment of Wigner's and Eisenbud's $R$-matrix method for scattering matrices of scattering systems consisting of two selfadjoint extensions of the same symmetric operator with finite…

We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…