相关论文: Higher Kurtz randomness

Let $X$ be a locally compact Polish space. A random measure on $X$ is a probability measure on the space of all (nonnegative) Radon measures on $X$. Denote by $\mathbb K(X)$ the cone of all Radon measures $\eta$ on $X$ which are of the form…

We consider the set of points chosen randomly, independently and uniformly in the $d$-dimensional spherical layer. A set of points is called $1$-convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate…

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…

We examine the ranks of operators in semi-finite C*-algebras as measured by their densely defined lower semicontinuous traces. We first prove that a unital simple C*-algebra whose extreme tracial boundary is nonempty and finite contains…

We consider a class of real numbers, a subset of irrational numbers and certain mathematical constants, for which the elements in the simple continued fraction appears to be random. As an illustrative example, one can consider $\pi = \{x_0,…

We show that the Hilbert-Kunz multiplicity is a rational number for an R_+-primary homogeneous ideal I=(f_1, ..., f_n) in a two-dimensional graded domain R of finite type over an algebraically closed field of positive characteristic.…

The prime numbers look like a randomly chosen sequence of natural numbers, but there is still no strict theory to determine 'Randomness'. In these years, cryptography has developed a battery of statistical tests for randomness. In this…

Quasirandomness is a general mathematical concept meant to encapsulate several characteristics usually satisfied by random combinatorial objects, and which we regard as describing when a given object 'looks random'. In this survey we…

Random systems of curves exhibiting fluctuating features on arbitrarily small scales ($\delta$) are often encountered in critical models. For such systems it is shown that scale-invariant bounds on the probabilities of crossing events imply…

We prove that superhigh sets can be jump traceable, answering a question of Cole and Simpson. On the other hand, we show that such sets cannot be weakly 2-random. We also study the class superhigh$^\Diamond$, and show that it contains some,…

We define a new class of pseudo effect algebras, called kite pseudo effect algebras, which is connected not necessarily with partially ordered groups, but rather with generalized pseudo effect algebras where the greatest element is not…

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

For every dimension d, there is an infinite family of convex co-compact reflection groups of isometries of hyperbolic d-space --- the superideal (simplicial and cubical) reflection groups --- with the property that a random group at any…

The upper semicontinuity of random attractors for non-compact random dynamical systems is proved when the union of all perturbed random attractors is precompact with probability one. This result is applied to the stochastic…

A collection of $n$ random events is said to be $(n - 1)$-wise independent if any $n - 1$ events among them are mutually independent. We characterise all probability measures with respect to which $n$ random events are $(n - 1)$-wise…

For a random quasi-abelian code of rate $r$, it is shown that the GV-bound is a threshold point: if $r$ is less than the GV-bound at $\delta$, then the probability of the relative distance of the random code being greater than $\delta$ is…

We say that a C*-algebra is nowhere scattered if none of its quotients contains a minimal open projection. We characterize this property in various ways, by topological properties of the spectrum, by divisibility properties in the Cuntz…

We consider two models of one-dimensional random walks among biased i.i.d. random conductances: the first is the classical exponential tilt of the conductances, while the second comes from the effect of adding an external field to a random…

Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…

The randomness rate of an infinite binary sequence is characterized by the sequence of ratios between the Kolmogorov complexity and the length of the initial segments of the sequence. It is known that there is no uniform effective procedure…