Related papers: Composability of Permutation Classes

We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…

Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…

We prove necessary and sufficient conditions on a family of (generalised) gridding matrices to determine when the corresponding permutation classes are partially well-ordered. One direction requires an application of Higman's Theorem and…

There is a natural equivalence relation on representations of the states of a given quantum system in a Hilbert space, two representations being equivalent iff they are related by a unitary transformation. There are two equivalence classes,…

We define two natural classes of functions, called 2-open and 2-closed, that are closest to open and closed functions. We show that they have the following property: there are $X_i \subset X$ $ (i=1,2,...$) such that $f|X_i$ are open or…

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…

Let $\mathfrak{C}$ be a class of finite combinatorial structures. The \textit{profile} of $\mathfrak{C}$ is the function $\varphi_{\mathfrak{C}}$ which counts, for every integer $n$, the number $\varphi_{\mathfrak{C}}(n)$ of members of…

Two different models for a Hopf-von Neumann algebra of bounded functions on the quantum semigroup of all (quantum) permutations of infinitely many elements are proposed, one based on projective limits of enveloping von Neumann algebras…

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…

We count permutations avoiding a nonconsecutive instance of a two- or three-letter pattern, that is, the pattern may occur but only as consecutive entries in the permutation. Two-letter patterns give rise to the Fibonacci numbers. The…

Motivated by charge balancing constraints for rank modulation schemes, we introduce the notion of balanced permutations and derive the capacity of balanced permutation codes. We also describe simple interleaving methods for permutation code…

We use mathematical induction to prove that the horizontal composition in the class of coherently diagonal complexes is indeed a binary operation. That is to say, the embedding of two coherently diagonal complexes in an alternating planar…

Two approximations of the integral of a class of sinusoidal composite functions, for which an explicit form does not exist, are derived. Numerical experiments show that the proposed approximations yield an error that does not depend on the…

It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the…

We study three aspects of commutation classes of reduced decompositions: the number of commutation classes, the structures of their corresponding graphs, and the enumeration of subnetworks, a concept recently introduced by Warrington [21].…

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…

As a step towards resolving a question of Ru\v{s}kuc on the decidability of joint embedding for hereditary classes of permutations, which may be viewed as structures in a language of 2 linear orders, we show the corresponding problem is…

When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…

We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two…

We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…