Related papers: There is No Composition in the Computable Reducibi…

Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\leq_c$. This gives rise to a rich degree-structure. In this…

The assembly index of assembly theory quantifies the minimal number of composition steps required to construct an object from elementary components. The study proves that the decision version of the assembly index problem is NP-complete,…

Over the past two decades, there has been much progress on the classification of symplectic linear quotient singularities V/G admitting a symplectic (equivalently, crepant) resolution of singularities. The classification is almost complete…

We say that a theory $T$ is intermediate under effective reducibility if the isomorphism problems among its computable models is neither hyperarithmetic nor on top under effective reducibility. We prove that if an infinitary sentence $T$ is…

Let $\mathcal{W}(b)$ be a class of free Lie conformal algebras of rank $2$ with $\mathbb{C}[\partial]$-basis ${L,H}$ and relations \begin{eqnarray*} [L_\lambda L]=(\partial+2\lambda)L,\ \ [L_\lambda H]=\big(\partial+(1-b)\lambda\big)H, \ \…

Let $A$ be a finite-dimensional algebra over an algebraically closed field $\Bbbk$. For any finite-dimensional $A$-module $M$ we give a general formula that computes the indecomposable decomposition of $M$ without decomposing it, for which…

In this paper we prove that every irreducible representation of a Leibniz algebra can be obtained from irreducible representations of the semisimple Lie algebra from the Levi decomposition. We also prove that - in general - for (semi)simple…

We discuss the complexity of completions of partial combinatory algebras, in particular of Kleene's first model. Various completions of this model exist in the literature, but all of them have high complexity. We show that although there do…

Let m be a cube-free positive integer and let p be a prime such that p does not divide m. In this paper we find the number of conjugacy classes of completely reducible solvable cube-free subgroups in GL(2, q) of order m, where q is a power…

The two dimensional Jacobian Conjecture says that a morphism $f:\mathbb{C}[x,y]\to \mathbb{C}[x,y]$ having an invertible Jacobian, is invertible. We show that a morphism $f$ having an invertible Jacobian is invertible, in each of the…

We show that for both the unary relation of transcendence and the finitary relation of algebraic independence on a field, the degree spectra of these relations may consist of any single computably enumerable Turing degree, or of those c.e.…

We are interested in the study of caustics by reflection of irreducible algebraic planar curves (in the complex projective plane). We prove the birationality of the caustic map (for a generic light position). We also give simple formulas…

We prove that compact non-flat manifolds with constant sectional curvature admit no conformal product structure. Furthermore, we demonstrate that the methods extend naturally to irreducible, compact locally symmetric spaces of non-positive…

It is well-known that coupling constraints in linear bilevel optimization can lead to disconnected feasible sets, which is not possible without coupling constraints. However, there is no difference between linear bilevel problems with and…

A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from polynomial space by showing that all…

For a finite dimensional representation $V$ of a group $G$ over a field $F$, the degree of reductivity $\delta(G,V)$ is the smallest degree $d$ such that every nonzero fixed point $v\in V^{G}\setminus\{0\}$ can be separated from zero by a…

In this paper it is shown that the lattice of C*-covers of an operator algebra does not contain enough information to distinguish operator algebras up to completely isometric isomorphism. In addition, four natural equivalences of the…

We construct two computable topologically conjugate functions for which no conjugacy is computable, or even hyperarithmetic, resolving an open question of Kennedy and Stockman.

We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…

In this paper, we give a complete classification of extensions of finite irreducible conformal modules over rank two Lie conformal algebras.