Related papers: Le cerf-volant d'une constellation
Let $V$ be a real or complex vector space. The finite topology of $V$ consists of all the subsets $U$ for which the intersection $U \cap F$ is closed in $F$ for every finite-dimensional linear subspace of $V$. It is known that if $V$ has…
A data structure for finite bounded acyclic categories has been built, which is useful to encode and manipulate abstract orientable incidence structure. It can be represented as a directed acyclic multigraph with weighted edges, where the…
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between orbits of graphs and error-correcting codes. We define a new…
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…
For a representation of a finite group $G$ on a complex vector space $V$ we determine when a holomorphic $\binom{p}{q}$-tensor field on the principle stratum of the orbit space $V/G$ can be lifted to a holomorphic $G$-invariant tensor field…
Weighted constellations give graphical representations of weighted branched coverings of the Riemann sphere. They were introduced to provide a combinatorial interpretation of the $2$D Toda $\tau$-functions of hypergeometric type serving as…
We provide a finite equational presentation of graphs of treewidth at most three, solving an instanceof an open problem by Courcelle and Engelfriet. We use a syntax generalising series-parallel expressions, denoting graphs with a small…
Let $\phi$ be a function that maps any non-empty subset $A$ of $\mathbb{R}^2$ to a non-empty subset $\phi(A)$ of $\mathbb{R}^2$. A $\phi$-cover of a set $T=\{T_1, T_2, \dots, T_m\}$ of pairwise non-crossing trees in the plane is a set of…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
Consider a polynomial $F$ in $m$ variables and a finite point ensemble $S=S_1 \times ... \times S_m$. When given the leading monomial of $F$ with respect to a lexicographic ordering we derive improved information on the possible number of…
We study the motion of stars in a star cluster which revolves in a circular orbit about its parent galaxy. The star cluster is modelled as an ellipsoid of uniform spatial density. We exhibit two 2-parameter families of self-consistent…
Two notions of riffle shuffling on finite Coxeter groups are given: one using Solomon's descent algebra and another using random walk on chambers of hyperplane arrangements. These coincide for types $A$,$B$,$C$, $H_3$, and rank two groups.…
`Categorification' is the process of replacing equations by isomorphisms. We describe some of the ways a thoroughgoing emphasis on categorification can simplify and unify mathematics. We begin with elementary arithmetic, where the category…
We establish a combinatorial realization of continued fractions as quotients of cardinalities of sets. These sets are sets of perfect matchings of certain graphs, the snake graphs, that appear naturally in the theory of cluster algebras. To…
A strong $s$-blocking set in a projective space is a set of points that intersects each codimension-$s$ subspace in a spanning set of the subspace. We present an explicit construction of such sets in a $(k - 1)$-dimensional projective space…
The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…
We exhibit an identity of abstract simplicial complexes between the well-studied complex of trees and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be…
We show that the points that converge to infinity under iteration of the exponential map form a connected subset of the complex plane.
We classify cocovers and covers of a given element of the double affine Weyl semigroup W with respect to the Bruhat order, specifically when W is associated to a finite root system that is irreducible and simply laced. We show two…
A {\em string graph} is the intersection graph of a family of continuous arcs in the plane. The intersection graph of a family of plane convex sets is a string graph, but not all string graphs can be obtained in this way. We prove the…