Add to ORKGNew version of "A remark about factorizing GCD-type Hyperdeterminants". Title changed. Results, examples and remarks added.International audienceWe compute hyperdeterminants of hypermatrices whose indices belongs in a meet-semilattice and whose entries depend only of the greatest lower bound of the indices. One shows that an elementary expansion of such a polynomial allows to generalize a theorem of Lindström to higher-dimensional determinants. And we gave as an application generalizations of some results due to Lehmer, Li and Haukkanen
AbstractThis paper studies the computationally difficult problem of finding a largest j-dimensional ...
Motivated by the investigation of algebraic approaches to study identifiability and ambiguity in fac...
AbstractGeneralized geometric progression (GP) block matrices are introduced, and it is shown that s...
New version of "A remark about factorizing GCD-type Hyperdeterminants". Title changed. Results, exam...
AbstractWe evaluate the higher-dimensional determinants of the greatest-common-divisor matrix define...
AbstractWe consider meet matrices on meet-semilattices as an abstract generalization of greatest com...
AbstractThe hyperdeterminant of a polynomial (interpreted as a symmetric tensor) factors into severa...
International audienceWe investigate the link between rectangular Jack polynomials and Hankel hyperd...
We introduce an algebraic model based on the expansion of the determinant of two matrices to provide...
We give partial generalizations of the classical Descartes' rule of signs to multivariate polynomial...
We provide combinatorial interpretations for determinants which are Fibonacci numbers of several rec...
We give a new combinatorial explanation for well-known relations between determinants and traces of ...
Hypermatrices are defined. Elementary operations and properties are defined and discussed. A 4-ary M...
AbstractLet A, B be multi-dimensional matrices of boundary format ∏i=0p(ki+1), ∏j=0q(lj+1), respecti...
In this thesis we explore two different topics: the complexity of the theory of the hyperdegrees, an...
AbstractThis paper studies the computationally difficult problem of finding a largest j-dimensional ...
Motivated by the investigation of algebraic approaches to study identifiability and ambiguity in fac...
AbstractGeneralized geometric progression (GP) block matrices are introduced, and it is shown that s...
New version of "A remark about factorizing GCD-type Hyperdeterminants". Title changed. Results, exam...
AbstractWe evaluate the higher-dimensional determinants of the greatest-common-divisor matrix define...
AbstractWe consider meet matrices on meet-semilattices as an abstract generalization of greatest com...
AbstractThe hyperdeterminant of a polynomial (interpreted as a symmetric tensor) factors into severa...
International audienceWe investigate the link between rectangular Jack polynomials and Hankel hyperd...
We introduce an algebraic model based on the expansion of the determinant of two matrices to provide...
We give partial generalizations of the classical Descartes' rule of signs to multivariate polynomial...
We provide combinatorial interpretations for determinants which are Fibonacci numbers of several rec...
We give a new combinatorial explanation for well-known relations between determinants and traces of ...
Hypermatrices are defined. Elementary operations and properties are defined and discussed. A 4-ary M...
AbstractLet A, B be multi-dimensional matrices of boundary format ∏i=0p(ki+1), ∏j=0q(lj+1), respecti...
In this thesis we explore two different topics: the complexity of the theory of the hyperdegrees, an...
AbstractThis paper studies the computationally difficult problem of finding a largest j-dimensional ...
Motivated by the investigation of algebraic approaches to study identifiability and ambiguity in fac...
AbstractGeneralized geometric progression (GP) block matrices are introduced, and it is shown that s...