Related papers: Rigid structures in the universal enveloping traff…
We introduce the notion of free decomposition spaces: they are simplicial spaces freely generated by their inert maps. We show that left Kan extension along the inclusion $j \colon \Delta_{\operatorname{inert}} \to \Delta$ takes general…
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
We study the problem of conjunctive query evaluation relative to a class of queries; this problem is formulated here as the relational homomorphism problem relative to a class of structures A, wherein each instance must be a pair of…
The automorphism group of the composition of graphs $G \circ H$ contains the wreath product $Aut(H) \wr Aut(G)$ of the automorphism groups of the corresponding graphs. The classical problem considered by Sabidussi and Hemminger was under…
A connected graph is called \emph{geodetic} if there is a unique shortest path between each pair of vertices. We introduce a systematic method for constructing new presentations of free products that give rise to previously unknown geodetic…
Let $G$ be a topological group, let $\phi$ be a continuous endomorphism of $G$ and let $H$ be a closed $\phi$-invariant subgroup of $G$. We study whether the topological entropy is an additive invariant, that is,…
If $G$ is a free product of finite groups, let $\Sigma Aut_1(G)$ denote all (necessarily symmetric) automorphisms of $G$ that do not permute factors in the free product. We show that a McCullough-Miller [D. McCullough and A. Miller, {\em…
Let $\mathcal K$ be a complete quasivariety of completely regular universal topological algebras of continuous signature $\mathcal E$ (which means that $\mathcal K$ is closed under taking subalgebras, Cartesian products, and includes all…
We introduce a traceable operator-algebraic framework for incompressible transport on M= T3 (and, more generally, compact Riemannian manifolds endowed with a smooth invariant probability measure). Given an autonomous divergence-free…
A theta is a graph consisting of two non-adjacent vertices and three internally disjoint paths between them, each of length at least two. For a family $\mathcal{H}$ of graphs, we say a graph $G$ is $\mathcal{H}$-free if no induced subgraph…
To any automorphism, $\alpha$, of a totally disconnected, locally compact group, $G$, there is associated a compact, $\alpha$-stable subgroup of $G$, here called the \emph{nub} of $\alpha$, on which the action of $\alpha$ is topologically…
An arbitrary dependence structure between a finite family of events of a probability space defines a hypergraph structure. We study the converse operation, starting from a hypergraph structure, to determine a canonical probability space…
We construct the join of noncommutative Galois objects (quantum torsors) over a Hopf algebra H. To ensure that the join algebra enjoys the natural (diagonal) coaction of H, we braid the tensor product of the Galois objects. Then we show…
As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph $G=(V,E)$, a multiset…
The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…
For a simple graph $\Gamma$ and for unital $C^*$-algebras with GNS-faithful states $(\mathbf{A}_v,\varphi_v)$ for $v\in V\Gamma$, we consider the reduced graph product $(\mathcal{A},\varphi)=*_{v,\Gamma}(\mathbf{A}_{v},\varphi_v)$ , and…
We study $N$-ary non-commutative notions of independence, which are given by trees and which generalize free, Boolean, and monotone independence. For every rooted subtree $\mathcal{T}$ of the $N$-regular tree, we define the…
We introduce a family of maps parametrised by certain ribbon graphs. It is based on a connection in non-commutative geometry and contains the double divergence as a special case. Applying the construction to the case of the group algebra of…
We investigate a structural generalisation of treewidth we call $\mathcal{A}$-blind-treewidth where $\mathcal{A}$ denotes an annotated graph class. This width parameter is defined by evaluating only the size of those bags $B$ of…
For each finite simple graph $G$, Aharoni, Berger and Ziv consider a recursively defined number $\psi (G) \in \mathbb{Z}\cup \{+ \infty \}$ which gives a lower bound for the topological connectivity of the independence complex $I_G$. They…