|
Browse All Reviews > Computing Methodologies (I) > Symbolic and Algebraic Manipulation (I.1) > Expressions And Their Representation (I.1.1) > Representations (General And Polynomial) (I.1.1...)
|
|
|
|
|
|
|
|
|
1-6 of 6
Reviews about "Representations (General And Polynomial) (I.1.1...)":
|
Date Reviewed |
|
Gröbner bases for complete uniform families Hegedűs G., Rónyai L. Journal of Algebraic Combinatorics: An International Journal 17(2): 171-180, 2003. Type: Article
In this paper, the authors present a completely explicit description of reduced Gröbner bases of the ideal of polynomials, which vanish on the set of characteristic vectors of the family of all d element sub...
|
May 5 2004 |
|
Multivariate polynomials, standard tableaux, and representations of symmetric groups Clausen M. (ed) Journal of Symbolic Computation 11(5-6): 483-522, 1991. Type: Article
The problem of finding appropriate bases for the free module of polynomials in countably many indeterminates with coefficients in a given commutative ring R (even when restricted to the special case of R being the ring of...
|
Dec 1 1993 |
|
An algorithm for the construction of matrix representations for finitely presented non-commutative algebras Labonté G. Journal of Symbolic Computation 9(1): 27-38, 1990. Type: Article
The algorithm described in this paper starts from a finite presentation of an associative algebra (that is, a finite set of generators and a finite set of equations which they satisfy) and constructs the regular representation and uses...
|
Oct 1 1990 |
|
Matrix Padé fractions and their computation Labahn G., Cabay S. SIAM Journal on Computing 18(4): 639-657, 1989. Type: Article
This paper introduces the new notion of a matrix Padé approximant of a formal matrix power series, which is a generalization of the scalar case. Padé approximants have several interesting applications, including numer...
|
Aug 1 1990 |
|
On the D-bases of polynomial ideals over principal ideal domains Pan L. Journal of Symbolic Computation 7(1): 55-69, 1989. Type: Article
This paper provides some technical results on the reduction of polynomials to canonical forms. The main new concept introduced is the D-base, which Pan claims is the first type of base that is defined by a reduction over an arbitrary p...
|
Jun 1 1990 |
|
Greatest common divisors of polynomials given by straight-line programs Kaltofen E. (ed) Journal of the ACM 35(1): 231-264, 1988. Type: Article
This research paper presents two principal results, both of which are algorithms for manipulating polynomials represented by straight-line programs. The first computes the greatest common divisor of a family of multivariate polynomials...
|
Apr 1 1989 |
|
|
|
|
|
|