Related papers: Analytic equivalence relations satisfying hyperari…
In this short note we show that every connected reductive simply-connected algebraic group of rank $>1$ over the complex numbers has infinitely many pairs of irreducible representations which are not related by an automorphism of the…
We prove that every curve on a rationally connected variety is algebraically equivalent to a (non-effective) integral sum of rational curves.
We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…
A relation extends another relation consistently if its symmetric, respectively its asymmetric, part contains the corresponding part of the smaller relation. It is shown that there exists no finite circular chain made from two transitive…
For a given extension $A \subset E$ of associative algebras we describe and classify up to an isomorphism all $A$-complements of $E$, i.e. all subalgebras $X$ of $E$ such that $E = A + X$ and $A \cap X = \{0\}$. Let $X$ be a given…
Let X and Y be compact hyper-Kahler manifolds deformation equivalence to the Hilbert scheme of length n subschemes of a K3 surface. A cohomology class in their product XxY is an analytic correspondence, if it belongs to the subring…
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…
This paper improves two existing theorems of interest to neo-logicist philosophers of mathematics. The first is a classification theorem due to Fine for equivalence relations between concepts definable in a well-behaved second-order logic.…
This paper presents two types of results related to hyperarithmetic analysis. First, we introduce new variants of the dependent choice axiom, namely $\mathrm{unique}~\Pi^1_0(\mathrm{resp.}~\Sigma^1_1)\text{-}\mathsf{DC}_0$ and…
We prove that if $\leq$ is an analytic partial order then either $\leq$ can be extended to a (boldface) $\Delta^1_2$ linear order similar to an antichain in $2^{<\omega_1}$ ordered lexicographically or a certain Borel partial order $\leq_0$…
By Hironaka Desingularization Theorem, any real analytic function has only normal crossing singularities after a suitable modification. We focus on the analytic equivalence of such functions with only normal crossing singularities. We prove…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
We prove that the epimorphism relation is a complete analytic quasi-order on the space of countable groups. In the process, we obtain the result of independent interest that the epimorphism relation on pointed reflexive graphs is complete.
This paper is devoted to study multiplicity and regularity as well as to present some classifications of complex analytic sets. We present an equivalence for complex analytical sets, namely blow-spherical equivalence and we receive several…
We introduce a class of analytic functions subordinate to the function $1+\sinh \left( z\right) $ and obtain various necessary and sufficient conditions for functions to be in the class. These conditions mainly comprise of the coefficient…
New (infinitely many) rational approximants to \zeta(3) proving its irrationality are given. The recurrence relations for the numerator and denominator of these approximants as well as their continued fraction expansions are obtained. A…
Assume $\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$. Let $E$ be a $\mathbf{\Sigma}^1_1$ equivalence relation coded in $\mathrm{HOD}$. $E$ has an ordinal definable equivalence class without any ordinal definable elements if and only…
This paper studies when an arithmetical equivalence relation $E$ can be realized as the connectedness relation of a graph $G$ which is simpler to define than $E$. Several examples of such equivalence relations are established. In…
Let $R\subseteq E$ be two Lie conformal algebras and $Q$ be a given complement of $R$ in $E$. Classifying complements problem asks for describing and classifying all complements of $R$ in $E$ up to an isomorphism. It is known that $E$ is…
Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an observer is shown. A powerful enabler for such proofs are logical…