Related papers: (Injective) facet-complexity between simplicial co…
A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…
By a quasi-representation of a group $G$ we mean an approximately multiplicative map of $G$ to the unitary group of a unital $C^*$-algebra. A quasi-representation induces a partially defined map at the level $K$-theory. In the early 90s…
We consider singularities of frontal surfaces of corank one and finite frontal codimension. We look at the classification under left-right-equivalence and introduce the notion of frontalisation for singularities of fold type. We define the…
In this paper we address the classification problem for purely infinite simple Leavitt path algebras of finite graphs over a field $\ell$. Each graph $E$ has associated a Leavitt path $\ell$-algebra $L(E)$. There is an open question which…
Denham, Suciu and Panov, Ray computed ranks of homotopy groups and Poincar\'e series of a moment-angle-complex $\mathcal Z(\mathcal K$) / Davis-Januzskiewicz space $DJ(\mathcal K)$ associated to a flag simplicial complex $\mathcal K$. In…
Simple semitoric systems were classified about ten years ago in terms of a collection of invariants, essentially given by a convex polygon with some marked points corresponding to focus-focus singularities. Each marked point is endowed with…
If $E$ is a directed graph, $K$ is a field, and $I$ is a graded ideal of the Leavitt path algebra $L_K(E),$ $I$ is completely determined by an admissible pair $(H,S)$ of two sets of vertices of $E$. The ideal $I=I(H,S)$ is graded isomorphic…
Obstacle representations of graphs have been investigated quite intensely over the last few years. We focus on graphs that can be represented by a single obstacle. Given a (topologically open) polygon $C$ and a finite set $P$ of points in…
An integral quadratic lattice is called indefinite $k$-universal if it represents all integral quadratic lattices of rank $k$ for a given positive integer $k$. For $k\geq 3$, we prove that the indefinite $k$-universal property satisfies the…
The Hom complex ${\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\rm Hom}(T,G)$ give lower bounds for the…
Simplicial identities play an important and fundamental role in simplicial homotopy theory. On the other hand, the study of the paths and the regular paths on discrete sets is the foundation for the path-homology theory of digraphs. In this…
Let (g,k) be a reductive symmetric superpair of even type, i.e. so that there exists an even Cartan subspace a in p. The restriction map S(p^*)^k->S(a^*)^W where W=W(g_0:a) is the Weyl group, is injective. We determine its image explicitly.…
Let $K$ be a simplical complex, and let $\mathcal{L}_i^{up}(K), \mathcal{Q}_i^{up}(K)$ be the $i$-th up Laplacian and signless Laplacian of $K$, respectively. In this paper we proved that the largest eigenvalue of $\mathcal{L}_i^{up}(K)$ is…
Given an arbitrary hypergraph $\mathcal{H}$, we may glue to $\mathcal{H}$ a family of hypergraphs to get a new hypergraph $\mathcal{H}'$ having $\mathcal{H}$ as an induced subhypergraph. In this paper, we introduce three gluing techniques…
The chiral equivariant cohomology contains and generalizes the classical equivariant cohomology of a manifold M with an action of a compact Lie group G. For any simple G, there exist compact manifolds with the same classical equivariant…
We present a short proof of the \v{C}adek-Kr\v{c}\'al-Matou\v{s}ek-Vok\v{r}\'inek-Wagner result from the title (in the following form due to Filakovsk\'y-Wagner-Zhechev). For any fixed even $l$ there is no algorithm recognizing the…
In the 1980's Daryl Cooper introduced the notion of a C-complex (or clasp-complex) bounded by a link and explained how to compute signatures and polynomial invariants using a C-complex. Since then this was extended by works of Cimasoni,…
This paper introduces the foliage partition, an easy-to-compute LC-invariant for graph states, of computational complexity $\mathcal{O}(n^3)$ in the number of qubits. Inspired by the foliage of a graph, our invariant has a natural graphical…
In recent times a great amount of progress has been achieved in symplectic and contact geometry, leading to the development of powerful invariants of 3-manifolds such as Heegaard Floer homology and embedded contact homology. These…
We consider the problem of deciding whether an input graph G admits a topological embedding into a two-dimensional simplicial complex C. This problem includes, among others, the embeddability problem of a graph on a surface and the…