Article
Licensed
Unlicensed
Requires Authentication
Plane sections of the generalised Pascal pyramid and their interpretations
-
O. V. Kuzmin
Published/Copyright:
October 18, 2010
Abstract
We consider sums of elements of plane sections of the generalised Pascal pyramide. We evaluate the sums and find recurrence relations which these sums obey, and then suggest enumerative interpretations of the combinatorial objects under investigation.
Received: 2010-03-02
Published Online: 2010-10-18
Published in Print: 2010-October
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Calculation of limit probabilities of the distribution of permanent of a random matrix over the field GF(p)
- On the number of coincidences of two homogeneous random walks with positive increments
- Plane sections of the generalised Pascal pyramid and their interpretations
- On proper colourings of hypergraphs using prescribed colours
- On large distances between neighbouring zeros of the Riemann zeta-function
- On some algebraic and combinatorial properties of correlation-immune Boolean functions
- Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements
- A complete solution of the minimisation problem for a set of binary two-tape automata
Articles in the same Issue
- Calculation of limit probabilities of the distribution of permanent of a random matrix over the field GF(p)
- On the number of coincidences of two homogeneous random walks with positive increments
- Plane sections of the generalised Pascal pyramid and their interpretations
- On proper colourings of hypergraphs using prescribed colours
- On large distances between neighbouring zeros of the Riemann zeta-function
- On some algebraic and combinatorial properties of correlation-immune Boolean functions
- Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements
- A complete solution of the minimisation problem for a set of binary two-tape automata
