Related papers: The Mouse Set Theorem Just Past Projective

We study $\Sigma_1(\omega_1)$-definable sets (i.e. sets that are equal to the collection of all sets satisfying a certain $\Sigma_1$-formula with parameter $\omega_1$) in the presence of large cardinals. Our results show that the existence…

In this article, for generalized projective spaces with any weights, we prove four main theorems in three different contexts where the Unital Set Condition USC (Definition $2.8$) on ideals is further examined. In the first context we prove,…

For $n<\omega$, let $N_n$ be the minimal iterable proper class mouse $M$ such that $M\models$ "there are ordinals $\delta_0<\kappa_0<\ldots<\delta_{n-1}<\kappa_{n-1}$ such that each $\delta_i$ is a Woodin cardinal and each $\kappa_i$ is a…

This paper aims to study linear sets of minimum size in the projective line, that is $\mathbb{F}_q$-linear sets of rank $k$ in $\mathrm{PG}(1,q^n)$ admitting one point of weight one and having size $q^{k-1}+1$. Examples of these linear sets…

We study the minimum \emph{Monitoring Edge Geodetic Set} (\megset) problem introduced in [Foucaud et al., CALDAM'23]: given a graph $G$, we say that an edge is monitored by a pair $u,v$ of vertices if \emph{all} shortest paths between $u$…

Let $\beta: S^{2n+1}\to S^{2n+1}$ be a minimal homeomorphism ($n\ge 1$). We show that the crossed product $C(S^{2n+1})\rtimes_{\beta} \Z$ has rational tracial rank at most one. More generally, let $\Omega$ be a connected compact metric…

A monitoring edge-geodetic set (or meg-set for short) of a graph is a set of vertices $M$ such that if any edge is removed, then the distance between some two vertices of $M$ increases. This notion was introduced by Foucaud et al. in 2023…

Let $M$ be a tame mouse modelling ZFC. We show that $M$ satisfies "$V=\mathrm{HOD}_x$ for some real $x$", and that the restriction $\mathbb{E}\upharpoonright[\omega_1^M,\mathrm{OR}^M)$ of the extender sequence $\mathbb{E}^M$ of $M$ to…

We give a construction of scales (in the descriptive set theoretic sense) directly from mouse existence hypotheses, without using any determinacy arguments. The construction is related to the Martin-Solovay construction for scales on…

An $\mathbb{F}_q$-linear set of rank $k$ on a projective line $\mathrm{PG}(1,q^h)$, containing at least one point of weight one, has size at least $q^{k-1}+1$ (see [J. De Beule and G. Van De Voorde, The minimum size of a linear set, J.…

Let $m \in \mathbb{N}$ be large. We show that there exist infinitely many primes $q_{1}< \cdot\cdot\cdot < q_{m+1}$ such that \[ q_{m+1}-q_{1}=O(e^{7.63m}) \] and $q_{j}+2$ has at most \[ \frac{7.36m}{\log 2} + \frac{4\log m}{\log 2} + 21…

This thesis analyses extenders in fine structural mice. Kunen showed that in the inner model for one measurable cardinal, there is a unique measure. This result is generalized, in various ways, to mice below a superstrong cardinal. The…

We present an $L$-like construction that produces the minimal model of $\mathsf{AD}_\mathbb{R}+$"$\Theta$ is regular". In fact, our construction can produce any model of $\mathsf{AD}^++\mathsf{AD}_\mathbb{R}+V=L(P(\mathbb{R}))$ in which…

Let $M$ be a short extender mouse. We prove that if $E\in M$ and $M$ satisfies "$E$ is a countably complete short extender whose support is a cardinal $\theta$ and $\mathcal{H}_\theta\subseteq\mathrm{Ult}(V,E)$", then $E$ is in the extender…

We investigate the structure of the monoid of endomorphisms of the ordered set $(\mathbb{Q},{\leq})$ of rational numbers. We show that for any countable linearly ordered set $\Omega$, there are uncountably many maximal subgroups of…

Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…

The Mandelbrot set is an extremely well-known mathematical object that can be described in a quite simple way but has very interesting and non-trivial properties. This paper surveys some results that are known concerning the…

Let $g \in L^2(\mathbb{R})$ be a rational function of degree $M$, i.e. there exist polynomials $P, Q$ such that $g = {{P} \over {Q}}$ and $deg(P) < deg(Q) \leq M$. We prove that for any $\varepsilon>0$ and any $M \in \mathbb{N}$ there…

We study the minimum dominating set problem as a representative combinatorial optimization challenge with a global topological constraint. The requirement that the backbone induced by the vertices of a dominating set should be a connected…

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…