Related papers: Farber's conjecture and beyond

Starting from Borel's description of the mod-2 cohomology of real flag manifolds, we give a minimal presentation of the cohomology ring for semi complete flag manifolds $F_{k,m}:=F(1,\ldots,1,m)$ where $1$ is repeated $k$ times. The…

Various connections between the theory of permutation groups and the theory of topological groups are described. These connections are applied in permutation group theory and in the structure theory of topological groups. The first draft of…

End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…

Using the ordered analogue of Farley-Sabalka's discrete gradient field on the configuration space of a graph, we unravel a levelwise behavior of the generators of the pure braid group on a tree. This allows us to generalize Farber's…

This is an elementary introduction to the Hodge Laplacian on a graph, a higher-order generalization of the graph Laplacian. We will discuss basic properties including cohomology and Hodge theory. The main feature of our approach is…

We study a probabilistic variant of the r-th sequential parametrized topological complexity, which bounds this classical invariant from below and measures the difficulty in constructing permissive parametrized motion planning algorithms. On…

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

This survey is a guide for the non specialist on how to use rational homotopy theory techniques to get approximations of Farber's topological complexity, in particular, and of Schwarz's sectional category, in general.

The main purpose of this note is to pose a couple of problems which are easily formulated thought some seem to be not yet solved. These problems are of general interest for discrete mathematics including a new twig of a bough of theory of…

We study graph complexes related to configuration spaces and diffeomorphism groups of highly connected manifolds of odd dimension. In particular we compute the cohomology in the "high genus" limit. This paper is a continuation of previous…

The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back…

Recent work by Abramsky and Brandenburger used sheaf theory to give a mathematical formulation of non-locality and contextuality. By adopting this viewpoint, it has been possible to define cohomological obstructions to the existence of…

We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…

The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…

In this survey we present the history and recent progress on several fundamental (quasi)conformal uniformization problems in the complex plane. Uniformization refers to the process of mapping a space to a canonical model by means of a…

Many real-world phenomena are naturally modeled by graphs and networks. However, classical graph models are often limited to pairwise interactions and may not adequately capture the richer structures that arise in practice. Higher-order…

We connect and solve two longstanding open problems in quite different areas: the model-theoretic question of whether $SOP_2$ is maximal in Keisler's order, and the question from set theory/general topology of whether $\mathfrak{p} =…

This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…

The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…

Score-based approaches in the structure learning task are thriving because of their scalability. Continuous relaxation has been the key reason for this advancement. Despite achieving promising outcomes, most of these methods are still…