Related papers: Affine interval exchange maps with a wandering int…
We develop a theory of minors for alternating dimaps --- orientably embedded digraphs where, at each vertex, the incident edges (taken in the order given by the embedding) are directed alternately into, and out of, the vertex. We show that…
Following the program of investigation of alternative spinor duals potentially applicable to fermions beyond the standard model, we demonstrate explicitly the existence of several well-defined spinor duals. Going further we define a mapping…
This paper uses a construction of M. Keane to show that there exists a topologically mixing interval exchange transformation.
The dynamics of coupled intermittent maps is used to model the correlated structure of genomic sequences. The use of intermittent maps, as opposed to other simple chaotic maps, is particularly suited for the production of long range…
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
We exhibit an explicit full measure class of minimal interval exchange maps T for which the cohomological equation $\Psi -\Psi\circ T=\Phi$ has a bounded solution $\Psi$ provided that the datum $\Phi$ belongs to a finite codimension…
One can realize higher laminations as positive configurations of points in the affine building. The duality pairings of Fock and Goncharov give pairings between higher laminations for two Langlands dual groups $G$ and $G^{\vee}$. These…
Let $T$ be an $m$-interval exchange transformation. By the rank of $T$ we mean the dimension of the $\mathbb{Q}$-vector space spanned by the lengths of the exchanged intervals. We prove that if $T$ is minimal and the rank of $T$ is greater…
We study countably piecewise continuous, piecewise monotone interval maps. We establish a necessary and sufficient criterion for the existence of a nondecreasing semiconjugacy to a map of constant slope in terms of the existence of an…
Transmission of a vertex v of a connected graph G is the sum of distances from v to all other vertices in G. Graph G is transmission irregular (TI) if no two of its vertices have the same transmission, and G is interval transmission…
In this paper, we investigate a class of non-invertible piecewise isometries on the upper half-plane known as Translated Cone Exchanges. These maps include a simple interval exchange on a boundary we call the baseline. We provide a…
We study aperiodic systems based on substitution rules by means of a transfer-matrix approach. In addition to the well-known trace map, we investigate the so-called `antitrace' map, which is the corresponding map for the difference of the…
In this paper we start by briefly surveying the theory of Fractional Jumps and transitive projective maps. Then, we give an efficient construction of a fractional jump of a projective map and we extend the compound generator construction…
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…
We prove that irreducible, linearly recurrent, type W interval exchange transformations are always mild mixing. For every irreducible permutation the set of linearly recurrent interval exchange transformations has full Hausdorff dimension.
Let $X$ be a finite set. We determine the diameter of the commuting graph of the partial transformation semigroup $\mathcal{P}(X)$ on $X$ and show that it coincides with the diameter of the commuting graph of the transformation semigroup…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
Since its introduction by Symons, the semigroup of maps with restricted range has been studied in the context of transformations on a set, or of linear maps on a vector space. Sets and vector spaces being particular examples of independence…
We consider ensembles of real symmetric band matrices with entries drawn from an infinite sequence of exchangeable random variables, as far as the symmetry of the matrices permits. In general the entries of the upper triangular parts of…
Many problems in machine learning involve calculating correspondences between sets of objects, such as point clouds or images. Discrete optimal transport provides a natural and successful approach to such tasks whenever the two sets of…