Related papers: The integrally representable trees of norm 3
We prove a weighted generalization of the formula for the number of plane vertex-labeled trees.
We give a practical formula for counting irreducible nodal genus-three plane curves that a fixed generic complex structure on the normalization. As an intermediate step, we enumerate rational plane curves that have a $(3,4)$-cusp.
A new class of 3-manifold invariants is constructed from representations of the category of framed tangles.
A positive-definite integral quadratic form is called regular if it represents every positive integer which is locally represented. In this article, we classify all regular diagonal quadratic forms of rank greater than 3.
For any n>3, we give a family of finite dimensional irreducible representations of the braid group B_n. Moreover, we give a subfamily parametrized by 0<m<n of dimension the combinatoric number (n,m). The representation obtained in the case…
This paper deals with the recoverable robust spanning tree problem under interval uncertainty representations. A polynomial time, combinatorial algorithm for the recoverable spanning tree problem is first constructed. This problem…
This paper is currently undergoing revision.
We introduce the notion of ''maximal rank type'' for representations of quivers, which requires certain collections of maps involved in the representation to be of maximal rank. We show that real root representations of quivers are of…
The family of trees with palindromic characteristic polynomials is characterized. Large families of graphs with this property are found as well.
In this note, we classify all the weighted oriented forests whose edge ideals have the property that one of their matching powers has linear resolution.
We classify the 5-dimensional homogeneous geometries in the sense of Thurston. The present paper (part 3 of 3) classifies those in which the linear isotropy representation is nontrivial but reducible. Most of the resulting geometries are…
Tree ensembles such as random forests and boosted trees are accurate but difficult to understand, debug and deploy. In this work, we provide the inTrees (interpretable trees) framework that extracts, measures, prunes and selects rules from…
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yields a new formula for the number of NATs. We also obtain…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
We give the classification of solvable and splitting Lie triple system and it turn that, up to isomorphism there exist 7 non isomorphic canonical Lie triple systems and 6 non isomorphic splitting canonical Lie triple systems and find the…
We examine what integers are representable as sums of three cubes. We also provide formulas for the number of representations of $x^3+y^3+z^3=n$ under the condition $x+y+z=t$. Also we show how the problem of three cubes is related to…
We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…
We introduce the notion of a nest-representable tolerance and show that some results from our former paper "From congruence identities to tolerance identities" [CT] can be extended to this more general setting.
This article discuss a class of tractable model in the form of polynomial type.