Related papers: Partition complexes and trees
We define two model structures on the category of bicomplexes concentrated in the right half plane. The first model structure has weak equivalences detected by the totalisation functor. The second model structure's weak equivalences are…
We show that the partition function of the logarithmic sector of critical topologically massive gravity which represents a series expansion of composition of functions, can be expressed as a sum over rooted trees. Our work brings a…
We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…
Naturally occurring diagrams in algebraic topology are commutative up to homotopy, but not on the nose. It was quickly realized that very little can be done with this information. Homotopy coherent category theory arose out of a desire to…
We construct factors of type $\tn$ for $n\in\NN, n\geq 2$ from group actions on homogeneous trees and their boundaries. Our result is a discrete analogue of a result of R.J Spatzier, where the hyperfinite factor of type $\tone$ is…
The aim of this paper is to extend the definition of motivic homotopy theory from schemes to a large class of algebraic stacks and establish a six functor formalism. The class of algebraic stacks that we consider includes many interesting…
We construct a small regular cellular decomposition of the Fulton MacPherson operad $FM_2$ that is compatible with the operad composition. The cells are indexed by trees with edges of two colors and vertices labelled by cells of the cacti…
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 develop the combinatorics of leveled trees in order to construct explicit resolutions of (co)operads and (co)operadic (co)bimodules. We build explicit cofibrant resolutions of operads and operadic bimodules in spectra analogous to the…
We prove that the homotopy theory of cofibration categories is equivalent to the homotopy theory of cocomplete quasicategories. This is achieved by presenting both homotopy theories as fibration categories and constructing an explicit…
We show that every sheaf on the site of smooth manifolds with values in a stable (infinity,1)-category (like spectra or chain complexes) gives rise to a differential cohomology diagram and a homotopy formula, which are common features of…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
Category theory provides a collective description of many arrangements in mathematics, such as topological spaces, Banach spaces and game theory. Within this collective description, the perspective from any individual member of the…
We embed the category of complex manifolds into the simplicial category of prestacks on the simplicial site of Stein manifolds, a prestack being a contravariant simplicial functor from the site to the category of simplicial sets. The…
A classical method for partition generating functions is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results for partitions with n copies of n are presented.
As interdisciplinary science is flourishing because of materials informatics and additional factors; a systematic way is required for expressing knowledge and facilitating communication between scientists in various fields. A function…
The polytope structure of the associahedron is decomposed into two categories, types and classes. The classification of types is related to integer partitions, whereas the classes present a new combinatorial problem. We solve this and…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
We show that morphisms from n A_infinity-algebras to a single one are maps over an operad module with n+1 commuting actions of the operad A_infinity, whose algebras are conventional A_infinity-algebras. Similar statement holds for homotopy…
Algorithms for binary classification based on adaptive tree partitioning are formulated and analyzed for both their risk performance and their friendliness to numerical implementation. The algorithms can be viewed as generating a set…