Related papers: Any FIP real computes a 1-generic

An outstanding folklore conjecture asserts that, for any prime $p$, up to isomorphism the projective plane $PG(2,\mathbb{F}_p)$ over the field $\mathbb{F}_p := \mathbb{Z}/p\mathbb{Z}$ is the unique projective plane of order $p$. Let $\pi$…

Given a planar curve defined by means of a real rational parametrization, we prove that the affine values of the parameter generating the real singularities of the offset are real roots of a univariate polynomial that can be derived from…

We develop a formula (Theorem 5.1) which allows to compute top Chern classes of vector bundles on the vanishing locus $V(s)$ of a section of this bundle. This formula particularly applies in the case when $V(s)$ is the union of locally…

We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to deterministically construct, in…

We take a first step towards a reconstruction of finite tensor categories using finitely many $F$-matrices. The goal is to reconstruct a finite tensor category from its projective ideal. Here we set up the framework for an important…

Abstractly, the generic extensions after $\aleph_\omega$-many Cohen reals and $\aleph_{\omega+1}$-many Cohen reals must be different for reasons of uniform density the relevant Boolean algebras. Nevertheless this is not satisfying and it…

We classify combinatorial Dyson-Schwinger equations giving a Hopf subalgebra of the Hopf algebra of Feynman graphs of the considered Quantum Field Theory. We first treat single equations with an arbitrary number (eventually infinite) of…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

Let M be a model of Peano Arithmetic that is countably generated over an exponentially closed cut I. We characterize those sets X of subsets of I for which there is a finitely (or countably) generated cofinal extension N of M such that I is…

We present some results about generics for computable Mathias forcing. The $n$-generics and weak $n$-generics in this setting form a strict hierarchy as in the case of Cohen forcing. We analyze the complexity of the Mathias forcing…

We study a recursively defined sequence which is constructed using the least common multiple. It has been conjectured that every term of that sequence is $1$ or a prime. In this paper we show that this claim is connected to a strong version…

We make use of a finite support product of Jensen forcing to define a model in which there is a countable non-empty lightface $\Pi^1_2$ set of reals containing no ordinal-definable real.

We study the set $\mathcal{L}_{F}$ of all $F$-vector spaces $L(P)$ where $P$ is monic and splits over $F$ and $L(Q)$ denotes the set of linear recurrence sequences over $F$ with characteristic polynomial $Q$. We show that $\mathcal{L}_{F}$…

A theorem of Cohen from 1950 states that a commutative ring is Noetherian if and only if every prime ideal is finitely generated. In this note, we establish analogues of this result in tensor triangular geometry. In particular, for an…

Farey sequences, Stern-Brocot sequences, the Calkin-Wilf sequences are shown to be generated via almost identical second order recurrence relations. These sequences have combinatorial, computational, and geometric applications, and are…

We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and we explicitly determine their associated…

We construct a topos in which the Dedekind reals are countable. The topos arises from a new kind of realizability, which we call parameterized realizability, based on partial combinatory algebras whose application depends on a parameter.…

We prove that the $d$-component of the generic initial ideal, with respect to the reverse lexicographic order, of an ideal generated by a regular sequence of homogeneous polynomials of degree $d$ is revlex in a particular, but important,…

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

Let I be a sigma-ideal sigma-generated by a projective collection of closed sets. The forcing with I-positive Borel sets is proper and adds a single real r of an almost minimal degree: if s is a real in V[r] then s is Cohen generic over V…