Related papers: Salce's problem on cotorsion pairs is undecidable
We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…
Let G be a torsion free hyperbolic group. We prove that the elementary theory of G is decidable and admits an effective quantifier elimination to boolean combination of AE-formulas. The existence of such quantifier elimination was…
For a prime $\ell$ and an abelian variety $A$ over a global field $K$, the $\ell$-parity conjecture predicts that, in accordance with the ideas of Birch and Swinnerton-Dyer, the $\mathbb{Z}_{\ell}$-corank of the $\ell^{\infty}$-Selmer group…
Let $R$ be a ring and $\mathsf S$ be a class of strongly finitely presented (FP${}_\infty$) $R$-modules closed under extensions, direct summands, and syzygies. Let $(\mathsf A,\mathsf B)$ be the (hereditary complete) cotorsion pair…
A central conjecture in inverse Galois theory, proposed by D\`{e}bes and Deschamps, asserts that every finite split embedding problem over an arbitrary field can be regularly solved. We give an unconditional proof of a consequence of this…
We consider the following question by Balister, Gy\H{o}ri and Schelp: given $2^{n-1}$ nonzero vectors in $\mathbb{F}_2^n$ with zero sum, is it always possible to partition the elements of $\mathbb{F}_2^n$ into pairs such that the difference…
We define a class $\mathcal{U}$ of solvable groups of finite abelian section rank which includes all such groups that are virtually torsion-free as well as those that are finitely generated. Assume that $G$ is a group in $\mathcal{U}$ and…
The axiom of choice ensures precisely that, in ZFC, every set is projective: that is, a projective object in the category of sets. In constructive ZF (CZF) the existence of enough projective sets has been discussed as an additional axiom…
We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…
Epigroups are semigroups equipped with an additional unary operation called pseudoinversion. Each finite semigroup can be considered as epigroup. We prove the following theorem announced by Zhil'tsov in 2000: the equational theory of the…
We introduce a general version of singular compactness theorem which makes it possible to show that being a $\Sigma$-cotorsion module is a property of the complete theory of the module. As an application of the powerful tools developed…
We introduce the notion of a duality pair and demonstrate how the left half of such a pair is often covering and preenveloping. As an application, we generalize a result by Enochs et al. on Auslander and Bass classes, and we prove that the…
We study algebraic complexity classes and their complete polynomials under \emph{homogeneous linear} projections, not just under the usual affine linear projections that were originally introduced by Valiant in 1979. These reductions are…
We study modal separability for fixpoint formulae: given two mutually exclusive fixpoint formulae $\varphi,\varphi'$, decide whether there is a modal formula $\psi$ that separates them, that is, that satisfies…
In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n.…
Schaefer's dichotomy theorem [Schaefer, STOC'78] states that a boolean constraint satisfaction problem (CSP) is polynomial-time solvable if one of six given conditions holds for every type of constraint allowed in its instances. Otherwise,…
The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order \emph{theories}, i.e.,…
We compute the number of orbits of pairs in a finitely generated torsion module (more generally, a module of bounded order) over a discrete valuation ring. The answer is found to be a polynomial in the cardinality of the residue field whose…
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…
We strengthen a result of Bagaria and Magidor~\cite{MR3152715} about the relationship between large cardinals and torsion classes of abelian groups, and prove that (1) the \emph{Maximum Deconstructibility} principle introduced in…