Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  generating function
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
A special relational structure, called genealogical tree, is introduced; its social interpretation and geometrical realizations are discussed. The numbers $C_{n,k}$ of all abstract genealogical trees with exactly n+1 nodes and k leaves is found by means of enumeration of code words. For each n, the $C_{n,k}$ form a partition of the n-th Catalan numer Cₙ, that means $C_{n,1}+C_{n,2}+ ...+C_{n,n} = Cₙ$.
2
Content available remote

Connections between Romanovski and other polynomials

88%
Open Mathematics
|
2007
|
tom 5
|
nr 3
581-595
EN
A connection between Romanovski polynomials and those polynomials that solve the one-dimensional Schrödinger equation with the trigonometric Rosen-Morse and hyperbolic Scarf potential is established. The map is constructed by reworking the Rodrigues formula in an elementary and natural way. The generating function is summed in closed form from which recursion relations and addition theorems follow. Relations to some classical polynomials are also given.
3
75%
EN
We have random number of independent diffusion processes with absorption on boundaries in some region at initial time t = 0. The initial numbers and positions of processes in region is defined by the Poisson random measure. It is required to estimate the number of the unabsorbed processes for the fixed time τ > 0. The Poisson random measure depends on τ and τ → ∞.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.