Related papers: Complexity of the homomorphism extension problem i…

This paper surveys, and in some cases generalises, many of the recent results on homomorphisms and the higher Ext groups for q-Schur algebras and for the Hecke algebra of type A. We review various results giving isomorphisms between Ext…

The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of…

Consider a smooth connected algebraic group $G$ acting on a normal projective variety $X$ with an open dense orbit. We show that Aut($X$) is a linear algebraic group if so is $G$; for an arbitrary $G$, the group of components of Aut($X$) is…

In this paper we show that the following problem is NP-complete: Given an alphabet $\Sigma$ and two strings over $\Sigma$, the question is whether there exists a permutation of $\Sigma$ which is a subsequence of both of the given strings.

In this paper, we study the isomorphism problem for central extensions. More precisely, in some new situations, we provide necessary and sufficient conditions for two central extensions to be isomorphic. We investigate the case when the…

We consider the problem of birationally modifying a morphism of complete varieties to make it a morphism from a nonsingular variety to a normal variety. Our main result is to give a counterexample to this problem. This example also is a…

We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that…

In this paper we are interested in the fine-grained complexity of deciding whether there is a homomorphism from an input graph $G$ to a fixed graph $H$ (the $H$-Coloring problem). The starting point is that these problems can be viewed as…

Do complexity classes have many-one complete sets if and only if they have Turing-complete sets? We prove that there is a relativized world in which a relatively natural complexity class-namely a downward closure of NP, \rsnnp - has…

Let integer $n \ge 3$ and integer $r = r(n) \ge 3$. Define the binomial random $r$-uniform hypergraph $H_r(n, p)$ to be the $r$-uniform graph on the vertex set $[n]$ such that each $r$-set is an edge independently with probability $p$. A…

Let $X$ be a quasi-affine algebraic variety isomorphic to the complement of a closed subvariety of dimension at most $n-3$ in $\C^n$. We find some conditions under which an isomorphism of two closed subvarieties of $X$ can be extended to an…

A homogeneous family of subsets over a given set is one with a very ``rich'' automorphism group. We prove the existence of a bi-universal element in the class of homogeneous families over a given infinite set and give an explicit…

Let $P$ be a finite poset. We will show that for any reasonable $P$-persistent object $X$ in the category of finite topological spaces, there is a $P-$ weighted graph, whose clique complex has the same $P$-persistent homology as $X$.

For a connected finite poset $P$, let $E(P)$ be the poset induced by the extremal points of $P$. We show that the fixed point property of $E(P)$ implies the fixed point property of $P$. On the other hand, we show that a homomorphism $f :…

We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…

Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…

For a fixed graph $H$ and for arbitrarily large host graphs $G$, the number of homomorphisms from $H$ to $G$ and the number of subgraphs isomorphic to $H$ contained in $G$ have been extensively studied in extremal graph theory and graph…

We study random, finite-dimensional, ungraded chain complexes over a finite field and show that for a uniformly distributed differential a complex has the smallest possible homology with the highest probability: either zero or…

We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…

We extend some classical results of Bousfield on homology localizations and nilpotent completions to a presentably symmetric monoidal stable $\infty$-category $\mathscr{M}$ admitting a multiplicative left-complete $t$-structure. If $E$ is a…