Related papers: Trees in Wavelet analysis on Vilenkin groups

We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…

The extended affine Weyl group of a root system is the semidirect product of the corresponding Weyl group by its coweight lattice. The stabilizer subgroup of the extended affine Weyl group with respect to the corresponding fundamental…

We study a new class of polyominoes, called $p$-Fibonacci polyominoes, defined using $p$-Fibonacci words. We enumerate these polyominoes by applying generating functions to capture geometric parameters such as area, semi-perimeter, and the…

We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…

We consider Hilbert series associated to modules over various categories of trees. Using the technology of Sam and Snowden, we show that these Hilbert series must be algebraic. We then apply these technical theorems to prove facts about…

A theory of higher rank multiresolution analysis is given in the setting of abelian multiscalings. This theory enables the construction, from a higher rank MRA, of finite wavelet sets whose multidilations have translates forming an…

This is the first paper in a series of three where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Our main goal is to show that group actions on Z^n-trees give one a powerful tool to…

We introduce block Markov chains (BMCs) indexed by an infinite rooted tree. It turns out that BMCs define a new class of tree-indexed Markovian processes. We clarify the structure of BMCs in connection with Markov chains (MCs) and Markov…

We develop a notion of groups that act acylindrically and non-elementarily on simplicial trees, which we call acylindrically arboreal groups. We then prove a complete classification of when graph products of groups and the fundamental…

We study a concrete family of symmetric integral $Z$-matrices attached to weighted star trees. The arms are ordinary type-$A$ chains and the central diagonal entry is an arbitrary positive integer $k$ rather than being fixed to the Cartan…

In this paper, the notion of {\em $p$-adic multiresolution analysis (MRA)} is introduced. We use a ``natural'' refinement equation whose solution (a refinable function) is the characteristic function of the unit disc. This equation reflects…

We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…

A caterpillar tree is a connected, acyclic, graph in which all vertices are either a member of a central path, or joined to that central path by a single edge. In other words, caterpillar trees are the class of trees which become path…

Let $W_{k,n}^{i}(m)$ denote a matrix with rows and columns indexed by the $k$-subsets and $n$-subsets, respectively, of an $m$-element set. The row $S$, column $T$ entry of $W_{k,n}^{i}(m)$ is $1$ if $|S \cap T| = i$, and is $0$ otherwise.…

We consider the lower-triangular matrix of generating polynomials that enumerate $k$-component forests of rooted trees on the vertex set $[n]$ according to the number of improper edges (generalizations of the Ramanujan polynomials). We show…

We construct a new bijection between the set of $n\times k$ $0$-$1$ matrices with no three $1$'s forming a $\Gamma$ configuration and the set of $(n,k)$-Callan sequences, a simple structure counted by poly-Bernoulli numbers. We give two…

This elementary note proposes candidates for interesting continuous piecewise-smooth `Riemannian' metrics on the moduli spaces of rooted geodesic trees embedded in the Poincar\'e disk. A related digression observes the existence of an…

We study the portraits of isometries of rooted trees - the labelling of the tree, at each vertex, by the permutation of its descendants - in terms of languages. We characterize regularly branched self-similar groups in terms of…

A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…

For the solutions $\Phi(z)$ of functional equations $\Phi(z)=P(z)+\Phi(Q(z))$, we derive a complete asymptotic of power series coefficients. As an application, we improve significantly an asymptotic of the number of $2,3$-trees with $n$…