Related papers: Full normalization for $\kappa^+$-supercompactness

The sigma model on complex projective superspaces CP^{S-1|S} gives rise to a continuous family of interacting 2D conformal field theories which are parametrized by the curvature radius R and the theta angle \theta. Our main goal is to…

We study realization of the democratic form of Yukawa matrices by infrared fixed points. We investigate renormalization-group flows of Yukawa couplings in models with a single Yukawa matrix for three families, and up and down-sector Yukawa…

For $\lambda$ inaccessible, we may consider $(< \lambda)$-support iteration of some specific $(<\lambda)$-complete $\lambda^+$-c.c. forcing notion. But this fails a "preservation by restricting to a sub-sequence of the forcing, we "correct"…

In an earlier paper, we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of $n$-by-$n$ matrices can be done by any algorithm in $O(n^{\omega +…

A supersymmetric string model in the D=11 superspace maximally extended by antisymmetric tensor bosonic coordinates, $\Sigma^{(528|32)}$, is proposed. It possesses 30 $\kappa$-symmetries and 32 target space supersymmetries. The usual…

We generalize the results from "P. Lipparini, Productive $[\lambda,\mu]$-compactness and regular ultrafilters, Topology Proceedings, 21 (1996), 161--171"; in particular the present results apply to singular cardinals, too.

Let $\mu$ be the geometric realization on $[0,1]$ of a Gibbs measure on $\Sigma=\{0,1\}^{\mathbb{N}}$ associated with a H\"older potential. The thermodynamic and multifractal properties of $\mu$ are well known to be linked via the…

Cyclic patterns of neuronal activity are ubiquitous in animal nervous systems, and partially responsible for generating and controlling rhythmic movements such as locomotion, respiration, swallowing and so on. Clarifying the role of the…

In this paper, we formalize design patterns, commonly used in the self-stabilizing area, to obtain general statements regarding both correctness and time complexity guarantees. Precisely, we study a general class of algorithms designed for…

The purpose of this paper is to build an algebraic framework suited to regularise branched structures emanating from rooted forests and which encodes the locality principle. This is achieved by means of the universal properties in the…

We write down the supermembrane actions for M-theory backgrounds dual to general ${\cal N}=2$ four-dimensional superconformal field theories. The actions are given to all orders in fermions and are in a particular $\kappa$-gauge. When an…

Automata networks are a very general model of interacting entities, with applications to biological phenomena such as gene regulation. In many contexts, the order in which entities update their state is unknown, and the dynamics may be very…

Conventional regularization is designed to control variance, but in small-data regression it can also aggravate underfitting when predictive signal is concentrated in weak directions of a restricted representation. We study a…

The "fast iterative shrinkage-thresholding algorithm", a.k.a. FISTA, is one of the most well-known first-order optimisation scheme in the literature, as it achieves the worst-case $O(1/k^2)$ optimal convergence rate in terms of objective…

In this paper we analyze the connection between some properties of partially strongly compact cardinals: the completion of filters of certain size and instances of the compactness of $\mathcal{L}_{\kappa,\kappa}$. Using this equivalence we…

In Part I of this series, we introduced a class of notions of forcing which we call Sigma-Prikry, and showed that many of the known Prikry-type notions of forcing that center around singular cardinals of countable cofinality are…

The main principle of stacked generalization (or Stacking) is using a second-level generalizer to combine the outputs of base classifiers in an ensemble. In this paper, we investigate different combination types under the stacking…

Matrix completion has been well studied under the uniform sampling model and the trace-norm regularized methods perform well both theoretically and numerically in such a setting. However, the uniform sampling model is unrealistic for a…

This article continues Ros{\l}anowski and Shelah math.LO/9906024, math.LO/0508272, math.LO/0210205, math.LO/0611131 and math.LO/0605067. We introduce here a new property of <lambda-strategically complete forcing notions which implies that…

This paper studies the transfinite propositional provability logics $\glp_\Lambda$ and their corresponding algebras. These logics have for each ordinal $\xi< \Lambda$ a modality $\la \alpha \ra$. We will focus on the closed fragment of…