Related papers: Trees whose path ideals have linear quotients
In this paper, we provide algorithms to rank and unrank certain degree-restricted classes of Cayley trees (spanning trees of the n-vertex complete graph). Specifically, we consider classes of trees that have a given set of leaves or a fixed…
Regression models for supervised learning problems with a continuous target are commonly understood as models for the conditional mean of the target given predictors. This notion is simple and therefore appealing for interpretation and…
It is known that there is an alternative characterization of characteristic vertices for trees with positive weights on their edges via Perron values and Perron branches. Moreover, the algebraic connectivity of a tree with positive edge…
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
S-Motzkin paths (bijective to ternary trees) and partial version of them are calculated using only elementary methods from linear algebra.
We consider three different schemes for signal routing on a tree. The vertices of the tree represent transceivers that can transmit and receive signals, and are equipped with i.i.d. weights representing the strength of the transceivers. The…
We study optimal decision policies for integer linear programs with a fixed feasible set and varying cost vectors, represented as linear decision trees. Once synthesized for a given feasible set, they return an optimal solution for any…
We note that each lattice $L$ has a unique largest distributive quotient, of which every distributive quotient of $L$ is itself a quotient.
We characterize those countable rooted trees whose full automorphism group has uncountable strong cofinality or contains an open subgroup with ample generics.
Given a weighted, ordered query set $Q$ and a partition of $Q$ into classes, we study the problem of computing a minimum-cost decision tree that, given any query $q$ in $Q$, uses equality tests and less-than comparisons to determine the…
It is proved that the vertex set of any simple graph $G$ can be equitably partitioned into $k$ subsets for any integer $k\geq\max\{\big\lceil\frac{\Delta(G)+1}{2}\big\rceil,\big\lceil\frac{|G|}{4}\big\rceil\}$ so that each of them induces a…
We describe all the trees with the property that the corresponding edge ideal of their line graph has a linear resolution. As a consequence, we give a complete characterization of those trees $T$ for which the line graph $L(T)$ is…
In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…
A split-by-edges tree of a graph G on n vertices is a binary tree T where the root = V(G), every leaf is an independent set in G, and for every other node N in T with children L and R there is a pair of vertices {u, v} in N such that L = N…
A semiring is uniserial if its ideals are totally ordered by inclusion. First, we show that a semiring $S$ is uniserial if and only if the matrix semiring $M_n(S)$ is uniserial. As a generalization of valuation semirings, we also…
The decidability of equivalence for three important classes of tree transducers is discussed. Each class can be obtained as a natural restriction of deterministic macro tree transducers (MTTs): (1) no context parameters, i.e., top-down tree…
In this short note, we find the number of forests of chord diagrams with a given number of trees and a given number of chords.
In this paper we shall consider the Lie algebra of column-finite infinite matrices indexed by positive integers $\mathbb{N}$, describe the lattice of its ideals for arbitrary field $K$ and study its derivations over any commutative, unital…
Let ${\cal T}=(T,w)$ be a weighted finite tree with leaves $1,..., n$. For any $I :=\{i_1,..., i_k \} \subset \{1,...,n\}$, let $D_I ({\cal T})$ be the weight of the minimal subtree of $T$ connecting $i_1,..., i_k$; the $D_{I} ({\cal T})$…
We consider an infinite sequence of rooted trees naturally emerging in a number-theoretical context. We advance some ideas on its structure by discussing some elementary properties. Some of those properties are shown to be related to…