Related papers: The equivalence of precompactness, zero maximal pa…

An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…

We introduce a new isomorphism-invariant notion of entropy for measure preserving actions of arbitrary countable groups on probability spaces, which we call orbital Rokhlin entropy. It employs Danilenko's orbital approach to entropy of a…

Let $Q$ denote the space of signed measures on the Borel $\sigma$-algebra of a separable complete space $X$. We endow $Q$ with the norm $\|q\|=\sup|\int\phi dq|$, where the supremum is taken over all Lipschitz with constant 1 functions…

We prove that many completeness properties coincide in metric spaces, precompact groups and dense subgroups of products of separable metric groups. We apply these results to function spaces C_p(X,G) of G-valued continuous functions on a…

In this work, we study pmp actions of countable groups on arbitrary diffuse probability spaces under the point of view of weak equivalence. We will show that any such an action is weakly equivalent to an action on a standard probability…

Image partition regular matrices near zero generalizes many classical results of Ram- sey Theory. There are several characterizations of finite image partition regular matrices near zero. Contrast to the finite cases there are only few…

In this note we present new examples of determinantal point processes with infinitely many particles. The particles live on the half-lattice {1,2,...} or on the open half-line (0,+\infty). The main result is the computation of the…

Although consistency is a minimum requirement of any estimator, little is known about consistency of the mean partition approach in consensus clustering. This contribution studies the asymptotic behavior of mean partitions. We show that…

In recent work with Raum the authors considered congruences for the ordinary partition function $p(n)$ of the form $p(\ell Q^r n+\beta)\equiv 0\pmod\ell$ where $\ell, Q\geq 5$ are prime and $r\in \{1,2\}$, and proved a number of results…

Partitioning algorithms play a key role in many scientific and engineering disciplines. A partitioning algorithm divides a set into a number of disjoint subsets or partitions. Often, the quality of the resulted partitions is measured by the…

In this paper it is proved that if a minimal system has the property that its sequence entropy is uniformly bounded for all sequences, then it has only finitely many ergodic measures and is an almost finite to one extension of its maximal…

We assess the descriptive complexity of *bisimilarity* or "equality of behavior" on a family of Markov decision processes over uncountable standard Borel spaces, namely *nondeterministic labelled Markov processes* (NLMP). We show that…

We study the entanglement entropy of random partitions in one- and two-dimensional critical fermionic systems. In an infinite system we consider a finite, connected (hypercubic) domain of linear extent $L$, the points of which with…

The present paper is devoted to analysis of the lack of compactness of bounded sequences in \emph{inhomogeneous} Sobolev spaces, where bounded sequences might fail to be compact due to an isometric group action, that is, \emph{translation}.…

Applications of harmonic analysis on finite groups were recently introduced to measure partition problems, with a variety of equipartition types by convex fundamental domains obtained as the vanishing of prescribed Fourier transforms.…

We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set $A$ with non-trivial prefix-free initial segment…

We argue that in the case of identical particles the most natural identification of separability, that is of absence of non-classical correlations, is via the factorization of mean values of commuting observables. It thus follows that…

We prove that for any infinite countable amenable group $G$, any $\epsilon > 0$ and any finite subset $K\subset G$, there exists a tiling (partition of $G$ into finite "tiles" using only finitely many "shapes"), where all the tiles are $(K;…

This paper investigates what can be inferred about an arbitrary continuous probability distribution from a finite sample of $N$ observations drawn from it. The central finding is that the $N$ sorted sample points partition the real line…

Let F be a separable uniformly bounded family of measurable functions on a standard measurable space, and let N_{[]}(F,\epsilon,\mu) be the smallest number of \epsilon-brackets in L^1(\mu) needed to cover F. The following are equivalent: 1.…