Related papers: An intrinsically linked simplicial $n$-complex
Classical and quantum superintegrable systems have a long history and they possess more integrals of motion than degrees of freedom. They have many attractive properties, wide applications in modern physics and connection to many domains in…
For integers $k\geq 1$ and $n\geq 2k+1$, the Schrijver graph $S(n,k)$ has as vertices all $k$-element subsets of $[n]:=\{1,2,\ldots,n\}$ that contain no two cyclically adjacent elements, and an edge between any two disjoint sets. More…
In this paper we give a positive answer to the open existence problem for complex-valued harmonic morphisms from the non-compact irreducible Riemannian symmetric spaces $SL_n(R)/SO(n)$, $SU^*(2n)/Sp(n)$ and their compact duals $SU(n)/SO(n)$…
A graph is chordal if it contains no induced cycle of length four or more. While finite chordal graphs are precisely those admitting tree-decompositions into cliques, this fails for infinite graphs. We establish two results extending the…
A vertex in a graph is simplicial if its neighborhood forms a clique. We consider three generalizations of the concept of simplicial vertices: avoidable vertices (also known as \textit{OCF}-vertices), simplicial paths, and their common…
The general idea of this paper is to start from a classical integrable (partial differential) equation which arises as a compatibility condition for a matrix linear differential problem. For definitiveness' sake, a generalised sinh-Gordon…
We prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and…
In a recent paper [J. Combin. Theory Ser. B}, 113 (2015), pp. 1-17], the authors have extended the concept of quadrangulation of a surface to higher dimension, and showed that every quadrangulation of the $n$-dimensional projective space…
Let $L_n$ denote the Dwyer-Kan localization of the category of weak n-categories divided by the n-equivalences. We propose a list of properties that this simplicial category is likely to have, and conjecture that these properties…
We introduce a generalization of the celebrated Lov\'asz theta number of a graph to simplicial complexes of arbitrary dimension. Our generalization takes advantage of real simplicial cohomology theory, in particular combinatorial…
We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…
A $2$-matching complex is a simplicial complex which captures the relationship between $2$-matchings of a graph. In this paper, we will use discrete Morse Theory and the Matching Tree Algorithm to prove homotopical results. We will consider…
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…
We develop the properties of the $n$-th sequential topological complexity $TC_n$, a homotopy invariant introduced by the third author as an extension of Farber's topological model for studying the complexity of motion planning algorithms in…
The theory of $N$-complexes is a generalization of both ordinary chain complexes and graded objects. Hence it yields deeper insight in the structure of these and offers a broader range of applications. This work generalizes the tensor…
We examine the topology of the clique complexes of the graphs of weakly and strongly separated subsets of the set $[n]=\{1,2,...,n\}$, which, after deleting all cone points, we denote by $\hat{\Delta}_{ws}(n)$ and $\hat{\Delta}_{ss}(n)$,…
We study multiplicative quiver varieties associated to specific extensions of cyclic quivers with $m\geq 2$ vertices. Their global Poisson structure is characterised by quasi-Hamiltonian algebras related to these quivers, which were studied…
We categorify the notion of an infinitesimal braiding in a linear strict symmetric monoidal category, leading to the notion of a (strict) infinitesimal 2-braiding in a linear symmetric strict monoidal 2-category. We describe the associated…
We classify isomorphism and chain homotopy equivalence classes of finitely generated $\mathbb{Z} \oplus \mathbb{Z}$ graded free chain complexes over $\frac{\mathbb{F}[U,V]}{(UV)}$. As a corollary, we establish that every link Floer complex…
We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…