Combinatorics and Number Theory of Counting Sequences

Combinatorics and Number Theory of Counting Sequences

Mezo, Istvan

Taylor & Francis Ltd

08/2019

498

Dura

Inglês

9781138564855

15 a 20 dias

544

Descrição não disponível.
I Counting sequences related to set partitions and permutations

Set partitions and permutation cycles.

Generating functions

The Bell polynomials

Unimodality, log concavity and log convexity

The Bernoulli and Cauchy numbers

Ordered partitions

Asymptotics and inequalities

II Generalizations of our counting sequences

Prohibiting elements from being together

Avoidance of big substructures

Prohibiting elements from being together

Avoidance of big substructures

Avoidance of small substructures

III Number theoretical properties

Congurences

Congruences vial finite field methods

Diophantic results

Appendix
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Bell Polynomials;Stirling Numbers;Negative Real Line;Exponential Generating Function;Meixner Polynomials;Universal Generating Functions;Bell Number;Minimal Polynomial;Log Concave Sequence;Hankel Transform;Eulerian Polynomial;Hankel Determinant;Pascal Triangle;Power Sum;Eulerian Numbers;Cauchy Number;Combinatorial Proof;Riemann Zeta Function;Binomial Coefficients;Bernoulli Polynomials;Young Tableau;Characteristic Polynomial;Bernoulli Numbers;Bessel Polynomials;Euler Gamma Function