top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Algorithmic combinatorics : enumerative combinatorics, special functions and computer algebra : in honour of Peter Paule on his 60th birthday / / Veronika Pillwein, Carsten Schneider, editors
Algorithmic combinatorics : enumerative combinatorics, special functions and computer algebra : in honour of Peter Paule on his 60th birthday / / Veronika Pillwein, Carsten Schneider, editors
Edizione [1st ed. 2020.]
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2020]
Descrizione fisica 1 online resource (XVII, 410 p. 55 illus., 19 illus. in color.)
Disciplina 511.6
Collana Texts and monographs in symbolic computation
Soggetto topico Combinatorial analysis
ISBN 3-030-44559-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto When the search for solutions can be terminated -- Euler’s partition theorem and refinement without appeal to infinit -- Sequences in partitions, double q-series and the Mock Theta Function -- Refine q-trinomial coecients and two infinit hierarchies of q-series identities -- Large scale analytic calculations in quantum field theories -- An eigenvalue problem for the associated Askey–Wilson polynomials -- Context-free grammars and stable multivariate polynomials over Stirling permutations -- An interesting class of Hankel determinants -- A sequence of polynomials generated by a Kapteyn series of the second kind -- Comparative analysis of random generators.-Difference equation theory meets mathematical finance -- Evaluations as L-subsets -- Exact lower bounds for monochromatic Schur triples and generalizations -- Evaluation of binomial double sums involving absolute values -- On two subclasses of Motzkin paths and their relation to ternary trees -- A theorem to reduce certain modular form relations modulo primes -- Trying to solve a linear system for strict partitions in ‘closed form’ -- Untying the Gordian Knot via experimental mathematics.
Record Nr. UNINA-9910427683703321
Cham, Switzerland : , : Springer, , [2020]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic combinatorics : enumerative combinatorics, special functions and computer algebra : in honour of Peter Paule on his 60th birthday / / Veronika Pillwein, Carsten Schneider, editors
Algorithmic combinatorics : enumerative combinatorics, special functions and computer algebra : in honour of Peter Paule on his 60th birthday / / Veronika Pillwein, Carsten Schneider, editors
Edizione [1st ed. 2020.]
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2020]
Descrizione fisica 1 online resource (XVII, 410 p. 55 illus., 19 illus. in color.)
Disciplina 511.6
Collana Texts and monographs in symbolic computation
Soggetto topico Combinatorial analysis
ISBN 3-030-44559-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto When the search for solutions can be terminated -- Euler’s partition theorem and refinement without appeal to infinit -- Sequences in partitions, double q-series and the Mock Theta Function -- Refine q-trinomial coecients and two infinit hierarchies of q-series identities -- Large scale analytic calculations in quantum field theories -- An eigenvalue problem for the associated Askey–Wilson polynomials -- Context-free grammars and stable multivariate polynomials over Stirling permutations -- An interesting class of Hankel determinants -- A sequence of polynomials generated by a Kapteyn series of the second kind -- Comparative analysis of random generators.-Difference equation theory meets mathematical finance -- Evaluations as L-subsets -- Exact lower bounds for monochromatic Schur triples and generalizations -- Evaluation of binomial double sums involving absolute values -- On two subclasses of Motzkin paths and their relation to ternary trees -- A theorem to reduce certain modular form relations modulo primes -- Trying to solve a linear system for strict partitions in ‘closed form’ -- Untying the Gordian Knot via experimental mathematics.
Record Nr. UNISA-996465361903316
Cham, Switzerland : , : Springer, , [2020]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui