Related papers: A von Neumann theorem for uniformly distributed se…

In this paper we give a precise estimate of the discrepancy of a class of uniformly distributed sequences of partitions. Among them we found a large class having low discrepancy (which means of order 1/N. One of them is the…

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

In this note we show that pattern matching in permutations is polynomial time reducible to pattern matching in set partitions. In particular, pattern matching in set partitions is NP-Complete.

The paper deals with a generalisation of uniform distribution. The analogues of Weyl's criterion are derived.

We introduce an elementary argument to the theory of distribution of sequences modulo one.

We give a detailed analysis of the proportion of elements in the symmetric group on $n$ points whose order divides $m$, for $n$ sufficiently large and $m \ge n$ with $m = O(n)$.

We study the problem of determining the distribution of vertices of a particular given type in the set of all Feynman tree graphs in quantum field theories. We show that in almost all cases a Gaussian distribution arises asymptotically, and…

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…

We introduce and study a simple Markovian model of random separable permutations. Our first main result is the almost sure convergence of these permutations towards a random limiting object in the sense of permutons, which we call the…

Let $A_k(n)$ denote the set of $k$-distinct partitions of $n$, and let $B_k(n)$ be the set of $k$-regular partitions of $n$. Glaisher showed that $\# A_k(n) = \# B_k(n)$. For $k=2$, this equality yields the celebrated Euler's partition…

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

Assuming the Generalized Riemann Hypothesis we obtain uniform, effective number-field analogues of Mertens' theorems.

A problem of Steinhaus was to partition a finite interval $I$ of the real line into countably infinitely many pairwise disjoint sets that are congruent in the sense that each set is a translate of a fixed set $A$. This paper describes von…

Lenz and Stollmann recently proved the existence of the integrated density of states in the sense of uniform convergence of the distributions for certain operators with aperiodic order. The goal of this paper is to establish a relation…

We show that some abstract results on propagation of fixed points for completely positive maps on $C^*$-algebras provide a natural approach to unify recent Noether type theorems on the equivalence of symmetries with conservation laws for…

Kingman derived the Ewens sampling formula for random partitions from the genealogy model defined by a Poisson process of mutations along lines of descent governed by a simple coalescent process. M\"ohle described the recursion which…

In this paper using Sperner's lemma for modified partition of a simplex we will constructively prove Brouwer's fixed point theorem for sequentially locally non-constant and uniformly sequentially continuous functions.

The classic Birkhoff- von Neumann theorem states that the set of doubly stochastic matrices is the convex hull of the permutation matrices. In this paper, we study a generalisation of this theorem in the type $II_1$ setting. Namely, we…