Related papers: Section Problems for Graph Configuration Spaces

Consider a reflection from a finitely-complete category $\mathbb{C}$ into its full subcategory $\mathbb{M}$, with unit $\eta :1_\mathbb{C}\rightarrow HI$. Suppose there is a left-exact functor $U$ into the category of sets, such that $UH$…

We give an alternative to Postnikov's homotopy classification of maps from 3-dimensional CW-complexes to homogeneous spaces G/H of Lie groups. It describes homotopy classes in terms of lifts to the group G and is suitable for extending the…

Given a symmetric D*D matrix M over {0,1,*}, a list M-partition of a graph G is a partition of G's vertices into D parts associated with the rows of M. The part of each vertex is chosen from a given list so that no edge of G maps to a 0 in…

In embedding calculus, spaces of embeddings are identified with derived mapping spaces between framed Fulton-MacPherson-type modules (framed configuration spaces). Unfortunately, there are no sufficiently good algebraic models for framed…

We study the problems of counting copies and induced copies of a small pattern graph $H$ in a large host graph $G$. Recent work fully classified the complexity of those problems according to structural restrictions on the patterns $H$. In…

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

In this paper, we show that for finite $CW$-complexes $X$ and two-stage space $Y$ (for example $n$-spheres $S^n$, homogeneous spaces and $F_0$-spaces), the rational homotopy type of $\map(X, Y)$ is determined by the cohomology algebra…

The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…

Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on a template, usually a set of relations, upon which they are…

The configuration category of a manifold is a topological category which we view as a Segal space, via the nerve construction. Our main result is that the unordered configuration category, suitably truncated, admits a finite presentation as…

For a class $\mathcal{G}$ of graphs, the objective of \textsc{Subgraph Complementation to} $\mathcal{G}$ is to find whether there exists a subset $S$ of vertices of the input graph $G$ such that modifying $G$ by complementing the subgraph…

Given a number field $k$ and a finite $k$-group $G$, the Tame Approximation Problem for $G$ asks whether the restriction map $H^1(k,G)\to\prod_{v\in\Sigma}H^1(k_v,G)$ is surjective for every finite set of places $\Sigma\subseteq\Omega_k$…

In \cite{HigherGnk}, the author has constructed natural maps from fundamental groups of topological spaces (restricted configuration spaces) to the groups $G_{n}^{k}$. In the present paper, we show that in the case of $n=k+1$, the group…

For a given $\pi=(\pi_0, \pi_1,..., \pi_k) \in \{0, 1, *\}^{k+1}$, we want to determine whether an input $k$-uniform hypergraph $G=(V, E)$ has a partition $(V_1, V_2)$ of the vertex set so that for all $X \subseteq V$ of size $k$, $X \in E$…

We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into another one in a step-by-step fashion. As one step of a transformation, we consider…

Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of…

We study the \emph{picture space} $X^d(G)$ of all embeddings of a finite graph $G$ as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural…

In this paper authors consider representations of graphs in Hilbert spaces applying a restriction of local scalarity on them. It enables to obtain a theory, similar to the classical theory of representations of graphs in vector spaces. In…

We consider convex maps f:R^n -> R^n that are monotone (i.e., that preserve the product ordering of R^n), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the…

Let $G$ be a graph on $n$ nodes. In this note, we prove that if $G$ is $(r+1)$-vertex connected, $1 \leq r \leq n-2$, then there exists a configuration $p$ in general position in $R^r$ such that the bar framework $(G,p)$ is universally…