Related papers: Relative Combinatorial Asphericity
We claim that both multipartiteness and localization of subsystems of compound quantum systems are of an essentially relative nature crucially depending on the set of operationalistically available states. In a more general setting, to…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
This paper presents two approaches to quantifying and visualizing variation in datasets of trees. The first approach localizes subtrees in which significant population differences are found through hypothesis testing and sparse classifiers…
Tree-level scattering amplitudes of particles have a geometrical description in terms of intersection numbers of pairs of twisted differential forms on the moduli space of Riemann spheres with punctures. We customize a catalog of twisted…
We extend our generic rigidity theory for periodic frameworks in the plane to frameworks with a broader class of crystallographic symmetry. Along the way we introduce a new class of combinatorial matroids and associated linear…
This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…
This paper presents an offering of some of the myriad connections between Combinatorics and Probability, directed in particular toward combinatorialists. The choice of material was dictated by the author's own interests, tastes and…
We state Bennequin inequalities in the relative case, and show that the relative invariants are additive under relative connected sums. We show they exhibit similar limitations as their classical analogues. We study relatively Legendrian…
A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…
Real Clifford algebras for arbitrary number of space and time dimensions as well as their representations in terms of spinors are reviewed and discussed. The Clifford algebras are classified in terms of isomorphic matrix algebras of real,…
Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which…
We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree…
The Whitehead asphericity problem, regarded as a problem of combinatorial group theory, asks whether any subpresentation of an aspherical group presentation is also aspherical. This is a long standing open problem which has attracted a lot…
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
Lajos Takacs gave a somewhat formidable alternating sum formula for the number of forests of unrooted trees on $n$ labeled vertices. Here we use a weight-reversing involution on suitable tree configurations to give a combinatorial…
The first steps in defining tropicalization for spherical varieties have been taken in the last few years. There are two parts to this theory: tropicalizing subvarieties of homogeneous spaces and tropicalizing their closures in spherical…