Related papers: Full normalization for $\kappa^+$-supercompactness
A semi-analytic method to compute the first coefficients of the renormalization group functions on a random lattice is introduced. It is used to show that the two-dimensional $O(N)$ non-linear $\sigma$-model regularized on a random lattice…
We show that the existence of a well-known type of ideals on a regular cardinal $\lambda$ implies a compactness property concerning the specialisability of a tree of height $\lambda$ with no cofinal branches. We also use Neeman's method of…
We announce a generalization of Zimmer's cocycle superrigidity theorem proven using harmonic map techniques. This allows us to generalize many results concerning higher rank lattices to all lattices in semisimple groups with property $(T)$.…
We extend the results we obtained in an earlier work. The cocommutative case of rooted ladder trees is generalized to a full Hopf algebra of (decorated) rooted trees. For Hopf algebra characters with target space of Rota-Baxter type, the…
We investigate conditions for "simultaneous normalizability" of a family of reduced schemes, i.e., the normalization of the total space normalizes, fiber by fiber, each member of the family. The main result (under more general conditions)…
This paper, dating from May 1991, contains preliminary (and unpublishable) notes on investigations about iteration trees. They will be of interest only to the specialist. In the first two sections I define notions of support and embeddings…
Saturation is a fundamental game-semantic property satisfied by strategies that interpret higher-order concurrent programs. It states that the strategy must be closed under certain rearrangements of moves, and corresponds to the intuition…
In this article we review how categorical equivalences are realized by renormalization group flow in physical realizations of stacks, derived categories, and derived schemes. We begin by reviewing the physical realization of sigma models on…
We present a quantitative basis-independent analysis of combinatory logic. Using a general argument regarding plane binary trees with labelled leaves, we generalise the results of David et al. and Bendkowski et al. to all Turing-complete…
In this paper, we introduce a birationally admissible stratification on the Deligne-Mumford stack of stable minimal models (e.g., the KSBA moduli stack), such that the universal family over each stratum admits a simple normal crossing log…
In this paper we apply methods of proof mining to obtain a uniform effective rate of asymptotic regularity for the Mann iteration associated to $\kappa$-strict pseudo-contractions on convex subsets of Hilbert spaces.
We construct a model of the form $L[A,U]$ that exhibits the simplest structural behavior of $\sigma$-complete ultrafilters in a model of set theory with a single measurable cardinal $\kappa$ , yet satisfies $2^\kappa = \kappa^{++}$. This…
We study modular invariance of normalized supercharacters of tame integrable modules over an affine Lie superalgebra, associated to an arbitrary basic Lie superalgebra $ \mathfrak{g}. $ For this we develop a several step modification…
We introduce a new class of ultrafilters which generalizes the well-known class of simple $P$-point ultrafilters. We prove that for any well-founded $\sigma$-directed partial order $\mathbb{D}$ there is a mild forcing extension where there…
We present a technique to study normalizing strategies when termination is asymptotic, that is, it appears as a limit, as opposite to reaching a normal form in a finite number of steps. Asymptotic termination occurs in several settings,…
We introduce regenerative tree growth processes as consistent families of random trees with n labelled leaves, n>=1, with a regenerative property at branch points. This framework includes growth processes for exchangeably labelled Markov…
We present a method which allows the combination of forcing uniformization on the $\Pi$- and the $\Sigma$-side of the projective hierarchy to a certain extent. Using this method we construct a universe where ${\Pi}^1_3$-reduction holds,…
In this paper we study string compactifications on Deligne-Mumford stacks. The basic idea is that all such stacks have presentations to which one can associate gauged sigma models, where the group gauged need be neither finite nor…
We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…
In the first part of the paper, we show that if $\omega \le \kappa < \lambda$ are cardinals, $\kappa^{<\kappa} = \kappa$, and $\lambda$ is weakly compact, then in $V[\M(\kappa,\lambda)]$ the tree property at $\lambda =…