Related papers: The cubical matching complex revisited
Suppose C is a singular curve in CP^2 and it is topologically an embedded surface of genus g; such curves are called cuspidal. The singularities of C are cones on knots K_i. We apply Heegaard Floer theory to find new constraints on the sets…
Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…
A compact K\"ahler manifold is shown to be simply-connected if its `symmetric cotangent algebra' is trivial. Conjecturally, such a manifold should even be rationally connected. The relative version is also shown: a proper surjective…
It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…
The family of right-angled tiling links consists of links built from regular 4-valent tilings of constant-curvature surfaces that contain one or two types of tiles. The complements of these links admit complete hyperbolic structures and…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
The dual complex of a singularity is defined, up-to homotopy, using resolutions of singularities. In many cases, for instance for isolated singularities, we identify and study a "minimal" representative of the homotopy class that is well…
The weak variant of Hanani-Tutte theorem says that a graph is planar, if it can be drawn in the plane so that every pair of edges cross an even number of times. Moreover, we can turn such a drawing into an embedding without changing the…
We show that the finite simply connected 2-complexes of nonpositive planar sectional curvature are collapsible. Moreover, we show that each finite connected 2-complex with negative planar sectional curvature and fundamental group…
We recapture Kuperberg's numerical invariant of 3-manifolds associated to a semisimple and cosemisimple Hopf algebra through a `planar algebra construction'. A result of possibly independent interest, used during the proof, which relates…
The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…
The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[m]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [m]$ of $[m]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…
We provide another approach to Friedland's result that the topological entropy $h$ of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic technique, our approach is mostly combinatorial and involves only…
Let A be a basic connected finite dimensional algebra over an algebraically closed field, let G be a group, let T be a basic tilting A-module and let B the endomorphism algebra of T. Under a hypothesis on T, we establish a correspondence…
Let $H$ be a finite dimensional hereditary algebra over an algebraically closed field $k$ and $\mathscr{C}_{F^m}$ be the repetitive cluster category of $H$ with $m\geq 1$. We investigate the properties of cluster tilting objects in…
A planar framework -- a graph together with a map of its vertices to the plane -- is flexible if it allows a continuous deformation preserving the distances between adjacent vertices. Extending a recent previous result, we prove that a…
It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is symmetric. In the present paper, this assertion is dissected into three separate matrix results of wider scope, which are extended also to…
The vertex corona of a vertex of some tiling is the vertex together with the adjacent tiles. A tiling where all vertex coronae are congruent is called monocoronal. We provide a classification of monocoronal tilings in the Euclidean plane…
A (general) polygonal line tiling is a graph formed by a string of cycles, each intersecting the previous at an edge, no three intersecting. In 2022, Matsushita proved the matching complex of a certain type of polygonal line tiling with…
We discuss the question whether the existence of perfect matchings in a cubic graph can be seen from the spectrum of its adjacency matrix. For regular graphs in general and for three edge-disjoint perfect matchings in a cubic graph (that…