Related papers: Matching and Independence Complexes Related to Sma…
Inspired by work of Fr\"oberg (1990), and Eagon and Reiner (1998), we define the \emph{total $k$-cut complex} of a graph $G$ to be the simplicial complex whose facets are the complements of independent sets of size $k$ in $G$. We study the…
Turaev conjectured that the classification, realization and splitting results for Poincar\'e duality complexes of dimension $3$ (PD$_{3}$-complexes) generalize to PD$_{n}$-complexes with $(n-2)$-connected universal cover for $n \ge 3$.…
Rational discrete cohomology and homology for a totally disconnected locally compact group $G$ is introduced and studied. The $\mathrm{Hom}$-$\otimes$ identities associated to the rational discrete bimodule $\mathrm{Bi}(G)$ allow to…
Robin Forman's highly influential 2002 paper A User's Guide to Discrete Morse Theory presents an overview of the subject in a very readable manner. As a proof of concept, the author determines the topology (homotopy type) of the abstract…
We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…
For an $n$-vertex graph $G$, let $h(G)$ denote the smallest size of a subset of $V(G)$ such that it intersects every maximum independent set of $G$. A conjecture posed by Bollob\'{a}s, Erd\H{o}s and Tuza in early 90s remains widely open,…
Starting from holography, we derive the symmetry TFT for $\mathcal{N}=4$ SYM with $\mathfrak{so}(2n)$ gauge algebra, including terms which were previously unaccounted for holographically, by considering the action of the symmetry TFT on…
Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For finite graphs one popular way to compute upper bounds for…
We describe polar homology groups for complex manifolds. The polar k-chains are subvarieties of complex dimension k with meromorphic forms on them, while the boundary operator is defined by taking the polar divisor and the Poincare residue…
An important facet of the inverse eigenvalue problem for graphs is to determine the minimum number of distinct eigenvalues of a particular graph. We resolve this question for the join of a connected graph with a path. We then focus on…
A new heuristic based on vertex invariants is developed to rapidly distinguish non-isomorphic graphs to a desired level of accuracy. The method is applied to sample subgraphs from an E.coli protein interaction network, and as a probe for…
We obtain eigenvalue equations satisfied by various elliptic modular graphs with five links where two of the vertices are unintegrated. Solving them leads to several non--trivial algebraic identities between these graphs.
We study the algebraic structure of the $n$-dimensional Cremona group and show that it is not an algebraic group of infinite dimension (ind-group) if $n\ge 2$. We describe the obstruction to this, which is of a topological nature. By…
We consider classification problems for manifolds and discrete subgroups of Lie groups from a descriptive set-theoretic point of view. This work is largely foundational in conception and character, recording both a framework for general…
Let M be a compact manifold. We show the identity component $\mathrm{Homeo}_0(M)$ of the group of self-homeomorphisms of M has a well-defined quasi-isometry type, and study its large scale geometry. Through examples, we relate this large…
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorithmic graph theory is essentially the…
This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…
We describe some metric properties of incomparability graphs. We consider the problem of the existence of infinite paths, either induced or isometric, in the incomparability graph of a poset. Among other things, we show that if the…
We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…
We investigate whether the presence or absence of correlations between subsystems of an N-partite quantum system is solely constrained by the non-negativity and monotonicity of mutual information. We argue that this relatively simple…