Random Regular Expression Over Huge Alphabets

In this article, we study some properties of random regular expressions of size [Formula: see text], when the cardinality of the alphabet also depends on [Formula: see text]. For this, we revisit and improve the classical Transfer Theorem from the field of analytic combinatorics. This provides precise estimations for the number of regular expressions, the probability of recognizing the empty word and the expected number of Kleene stars in a random expression. For all these statistics, we show that there is a threshold when the size of the alphabet approaches [Formula: see text], at which point the leading term in the asymptotics starts oscillating.

Mice with finitely many Woodin cardinals from optimal determinacy hypotheses

We prove the following result which is due to the third author. Let [Formula: see text]. If [Formula: see text] determinacy and [Formula: see text] determinacy both hold true and there is no [Formula: see text]-definable [Formula: see text]-sequence of pairwise distinct reals, then [Formula: see text] exists and is [Formula: see text]-iterable. The proof yields that [Formula: see text] determinacy implies that [Formula: see text] exists and is [Formula: see text]-iterable for all reals [Formula: see text]. A consequence is the Determinacy Transfer Theorem for arbitrary [Formula: see text], namely the statement that [Formula: see text] determinacy implies [Formula: see text] determinacy.

Rate of convergence in the transfer theorem for min-scheme

In this paper non-uniform estimate of convergence rate in the min-scheme is obtained. Presented results make the estimates, given in [1] and [2], more precise.

Properadic Homotopical Calculus

In this paper, we initiate the generalization of the operadic calculus that governs the properties of homotopy algebras to a properadic calculus that governs the properties of homotopy gebras over a properad. In this first article of a series, we generalize the seminal notion of ${\infty }$-morphisms and the ubiquitous homotopy transfer theorem. As an application, we recover the homotopy properties of involutive Lie bialgebras developed by Cieliebak–Fukaya–Latschev and we produce new explicit formulas.

Endperiodic automorphisms of surfaces and foliations

We extend the unpublished work of Handel and Miller on the classification, up to isotopy, of endperiodic automorphisms of surfaces. We give the Handel–Miller construction of the geodesic laminations, give an axiomatic theory for pseudo-geodesic laminations, show that the geodesic laminations satisfy the axioms, and prove that pseudo-geodesic laminations satisfying our axioms are ambiently isotopic to the geodesic laminations. The axiomatic approach allows us to show that the given endperiodic automorphism is isotopic to a smooth endperiodic automorphism preserving smooth laminations ambiently isotopic to the original ones. Using the axioms, we also prove the ‘transfer theorem’ for foliations of 3-manifolds, namely that, if two depth-one foliations ${\mathcal{F}}$ and ${\mathcal{F}}^{\prime }$ are transverse to a common one-dimensional foliation ${\mathcal{L}}$ whose monodromy on the non-compact leaves of ${\mathcal{F}}$ exhibits the nice dynamics of Handel–Miller theory, then ${\mathcal{L}}$ also induces monodromy on the non-compact leaves of ${\mathcal{F}}^{\prime }$ exhibiting the same nice dynamics. Our theory also applies to surfaces with infinitely many ends.