Enumeration and asymptotic formulas for rectangular partitions of the hypercube

From MaRDI portal
Publication:5212151

zbMATH Open1431.05004arXiv1903.00813MaRDI QIDQ5212151FDOQ5212151

Yu Hin Au, Murray R. Bremner, Fatemeh Bagherzadeh

Publication date: 27 January 2020

Abstract: We study a two-parameter generalization of the Catalan numbers: Cd,p(n) is the number of ways to subdivide the d-dimensional hypercube into n rectangular blocks using orthogonal partitions of fixed arity p. Bremner & Dotsenko introduced Cd,p(n) in their work on Boardman--Vogt tensor products of operads; they used homological algebra to prove a recursive formula and a functional equation. We express Cd,p(n) as simple finite sums, and determine their growth rate and asymptotic behaviour. We give an elementary proof of the functional equation, using a bijection between hypercube decompositions and a family of full p-ary trees. Our results generalize the well-known correspondence between Catalan numbers and full binary trees.


Full work available at URL: https://arxiv.org/abs/1903.00813

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (2)

Uses Software





This page was built for publication: Enumeration and asymptotic formulas for rectangular partitions of the hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212151)