AbstractAs a culmination of the efforts of the invariant theorists from Clebsch, Gordan, Young, to Rota, in 1972 Doublet-Rota-Stein proved the Straightening Law which says that the standard monomials in the minors of a matrix X, which correspond to standard bitableaux, form a vector space basis of the polynomials ring K[X] in the indeterminate entries X over the coefficient field K. Now we may ask what happens to this when we consider ‘higher dimensional’ matrices by using cubical, 4-way,…,q-way determinants which were already introduced by Cayley in 1843. In the present paper we show that, for every q>2, the standard monomials in the multiminors of the multimatrix X are linearly independent over K. In a forthcoming paper it will be shown t...
In this paper, we are interested in monomial codes with associated vector $a=(a_0, a_1,\ldots, a_{n-...
AbstractColumns of a matrix A in the minimax algebra are called strongly linearly independent if for...
AbstractA decomposition theorem is established for square matrices A(s) defined over R[s], the ring ...
As a culmination of the efforts of the invariant theorists from Clebsch, Gordan, Young, to Rota, in ...
AbstractBy generalizing the Robinson-Schensted-Knuth insertion procedure, we establish a bijective c...
By generalizing the Robinson-Schensted-Knuth insertion procedure, we establish a bijective correspon...
AbstractIn the third volume of his book on the art of computer programming, Knuth has refined a sort...
In the third volume of his book on the art of computer programming, Knuth has refined a sorting proc...
Abstract The main results of this paper are accessible with only basic linear algebra. Given an incr...
The book is a reproduction of a course of lectures delivered by the author in 1983-84 which appeared...
The study of the action of Capelli operators on bideterminants leads to a necessary condition—formul...
Motivated by the investigation of algebraic approaches to study identifiability and ambiguity in fac...
Motivated by the investigation of algebraic approaches to study identifiability and ambiguity in fac...
AbstractWe give an elementary proof of the following known fact: any multihomogenous component in th...
AbstractThe second author has introduced non-crossing tableaux, objects whose non-nesting analogues ...
In this paper, we are interested in monomial codes with associated vector $a=(a_0, a_1,\ldots, a_{n-...
AbstractColumns of a matrix A in the minimax algebra are called strongly linearly independent if for...
AbstractA decomposition theorem is established for square matrices A(s) defined over R[s], the ring ...
As a culmination of the efforts of the invariant theorists from Clebsch, Gordan, Young, to Rota, in ...
AbstractBy generalizing the Robinson-Schensted-Knuth insertion procedure, we establish a bijective c...
By generalizing the Robinson-Schensted-Knuth insertion procedure, we establish a bijective correspon...
AbstractIn the third volume of his book on the art of computer programming, Knuth has refined a sort...
In the third volume of his book on the art of computer programming, Knuth has refined a sorting proc...
Abstract The main results of this paper are accessible with only basic linear algebra. Given an incr...
The book is a reproduction of a course of lectures delivered by the author in 1983-84 which appeared...
The study of the action of Capelli operators on bideterminants leads to a necessary condition—formul...
Motivated by the investigation of algebraic approaches to study identifiability and ambiguity in fac...
Motivated by the investigation of algebraic approaches to study identifiability and ambiguity in fac...
AbstractWe give an elementary proof of the following known fact: any multihomogenous component in th...
AbstractThe second author has introduced non-crossing tableaux, objects whose non-nesting analogues ...
In this paper, we are interested in monomial codes with associated vector $a=(a_0, a_1,\ldots, a_{n-...
AbstractColumns of a matrix A in the minimax algebra are called strongly linearly independent if for...
AbstractA decomposition theorem is established for square matrices A(s) defined over R[s], the ring ...