Counting Arrangements of 1's and -1's

DOI10.1080/0025570X.1996.11996408zbMath0859.05007OpenAlexW15048363WikidataQ129994767 ScholiaQ129994767MaRDI QIDQ4886422

D. F. Bailey

Publication date: 1 September 1996

Published in: Mathematics Magazine (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0025570x.1996.11996408

zbMATH Keywords

arrangementsCatalan numberPascal triangletriangular arraynumber of sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10)

Related Items (14)

Combinatorial analogues of ad-nilpotent ideals for untwisted affine Lie algebras ⋮ The Catalan combinatorics of the hereditary artin algebras ⋮ Exact site-percolation probability on the square lattice ⋮ Hadamard multipliers on spaces of real analytic functions ⋮ Some new binomial sums related to the Catalan triangle ⋮ Vincular pattern avoidance on cyclic permutations ⋮ Effects of boundary conditions on irreversible dynamics ⋮ Starvation dynamics of a greedy forager ⋮ Orbiting triangle method for convex polygon triangulation ⋮ A note on the moments of the Kesten distribution ⋮ Unnamed Item ⋮ Identities from representation theory ⋮ Smart Contract Execution - the (+-)-Biased Ballot Problem. ⋮ CATALAN'S TRAPEZOIDS

This page was built for publication: Counting Arrangements of 1's and -1's