Related papers: Low$_2$ computably enumerable sets have hyperhyper…

In a simple C*-algebra with suitable regularity properties, any unitary or invertible element with de la Harpe--Skandalis determinant zero is a finite product of commutators.

In this paper we determine the precise extent to which the classical sl_2-theory of complex semisimple finite-dimensional Lie algebras due to Jacobson--Morozov and Kostant can be extended to positive characteristic. This builds on work of…

We prove that the reduced group C*-algebras of infinite countable discrete groups having topologically-free extreme boundaries, or more generally groups that satisfy certain combinatorial property including all acylindrically hyperbolic…

We solve a class of lifting problems involving approximate polynomial relations (soft polynomial relations). Various associated C*-algebras are therefore projective. The technical lemma we need is a new manifestation of Akemann and…

For a given subset $A\subseteq \mathbb F_q^*$, we study the problem of finding a large packing set $B$ of $A$, that is, a set $B \subseteq \mathbb F_q^*$ such that $|AB|=|A||B|$. We prove the existence of such a $B$ of size $|B|\ge…

We initiate the study of the effective content of $K$-theory for $\mathrm{C}^*$-algebras. We prove that there are computable functors which associate, to a computably enumerable presentation of a $\mathrm{C}^*$-algebra $\boldA$, computably…

We show that for any set $A \subset \mathbb{N}$ with positive upper density and any $\ell,m \in \mathbb{N}$, there exist an infinite set $B\subset \mathbb{N}$ and some $t\in \mathbb{N}$ so that $\{mb_1 + \ell b_2 \colon b_1,b_2\in B\…

A finite hypergraph $H$ consists of a finite set of vertices $V(H)$ and a collection of subsets $E(H) \subseteq 2^{V(H)}$ which we consider as partition of unity relations between projection operators. These partition of unity relations…

A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…

In the late 1980s, A. Premet conjectured that the variety of nilpotent elements of any finite dimensional restricted Lie algebra over an algebraically closed field of characteristic $p>0$ is irreducible. This conjecture remains open, but it…

The study of minimal complements in a group or a semigroup was initiated by Nathanson. The notion of minimal complements and being a minimal complement leads to the notion of co-minimal pairs which was considered in a prior work of the…

This paper is a contribution to the study of the subgroup structure of exceptional algebraic groups over algebraically closed fields of arbitrary characteristic. Following Serre, a closed subgroup of a semisimple algebraic group $G$ is…

In the context of product-line engineering and feature models, atomic sets are sets of features that must always be selected together in order for a configuration to be valid. For many analyses and applications, these features may be…

Suppose that G is a discrete abelian group and A is a finite symmetric subset of G. We show two main results. i) Either there is a set H of O(log^c|A|) subgroups of G with |A \triangle \bigcup H| = o(|A|), or there is a character X on G…

For a discrete group G, we consider the minimal C*-subalgebra of $\ell^\infty(G)$ that arises as the image of a unital positive G-equivariant projection. This algebra always exists and is unique up to isomorphism. It is trivial if and only…

Let $\mathcal A$ be a simple, $\sigma$-unital, non-unital, non-elementary C*-algebra and let $I_{min}$ be the intersection of all the ideals of $\mathcal M(\mathcal A)$ that properly contain $\mathcal A$. $I_{min}$ coincides with the ideal…

Kirchberg's Embedding Problem (KEP) asks whether every separable C$^*$ algebra embeds into an ultrapower of the Cuntz algebra $\mathcal{O}_2$. In this paper, we use model theory to show that this conjecture is equivalent to a local…

In statistical physics, the challenging combinatorial enumeration of the configurations of a system subject to hard constraints (microcanonical ensemble) is mapped to a mathematically easier calculation where the constraints are softened…

We study the computably enumerable sets in terms of the: (a) Kolmogorov complexity of their initial segments; (b) Kolmogorov complexity of finite programs when they are used as oracles. We present an extended discussion of the existing…

We show that a separable purely infinite C*-algebra is of real rank zero if and only if its primitive ideal space has a basis consisting of compact-open sets and the natural map K_0(I) -> K_0(I/J) is surjective for all closed two-sided…