Related papers: Vanishing of l^2-cohomology as a computational pro…

Given an $L^2$-acyclic connected finite $CW$-complex, we define its universal $L^2$-torsion in terms of the chain complex of its universal covering. It takes values in the weak Whitehead group $\operatorname{Wh}^w(G)$. We study its main…

A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…

We exhibit infinitely many natural numbers $n$ for which there exists at least one insolvable group of order $n$, and yet the holomorph of any solvable group of order $n$ has no insolvable regular subgroup. We also solve Problem 19.90 (d)…

Given a finite group $G$, we say that $G$ has weak normal covering number $\gamma_w(G)$ if $\gamma_w(G)$ is the smallest integer with $G$ admitting proper subgroups $H_1,\ldots,H_{\gamma_w(G)}$ such that each element of $G$ has a conjugate…

We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated…

We initiate the study of holomorphically convex groups: groups that can be realized as fundamental groups of smooth complex projective varieties with holomorphically convex universal covers. If $G$ is a holomorphically convex group of…

We generalize a recent result by J.F. Carlson to finite tensor categories having finitely generated cohomology. Specifically, we show that if the Krull dimension of the cohomology ring is sufficiently large, then there exist infinitely many…

If X is a CW complex, one can assign to each point of X an ordered abelian group of finite rank whose subset of positive elements depends continuously on the points of X. A locally trivial bundle which arises in this way we denote by E(X).…

This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second…

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

We study the cohomology of symbolic dynamical systems called homshifts: they are the nearest-neighbour $\mathbb{Z}^d$ shifts of finite type whose adjacency rules are the same in every direction. Building on the work of Klaus Schmidt…

Let $X$ be a singular Hermitian complex space of pure dimension $n$. We use a resolution of singularities to give a smooth representation of the $L^2$-$\overline\partial$-cohomology of $(n,q)$-forms on $X$. The central tool is an…

In many simple integral domains, such as $\mathbb{Z}$ or $\mathbb{Z}[i]$, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact…

Let $G$ be the simple algebraic group $SL_2$ defined over an algebraically closed field $K$ of characteristic $p>0$. In this paper, we find the second cohomology of all irreducible representations of $G$

For any Coxeter group W, we define a filtration of H^*(W;ZW) by W-submodules and then compute the associated graded terms. More generally, if U is a CW complex on which W acts as a reflection group we compute the associated graded terms for…

Using $L^2$-methods, we prove a vanishing theorem for tame harmonic bundles over quasi-compact K\"ahler manifolds in a very general setting. As a special case, we give a completely new proof of the Kodaira type vanishing theorems for Higgs…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

The braid group has recently attracted much attention. This is primarily based upon the discovery of its usage in various cryptosystems [AAG],[KLCHKP]. One major focus of current research has been in solving decision problems in braid…

In this paper we prove, without the finite rank assumption, that any irreducible Coxeter group of infinite order is directly indecomposable as an abstract group. The key ingredient of the proof is that we can determine, for an irreducible…

We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral…