Related papers: Full normalization for $\kappa^+$-supercompactness
We prove that the complement of a $\sigma$-compact subset of a topological space that has a $\pi$-tree also has a $\pi$-tree. To do this, we construct the foliage hybrid operation, which deals with foliage trees (that is, set-theoretic…
The following pcf results are proved: 1. Assume that kappa > aleph_0 is a weakly compact cardinal. Let mu > 2^kappa be a singular cardinal of cofinality kappa. Then for every regular lambda < pp^+_{Gamma(kappa)} (mu) there is an increasing…
We show a rigidity result for subfactors that are normalized by a representation of a lattice $\Gamma$ in a higher rank simple Lie group with trivial center into a finite factor. This implies that every subfactor of $L\Gamma$ which is…
Dobrinen, Hathaway and Prikry studied a forcing $\mathbb{P}_\kappa$ consisting of perfect trees of height $\lambda$ and width $\kappa$ where $\kappa$ is a singular $\omega$-strong limit of cofinality $\lambda$. They showed that if $\kappa$…
Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…
We perform renormalization group transformations to construct optimally local perfect lattice actions for free scalar fields of any mass. Their couplings decay exponentially. The spectrum is identical to the continuum spectrum, while…
Sharpness-aware minimization (SAM) was proposed to reduce sharpness of minima and has been shown to enhance generalization performance in various settings. In this work we show that perturbing only the affine normalization parameters…
We model collapsible and ordered pushdown systems with term rewriting, by encoding higher-order stacks and multiple stacks into trees. We show a uniform inverse preservation of recognizability result for the resulting class of term…
Irreversible aggregation is revisited in view of recent work on renormalization of complex networks. Its scaling laws and phase transitions are related to percolation transitions seen in the latter. We illustrate our points by giving the…
We show that if the universe is self-iterable and $\kappa$ is an inaccessible limit of Woodin cardinal then $AD_R + "\Theta$ is regular" holds in the derived model at $\kappa$. The proof is fine-structure free, and only assumes basic…
We study a systematic improvement of perturbation theory for gauge fields on the lattice [hep-lat/0606001]; the improvement entails resumming, to all orders in the coupling constant, a dominant subclass of tadpole diagrams. This method,…
A complete reduction on a difference field is a linear operator that enables one to decompose an element of the field as the sum of a summable part and a remainder such that the given element is summable if and only if the remainder is…
We propose a method using perturbation theory in the running coupling constant and the idea of scaling to determine improved actions for lattice field theories combining Wilson's renormalization group with Symanzik's improvement program .…
We construct a model in which the continuum has size $\kappa$ for a regular cardinal $\kappa$ and in which the $\Sigma^1_n$-uniformization property holds simultaneously for every $n \ge 2$. Additionally this model has a $\Delta^1_3$-…
We introduce saturation of nondeterministic tree automata, a technique that consists of adding new transitions to an automaton while preserving its language. We implemented our algorithm on minotaut - a module of the tree automata library…
We study the complexity of finding an optimal hierarchical clustering of an unweighted similarity graph under the recently introduced Dasgupta objective function. We introduce a proof technique, called the normalization procedure, that…
We show that the tree property, stationary reflection and the failure of approachability at $\kappa^{++}$ are consistent with $\mathfrak{u}(\kappa) = \kappa^+ < 2^\kappa$, where $\kappa$ is a singular strong limit cardinal with the…
Theoretical analyses of evolution strategies are indispensable for gaining a deep understanding of their inner workings. For constrained problems, rather simple problems are of interest in the current research. This work presents a…
The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…
Let $X$ be a finite set such that $|X|=n$. Let $\trans$ and $\sym$ denote respectively the transformation monoid and the symmetric group on $n$ points. Given $a\in \trans\setminus \sym$, we say that a group $G\leq \sym$ is $a$-normalizing…