Related papers: Forest Categories
We define a decidable class of TAGs that is strongly equivalent to CFGs and is cubic-time parsable. This class serves to lexicalize CFGs in the same manner as the LCFGs of Schabes and Waters but with considerably less restriction on the…
In this paper, we will consider a class of locally $\Phi$-Beilinson-Green algebras, where $\Phi$ is an infinite admissible set of the integers, and show that symmetric approximation sequences in $n$-exangulated categories give rise to…
The development of mathematics has been characterized by the increasing interconnectivity of seemingly separate disciplines. Such interplay has been facilitated by a massive development in formalism; category theory has provided a common…
We examine languages of unranked forests definable using the temporal operators EF and EX. We characterize the languages definable in this logic, and various fragments thereof, using the syntactic forest algebras introduced by Bojanczyk and…
In this short note we prove, by means of classical fixed point index, an affine version of a Birkhoff--Kellogg type theorem in cones. We apply our result to discuss the solvability of a class of boundary value problems for functional…
In this paper we extend To\"en's derived Hall algebra construction, in which he obtains unital associative algebras from certain stable model categories, to one in which such algebras are obtained from more general stable homotopy theories,…
An extension of order theory is presented that serves as a formalism for the study of dendroidal sets analogously to way the formalism of order theory is used in the study of simplicial sets.
We extend the Kechris--Pestov--Todor\v{c}evi\'c correspondence to weak Fra\"{\i}ss\'{e} categories and automorphism groups of generic objects. The new ingredient is the weak Ramsey property. We demonstrate the theory on several examples…
Let $\md^b(A)$ be the derived category of a finite dimensional basic algebra $A$ with finite global dimension. We construct the Lie algebra arising from the 2-periodic version $\mk_2(\mp(A))$ of $\mk^b(\mp(A))$ in term of constructible…
This paper supplements [17], showing that categorically the layered theory is the same as the theory of ordered monoids (e.g. the max-plus algebra) used in tropical mathematics. A layered theory is developed in the context of categories,…
The filtered derived category of an abelian category has played a useful role in subjects including geometric representation theory, mixed Hodge modules, and the theory of motives. We develop a natural generalization using current methods…
We use a $K$-theory recipe of Thomason to obtain classifications of triangulated subcategories via refining some standard thick subcategory theorems. We apply this recipe to the full subcategories of finite objects in the derived categories…
We provide a bijection between the set of factorizations, that is, ordered (n-1)-tuples of transpositions in ${\mathcal S}_{n}$ whose product is (12...n), and labelled trees on $n$ vertices. We prove a refinement of a theorem of D\'{e}nes…
Tree-graded spaces are a generalization of $\mathbb{R}$-trees and play an important role in describing the large-scale geometry of relatively hyperbolic groups. We consider a subclass of tree-graded spaces that we call "disjointly…
We develop a theory of descent and forms of tensor categories over arbitrary fields. We describe the general scheme of classification of such forms using algebraic and homotopical language, and give examples of explicit classification of…
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…
For an abelian category C and a filtrant preordered set Lambda, we prove that the derived category of the quasi-abelian category of filtered objects in C indexed by Lambda is equivalent to the derived category of the abelian category of…
We apply decision tree induction to the problem of discourse clue word sense disambiguation with a genetic algorithm. The automatic partitioning of the training set which is intrinsic to decision tree induction gives rise to linguistically…
Decision forest algorithms typically model data by learning a binary tree structure recursively where every node splits the feature space into two sub-regions, sending examples into the left or right branch as a result. In axis-aligned…
A tree is scattered if no subdivision of the complete binary tree is a subtree. Building on results of Halin, Polat and Sabidussi, we identify four types of subtrees of a scattered tree and a function of the tree into the integers at least…