Related papers: The thirty-seven measures on permutations

From geometrical point of view, Eve (2003) studied seven means. These means are Harmonic, Geometric, Arithmetic, Heronian, Contra-harmonic, Root-mean square and Centroidal mean. We have considered for the first time a new measure calling…

For a class of irrational numbers, depending on their Diophantine properties, we construct explicit rank-one transformations that are totally ergodic and not weakly mixing. We classify when the measure is finite or infinite. In the finite…

When permutation methods are used in practice, often a limited number of random permutations are used to decrease the computational burden. However, most theoretical literature assumes that the whole permutation group is used, and methods…

Due to \v{C}encov's theorem, there exists a unique family of invariant symmetric $(0,2)$-tensor fields on the space of positive probability measures on a set of $n$-points indexed by $n\in \mathbb{N}$ under Markov embeddings. We deform…

As a continuation of our previous work on the subject, we prove new measure invariance results for the Benjamin-Ono equation. The measures are associated with conservation laws whose leading term is a fractional Sobolev norm of order larger…

We define a model for rank one measure preserving transformations in the sense of [2]. This is done by defining a new Polish topology on the space of codes, which are infinite rank one words, for symbolic rank one systems. We establish that…

Well-partial orders, and the ordinal invariants used to measure them, are relevant in set theory, program verification, proof theory and many other areas of computer science and mathematics. In this article we focus on one of the most…

Given an irreducible subshift of finite type X, a subshift Y, a factor map \pi : X \to Y, and an ergodic invariant measure \nu on Y, there can exist more than one ergodic measure on X which projects to \nu and has maximal entropy among all…

We present conditions every measure of entanglement has to satisfy and construct a whole class of 'good' entanglement measures. The generalization of our class of entanglement measures to more than two particles is straightforward. We…

We introduce the notion of hyperfiniteness for permutation actions of countable groups on countable sets and give a geometric and analytic characterization, similar to the known characterizations for amenable actions. We also answer a…

We consider the number of passes a permutation needs to take through a stack if we only pop the appropriate output values and start over with the remaining entries in their original order. We define a permutation $\pi$ to be $k$-pass…

We describe a construction process of a relevant measure in any non-empty compact metric space. This probability measure has invariance properties with respect to isometric maps defined on open sets. These properties imply that this measure…

We prove that a general class of measures, which includes $\log$-concave measures, is $\frac{1}{n}$-concave according to the terminology of Borell, with additional assumptions on the measures or on the sets, such as symmetries. This…

We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.

A construction of product measures is given for an arbitrary sequence of measure spaces via outer measure techniques without imposing any condition on the underlying measure spaces. This approach concludes finally the problem of the…

We study the relationship between different kinds of convergence of finite signed measures and discuss their metrizability. In particular, we study the concept of basic convergence recently introduced by Khartov [arXiv:2204.13667] and…

We establish a generalization of Anush Tserunyan and Jenna Zomback's 2024 Backward Ergodic Theorem. We remove the countable-to-one assumption and thus provide a backward ergodic theorem for arbitrary measure-preserving transformations.…

We introduce a new natural notion of convergence for permutations at any specified scale, in terms of the density of patterns of restricted width. In this setting we prove that limits may be chosen independently at a countably infinite…

In this paper we propose numerical measures for evaluating the aesthetic interest of simple patterns. The patterns consist of elements (symbols, pixels, etc.) in regular square arrays. The measures depend on two characteristics of the…

We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…