Related papers: A Computably Enumerable $tt$-Degree Without Comput…

A countable group is C*-simple if its reduced C*-algebra is simple. It is well known that C*-simplicity implies that the amenable radical of the group must be trivial. We show that the converse does not hold by constructing explicit…

We classify order $3$ linear difference operators over $\mathbb{C}(x)$ that are solvable in terms of lower order difference operators. To prove this result, we introduce the notion of absolute irreducibility for difference modules, and…

Kronecker observed that either all roots or only one root of a solvable irreducible equation of odd prime degree with integer coefficients are real. This gives a possibility to construct specific examples of equations not solvable by…

For a degree $n$ polynomial $f$ over the rationals, the elements in the fiber $f^{-1}(a)$ are of degree $n$ over $\mathbb Q$ for most rational values $a$ by Hilbert's irreducibility theorem. Determining the set of exceptional $a$'s without…

Let A be a simple, unital, exact, and finite C*-algebra which absorbs the Jiang-Su algebra Z tensorially. We prove that the Cuntz semigroup of A admits a complete order embedding into an ordered semigroup obtained from the Elliott invariant…

We study the \emph{Bipartite Degree Realization} (BDR) problem: given a graphic degree sequence $D$, decide whether it admits a realization as a bipartite graph. While bipartite realizability for a fixed vertex partition can be decided in…

In this paper we consider the even monic degree-8 cuboid polynomial $P_{a,u}(t)$ with coprime integers $a\neq u>0$. We prove irreducibility over $\mathbb{Z}$ by excluding all degree-8 splittings. First, any putative $4{+}4$ factorization is…

We show that, if a simple $C^{*}$-algebra $A$ is topologically finite-dimensional in a suitable sense, then not only $K_{0}(A)$ has certain good properties, but $A$ is even accessible to Elliott's classification program. More precisely, we…

This paper presents categorical formulations of Turing, Medvedev, Muchnik, and Weihrauch reducibilities in Computability Theory, utilizing Lawvere doctrines. While the first notions lend themselves to a smooth categorical presentation,…

In this paper, we prove that the variety $C_m(L)$ of commuting $m$-tuples of elements of simple Lie algebra $L$ is often reducible. Explicitely, we prove it is reducible for all simple Lie algebra $L$ not isomorphic to $\mathfrak{sl}_2$ and…

In this note, we prove that for every integer $d\geq 2$ which is not a prime power, there exists a finite solvable group $G$ such that $d\mid |G|$, $\pi(G)=\pi(d)$ and $G$ has no subgroup of order $d$. We also introduce the CLT-degree of a…

We prove that the incidence scheme of rational curves of degree 11 on quintic threefolds is irreducible. This implies a strong form of the Clemens conjecture in degree 11. Namely, on a general quintic threefold $F$ in $\mathbb{P}^4$, there…

In this paper, we present a conjecture on the degree of unipotent characters in the cohomology of particular Deligne-Lusztig varieties for groups of Lie type, and derive consequences of it. These degrees are a necessary piece of data in the…

In recent years, a large class of nuclear $C^\ast$-algebras have been classified, modulo an assumption on the Universal Coefficient Theorem (UCT). We think this assumption is redundant and propose a strategy for proving it. Indeed,…

For a labelled tree on the vertex set $[n]:=\{1,2,..., n\}$, define the direction of each edge $ij$ to be $i\to j$ if $i<j$. The indegree sequence of $T$ can be considered as a partition $\lambda \vdash n-1$. The enumeration of trees with a…

Let $C\subset \bold P^r$ be an integral projective curve. One defines the speciality index $e(C)$ of $C$ as the maximal integer $t$ such that $h^0(C,\omega_C(-t))>0$, where $\omega_C$ denotes the dualizing sheaf of $C$. Extending a…

Let N be a normal subgroup of a finite group G and consider the set cd(G|N) of degrees of irreducible characters of G whose kernels do not contain N. A number of theorems are proved relating the set cd(G|N) to the structure of N. For…

We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is $\bf{0^{(\alpha)}}$ for…

The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate…

Let $C_1,C_2\subseteq\mathbb{G}_m^N(\mathbb{C})$ be irreducible closed algebraic curves, with $N\geq 3$. Suppose $C_1$ is not contained in an algebraic subgroup of $\mathbb{G}_m^N(\mathbb{C})$ of dimension $1$ and $C_1\cup C_2$ is not…