Related papers: A candidate for a solution to Wall's D(2) problem

We investigate a conjecture about stabilisation of deficiency in finite index subgroups and relate it to the D2 Problem of C.T.C. Wall and the Relation Gap problem. We verify the pro-$p$ version of the conjecture, as well as its higher…

If a finite group $G$ is isomorphic to a subgroup of $SO(3)$, then $G$ has the D2-property. Let $X$ be a finite complex satisfying Wall's D2-conditions. If $\pi_1(X)=G$ is finite, and $\chi(X) \geq 1-Def(G)$, then $X \vee S^2$ is simple…

The realization problem asks: When does an algebraic complex arise, up to homotopy, from a geometric complex? In the case of 2- dimensional algebraic complexes, this is equivalent to the D2 problem, which asks when homological methods can…

A computational problem exhibits a "gap property" when there is no tractable boundary between two disjoint sets of instances. We establish a Gap Trichotomy Theorem for a family of constraint problem variants, completely classifying the…

A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable \omega-categorical relational structures have two algebraic counterparts for…

The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…

The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template…

A value of a CSP instance is typically defined as a fraction of constraints that can be simultaneously met. We propose an alternative definition of a value of an instance and show that, for purely combinatorial reasons, a value of an…

Wall's D(2) problem asks if a cohomologically 2-dimensional geometric 3-complex is necessarily homotopy equivalent to a geometric 2-complex. We solve part of the problem when the fundamental group is dihedral of order $2^n$, and offer a…

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…

In our previous work "Characterization of certain homorphic geodesic cycles on Hermitian locally symmetric manifolds of the noncompact type" in "Modern methods in Complex Analysis" Annals of Math. Studies 138 (1995) 85-118, we formulated a…

Recently, Schlage-Puchta proved super multiplicity of $p$-deficiency for normal subgroups of $p$-power index. We extend this result to all normal subgroups of finite index. We then use the methods of the proof to show that some groups with…

This paper is a synthesis and extension of three earlier papers on $PD_4$-complexes $X$ with fundamental group $\pi$ such that $c.d.\pi=2$ and $\pi$ has one end. Our goal is to show that the homotopy types of such complexes are determined…

Let $Q_m$ be the HNN extension of $\Z/m \times \Z/m$ where the stable letter conjugates the first factor to the second. We explore small presentations of the groups $\Gamma_{m,n}=Q_m \ast Q_n$. We show that for certain choices of (m,n), for…

The CSP (constraint satisfaction problems) is a class of problems deciding whether there exists a homomorphism from an instance relational structure to a target one. The CSP dichotomy is a profound result recently proved by Zhuk (2020, J.…

The constraint satisfaction problem (CSP) can be formulated as a homomorphism problem between relational structures: given a structure $\mathcal{A}$, for any structure $\mathcal{X}$, whether there exists a homomorphism from $\mathcal{X}$ to…

In ethics, individual responsibility is often defined through Frankfurt's principle of alternative possibilities. This definition is not adequate in a group decision-making setting because it often results in the lack of a responsible party…

The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable if the model-complete core of the template…

The paper contains three results, the common feature of which is that they deal with the Schatten $p$ class. The first is a presentation of a new complemented subspace of $C_p$ in the reflexive range (and $p\not= 2$). This construction…

The question whether non-isomorphic finite $p$-groups can have isomorphic modular group algebras was recently answered in the negative by Garc\'ia-Lucas, Margolis and del R\'io [J. Reine Angew. Math. 783 (2022), pp. 269-274]. We embed these…