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

For typical cocycles over subshifts of finite type, we show that for any given orbit segment, we can construct a periodic orbit such that it shadows the given orbit segment and that the product of the cocycle along its orbit is a proximal…

We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…

We prove that for continuous maps on the interval, the existence of an n-cycle, implies the existence of n-1 points which interwind the original ones and are permuted by the map. We then use this combinatorial result to show that piecewise…

We give a complete description of the stable subset (the union of all backward orbit with bounded step) and of the pre-models of a univalent self-map $f: X\to X$, where $X$ is a Kobayashi hyperbolic cocompact complex manifold, such as the…

We classify the regular maps $\mathcal M$ which have automorphism groups $G$ acting faithfully and primitively on their vertices. As a permutation group $G$ must be of almost simple or affine type, with dihedral point stabilisers. We show…

The allowed patterns of a map are those permutations in the same relative order as the initial segments of orbits realized by the map. In this paper, we characterize and provide enumerative bounds for the allowed patterns of signed shifts,…

This paper shows that orbital equations generated by iteration of polynomial maps do not have necessarily a unique representation. Remarkably, they may be represented in an infinity of ways, all interconnected by certain nonlinear…

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…

Let $G=(V,E)$ be a simple graph without isolated vertices. A set $S\subseteq V$ is a paired-dominating set if every vertex in $V-S$ has at least one neighbor in $S$ and the subgraph induced by $S$ contains a perfect matching. In this paper,…

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…

A disjoint rotation map is an interval exchange transformation (IET) on the unit interval that acts by rotation on a finite number of invariant subintervals. It is currently unknown whether the group E of all IETs possesses any non-abelian…

We study the action of substitution maps between power series rings as an additional algebraic structure on the groups of Hasse--Schmidt derivations. This structure appears as a counterpart of the module structure on classical derivations.

In this paper we introduce filtration pairs for isolated invariant sets of continuous maps. We prove the existence of filtration pairs and show that, up to shift equivalence, the induced map on the corresponding pointed space is an…

Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…

We establish a bijection between the set of finite topological $T_0$-spaces (or partially ordered sets) and equivalence classes of square matrices. The absolute value of the determinant or the rank of these matrices serve as simple homotopy…

In this article, we compare the dynamics of the shift map and its induced counterpart on the hyperspace of the shift space. We show that many of the properties of induced shift map can be easily demonstrated by appropriate sequences of…

We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…

We study the existence of unitriangular basic sets for the symmetric group which behave nicely with respect to the Mullineux involution. Such sets give a natural labelling for the modular irreducible representations. We show that, for any…

Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix $A$ into another $B$ if and only if the vector of eigenvalues of $A$ majorizes that of $B$. In this work I characterize the…