Some new formulas for .
Almkvist, Gert, Krattenthaler, Christian, Petersson, Joakim (2003)
Experimental Mathematics
Similarity:
Displaying similar documents to “On the number of possible row and column sums of -matrices.”
Some new formulas for .
Differential resolvents of minimal order and weight.
Nahay, John Michael (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Powers of a matrix and combinatorial identities.
Mc Laughlin, J., Sury, B. (2005)
Integers
Similarity:
On stable polynomials
Miloslav Nekvinda (1989)
Aplikace matematiky
Similarity:
The article is a survey on problem of the theorem of Hurwitz. The starting point of explanations is Schur's decomposition theorem for polynomials. It is showed how to obtain the well-known criteria on the distribution of roots of polynomials. The theorem on uniqueness of constants in Schur's decomposition seems to be new.
Determinant identities and a generalization of the number of totally symmetric self-complementary plane partitions.
Krattenthaler, C. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Degrees of Polynomial Solutions of a Class of Riccati - tipe Differential Equations*.
Mira Bhargava (1964)
Collectanea Mathematica
Similarity:
A remark on the Chebotarev theorem about roots of unity.
Pakovich, F. (2007)
Integers
Similarity:
On a Theorem by Van Vleck Regarding Sturm Sequences
Akritas, Alkiviadis, Malaschonok, Gennadi, Vigklas, Panagiotis (2013)
Serdica Journal of Computing
Similarity:
In 1900 E. B. Van Vleck proposed a very efficient method to compute the Sturm sequence of a polynomial p (x) ∈ Z[x] by triangularizing one of Sylvester’s matrices of p (x) and its derivative p′(x). That method works fine only for the case of complete sequences provided no pivots take place. In 1917, A. J. Pell and R. L. Gordon pointed out this “weakness” in Van Vleck’s theorem, rectified it but did not extend his method, so that it also works in the cases of: (a) complete Sturm sequences...
On the -modules generated by partitions of a given shape.
Kane, Daniel, Sivek, Steven (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Discrete-time symmetric polynomial equations with complex coefficients
Didier Henrion, Jan Ježek, Michael Šebek (2002)
Kybernetika
Similarity:
Discrete-time symmetric polynomial equations with complex coefficients are studied in the scalar and matrix case. New theoretical results are derived and several algorithms are proposed and evaluated. Polynomial reduction algorithms are first described to study theoretical properties of the equations. Sylvester matrix algorithms are then developed to solve numerically the equations. The algorithms are implemented in the Polynomial Toolbox for Matlab.