Logarithmic Tree Factorials

Abstract

To any rooted tree, we associate a sequence of numbers that we call the logarithmic factorials of the tree. This provides a generalization of Bhargava's factorials to a natural combinatorial setting suitable for studying questions around generalized factorials. We discuss several basic aspects of the framework in this paper. In particular, we relate the growth of the sequence of logarithmic factorials associated to a tree to the transience of the random walk and the existence of a harmonic measure on the tree, obtain an equidistribution theorem for factorial-determining-sequences of subsets of local fields, and provide a factorial-based characterization of the branching number of infinite trees. Our treatment is based on a local weighting process in the tree which gives an effective way of constructing the factorial sequence.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…