Related papers: GMSNP and Finite Structures

We present a dichotomy for structures $A$ that are preserved by primitive actions of $S_{\omega} = \text{Sym}({\mathbb N})$: such a structure primitively positively constructs all finite structures and the constraint satisfaction problem is…

On finite structures, there is a well-known connection between the expressive power of Datalog, finite variable logics, the existential pebble game, and bounded hypertree duality. We study this connection for infinite structures. This has…

The solubilizer of an element $x$ of a profinite group $G$ is the set of the elements $y$ of $G$ such that the subgroup of $G$ generated by $x$ and $y$ is prosoluble. We propose the following conjecture: the solubilizer of $x$ in $G$ has…

The complexity and approximability of the constraint satisfaction problem (CSP) has been actively studied over the last 20 years. A new version of the CSP, the promise CSP (PCSP) has recently been proposed, motivated by open questions about…

In the field of constraint satisfaction problems (CSP), promise CSPs are an exciting new direction of study. In a promise CSP, each constraint comes in two forms: "strict" and "weak," and in the associated decision problem one must…

Let $G$ be a group and $H \le K \le G$. We say that $H$ is $c$-embedded in $G$ with respect to $K$ if there is a subgroup $B$ of $G$ such that $G = HB$ and $H \cap B \le Z(K)$. Given a finite group $G$, a prime number $p$ and a Sylow…

One of the central open problems to classify the computational complexity of finite-domain constraint satisfaction problems within P is to prove better algorithmic results for CSPs with a Maltsev polymorphism; we do not even know whether…

In this paper it is shown how to construct a finite topological space $X$ for a given finitely presentable group $G$ such that $\pi_1(X)\cong G$. Our construction is not optimal in the sense that the cardinality of the space $X$ might not…

We prove that the C*-algebra of a directed graph $E$ is liminal iff the graph satisfies the finiteness condition: if $p$ is an infinite path or a path ending with a sink or an infinite emitter, and if $v$ is any vertex, then there are only…

A group $\Gamma$ is said to be periodic if for any $g$ in $\Gamma$ there is a positive integer $n$ with $g^n=id$. We first prove that a finitely generated periodic group acting on the 2-sphere $\SS^2$ by $C^1$-diffeomorphisms with a finite…

Recently, Herbig--Schwarz--Seaton have shown that $3$-large representations of a reductive group $G$ give rise to a large class of symplectic singularities via Hamiltonian reduction. We show that these singularities are always terminal. We…

Promise Constraint Satisfaction Problems (PCSP) were proposed recently by Brakensiek and Guruswami arXiv:1704.01937 as a framework to study approximations for Constraint Satisfaction Problems (CSP). Informally a PCSP asks to distinguish…

This thesis investigates the extent to which the optimal value of a constraint satisfaction problem (CSP) can be approximated by some sentence of fixed point logic with counting (FPC). It is known that, assuming $\mathsf{P} \neq…

For a discrete group G, we consider the minimal C*-subalgebra of $\ell^\infty(G)$ that arises as the image of a unital positive G-equivariant projection. This algebra always exists and is unique up to isomorphism. It is trivial if and only…

We give a complexity dichotomy theorem for the counting Constraint Satisfaction Problem (#CSP in short) with complex weights. To this end, we give three conditions for its tractability. Let F be any finite set of complex-valued functions,…

Let $S$ and $\mathcal{C}$ be affine semigroups in $\mathbb{N}^d$ such that $S\subseteq \mathcal{C}$. We provide a characterization for the set $\mathcal{C}\setminus S$ to be finite, together with a procedure and computational tools to check…

Constraint Satisfaction Problems (CSPs) form a broad class of combinatorial problems, which can be formulated as homomorphism problems between relational structures. The CSP dichotomy theorem classifies all such problems over finite domains…

The quantified constraint satisfaction problem $\mathrm{QCSP}(\mathcal{A})$ is the problem to decide whether a positive Horn sentence, involving nothing more than the two quantifiers and conjunction, is true on some fixed structure…

We show that the finiteness length of an $S$-arithmetic subgroup $\Gamma$ in a noncommutative isotropic absolutely almost simple group $G$ over a global function field is one less than the sum of the local ranks of $G$ taken over the places…

We prove that a strictly stable minimal $C^2_h$ intrinsic graph G is locally area-minimizing, i.e. given any $C^1_h$ graph $S$ with the same boundary, $\text{Area}(G)<\text{Area}(S)$ unless $G=S$. As a consequence we show the existence and…