A Recurrence Formula for D Numbers D2n(2n−1)
we establish a recurrence formula for D numbers D2n(2n−1). A generating function for D numbers D2n(2n−1) is also presented.
Saved in:
| Main Author: | Guodong Liu |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2009-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2009/605313 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
All Graphs of Order n with Distinguishing Number n−1 or n − 2
by: Andi Pujo Rahadi, et al.
Published: (2025-05-01) -
4d N $$ \mathcal{N} $$ = 1 from 6d D-type N $$ \mathcal{N} $$ = (1, 0)
by: Jin Chen, et al.
Published: (2020-01-01) -
Les groupes binominaux de type N2’s N1, N1 of N2 et N2N1
by: Evelyne Chabert
Published: (2023-05-01) -
3D TFTs from 4d N $$ \mathcal{N} $$ = 2 BPS particles
by: Davide Gaiotto, et al.
Published: (2025-03-01) -
End of the world brane dynamics in holographic 4d N $$ \mathcal{N} $$ = 4 SU(N) with 3d N $$ \mathcal{N} $$ = 2 boundary conditions
by: Jesús Huertas, et al.
Published: (2025-01-01)