Related papers: GMSNP and Finite Structures

We study a combinatorial property of subsets in finite groups that is analogous to the notion of independence in graphs. Given a group $G$ and a non-empty subset $A\subset G$, we define a (right) $s$-factor as a subset $B\subset G$…

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…

An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP…

We study finite p-groups G of coclass upto 4 for which the group Aut_z(G) of all central automorphisms of G is of minimal possible order. As a consequence, we obtain very short and elementary proofs of main results of Sharma and Gumber [7].

A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…

The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T. We study the computational complexity of CSP$(T_1…

Conservative constraint satisfaction problems (CSPs) constitute an important particular case of the general CSP, in which the allowed values of each variable can be restricted in an arbitrary way. Problems of this type are well studied for…

For a finite relational structure A, let CSP(A) denote the CSP instances whose constraint relations are taken from A. The resulting family of problems CSP(A) has been considered heavily in a variety of computational contexts. In this…

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

We prove that relational structures admitting specific polymorphisms (namely, canonical pseudo-WNU operations of all arities $n \geq 3$) have low relational width. This implies a collapse of the bounded width hierarchy for numerous classes…

The binary Constraint Satisfaction Problem (CSP) is to decide whether there exists an assignment to a set of variables which satisfies specified constraints between pairs of variables. A binary CSP instance can be presented as a labelled…

The generalized Fitting height of a finite group $G$ is the least number $h=h^*(G)$ such that $F^*_h(G)=G$, where the $F^*_i(G)$ is the generalized Fitting series: $F^*_1(G)=F^*(G)$ and $F^*_{i+1}(G)$ is the inverse image of…

In this paper we explore the structure and properties of C-groups. We define a C-group as a group $G$ with $rk(G) < rk(Z(G))$ (where $rk(G)$ is the minimal cardinal of a generating set for a group $G$). Using GAP (a group theory program)…

The logic MMSNP is a well-studied fragment of Existential Second-Order logic that, from a computational perspective, captures finite-domain Constraint Satisfaction Problems (CSPs) modulo polynomial-time reductions. At the same time, MMSNP…

Let $G$ be a locally compact group with cocompact connected component. We prove that the assembly map from the topological $\k$-theory of $G$ to the $\k$-theory of the reduced $C^*$-algebra of $G$ is an isomorphism.

Following the success of the so-called algebraic approach to the study of decision constraint satisfaction problems (CSPs), exact optimization of valued CSPs, and most recently promise CSPs, we propose an algebraic framework for valued…

The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context we study the stability of CSP complexity and polymorphism properties under some basic graph theoretic…

Feder-Vardi conjecture, which proposed that every finite-domain Constraint Satisfaction Problem (CSP) is either in P or it is NP-complete, has been solved independently by Bulatov and Zhuk almost ten years ago. Bodirsky-Pinsker conjecture…

A finitely presented 1-ended group $G$ has {\it semistable fundamental group at infinity} if $G$ acts geometrically on a simply connected and locally compact ANR $Y$ having the property that any two proper rays in $Y$ are properly…

Let $G$ be a finite insoluble group with soluble radical $ R(G)$. The solubility graph $\Gamma_{\rm S}(G)$ of $G$ is a simple graph whose vertices are the elements of $G\setminus R(G) $ and two distinct vertices $x$ and $y$ are adjacent if…