Related papers: The integrally representable trees of norm 3

In this paper we prove an identity in terms of generating functions which enables us to calculate the numbers of isomorphism classes of absolutely indecomposable semistable representations of quivers over finite fields.

We introduce a novel interpretable tree based algorithm for prediction in a regression setting. Our motivation is to estimate the unknown regression function from a functional decomposition perspective in which the functional components…

In this paper, we prove certain theorems about three consecutive primes.

We construct a tree T of maximal degree 3 with infinitely many leaves such that whenever finitely many of them are removed, the remaining tree is isomorphic to T. In this sense T resembles an infinite star.

We construct representation theory of Lie algebras with filtrations. In this framework a classification of irreducible representations is obtained and spectra of some reducible representations are found.

It implicitly follows from the work of [Colbourn, El-Mallah: On two dual classes of planar graphs. Discrete Mathematics 80(1): 21-40 (1990)] that every planar partial 3-tree is a subgraph of a planar 3-tree. This fact has already enabled to…

Random forests are decision tree ensembles that can be used to solve a variety of machine learning problems. However, as the number of trees and their individual size can be large, their decision making process is often incomprehensible. In…

We continue our study of topological partial *-algebras, focusing our attention to *-semisimple partial *-algebras, that is, those that possess a {multiplication core} and sufficiently many *-representations. We discuss the respective roles…

In this article we tackle the combinatorics of coloured hard-dimer objects. This is achieved by identifying coloured hard-dimer configurations with a certain class of rooted trees that allow for an algebraic treatment in terms of…

An explicit perturbative solution to all orders is given for a general class of nonlinear differential equations. This solution is written as a sum indexed by rooted trees and uses the Green function of a linearization of the equations. The…

We present a description of non-solvable groups in which all real irreducible character degrees are prime-power numbers.

We characterise ideals in two-dimensional regular local rings that arise as ideals of maximal minors of indecomposable integrally closed modules of rank three.

Classical models for supervised machine learning, such as decision trees, are efficient and interpretable predictors, but their quality is highly dependent on the particular choice of input features. Although neural networks can learn…

Planar partial $3$-trees are subgraphs of those planar graphs obtained by repeatedly inserting a vertex of degree $3$ into a face. In this paper, we show that planar partial $3$-trees have $1$-string $B_1$-VPG representations, i.e.,…

We examine a family of 3-point mappings that include mappings solvable through linearization. The different origins of mappings of this type are examined: projective equations and Gambier systems. The integrable cases are obtained through…

We characterize those countable rooted trees whose full automorphism group has uncountable strong cofinality or contains an open subgroup with ample generics.

In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly distributed over the interval [0, 1]. In particular, we derive a…

We consider the problem of computing the measure of a regular set of infinite binary trees. While the general case remains unsolved, we show that the measure of a language can be computed when the set is given in one of the following three…

This paper produces a recursive formula of the Betti numbers of certain Stanley-Reisner ideals (graph ideals associated to forests). This gives a purely combinatorial definition of the projective dimension of these ideals, which turns out…

A triangular form is defined to be an integer-valued quadratic polynomial of the form $a_1P_3(x_1)+a_2P_3(x_2)+\cdots+a_kP_3(x_k)$ where $a_i's$ are positive integers and $P_3(x)=x(x+1)/2$. A triangular form is called regular if it…