相关论文: Bifix codes and interval exchanges
We introduce a class of sets of words which is a natural common generalization of Sturmian sets and of interval exchange sets. This class of sets consists of the uniformly recurrent tree sets, where the tree sets are defined by a condition…
The languages generated by interval exchange transformations have been characterized by Ferenczi-Zamboni (2008) and Belov-Cernyatev (2010) under some extra conditions on the system. Lifting these conditions leads us to consider successively…
We prove that any over-twist pattern is conjugate to an interval exchange transformation with bounded number of segments of isometry, restricted on one of its cycles. The bound is independent of the period and over-rotation number of the…
We define a new class of shift spaces which contains a number of classes of interest, like Sturmian shifts used in discrete geometry. We show that this class is closed under two natural transformations. The first one is called conjugacy and…
We establish a relation between fully extended $2$-dimensional TQFTs and recognisable weighted formal languages, rational biprefix codes and lattice TFTs. We show the equivalence of $2D$ closed TFTs and rational exchangeable series and we…
We initiate the study of sorting permutations using prefix block-interchanges, which exchange any prefix of a permutation with another non-intersecting interval. The goal is to transform a given permutation into the identity permutation…
In this article we prove that given a self-similar interval exchange transformation T, whose associated matrix verifies a quite general algebraic condition, there exists an affine interval exchange transformation with wandering intervals…
We show the equivalence of two possible definitions of a rotational interval exchange transformation: by the first one, it is a first return map for a circle rotation onto a union of finite number of circle arcs, and by the second one, it…
This paper considers a base station that delivers packets to multiple receivers through a sequence of coded transmissions. All receivers overhear the same transmissions. Each receiver may already have some of the packets as side…
The class of intersection bigraphs of unit intervals of the real line whose ends may be open or closed is called a class of mixed unit interval bigraphs. This class of bigraphs is a strict superclass of the class of unit interval bigraphs.…
We consider the problem of coding over the multi-user Interference Channel (IC). It is well-known that aligning the interfering signals results in improved achievable rates in certain setups involving more than two users. We argue that in…
A new class of alternating convolutions concerning binomial coefficients and Catalan numbers are evaluated in closed forms.
A sharp bound on the number of invariant components of an interval exchange transformation is provided. More precisely, it is proved that the number of periodic components n_per and the number of minimal components n_min of an interval…
We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of…
We study the existence of transitive exchange maps with flips defined on the unit circle. We provide a complete answer to the question of whether there exists a transitive exchange map of the unit circle defined on n subintervals and having…
We define a diophantine condition for interval exchange transformations (i.e.t.s). When the number of intervals is two, that is for rotations on the circle, our condition coincides with classical Khinchin condition. We prove for i.e.t.s the…
A general class of the almost instantaneous fixed-to-variable-length (AIFV) codes is proposed, which contains every possible binary code we can make when allowing finite bits of decoding delay. The contribution of the paper lies in the…
We present a computational study of finite-time mixing of a line segment by cutting and shuffling. A family of one-dimensional interval exchange transformations is constructed as a model system in which to study these types of mixing…
Let $W$ be an infinite word over finite alphabet $A$. We get combinatorial criteria of existence of interval exchange transformations that generate the word W.
We consider the restriction of interval exchange transformations to algebraic number fields, which leads to maps on lattices. We characterize renormalizability arithmetically, and study its relationships with a geometrical quantity that we…