Related papers: N-valid trees in wavelet theory on Vilenkin groups

Let E be an elementary abelian p-group of rank r and let k be a field of characteristic p. We introduce functors F_i from finitely generated kE-modules of constant Jordan type to vector bundles over projective space of dimension r-1. The…

Let $A$ be a commutative $k$-algebra over a field of $k$ and $\Xi$ a linear operator defined on $A$. We define a family of $A$-valued invariants $\Psi$ for finite rooted forests by a recurrent algorithm using the operator $\Xi$ and show…

Multiresolution analysis (MRA) on compact abelian group $G$ has been constructed with epimorphism as a dilation operator. We show a characterization of scaling sequences of an MRA on $L^p(G)$, $1\le p<\infty$. With the help of this scaling…

The present article continues the study of median groups initiated in [6, 9, 10]. Some classes of median groups are introduced and investigated with a stress upon the class of the so called A-groups which contains as remarkable subclasses…

We introduce an algorithmic approach based on generating tree method for enumerating the inversion sequences with various pattern-avoidance restrictions. For a given set of patterns, we propose an algorithm that outputs either an accurate…

We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…

We prove two recent conjectures of Bourn and Erickson (2023) regarding the real-rootedness of a certain family of polynomials $N_n(t)$ as well as the sum of their coefficients. These polynomials arise as the numerators of generating…

The article presents results on the well-known problem concerning the structure of integer polynomials $p_n(z; x, y)$, which define multiplication laws in $n$-valued groups $\mathbb{G}_n$ over the field of complex numbers $\mathbb{C}$. We…

Using a prime element of a local field K of positive characteristic p, the concepts of multiresolution analysis (MRA) and wavelet can be generalized to such a field. We prove a version of the splitting lemma for this setup and using this…

For a natural class of $r \times n$ integer matrices, we construct a non-convex polytope which periodically tiles $\mathbb R^n$. From this tiling, we provide a family of geometrically meaningful maps from a generalized sandpile group to a…

Galled trees are studied as a recombination model in theoretic population genetics. This class of phylogenetic networks has been generalized to tree-child networks, normal networks and tree-based networks by relaxing a structural condition.…

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…

In this paper, we introduce tree varieties as a natural generalization of products of partial flag varieties. We study orbits of the PGL action on tree varieties. We characterize tree varieties with finitely many PGL orbits, generalizing a…

For a field $\mathbb{F}$, let $R(n, m)$ be the ring of invariant polynomials for the action of $\mathrm{SL}(n, \mathbb{F}) \times \mathrm{SL}(n, \mathbb{F})$ on tuples of matrices -- $(A, C)\in\mathrm{SL}(n, \mathbb{F}) \times…

Cayley's formula states that the number of labelled trees on $n$ vertices is $n^{n-2}$, and many of the current proofs involve complex structures or rigorous computation. We present a bijective proof of the formula by providing an…

In this paper we find the generating function for the number of vertices which have $k$ elements in their subtree and use this generating function to calculate the probability that a vertex has a size $k$ subtree. We also show how this same…

Let $K$ be an imaginary quadratic field and $\mathcal{O}_K$ be its ring of integers. Let $h_E$ be the Weber function on certain elliptic curve $E$ with complex multiplication by $\mathcal{O}_K$. We show that if $N$ ($>1$) is an integer…

A rooted tree module (RTM) $M:=M(T,F)$ over a zero-relation algebra $\Lambda:=\mathcal KQ/\langle\rho\rangle$ over a field $\mathcal K$ is given by the data of a quiver morphism $F:T\to Q$ from a rooted tree $T$ (either with a source or a…

The walk matrix of an $n$-vertex graph $G$ with adjacency matrix $A$, denoted by $W(G)$, is $[e,Ae,\ldots,A^{n-1}e]$, where $e$ is the all-ones vector. Let $G\circ P_m$ be the rooted product of $G$ and a rooted path $P_m$ (taking an…

Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data-structures. Categorically, they arise as final coalgebras for polynomial…