Related papers: Permutation classes
In this preprint the notion of deformation quantization of endomorphism bundles over symplectic manifolds is defined and developed, including index theory.
This paper surveys some results and methods in topological transformation groups.
We propose a semantics for permutation equivalence in higher-order rewriting. This semantics takes place in cartesian closed 2-categories, and is proved sound and complete.
In this chapter we provide an overview of computational modeling for semantic change using large and semi-large textual corpora. We aim to provide a key for the interpretation of relevant methods and evaluation techniques, and also provide…
Different ways to describe a permutation, as a sequence of integers, or a product of Coxeter generators, or a tree, give different choices to define a simple permutation. We recollect few of them, define new types of simple permutations,…
Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six…
This article discuss a class of tractable model in the form of polynomial type.
The survey contains a brief description of the ideas, constructions, results, and prospects of the theory of hypergroups and generalized translation operators. Representations of hypergroups are considered, being treated as continuous…
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…
Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and…
This paper documents and reviews the state of the art concerning computational models of construction grammar learning. It brings together prior work on the computational learning of form-meaning pairings, which has so far been studied in…
Motivated by recent studies of large Mallows$(q)$ permutations, we propose a class of random permutations of $\mathbb{N}_{+}$ and of $\mathbb{Z}$, called regenerative permutations. Many previous results of the limiting Mallows$(q)$…
Permutation polynomials over finite fields have taken an important role in vast areas in mathematics as well as engineering. Recently, Tu et al. gave some classes of complete permutation polynomials over finite fields of even…
Permutation polynomials over finite fields have extensive applications in various areas. Particularly, permutation polynomials with simple forms are of great interest. In recent papers, several classes of permutation polynomials of the form…
Tensor transpose is a higher order generalization of matrix transpose. In this paper, we use permutations and symmetry group to define? the tensor transpose. Then we discuss the classification and composition of tensor transposes.…
This text contains over three hundred specific open questions on various topics in additive combinatorics, each placed in context by reviewing all relevant results. While the primary purpose is to provide an ample supply of problems for…
In this paper we provide an overview of a series of recent results regarding algorithms for searching for subsequences in words or for the analysis of the sets of subsequences occurring in a word.
In this survey paper we discuss some recent results and related open questions in additive combinatorics, in particular, questions about sumsets in finite abelian groups.
The theory of permutation orbifolds is reviewed and applied to the study of symmetric product orbifolds and the congruence subgroup problem. The issue of discrete torsion, the combinatorics of symmetric products, the Galois action and…
This paper studies permutation statistics that count occurrences of patterns. Their expected values on a product of $t$ permutations chosen randomly from $\Gamma \subseteq S_{n}$, where $\Gamma$ is a union of conjugacy classes, are…