English
Related papers

Related papers: The thirty-seven measures on permutations

200 papers

Representations of sets are challenging to learn because operations on sets should be permutation-invariant. To this end, we propose a Permutation-Optimisation module that learns how to permute a set end-to-end. The permuted set can be…

Machine Learning · Computer Science 2019-01-16 Yan Zhang , Jonathon Hare , Adam Prügel-Bennett

We open a new field on how one can define means on infinite sets. We investigate many different ways on how such means can be constructed. One method is based on sequences of ideals, other deals with accumulation points, one uses isolated…

Classical Analysis and ODEs · Mathematics 2019-06-18 Attila Losonczi

Define an outer measure on R^n by taking the infimum, over all covers of the set by tubes, of the sum of the cross-sectional areas of the tubes. We show that the only measurable sets for this outer measure are its null sets and their…

Classical Analysis and ODEs · Mathematics 2007-05-23 Marianna Csörnyei , Laura Wisewell

The new notion of maturity-independent risk measures is introduced and contrasted with the existing risk measurement concepts. It is shown, by means of two examples, one set on a finite probability space and the other in a diffusion…

Risk Management · Quantitative Finance 2008-12-02 Thaleia Zariphopoulou , Gordan Zitkovic

Say that a permutation of $1,2,\ldots,n$ is \textit{$k$-bounded} if every pair of consecutive entries in the permutation differs by no more than $k$. Such a permutation is \textit{anchored} if the first entry is $1$ and the last entry is…

Combinatorics · Mathematics 2019-09-11 Maria M. Gillespie , Kenneth G. Monks , Kenneth M. Monks

We establish various forms of the following certainty principle: a set $S \subset \mathbb{R}^{n}$ contains a given finite linear pattern, provided that $S$ is a support of the Fourier transform of a sufficiently singular probability measure…

Classical Analysis and ODEs · Mathematics 2024-10-22 Rami Ayoush

We formulate and prove a very general relative version of the Dobrushin-Lanford-Ruelle theorem which gives conditions on constraints of configuration spaces over a finite alphabet such that for every absolutely summable relative…

Mathematical Physics · Physics 2020-05-07 Sebastián Barbieri , Ricardo Gómez , Brian Marcus , Siamak Taati

In [8] we found a class of overlapping asymmetric self-similar measures on the real line, which are generically absolutely continuous with respect to the Lebesgue measure. Here we construct exceptional measures in this class being singular.

Dynamical Systems · Mathematics 2018-10-31 Jörg Neunhäuserer

The paper treats density measures as typical examples of finitely additive measures in $\mathbb{R}^n$. We study their structure and derive basic properties. In addition, estimates for related integrals are provided. The results are applied…

Analysis of PDEs · Mathematics 2026-03-26 Moritz Schönherr , Friedemann Schuricht

In this note we investigate correlation inequalities for `up-sets' of permutations, in the spirit of the Harris--Kleitman inequality. We focus on two well-studied partial orders on $S_n$, giving rise to differing notions of up-sets. Our…

Combinatorics · Mathematics 2020-04-22 J. Robert Johnson , Imre Leader , Eoin Long

We give an example of non-translation invariant product measure obtained from two translation invariant measures, one of which is non-sigma finite. This particular example also suggests that there can be infinitely many product measures if…

General Mathematics · Mathematics 2023-10-02 Nicha Khenkhok

We complete the program developed in our previous works aiming to construct an infinite sequence of invariant measures of gaussian type associated with the conservation laws of the Benjamin-Ono equation.

Analysis of PDEs · Mathematics 2015-09-30 Y. Deng , N. Tzvetkov , N. Visciglia

The paper reviews two prominent approaches for the measurement of technological complexity: the method of reflection and the assessment of technologies' combinatorial difficulty. It discusses their central underlying assumptions and…

Applications · Statistics 2018-03-12 Tom Broekel

The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…

Combinatorics · Mathematics 2021-11-17 Quinn Minnich

Certain countably and finitely additive measures can be associated to a given nonnegative supermartingale. Under weak assumptions on the underlying probability space, existence and (non)uniqueness results for such measures are proven.

Probability · Mathematics 2015-12-23 Nicolas Perkowski , Johannes Ruf

Kaneko and Tsumura proved a relation of multiple $\tilde{T}$-values involving Entringer numbers counting the total number of down-up permutations starting with a fixed value. In the present paper, we generalize this relation and provide…

Number Theory · Mathematics 2024-04-30 Ryota Umezawa

Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…

High Energy Physics - Theory · Physics 2016-05-04 Sanjaye Ramgoolam

The first part deals with piecewise fractional linear maps with three branches. Given a map $T$ a map $S$ is called a related map if some branches of $T$ are replaced by a 'flipped' branch, namely a branch of $1-T$. The main question is if…

Dynamical Systems · Mathematics 2026-02-24 Fritz Schweiger

Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of…

Probability · Mathematics 2009-02-04 Carl Graham

A sample of n generic points in the xy-plane defines a permutation that relates their ranks along the two axes. Every subset of k points similarly defines a pattern, which occurs in that permutation. The number of occurrences of small…

Data Structures and Algorithms · Computer Science 2021-09-14 Chaim Even-Zohar , Calvin Leng