Related papers: Trees in Wavelet analysis on Vilenkin groups

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

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…

A locking-free rectangular Mindlin plate element with a new multi-resolution analysis (MRA) is proposed and a new finite element method is hence presented. The MRA framework is formulated out of a mutually nesting displacement subspace…

Let $\Gamma\subset\mathbb{Q}^*$ be a finitely generated subgroup and let $p$ be a prime such that the reduction group $\Gamma_p$ is a well defined subgroup of the multiplicative group $\mathbb{F}_p^*$. We prove an asymptotic formula for the…

A zero-one sequence describes a path through a rooted directed binary tree $T$; it also encodes a real number in $[0,1]$. We regard the level of the external node of $T$ along the path as a function on the unit interval, the silhouette of…

We develop the theory of Weyl group multiple Dirichlet series for root systems of type C. For an arbitrary root system of rank r and a positive integer n, these are Dirichlet series in r complex variables with analytic continuation and…

We study three combinatorial models for the lower-triangular matrix with entries $t_{n,k} = \binom{n}{k} n^{n-k}$: two involving rooted trees on the vertex set $[n+1]$, and one involving partial functional digraphs on the vertex set $[n]$.…

In this paper we study the description of the functional graphs associated with the power maps over finite groups. We present a structural result which describes the isomorphism class of these graphs for abelian groups and also for flower…

We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and…

In this work we define some map-germs, called elementary joins, for the purpose of producing new ${\mathcal A}$-finite map-germs from them. In particular, we describe a general form of an ${\mathcal A}$-finite monomial map from…

We examine a discrete random recursive tree growth process that, at each time step, either adds or deletes a node from the tree with probability $p$ and $1-p$, respectively. Node addition follows the usual uniform attachment model. For node…

We explore a generating function trick which allows us to keep track of infinitely many statistics using finitely many variables, by recording their individual distributions rather than their joint distributions. Building on previous work…

We extend the scope of analytic combinatorics to classes containing objects that have irrational sizes. The generating function for such a class is a power series that admits irrational exponents (which we call a Ribenboim series). A…

A {\it tiered graph} $G=(V,E)$ with $m $ tiers is a simple graph with $V\subseteq \brk{n}$, where $\brk{n}=\{1,2,\cdots,n\}$, and with a surjective map $t$ from $V$ to $\brk{m}$ such that if $v$ is a vertex adjacent to $v'$ in $G$ with…

We consider a class of infinite weighted metric trees obtained as perturbations of self-similar regular trees. Possible definitions of the boundary traces of functions in the Sobolev space on such a structure are discussed by using…

We present a systematic effective method to construct coarse fundamental domains for the action of the Picard modular groups $PU(2,1,\mathcal{O}_d)$ where $\mathcal{O}_d$ has class number one, i.e. $d=1,2,3,7,11,19,43,67,163$. The…

We show that if G is a finite group and f is a {0,1}-valued function on G with Fourier algebra norm at most M then f may be computed by a coset decision tree (that is a decision tree in which at each vertex we query membership of a given…

Starting from certain rational varieties blown-up from (P^1)^N, we construct a tropical, i.e., subtraction-free birational, representation of Weyl groups as a group of pseudo isomorphisms of the varieties. Furthermore, we develop an…

In previous work, we gave asymptotic counting results for the number of tree-child and normal networks with $k$ reticulation vertices and explicit exponential generating functions of the counting sequences for $k=1,2,3$. The purpose of this…

This paper is originally designed as a part of revision of the author's preprint math.AG/9908174 "P-adic Schwarzian triangle groups of Mumford type". Recently, Yves Andr'e pointed out a flaw in that preprint; more precisely, Proposition II…