Related papers: On the existence of a strong minimal pair
The structure of nilpotent symplectic algebras of maximal class has been studied in [8, 5]. In this paper, we study the dual subclass of algebras of minimal class. In particular, we show that symplectic alternating algebras of dimension up…
We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…
In this paper, we study some useful properties of persistent pairs in a discrete Morse function on a simplicial complex $K$. In case of $\dim K=1$ (i.e., a graph), by using the properties, we characterize strongly connectedness of critical…
For every cluster-tilted algebra of simply-laced Dynkin type we provide a companion basis which is strong, i.e. gives the set of dimension vectors of the finitely generated indecomposable modules for the cluster-tilted algebra. This shows…
Exceptional groups of type $E_6$ contain dual pairs where one member is $\mathrm{Spin}(8)$, and the other is $T\rtimes \mathbb Z/2\mathbb Z$, where $T$ is a two-dimensional torus and the non-trivial element in $\mathbb Z/2\mathbb Z$ acts on…
We provide an alternative, simpler proof of the existence of thick triangulations for noncompact $\mathcal{C}^1$ manifolds. Moreover, this proof is simpler than the original one given in \cite{pe}, since it mainly uses tools of elementary…
The Turing degree spectrum of a countable structure $\mathcal{A}$ is the set of all Turing degrees of isomorphic copies of $\mathcal{A}$. The Turing degree of the isomorphism type of $\mathcal{A}$, if it exists, is the least Turing degree…
This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…
A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits of A, but which does not necessarily give an answer for…
In this short note, we will show that the metric of Deligne's pairing is continous.
We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C^*$ algebras.
We prove a combination theorem for PD(n)-pairs.
In this article we introduce a definition of topological minimal sets, which is a generalization of that of Mumford-Shah-minimal sets. We prove some general properties as well as two existence theorems for topological minimal sets. As an…
This work establishes a strong uniqueness property for a class of planar locally integrable vector fields. A result on pointwise convergence to the boundary value is also proved for bounded solutions.
This article contains the proof of a theorem on orthogonal-Pin duality that was cited without proof in a previous article in this journal.
We study minimally Terracini finite sets of points in the projective plane and we prove that the sequence of the cardinalities of minimally Terracini sets can have any number of gaps for degree great enough.
In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…
A set $A$ is coarsely computable with density $r \in [0,1]$ if there is an algorithm for deciding membership in $A$ which always gives a (possibly incorrect) answer, and which gives a correct answer with density at least $r$. To any Turing…
We prove a stronger version of a termination theorem appeared in the paper "On existence of log minimal models II". We essentially just get rid of the redundant assumptions so the proof is almost the same as in there. However, we give a…
A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…