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

To do homological algebra with unbounded chain complexes one needs to first find a way of constructing resolutions. Spaltenstein solved this problem for chain complexes of R-modules by truncating further and further to the left, resolving…

The paper constructs an `exotic' algebraic 2-complex over the generalized quaternion group of order 28, with the boundary maps given by explicit matrices over the group ring. This result depends on showing that a certain ideal of the group…

Inspired by computational complexity results for the quantified constraint satisfaction problem, we study the clones of idempotent polymorphisms of certain digraph classes. Our first results are two algebraic dichotomy, even "gap",…

We study the interplay among Wall's $D(2)$ problem, normal generation conjecture (the Wiegold Conjecture) of perfect groups and Swan's problem on partial Euler characteristic and deficiency of groups. In particular, for a 3-dimensional…

The objective of this work is to reconsider the schematization problem of [6], with a particular focus on the global case over Z. For this, we prove the conjecture [Conj. 2.3.6][15] which gives a formula for the homotopy groups of the…

We establish a bridge between homotopy groups of spheres and commutator calculus in groups, and solve in this manner the "dimension problem" by providing a converse to Sjogren's theorem: every abelian group of bounded exponent can be…

We present new, unified proofs for the cell-like, $\mathbb{Z}/p$-, and $\mathbb{Q}$-resolution theorems. Our arguments employ extensions that are much simpler then those used by our predecessors. The techniques allow us to solve problems…

We develop a unified framework to characterize the power of higher-level algorithms for the constraint satisfaction problem (CSP), such as $k$-consistency, the Sherali-Adams LP hierarchy, and the affine IP hierarchy. As a result,…

To any fixed, finite relational structure, $\mathbb{D}$, there is an associated decision problem, CSP$(\mathbb{D})$, which is a restricted version of the constraint satisfaction problem. In [8], the so called "algebraic approach" to the…

Let $D$ be a digraph on $p\geq 5$ vertices with minimum degree at least $p-1$ and with minimum semi-degree at least $p/2-1$. For $D$ (unless some extremal cases) we present a detailed proof of the following results [12]: (i) $D$ contains…

The main result of [4] is that all finitely presented groups of p-deficiency greater than one are p-large. Here we prove that groups with a finite presentation of p-deficiency one possess a finite index subgroup that surjects onto . This…

Contents: Rational functions with given monodromy on generic curves (I. Bouw & S. Wewers); Can deformation rings of group representations not be local complete intersections? (T. Chinburg); Lifting an automorphism group to finite…

The D2 problem of C. T. C. Wall asks whether every finite cohomologically 2-dimensional CW-complex is homotopy equivalent to a finite 2-complex. Several potential counterexamples have been proposed, the longest standing of which is a…

Given a $T_0$ paratopological group $G$ and a class $\mathcal C$ of continuous homomorphisms of paratopological groups, we define the $\mathcal C$-$semicompletion$ $\mathcal C[G)$ and $\mathcal C$-$completion$ $\mathcal C[G]$ of the group…

We consider N-body problems with homogeneous potential $1/r^{2\kappa}$ where $\kappa\in(0,1)$, including the Newtonian case ($\kappa=1/2$). Given $R>0$ and $T>0$, we find a uniform upper bound for the minimal action of paths binding in time…

We consider the problem of linear regression where the $\ell_2^n$ norm loss (i.e., the usual least squares loss) is replaced by the $\ell_p^n$ norm. We show how to solve such problems up to machine precision in $O^*(n^{|1/2 - 1/p|})$…

If $G$ has $4$-periodic cohomology, then D2 complexes over $G$ are determined up to polarised homotopy by their Euler characteristic if and only if $G$ has at most two one-dimensional quaternionic representations. We use this to solve…

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…

Let $G$ be a connected reductive group over a totally real field $F$ which is compact modulo center at archimedean places. We find congruences modulo an arbitrary power of p between the space of arbitrary automorphic forms on $G(\mathbb…