We define “Locally Nameless Permutation Types”, which fuse permutation types as used in Nominal Isabelle with the locally nameless representation. We show that this combination is particularly useful when formalizing programming languages where bound names may become free during execution (“extrusion”), common in process calculi. It inherits the generic definition of permutations and support, a...

Modeling proximity searching problems in a metric space allows one to approach many problems in different areas, e.g. pattern recognition, multimedia search, or clustering. Recently there was proposed the permutation based approach, a novel technique that is unbeatable in practice but difficult to compress. In this article we introduce an improvement on that metric space search data structure. ...

This paper proposes a novel statistical procedure based on permutation tests for extracting a subset of truly relevant variables from multivariate importance rankings derived from tree-based supervised learning methods. It shows also that the direct extension of the classical approach based on permutation tests for estimating false discovery rates of univariate variable scoring procedures does ...

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner combinatorial description of the invariant ring. Computational Invariant Theory, representation theory, permutation group This is a drafty old version : full ...

We review a recently proposed approach to the problem of alternating signs for fermionic many body Monte Carlo simulations in finite temperature simulations. We derive an estimate for fermion wandering lengths and introduce the notion of permutation zones, special regions of the lattice where identical fermions may interchange and outside of which they may not. Using successively larger permuta...

We axiomatize permutation equivalence in term rewriting systems and Klop's orthogonal Combinatory Reduction Systems Klop 1980]. The axioms for the former ones are provided by the general approach proposed by Meseguer Meseguer 1992]. The latter ones need extra axioms modeling the interplay between reductions and the operation of substitution. As a consequence of this work, the deenition of permu...

The set of synchronizing words a given n-state automaton forms regular language recognizable by an with \(2^n - n\) states. size recognizing for the is linked to computational problems related synchronization and length words. Hence, it natural investigate automata extremal this property, i.e., such that minimal deterministic has sync-maximal permutation groups have been introduced in [S. Hoffm...

The problem of reconstructing signed permutations on n elements from their erroneous patterns distorted by reversal errors is considered in this paper.A reversal is the operation of taking a segment of the signed permutation, reversing it, and flipping the signs of its elements. The reversal metric is defined as the least number of reversals transforming one signed permutation into another. It ...

The problem of sorting signed permutations by reversals is a well-studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pevzner in 1995. The algorithm was improved several times, and nowadays the most efficient algorithm has a subquadratic running time. Simple permutations played an important role in the development of these algorithms. A...