Related papers: Forest Categories
This paper classifies the derivations of group algebras in terms of the generators and defining relations of the group. If $RG$ is a group ring, where $R$ is commutative and $S$ is a set of generators of $G$ then necessary and sufficient…
Much of algebra and representation theory can be formulated in the general framework of tensor categories. The aim of this paper is to further develop this theory for braided tensor categories. Several results are established that do not…
In this expository paper, we present a construction of tree modules and combine it with (infinite dimensional) tilting theory and relative Mittag-Leffler conditions in order to explore limits of the approximation theory of modules. We also…
Combinatoric formulas for cluster expansions have been improved many times over the years. Here we develop some new combinatoric proofs and extensions of the tree formulas of Brydges and Kennedy, and test them on a series of pedagogical…
Elementary arguments show that a tree or forest is determined (up to isomorphism) by binary matroids defined using the adjacency matrix.
We show that a skew category algebra can be embedded into a twisted tensor product algebra. We investigate the extension of some concepts of Puig and Turull from group algebras to category algebras and their behavior with respect to skew…
In this paper we construct a tilting sheaf for Severi-Brauer Varieties and Involution Varieties. This sheaf relates the derived category of each variety to the derived category of modules over a ring whose semisimple component consists of…
Despite widespread interest and practical use, the theoretical properties of random forests are still not well understood. In this paper we contribute to this understanding in two ways. We present a new theoretically tractable variant of…
Given a recollement of three proper dg algebras over a noetherian commutative ring, e.g. three algebras which are finitely generated over the base ring, which extends one step downwards, it is shown that there is a short exact sequence of…
In classification and forecasting with tabular data, one often utilizes tree-based models. Those can be competitive with deep neural networks on tabular data and, under some conditions, explainable. The explainability depends on the depth…
Let X ->Y be a Zariski locally trivial fibration of smooth complex projective varieties, with fiber F. We give a structure theorem for the derived category of X provided both F and Z have a full strongly exceptional collection of line…
Using suitable deformations of simplicial trees and the duality theory for median sets, we show that every free action on a median set can be extended to a free and transitive one. We also prove that the category of median groups is a…
We extend Forester's rigidity theorem so as to give a complete characterization of rigid group actions on trees (an action is rigid if it is the only reduced action in its deformation space, in particular it is invariant under automorphisms…
We provide an expository account of some of the Hopf algebras that can be defined using trees, labeled trees, ordered trees and heap ordered trees. We also describe some actions of these Hopf algebras on algebra of functions.
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $\sigma$-scattered to partial orders, and use our method…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
We present a new way of constructing an ensemble classifier, named the Guided Random Forest (GRAF) in the sequel. GRAF extends the idea of building oblique decision trees with localized partitioning to obtain a global partitioning. We show…
The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a topological space whose points, called profinite words,…
In this paper, we look at an unambiguous version of Simon's forest factorization theorem, a very deep result which has wide connections in algebra, logic and automata. Given a morphism $\varphi$ from $\Sigma^+$ to a finite semigroup $S$, we…