Related papers: Partition complexes and trees
Recently, the Johnson-McCarthy discrete calculus for homotopy functors was extended to include functors from an unbased simplicial model category to spectra. This paper completes the constructions needed to ensure that there exists a…
We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…
For a homological functor from a triangulated category to an abelian category satisfying some technical assumptions we construct a tower of interpolation categories. These are categories over which the functor factorizes and which capture…
In 1981, Andr\'e Joyal provided a combinatorial interpretation of the algebra of formal power series, a central gadget in the toolkit of enumerative combinatorics. In Joyal's theory of species of structures, combinatorial species (like…
By using only combinatorial data on two posets X and Y, we construct a set of so-called formulas. A formula produces simultaneously, for any abelian category A, a functor between the categories of complexes of diagrams over X and Y with…
We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.
We analyze a general family of fibrations which, after looping, have sections. Methods are developed to determine the homotopy type of the fibre and the homotopy classes of the map from the fibre to the base. The methods are driven by…
We classify the homogeneous finite-dimensional permutation structures, i.e., homogeneous structures in a language of finitely many linear orders, giving a nearly complete answer to a question of Cameron, and confirming the classification…
In this paper, we study classes of structures and individual structures for which programs implementing functions defined everywhere are equivalent to finite tree-programs. The programs under consideration may have cycles and at most…
We consider finite quantum systems defined by a mixed set of commutation and anti-commutation relations between components of the Hamiltonian operator. These relations are represented by an anti-commutativity graph which contains a…
We observe that there is an equivalence between the singularity category of an affine complete intersection and the homotopy category of matrix factorizations over a related scheme. This relies in part on a theorem of Orlov. Using this…
This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete…
In this paper, we show that two constructions form stacks: Firstly, as one varies the $\infty$-topos, $\mathcal{X}$, Lurie's homotopy theory of higher categories internal to $\mathcal{X}$ varies in such a way as to form a stack over the…
We study the construction of tensor products of representations up to homotopy, which are the A-infinity version of ordinary representations. We provide formulas for the construction of tensor products of representations up to homotopy and…
We consider multi-class classification where the predictor has a hierarchical structure that allows for a very large number of labels both at train and test time. The predictive power of such models can heavily depend on the structure of…
Phylogenetic trees are leaf-labelled trees used to model the evolution of species. In practice it is not uncommon to obtain two topologically distinct trees for the same set of species, and this motivates the use of distance measures to…
Using the fact that Hopf-Galois structures on separable extensions and skew bracoids are both intrinsically connected to transitive subgroups of the holomorph of a finite group, we present algorithms to classify and enumerate these objects…
In this brief note a straightforward combinatorial proof for an identity directly connecting rooted forests and unordered set partitions is provided. Furthermore, references that put this type of identity in the context of forest volumes…
We present an algorithm for classification tasks on big data. Experiments conducted as part of this study indicate that the algorithm can be as accurate as ensemble methods such as random forests or gradient boosted trees. Unlike ensemble…
In this paper, we first construct some complete cotorson pairs on the category $\mathbb{C}_N(\mathcal{G})$ of unbounded $N$-complexes of Grothendieck category $\mathcal{G}$, from two given cotorsion pairs in $\mathcal{G}$. Next as an…