Related papers: N-valid trees in wavelet theory on Vilenkin groups
For a labeled tree on the vertex set $\set{1,2,\ldots,n}$, the local direction of each edge $(i\,j)$ is from $i$ to $j$ if $i<j$. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges…
Let $w_{n,k,m}$ be the number of Dyck paths of semilength $n$ with $k$ occurrences of $UD$ and $m$ occurrences of $UUD$. We establish in two ways a new interpretation of the numbers $w_{n,k,m}$ in terms of plane trees and internal nodes.…
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 propose a simple method to construct integral periodic mask and corresponding scaling step functions that generate non-Haar orthogonal MRA on the local field $ F^{(s)}$ of positive characteristic $p$. To construct this mask we use two…
Let $E$ be a elementary abelian $p$-group of order $q=p^n$. Let $W$ be a faithful indecomposable representation of $E$ with dimension 2 over a field $k$ of characteristic $p$, and let $V= S^m(W)$ with $m<q$. We prove that the rings of…
This work addresses an enumeration problem on weighted bi-colored plane trees with prescribed vertex data, with all vertices labeled distinctly. We give a bijection proof of the enumeration formula originally due to Kochetkov, hence…
A proper vertex of a rooted tree with totally ordered vertices is a vertex that is less than all its proper descendants. We count several kinds of labeled rooted trees and forests by the number of proper vertices. Our results are all…
We present a general criterion under which the equality var(A Wr B) = var(A) var(B) holds for finite groups A and B. This continues our previous research on varieties, generated by wreath products of abelian groups, and generalizes some…
For an arbitrary matrix dilation, any integer n and any integer/semi-integer c, we describe all masks that are symmetric with respect to the point c and have sum rule of order n. For each such mask, we give explicit formulas for wavelet…
We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…
Herein we prove that if $M$ is a compact oriented Riemann surface of genus $g$, and $M^{[n]}$ is the classifying space of $n$ distinct, unordered points on $M$, then the kernel of the map $\pi_1(M^{[n]})\to H_1(M)$ is generated by…
In this paper we study the elementary theory of graph products of groups and show that under natural conditions on the vertex groups we can recover (the core of) the underlying graph and the associated vertex groups. More precisely, we…
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…
Let $0<k\in\mathbb{Z}$. A reinterpretation of the proof of existence of Hamilton cycles in the middle-levels graph $M_k$ induced by the vertices of the $(2k+1)$-cube representing the $k$- and $(k+1)$-subsets of $\{0,\ldots,2k\}$ is given…
We construct the first example of a finitely generated group which has Serre's property (FA) (i.e., whenever it acts on a simplicial tree it fixes a vertex), but admits a fixed point-free action on an $\mathbb{R}$-tree with finite arc…
We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…
Recent examples of periodic bifurcations in descendant trees of finite p-groups with p in {2,3} are used to show that the possible p-class tower groups G of certain multiquadratic fields K with p-class group of type (2,2,2), resp. (3,3),…
A wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We describe a pair of short exact sequences relating the sandpile group of a wired tree to the sandpile groups of its principal subtrees. In the case…
We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…
Let $p(x)$ be a polynomial like function of the form $p(x)=(x-r_{1})^{m_{1}}... (x-r_{N})^{m_{N}}$, where $m_{1},...,m_{N}$ are given positive real numbers and $r_{1}<r_{2}<... <r_{N}$. Let $\{x_{k}\} $ be the critical points of $p$ in…