Related papers: Percolating sets and the operad of permutations
We describe infinite clusters which arise in nearest-neighbour percolation for so-called cocycle measures on the square lattice. These measures arise naturally in the study of random transformations. We show that infinite clusters have a…
In this paper, we will address broader concepts for Dunford-Pettis operators, presenting new classes and results that correlate this class with others already well-studied in the literature, as well as an approach outside the origin. We…
The interval poset of a permutation catalogues the intervals that appear in its one-line notation, according to set inclusion. We study this poset, describing its structural, characterizing, and enumerative properties.
Using a recently introduced algorithm for simulating percolation in microcanonical (fixed-occupancy) samples, we study the convergence with increasing system size of a number of estimates for the percolation threshold for an open system…
Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…
The inner plethysm of symmetric functions corresponds to the $\lambda$-ring operations of the representation ring $R({\mathfrak S}_n)$ of the symmetric group. It is known since the work of Littlewood that this operation possesses stability…
Given a sequence of real numbers, we consider its subsequences converging to possibly different limits and associate to each of them an index of convergence which depends on the density of the associated subsequences. This index turns out…
A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
Ordinal Patterns are a time-series data analysis tool used as a preliminary step to construct the Permutation Entropy which itself allows the same characterization of dynamics as chaotic or regular as more theoretical constructs such as the…
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…
. We study the statistical properties of the eigenvalues of non-Hermitian operators assoicated with the dissipative complex systems. By considering the Gaussian ensembles of such operators, a hierarchical relation between the correlators is…
We introduce a notion of an operad of complexity $m$, for $m \geq 1$. Operads of complexity $1$ are monoids in the category of $\mathbb{N}$-indexed collections, with monoidal product given by the Day convolution, and operads of complexity…
We introduce truncation ideals of a $\Bbbk$-linear unitary symmetric operad and use them to study ideal structure, growth property and to classify operads of low Gelfand-Kirillov dimension.
We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operads obtained from usual monoids such as the additive and multiplicative…
A representation for the kernel of the transmutation operator relating the perturbed Bessel equation with the unperturbed one is obtained in the form of a functional series with coefficients calculated by a recurrent integration procedure.…
An operad describes a category of algebras and a (co)homology theory for these algebras may be formulated using the homological algebra of operads. A morphism of operads $f:\mathcal{O}\rightarrow\mathcal{P}$ describes a functor allowing a…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
A sweep of a point configuration is any ordered partition induced by a linear functional. Posets of sweeps of planar point configurations were formalized and abstracted by Goodman and Pollack under the theory of allowable sequences of…
The X-ray of a permutation is defined as the sequence of antidiagonal sums in the associated permutation matrix. X-rays of permutation are interesting in the context of Discrete Tomography since many types of integral matrices can be…