相关论文: On the inverse Kostka matrix
We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We conjecture a combinatorial formula for the monomial expansion of the image of any Schur function under the Bergeron-Garsia nabla operator. The formula involves nested labeled Dyck paths weighted by area and a suitable "diagonal…
Indentation test is used with growing popularity for the characterization of various materials on different scales. Developed methods are combining the test with computer simulation and inverse analyses to assess material parameters…
A factorization of the inverse of a Hermetian positive definite matrix based on a diagonal by diagonal recurrence formulae permits the inversion of Block Toeplitz matrices, using only matrix-vector products, and with a complexity of…
We introduce a spin analogue of Kostka polynomials and show that these polynomials enjoy favorable properties parallel to the Kostka polynomials. Further connections of spin Kostka polynomials with representation theory are established.
We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…
An inverse scattering problem is formulated for reconstructing optical properties of biological tissues. A recursive linearization algorithm is used to solve the inverse scattering problem. We employed the idea of finite element boundary…
A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…
Using the expansion of the inverse of the Kostka matrix in terms of tabloids as presented by Egecioglu and Remmel, we show that the fusion coefficients can be expressed as an alternating sum over cylindric tableaux. Cylindric tableaux are…
We give an algorithm for computing matrix corepresentations for special linear and special unitary quantum groups using a combinatorial re-indexing of basis elements.
We consider the $n\times n$ Hankel matrix $H$ whose entries are defined by $H_{ij}=1/s_{i+j}$ where $s_k=(k-1)!$ and prove that $H$ is invertible for all $n\in\mathbb{N}$ by providing an explicit formula for its inverse matrix.
A class of bilinear permutation polynomials over a finite field of characteristic 2 was constructed in a recursive manner recently which involved some other constructions as special cases. We determine the compositional inverses of them…
In this article we obtain a general polynomial identity in $k$ variables, where $k\geq 2$ is an arbitrary positive integer. We use this identity to give a closed-form expression for the entries of the powers of a $k \times k$ matrix.…
We present further properties of a previously proposed recursive scheme for parameterisation of n-by-n unitary matrices. We show that the factors in the recursive formula may be introduced in any desired order. The method is used to study…
A simple recursive scheme for parameterisation of n-by-n unitary matrices is presented.
The combinatorial R matrices are obtained for a family {B_l} of crystals for U'_q(C^{(1)}_n) and U'_q(A^{(2)}_{2n-1}), where B_l is the crystal of the irreducible module corresponding to the one-row Young diagram of length l. The…
In a recent paper, an algorithm has been presented for determining implications between a particular kind of category theoretic property represented by matrices -- the so called `matrix properties'. In this paper we extend this algorithm to…
Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…
Here we propose a way to construct generalized Kostka polynomials. Namely, we construct an equivariant filtration on tensor products of irreducible representations. Further, we discuss properties of the filtration and the adjoint graded…