Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the enumeration of rooted trees with fixed size of maximal decreasing trees
153
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let $T_{n}$ be the set of rooted labeled trees on $set{0,...,n}$. A maximal decreasing subtree of a rooted labeled tree is defined by the maximal subtree from the root with all edges being decreasing. In this paper, we study a new refinement $T_{n,k}$ of $T_n$, which is the set of rooted labeled trees whose maximal decreasing subtree has $k+1$ vertices.
rate research
Read More
In this paper we enumerate the cardinalities for the set of all vertices of outdegree $ge k$ at level $ge ell$ among all rooted ordered $d$-trees with $n$ edges. Our results unite and generalize several previous works in the literature.
We introduce some natural families of distributions on rooted binary ranked plane trees with a view toward unifying ideas from various fields, including macroevolution, epidemiology, computational group theory, search algorithms and other fields. In the process we introduce the notions of split-exchangeability and plane-invariance of a general Markov splitting model in order to readily obtain probabilities over various equivalence classes of trees that arise in statistics, phylogenetics, epidemiology and group theory.
The Perron value $rho(T)$ of a rooted tree $T$ has a central role in the study of the algebraic connectivity and characteristic set, and it can be considered a weight of spectral nature for $T$. A different, combinatorial weight notion for $T$ - the moment $mu(T)$ - emerges from the analysis of Kemenys constant in the context of random walks on graphs. In the present work, we compare these two weight concepts showing that $mu(T)$ is almost an upper bound for $rho(T)$ and the ratio $mu(T)/rho(T)$ is unbounded but at most linear in the order of $T$. To achieve these primary goals, we introduce two new objects associated with $T$ - the Perron entropy and the neckbottle matrix - and we investigate how different operations on the set of rooted trees affect the Perron value and the moment.
The greedy tree $mathcal{G}(D)$ and the $mathcal{M}$-tree $mathcal{M}(D)$ are known to be extremal among trees with degree sequence $D$ with respect to various graph invariants. This paper provides a general theorem that covers a large family of invariants for which $mathcal{G}(D)$ or $mathcal{M}(D)$ is extremal. Many known results, for example on the Wiener index, the number of subtrees, the number of independent subsets and the number of matchings follow as corollaries, as do some new results on invariants such as the number of rooted spanning forests, the incidence energy and the solvability. We also extend our results on trees with fixed degree sequence $D$ to the set of trees whose degree sequence is majorised by a given sequence $D$, which also has a number of applications.
We find a formula to compute the number of the generators, which generate the $n$-filtered space of Hopf algebra of rooted trees, i.e. the number of equivalent classes of rooted trees with weight $n$. Applying Hopf algebra of rooted trees, we show that the analogue of Andruskiewitsch and Schneiders Conjecture is not true. The Hopf algebra of rooted trees and the enveloping algebra of the Lie algebra of rooted trees are two important examples of Hopf algebras. We give their representation and show that they have not any nonzero integrals. We structure their graded Drinfeld doubles and show that they are local quasitriangular Hopf algebras.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
