Related papers: members of thin $\Pi_1^0$ classes and generic degr…
A thin Lie algebra is a Lie algebra graded over the positive integers satisfying a certain narrowness condition. We describe several cyclic grading of the modular Hamiltonian Lie algebras $H(2\colon\n;\omega_2)$ (of dimension one less than…
Answering an open question raised by Cooper, we show that there exist $\Delta^0_2$ sets $D$ and $E$ such that the singleton degree of $E$ is a minimal cover of the singleton degree of $D$. This shows that the $\Sigma^{0}_{2}$ singleton…
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
Thin coverings are a method of constructing graded-simple modules from simple (ungraded) modules. After a general discussion, we classify the thin coverings of (quasifinite) simple modules over associative algebras graded by finite abelian…
We address a conjecture that $\pi_1$-surjective maps between closed aspherical 3-manifolds having the same rank on $\pi_1$ must be of non-zero degree. The conjecture is proved for Seifert manifolds, which is used in constructing the first…
A product-quotient surface is the minimal resolution of the singularities of the quotient of a product of two curves by the action of a finite group acting separately on the two factors. We classify all minimal product-quotient surfaces of…
We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…
The Turing degree of a real measures the computational difficulty of producing its binary expansion. Since Turing degrees are tailsets, it follows from Kolmogorov's 0-1 law that for any property which may or may not be satisfied by any…
In this note we introduce the notion of a transcendental group, that is, a subgroup $G$ of the topological group $\mathbb{C}$ of all complex numbers such that every element of $G$ except $ 0$ is a transcendental number. All such topological…
This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…
Let $\Pi_n$ be the class of algebraic polynomials $P$ of degree $n$, all of whose zeros lie on the segment $[-1,1]$. In 1995, S.P. Zhou has proved the following Tur\'{a}n type reverse Markov-Nikol'skii inequality: $\|P'\|_{L_p[-1,1]}>c\,…
These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…
It is known that first-order logic with some counting extensions can be efficiently evaluated on graph classes with bounded expansion, where depth-$r$ minors have constant density. More precisely, the formulas are $\exists x_1 ... x_k \#y…
We initiate the computability-theoretic study of ringed spaces and schemes. In particular, we show that any Turing degree may occur as the least degree of an isomorphic copy of a structure of these kinds. We also show that these structures…
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table…
We consider large uniform labeled random graphs in different classes with few induced $P_4$ ($P_4$ is the graph consisting of a single line of $4$ vertices) which generalize the case of cographs. Our main result is the convergence to a…
Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerable many-one degrees. Positive answers…
We give new decomposition theorems for classes of graphs that can be transduced in first-order logic from classes of sparse graphs -- more precisely, from classes of bounded expansion and from nowhere dense classes. In both cases, the…
We define a notion of relative fundamental class that applies to moduli spaces in gauge theory and in symplectic Gromov-Witten theory. For universal moduli spaces over a parameter space, the relative fundamental class specifies an element…
We show that there is a minimal pair in the nonuniform generic degrees, and hence also in the uniform generic degrees. This fact contrasts with Igusa's result that there are no minimal pairs for relative generic computability, and answers a…