Solution of a question (4392).
note of Caleynumber of termsproofs for a theoremrecursion formulaerowsSolutionsymmetrical determinant
Recursive functions and relations, subrecursive hierarchies (03D20) Proof theory in general (including proof-theoretic semantics) (03F03) Recurrences (11B37) Matrices, determinants in number theory (11C20) Syzygies, resolutions, complexes and commutative rings (13D02) Determinants, permanents, traces, other special matrix functions (15A15) Hermitian, skew-Hermitian, and related matrices (15B57)
Beweise für den Satz: Ist \(N_p\) die Anzahl der Glieder in einer symmetrischen Determinante mit \(p\) Horizontal- und Verticalreihen, so genügt dieses \(N\) der Recursionsformel \[ N_{k}-N_{k-1}-(k-1)^2N_{k-2}+\frac{1}{2}(k-1)(k-2) \{N_{k-3}+(k-3)N_{k-4}\}=0 \] wo \(k\) positiv und \(N_0=1\). Vergl. die obige Notiz von Cayley in den Monthl Not. of the R. Astr. S. April 1874 (JFM 06.0084.02), und die obige Arbeit (JFM 06.0084.01).
This page was built for publication: Solution of a question (4392).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1558580)
