English
Related papers

Related papers: The thirty-seven measures on permutations

200 papers

Spaces of quasi-invariant measures supplied with different topologies are studied. Their embeddings, projective decompositions, conditions for their metrizability are investigated. Theorems about convergence of nets of quasi-invariant…

Probability · Mathematics 2016-06-08 Sergey Victor Ludkowski

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…

Combinatorics · Mathematics 2009-11-09 S. V. Avgustinovich , A. E. Frid , T. Kamae , P. V. Salimov

It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.

Combinatorics · Mathematics 2012-02-14 M. H. Albert , Micah Coleman , Ryan Flynn , Imre Leader

We present an analysis of eight measures used for quantifying morphological complexity of natural languages. The measures we study are corpus-based measures of morphological complexity with varying requirements for corpus annotation. We…

Computation and Language · Computer Science 2022-04-12 Çağrı Çöltekin , Taraka Rama

We study a class of Markov chains that model the evolution of a quantum system subject to repeated measurements. Each Markov chain in this class is defined by a measure on the space of matrices. It is then given by a random product of…

Probability · Mathematics 2017-04-03 Tristan Benoist , Martin Fraas , Yan Pautrat , Clément Pellegrini

The invariant measure is a fundamental object in the theory of Markov processes. In finite dimensions a Markov process is defined by transition rates of the corresponding stochastic matrix. The Markov tree theorem provides an explicit…

Probability · Mathematics 2019-10-08 Artur Stephan

Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…

Computational Complexity · Computer Science 2023-06-16 Mandar Juvekar , Arian Nadjimzadah

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

Combinatorics · Mathematics 2025-05-28 Atli Fannar Franklín

We establish an equivalence-singularity dichotomy for a large class of one-dimensional Markov measures. Our approach is new in that we deal with one-sided and two-sided chains simultaneously, and in that we do not appeal to any 0-1 law. In…

Probability · Mathematics 2022-12-07 Nachi Avraham-Re'em

This paper formulates and evaluates a series of multi-unit measures of directional association, building on the pairwise {\Delta}P measure, that are able to quantify association in sequences of varying length and type of representation.…

Computation and Language · Computer Science 2021-04-06 Jonathan Dunn

A connection between representation of compact groups and some invariant ensembles of Hermitian matrices is described. We focus on two types of invariant ensembles which extend the Gaussian and the Laguerre Unitary ensembles. We study them…

Probability · Mathematics 2012-07-12 Manon Defosseux

Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…

Combinatorics · Mathematics 2015-08-18 Sergey Bereg , Alexander E. Holroyd , Lev Nachmanson , Sergey Pupyrev

We present an approach to the study of stationary measures placing Tarski's foundational work in this area within a modern category theoretic context. Guiding this work is the notion that measurable spaces equipped with symmetries carry an…

Probability · Mathematics 2013-07-30 Tyler Bryson

For each vector $v$ we define the notion of a $v$-positive type for infinite measure-preserving transformations, a refinement of positive type as introduced by Hajian and Kakutani. We prove that a positive type transformation need not be…

Dynamical Systems · Mathematics 2013-10-11 Tudor Pădurariu , Cesar E. Silva , Evangelie Zachos

This short review is devoted to measures on infinite dimensional spaces. We start by discussing product measures and projective techniques. Special attention is paid to measures on linear spaces, and in particular to Gaussian measures.…

Functional Analysis · Mathematics 2023-12-08 José Velhinho

The relation between tempered distributions and measures is analysed and clarified. While this is straightforward for positive measures, it is surprisingly subtle for signed or complex measures.

Functional Analysis · Mathematics 2024-04-22 Michael Baake , Nicolae Strungaru

I am going to compare well-known properties of infinite words with those of infinite permutations, a new object studied since middle 2000s. Basically, it was Sergey Avgustinovich who invented this notion, although in an early study by Davis…

Formal Languages and Automata Theory · Computer Science 2011-08-19 Anna E. Frid

We propose and study a novel collection of signed measures, which will be apply called Taylor measures. Stochastic versions of the new measures are also defined and studied. We illustrate, through examples, how the deterministic and…

Probability · Mathematics 2025-08-15 Athanasios Christou Micheas

In this paper we provide sufficient conditions which guarantee the existence of a system of invariant measures for semigroups associated to systems of parabolic differential equations with unbounded coefficients. We prove that these…

Analysis of PDEs · Mathematics 2017-12-05 Davide Addona , Luciana Angiuli , Luca Lorenzi

We develop a new, powerful method for counting elements in a multiset. As a first application, we use this algorithm to study the number of occurrences of patterns in a permutation. For patterns of length 3 there are two Wilf classes, and…

Combinatorics · Mathematics 2024-03-05 Andrew R Conway , Anthony J Guttmann