Related papers: Complexity of the homomorphism extension problem i…

It was shown in Alur et al. [1] that the problem of verifying finite concurrent systems through Linearizability is in EXPSPACE. However, there was still a complexity gap between the easy to obtain PSPACE lower bound and the EXPSPACE upper…

Let X be a smooth complex algebraic variety. Morgan [Mor78] showed that the rational homotopy type of X is a formal consequence of the differential graded algebra defined by the first term of its weight spectral sequence. In the present…

In this paper we shall prove that any $2$-transitive finitely homogeneous structure with a supersimple theory satisfying a generalized amalgamation property is a random structure. In particular, this adapts a result of Koponen for binary…

A plurisubharmonic singularity is extreme if it cannot be represented as the sum of non-homothetic singularities. A complete characterization of such singularities is given for the case of homogeneous singularities (in particular, those…

Let $C,A$ be countable abelian groups. In this paper we determine the complexity of classifying extensions $C$ by $A$, in the cases when $C$ is torsion-free and $A$ is a $p$-group, a torsion group with bounded primary components, or a free…

We consider the complexity of counting homomorphisms from an $r$-uniform hypergraph $G$ to a symmetric $r$-ary relation $H$. We give a dichotomy theorem for $r>2$, showing for which $H$ this problem is in FP and for which $H$ it is…

We investigate the complexity of a puzzle that turns out to be NL-complete.

In the present paper, we study the match test for extended regular expressions. We approach this NP-complete problem by introducing a novel variant of two-way multihead automata, which reveals that the complexity of the match test is…

This paper shows that for K a local field, k a subfield of K and X a variety over k, X is complete if and only if for every finite field extension K' of K, X(K') is compact in its strong topology.

We apply results proved in [Li19] to the linear order expansions of non-trivial free homogeneous structures and the universal n-linear order for $n\geq 2$, and prove the simplicity of their automorphism groups.

We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned…

A length-$n$ random sequence $X_1,\ldots,X_n$ in a space $S$ is finitely exchangeable if its distribution is invariant under all $n!$ permutations of coordinates. Given $N > n$, we study the extendibility problem: when is it the case that…

Let $r$ be a positive integer. An $r$-set is a pair $X= (V(X),R(X))$ consisting of a set $V(X)$ with a subset $R(X)$ of the direct product $V(X)^r$. The object of this paper is to investigate the Hom complexes of $r$-sets, which were…

A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…

We revisit the algorithmic problem of reconstructing a graph from homomorphism counts that has first been studied in (B\"oker et al., STACS 2024): given graphs $F_1,\ldots,F_k$ and counts $m_1,\ldots,m_k$, decide if there is a graph $G$…

This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…

We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…

We introduce a variant of contact homology for convex open contact manifolds. As an application, we prove the existence of (in fact, infinitely many) exotic tight contact structures on $\mathbb{R}^{2n-1}$ for all $n>2$.

We prove explicit estimates for the error in random homogenization of degenerate, second-order Hamilton-Jacobi equations, assuming the coefficients satisfy a finite range of dependence. In particular, we obtain an algebraic rate of…

We characterize the sets of solvability for Hermite multivariate interpolation problems when the sum of multiplicities is at most $2n + 2$, with $n$ the degree of the polynomial space. This result extends an earlier theorem (2000) by one of…