Related papers: Permutations and negative beta-shifts

In this paper, we start by giving the definitions and basic facts about hyperoctahedral number system. There is a natural correspondence between the integers expressed in the latter and the elements of the hyperoctahedral group when we use…

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

We give two versions of the natural extension of a specific greedy beta-transformation with deleted digits. We use the natural extension to obtain an explicit expression for the invariant measure, equivalent to the Lebesgue measure, of this…

Motivated by a problem from behavioral economics, we study subgroups of permutation groups that have a certain strong symmetry. Given a fixed permutation, consider the set of all permutations with disjoint inversion sets. The group is…

In the context of the genome rearrangement problem, we analyze two well known models, namely the block transposition and the prefix block transposition models, by exploiting the connection with the notion of permutation pattern. More…

Necessary and sufficient conditions are given for the similarity between two perturbations of the (backward) shift by rank one operators, under certain assumptions on the perturbations. The proof of similarity is based on an explicit…

We introduced positive cones in an earlier paper as a notion of ordering on central simple algebras with involution that corresponds to signatures of hermitian forms. In the current paper we describe signatures of hermitian forms directly…

We consider the structure of roller coaster permutations as introduced by Ahmed & Snevily[1]. A roller coaster permutation is described as a permuta- tion that maximizes the total switches from ascending to descending or visa versa for the…

The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fundamental to understand nature and complexity of optimization…

Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…

In this paper, we deal with reversing and extended symmetries of shifts generated by bijective substitutions. We provide equivalent conditions for a permutation on the alphabet to generate a reversing/extended symmetry, and algorithms how…

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…

In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…

In this paper I present a conjecture for a recursive algorithm that finds each permutation of combining two sets of objects (AKA the Shuffle Product). This algorithm provides an efficient way to navigate this problem, as each atomic…

Computing the reversal distances of signed permutations is an important topic in Bioinformatics. Recently, a new lower bound for the reversal distance was obtained via the plane permutation framework. This lower bound appears different from…

We introduce a permutation analogue of the celebrated Szemeredi Regularity Lemma, and derive a number of consequences. This tool allows us to provide a structural description of permutations which avoid a specified pattern, a result that…

In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem…

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

A treatment is given of the orbit dynamics for linear unstable motion that allows for the zeros in the beta function and makes no assumptions about the realness of the betatron and phase functions. The phase shift per turn is shown to be…

The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…