Related papers: Percolating sets and the operad of permutations
This paper is an introduction to a series of papers in which we give combinatorial models for certain important operads (including A-infinity and E-infinity operads, the little n-cubes operads, and the framed little disks operad) and…
In this paper we apply the previously derived formalism of permutation orbifold conformal field theories to N=2 supersymmetric minimal models. By interchanging extensions and permutations of the factors we find a very interesting structure…
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 prove the existence of non-trivial phase transitions for the intersection of two independent random interlacements and the complement of the intersection. Some asymptotic results about the phase curves are also obtained. Moreover, we…
This is a slightly enlarged and corrected version of a contribution to the Oberwolfach Reports 3(1):511-552, 2006. We summarise some results on spectral properties of Laplacians on percolation graphs and more general Anderson-percolation…
We study subcritical two-dimensional oriented percolation seen from its rightmost point on the set of infinite configurations which are bounded above. This a Feller process whose state space is not compact and has no invariant measures. We…
The present article exploits the fact that permutads (aka shuffle algebras) are algebras over a terminal operad in a certain operadic category Per. In the first, classical part we formulate and prove a claim envisaged by Loday and Ronco…
We consider independent edge percolation models on Z, with edge occupation probabilities p_<x,y> = p if |x-y| = 1, 1 - exp{- beta / |x-y|^2} otherwise. We prove that oriented percolation occurs when beta > 1 provided p is chosen…
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description of West-2-stack-sortable permutations, that is permutations…
We study the structure of multiple correlation sequences defined by measure preserving actions of commuting transformations. When the iterates of the transformations are integer polynomials we prove that any such correlation sequence is the…
A novel variational method is proposed for calculating the percolation threshold, the real-space structure, and the thermodynamical compressibility of a disordered two-dimensional electron liquid. Its high accuracy is verified against prior…
In this paper, I introduce a new generalization of the concept of an operad, further generalizing the concept of an opetope introduced by Baez and Dolan, who used this for the definition of their version of non-strict $n$-categories.…
For a permutation $\pi$, and the corresponding permutation matrix, we introduce the notion of {\em discrete derivative}, obtained by taking differences of successive entries in $\pi$. We characterize the possible derivatives of…
The main ideas developed in this habilitation thesis consist in endowing combinatorial objects (words, permutations, trees, Young tableaux, etc.) with operations in order to construct algebraic structures. This process allows, by studying…
Wall-crossing phenomena are ubiquitous in many problems of algebraic geometry and theoretical physics. Various ways to encode the relevant information and the need to track the changes under the variation of parameters lead to rather…
We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. The similarity with orbit algebras is such that it took the…
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…
The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…
The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Hum\'anez & Bernhardt (power of two). It is well known that Sharkovskii's theorem shows the relationship between the cardinal of the set of…
We review the basic properties of paired operators and their adjoints, the transposed paired operators, with particular reference to commutation relations, and we study the properties of their kernels, bringing out their similarities and…