English
Related papers

Related papers: Block Maps between Primitive Uniform and Pisot Sub…

200 papers

Assume that the interval $I=[0,1)$ is partitioned into finitely many intervals $I_1,\dots,I_r$ and consider a map $T\colon I\to I$ so that $T_{\vert I_s}$ is a translation for each $1 \le s \le r$. We do not assume that the images of these…

Dynamical Systems · Mathematics 2025-06-12 Kostiantyn Drach , Leon Staresinic , Sebastian van Strien

A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…

Group Theory · Mathematics 2018-05-25 Gareth A. Jones

In this paper we establish a new connection between central sets and the strong coincidence conjecture for fixed points of irreducible primitive substitutions of Pisot type. Central sets, first introduced by Furstenberg using notions from…

Combinatorics · Mathematics 2013-01-25 Marcy Barge , Luca Q. Zamboni

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…

General Physics · Physics 2020-05-20 R. T. Cavalcanti , J. M. Hoff da Silva

We show that several monoids of non-negative integer matrices enjoy a Pisot property: each matrix in that monoid has only one eigenvalue with absolute value larger than one. These monoids come from multidimensional continued fractions,…

Dynamical Systems · Mathematics 2015-06-12 Artur Avila , Vincent Delecroix

We exhibit a single interval map (called universal map) that admits all those orbit patterns which are available in the first Sharkovsky class. An interval map is said to be in the first Sharkovsky class if every periodic point of it is a…

Dynamical Systems · Mathematics 2021-11-15 V. Kannan , Pabitra Narayan Mandal

Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets and proposed a definition for sliding block codes between such shift spaces. In this work we propose a more general definition for sliding…

Dynamical Systems · Mathematics 2018-02-15 Daniel Gonçalves , Marcelo Sobottka , Charles Starling

We study the lattice of submonoids of the uniform block permutation monoid containing the symmetric group (which is its group of units). We prove that this lattice is distributive under union and intersection by relating the submonoids…

Combinatorics · Mathematics 2025-03-20 Rosa Orellana , Franco Saliola , Anne Schilling , Mike Zabrocki

Given a block of a finite group, any source algebra has a basis invariant under the multiplicative actions of the defect group. Is such a basis a characteristic biset of the block fusion system? If the basis can be chosen to consist…

Representation Theory · Mathematics 2019-09-05 Laurence Barker , Matthew Gelvin

A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local…

Combinatorics · Mathematics 2011-03-10 Thomas Fernique , Nicolas Ollinger

For quantum systems described by finite matrices, linear and affine maps of matrices are shown to provide equivalent descriptions of evolution of density matrices for a subsystem caused by unitary Hamiltonian evolution in a larger system;…

Quantum Physics · Physics 2009-11-10 Thomas F. Jordan

In this paper we provide sufficient conditions in order to show that the set image of a continuous and shift-commuting map defined on a shift space over an arbitrary discrete alphabet is also a shift space; additionally, if such a map is…

Dynamical Systems · Mathematics 2021-06-21 Jorge Campos , Neptalí Romero , Ramón Vivas

Let $\Omega$ be a set of cardinality $n$, $G$ a permutation group on $\Omega$, and $f:\Omega\to\Omega$ a map which is not a permutation. We say that $G$ synchronizes $f$ if the semigroup $\langle G,f\rangle$ contains a constant map. The…

Combinatorics · Mathematics 2014-01-27 João Araújo , Peter J. Cameron

We study a class of $\Z^{d}$-substitutive subshifts, including a large family of constant-length substitutions, and homomorphisms between them, i.e., factors modulo isomorphisms of $\Z^{d}$. We prove that any measurable factor map and even…

Dynamical Systems · Mathematics 2023-02-27 Christopher Cabezas

In this paper first we give a partial answer to a question of L. Moln\'ar and W. Timmermann. Namely, we will describe those linear (not necessarily bijective) transformations on the set of self-adjoint matrices which preserve a unitarily…

Functional Analysis · Mathematics 2015-07-13 György Pál Gehér , Gergő Nagy

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…

Data Structures and Algorithms · Computer Science 2022-08-29 Anthony Labarre

We propose graph theoretic equivalents for existence of a finite projective plane. We then develop a new approach and see that the problem of existence of a finite projective plane of order n is linked up with a subset of sharply 2…

General Mathematics · Mathematics 2015-08-04 Dhananjay P. Mehendale

A long-standing question is what invariant sets can be shared by two maps acting on the same space. A similar question stands for invariant measures. A particular interesting case are expanding Markov maps of the circle. If the two involved…

Dynamical Systems · Mathematics 2021-11-04 Georgios Lamprinakis

We give an example of a sequential dynamical system consisting of intermittent-type maps which exhibits loss of memory with a polynomial rate of decay. A uniform bound holds for the upper rate of memory loss. The maps may be chosen in any…

Dynamical Systems · Mathematics 2014-10-31 R. Aimino , H. Hu , M. Nicol , A. Torok , S. Vaienti

The operation of switching a graph $\Gamma$ with respect to a subset $X$ of the vertex set interchanges edges and non-edges between $X$ and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set…

Combinatorics · Mathematics 2015-02-19 Peter J. Cameron , Pablo Spiga