相关论文: On the Rokhlin lemma for infinite measure-preservi…

Let $(X,\mathcal{F},\mu,T)$ be a not necessarily invertible non-atomic measure-preserving dynamical system where the $\sigma$-algebra $\mathcal{F}$ is generated by the intervals according to some total order. The main result is that the…

We show that under some natural ergodicity assumptions extensions given by Rokhlin cocycles lift the multiplier property if the associated locally compact group extension has only countably many L^\infty-eigenvalues. We make use of some…

Bobkov (J. Theoret. Probab. 18(2) (2005) 399-412) investigated an approximate de Finetti representation for probability measures, on product measurable spaces, which are symmetric under permutations of coordinates. One of the main results…

In a previous paper (called "Rectangular random matrices. Related covolution"), we defined, for $\lambda \in [0,1]$, the rectangular free convolution with ratio $\lambda$. Here, we investigate the related notion of infinite divisiblity,…

We provide a Kingman-like Theorem for arbitrary finite measures and a version of Birkhoff's Theorem for bounded observable. As an application, we show that Birkhoff's limit exists for some continuous observable, in an example of Bowen.

Let $\Lambda$ be a finite dimensional algebra. In this paper we show that there is a natural bijection between cosilting modules in Mod$\Lambda$ and semibricks in Mod$\Lambda$ satisfying some condition. Also this bijection restricts to a…

We study the optimal rectangular-discrepancy approximation of permutons by finite permutations. We transfer bounds from discrepancy theory to this more restricted setup. Moreover, we show that superlinear approximation can occur only for…

The Myhill isomorphism is a variant of the Cantor-Bernstein theorem. It states that, from two injections that reduces two subsets of $\mathbb{N}$ to each other, there exists a bijection $\mathbb{N} \to \mathbb{N}$ that preserves them. This…

We give an elementary proof of a generalization of Rokhlin's lemma for commuting non-invertible measure-preserving transformations, and we present several combinatorial applications.

We study the universal closest refinement problem on measurable bipartite relations over standard Borel spaces. Given prescribed side measures, the feasible class consists of finite refinement plans concentrated on the relation and carrying…

We introduce an intersection type system for the lambda-mu calculus that is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus's denotational model of continuations in the category of…

Let $x \in \mathbb{R}$ be arbitrary and consider the `greedy' approximation of $x$ by signed harmonic sums: given $a_n = \sum_{k \leq n} \varepsilon_k/k$ with $\varepsilon_k \in \left\{-1,1\right\}$, we set $\varepsilon_{n+1} = 1$ if $a_n…

In this paper, we investigate several types of low complexity of finite partitions, including precompactness, zero maximal pattern entropy, bounded mean complexity and mean equicontinuity. We first show that a collection of finite…

The aim of this paper is to provide a new perspective on finite element accuracy. Starting from a geometrical reading of the Bramble-Hilbert lemma, we recall the two probabilistic laws we got in previous works that estimate the relative…

We introduce and study a notion of Rokhlin property for an inclusion of unital $C^*$-algebras which could have no projections like the Jiang-Su algebra. We also introduce a notion of approximate representability and show a duality between…

Maximum likelihood estimation is a fundamental computational problem in statistics. In this note, we give a bound for the maximum likelihood degree of algebraic statistical models for discrete data. As usual, such models are identified with…

In a variety of applications it is important to extract information from a probability measure $\mu$ on an infinite dimensional space. Examples include the Bayesian approach to inverse problems and possibly conditioned) continuous time…

The Robbins-Siegmund theorem establishes the convergence of stochastic processes that are almost supermartingales and is one of the most commonly used approaches for analyzing stochastic iterative algorithms in stochastic approximation and…

We study the nature of applicative bisimilarity in $\lambda$-calculi endowed with operators for sampling from continuous distributions. On the one hand, we show that bisimilarity, logical equivalence, and testing equivalence all coincide…

While any infimum in a poset can also be computed as a supremum, and vice versa, categorical limits and colimits do not always approximate each other. If I approach a point from below, and you approach it from above, then we will surely…