Related papers: The integrally representable trees of norm 3
In analogy to other concepts of a similar nature, we define the inducibility of a rooted binary tree. Given a fixed rooted binary tree $B$ with $k$ leaves, we let $\gamma(B,T)$ be the proportion of all subsets of $k$ leaves in $T$ that…
A few notes about infinite trees in a descriptive set-theoretic setting.
Tree ensembles, such as random forest and boosted trees, are renowned for their high prediction performance, whereas their interpretability is critically limited. In this paper, we propose a post processing method that improves the model…
Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…
The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs classes with set representation characterisations. The complexity of recognising SOGs in open. The complexities of recognising many subclasses of SOGs are known.…
In this paper, we use a new and correct method to determine the $n$-vertex $k$-trees with the first three largest signless Laplacian indices.
We provide a classification of the homogeneous 3-dimensional permutation structures, i.e. homogeneous structures in a language of 3 linear orders, partially answering a question of Cameron. We also arrive at a natural description of all…
The idea of "vertex at the infinity" naturally appears when studying indecomposable injective representations of tree quivers. In this paper we formalize this behavior and find the structure of all the indecomposable injective…
The properties of randomly evolving special trees having defined and analyzed already in two earlier papers (arXiv:cond-mat/0205650 and arXiv:cond-mat/0211092) have been investigated in the case when the continuous time parameter converges…
We calculate extensions between certain irreducible admissible representations of p-adic groups.
We show that a tree of order $n$ has at most $O(5^{n/4})$ nonisomorphic subtrees, and that this bound is best possible. We also prove an analogous result for the number of nonisomorphic rooted subtrees of a rooted tree.
We show that the Thurston norm of any irreducible 3-manifold can be detected using twisted Reidemeister torsions corresponding to integral representations and also corresponding to representations over finite fields. In particular our…
This paper discusses the enumeration for the total number of all rooted spanning forests of the labeled complete tripartite graph. We enumerate the total number by a combinatorial decomposition.
This paper introduces a notion of decompositions of integral varifolds into countably many integral varifolds, and the existence of such decomposition of integral varifolds whose first variation is representable by integration is…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
We review the state of the art of the classification of real uniruled threefolds
In this paper, we give a complete classification of extensions of finite irreducible conformal modules over rank two Lie conformal algebras.
We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting…
We compute the integral cohomology rings of a family of 3-groups. As a corollary, we exhibit, for each n greater than or equal to 5, a pair of groups of order 3^n whose integral cohomology rings are isomorphic.
In this paper we study representations of conformal nets associated with positive definite even lattices and their orbifolds with respect to isometries of the lattices. Using previous general results on orbifolds, we give a list of all…