Related papers: Specializing Wide Aronszajn Trees without Adding R…
We present an axiomatic framework for analyzing the algorithmic properties of decision trees. This framework supports the classification of decision tree problems through structural and ancestral constraints within a rigorous mathematical…
We propose an explicit construction of a weighted generalised Grassmannian. For a weighted Grassmannian (i.e., for series A) we obtain an effective parametrisation of possible $\mathbb{Z}$-gradings on Pl\"{u}cker coordinates, and provide…
We provide a characterisation of differentially large fields in arbitrary characteristic and a single derivation in the spirit of Blum axioms for differentially closed fields. In the case of characteristic zero, we use these axioms to…
We analyze a countable support product of a free Suslin tree which turns it into a highly rigid Kurepa tree with no Aronszajn subtree. In the process, we introduce a new rigidity property for trees, which says roughly speaking that any…
A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…
A tree ${\mathbb T} =\langle T\leq \rangle$ is reversible iff there is no order $\preccurlyeq \;\varsubsetneq \;\leq $ such that ${\mathbb T} \cong \langle T ,\preccurlyeq\rangle$. Using a characterization of reversibility via back and…
Explanation-based generalization is used to extract a specialized grammar from the original one using a training corpus of parse trees. This allows very much faster parsing and gives a lower error rate, at the price of a small loss in…
In this paper, we consider the problem of reconstructing trees from traces in the tree edit distance model. Previous work by Davies et al. (2019) analyzed special cases of reconstructing labeled trees. In this work, we significantly expand…
We investigate the structure of trees that have greatest maximum eigenvalue among all trees with a given degree sequence. We show that in such an extremal tree the degree sequence is non-increasing with respect to an ordering of the…
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…
Model trees provide an appealing way to perform interpretable machine learning for both classification and regression problems. In contrast to ``classic'' decision trees with constant values in their leaves, model trees can use linear…
We prove a general Ramsey theorem for trees with a successor operation. This theorem is a common generalization of the Carlson-Simpson Theorem and the Milliken Tree Theorem for regularly branching trees. Our theorem has a number of…
The computational complexity of time-dependent perturbation theory is well-known to be largely combinatorial whatever the chosen expansion method and family of parameters (combinatorial sequences, Goldstone and other Feynman-type…
We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…
We investigate two variants of splitting tree forcing, their ideals and regularity properties. We prove connections with other well-known notions, such as Lebesgue measurablility, Baire- and Doughnut-property and the Marczewski field.…
We provide explicit formulas of non-recursive type for the linearizing transformations of a non-resonant analytic germ of diffeomorphism at a fixed point or a non-resonant analytic germ of vector field at a singular point, in any complex…
By studying non-commutative series in an infinite alphabet we introduce shift-plethystic trees and a class of integer compositions as new combinatorial models for the Rogers-Ramanujan identities. We prove that the language associated to…
We study the class of differentially henselian fields, which are henselian valued fields equipped with generic derivations in the sense of Cubides Kovacics and Point, and are special cases of differentially large fields in the sense of…
In this paper we prove a strong Hahn-Banach theorem: separation of disjoint convex sets by linear forms is possible without any further conditions, if the target field $\R$ is replaced by a more general real closed extension field. From…