Related papers: Normality, Relativization, and Randomness
Central limit theorems for the log-volume of a class of random convex bodies in $\mathbb{R}^n$ are obtained in the high-dimensional regime, that is, as $n\to\infty$. In particular, the case of random simplices pinned at the origin and…
Given an integer $b\geqslant 2$ and a set $P$ of prime numbers, the set $T_P $ of Toeplitz numbers comprises all elements of $[0,b[$ whose digits $(a_n)_{n\geqslant 1}$ in the base-$b$ expansion satisfy $a_n=a_{pn}$ for all $p\in P$ and…
The theory of rough sets was firstly introduced by Pawlak (see \cite{p}). Many Mathematician has been studied the relations between rough sets and algebraic systems such as groups, rings and modules. In this paper we will introduce the…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
High dimensional data can have a surprising property: pairs of data points may be easily separated from each other, or even from arbitrary subsets, with high probability using just simple linear classifiers. However, this is more of a rule…
In this paper we introduce the notion of (pointed) prenormal category, modelled after regular categories, but with the key notions of coequaliser and kernel pair replaced by those of cokernel and kernel. This framework provides a natural…
We investigate the issue of regularization/renormalization in the presence of a nontrivial background in the case of 1+1-(supersymmetric) solitons. In particular we study and compare the commonly employed regularization methods (mode-…
In this paper, the notion of pronormal L-subgroups of an L-group has been introduced by using the concept of conjugate L-subgroup. The notion of pronormal L-subgroups has been investigated in context of normality and subnormality of…
Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…
Certain generalization of Euler numbers was defined in 1935 by Lehmer using cubic roots of unity, as a natural generalization of Bernoulli and Euler numbers. In this paper, Lehmer's generalized Euler numbers are studied to give certain…
Methods for the reduction of the complexity of computational problems are presented, as well as their connections to renormalization, scaling, and irreversible statistical mechanics. Several statistically stationary cases are analyzed; for…
We present a partial survey on normal numbers, including Keane's contributions, and with recent developments in different directions.
There are many randomness notions. On the classical account, many of them are about whether a given infinite binary sequence is random for some given probability. If so, this probability turns out to be the same for all these notions, so…
We propose a generalization of the random matrix theory following the basic prescription of the recently suggested concept of superstatistics. Spectral characteristics of systems with mixed regular-chaotic dynamics are expressed as weighted…
Random features models play a distinguished role in the theory of deep learning, describing the behavior of neural networks close to their infinite-width limit. In this work, we present a thorough analysis of the generalization performance…
Let $\alpha=0.a_1a_2a_3\ldots$ be an irrational number in base $b>1$, where $0\leq a_i<b$. The number $\alpha \in (0,1)$ is a \textit{normal number} if every block $(a_{n+1}a_{n+2}\ldots a_{n+k})$ of $k$ digits occurs with probability…
Let $A$ be an excellent two-dimensional normal local ring containing an algebraically closed field and let $X\to \mathrm{Spec} (A)$ be a resolution of singularity. We prove a theorem giving a condition under which the dimension of the…
We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…
We introduce a concept for random tilings which, comprising the conventional one, is also applicable to tiling ensembles without height representation. In particular, we focus on the random tiling entropy as a function of the tile…
We introduce a new concept of rank - relative rank associated to a filtered collection of polynomials. When the filtration is trivial our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of…