Related papers: (M + 1)-step shift spaces that are not conjugate t…

A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…

We initiate the study of correspondences for Smale spaces. Correspondences are shown to provide a notion of a generalized morphism between Smale spaces and are a special case of finite equivalences. Furthermore, for shifts of finite type, a…

This is an expository paper about iterations of a smooth real function $f$ on $[0,\varepsilon)$ such that $f(0)=0$, $f'(0)=1$, and $f(x)<x$ for $x>0$, i.e., the sequence defined by $x_{n+1}=f(x_n)$. This sequence has interesting…

Let $\mathbb{V}$ denote an $n$-tuple of shifts of finite multiplicity, and denote by $\mathrm{Ann}(\mathbb{V})$ the ideal consisting of polynomials $p$ in $n$ complex variables such that $p(\mathbb{V})=0$. If $\mathbb{W}$ on $\mathfrak{K}$…

We investigate commutative analogues of Clifford algebras -- algebras whose generators square to $\pm1$ but commute, instead of anti-commuting as they do in Clifford algebras. We observe that commutativity allows for elegant results. We…

The notion of (3+1)-avoidance has shown up in many places in enumerative combinatorics. The natural goal of enumeration of all (3+1)-avoiding posets remains open. In this paper, we enumerate graded (3+1)-avoiding posets for both reasonable…

Recently a generalization of shifts of finite type to the infinite alphabet case was proposed, in connection with the theory of ultragraph C*-algebras. In this work we characterize the class of continuous shift commuting maps between these…

We consider an orbit category of the bounded derived category of a path algebra of type A_n which can be viewed as a -(m+1)-cluster category, for m >= 1. In particular, we give a characterisation of those maximal m-rigid objects whose…

We study M-separability as well as some other combinatorial versions of separability. In particular, we show that the set-theoretic hypothesis b=d implies that the class of selectively separable spaces is not closed under finite products,…

We describe a class of $C^*$-algebras which simultaneously generalise the ultragraph algebras of Tomforde and the shift space $C^*$-algebras of Matsumoto. In doing so we shed some new light on the different $C^*$-algebras that may be…

We present a variety of new results on finite sets A of integers for which the sumset A+A is larger than the difference set A-A, so-called MSTD (more sums than differences) sets. First we show that there is, up to affine transformation, a…

We provide examples of nonseparable spaces $X$ for which C(X) admits an isometric shift of type I, which solves in the negative a problem proposed by Gutek {\em et al.} (J. Funct. Anal. {\bf 101} (1991), 97-119). We also give two…

We investigate the dynamics of tiling dynamical systems and their deformations. If two tiling systems have identical combinatorics, then the tiling spaces are homeomorphic, but their dynamical properties may differ. There is a natural map…

Many recent papers deal with the enumeration of 2-dimensional walks with prescribed steps confined to the positive quadrant. The classification is now complete for walks with steps in $\{0, \pm 1\}^2$: the generating function is D-finite if…

Given a positive integer $M$ and $q \in (1, M+1]$ we consider expansions in base $q$ for real numbers $x \in \left[0, {M}/{q-1}\right]$ over the alphabet $\{0, \ldots, M\}$. In particular, we study some dynamical properties of the natural…

It is known that complete graphs and complete multipartite graphs have modularity zero. We show that the least number of edges we may delete from the complete graph $K_n$ to obtain a graph with non-zero modularity is $\lfloor n/2\rfloor…

A homshift is a $d$-dimensional shift of finite type which arises as the space of graph homomorphisms from the grid graph $\mathbb Z^d$ to a finite connected undirected graph $G$. While shifts of finite type are known to be mired by the…

\begin{abstract} In this paper, we investigate a shift arising from graph $G$. We prove that any $k$-dimensional shift of finite type can be generated through a $k$-dimensional graph. We investigate the structure of the shift space using…

Recently, Bostan and his coauthors investigated lattice walks restricted to the non-negative octant $\mathbb{N}^3$. For the $35548$ non-trivial models with at most six steps, they found that many models associated to a group of order at…

We characterize disjoint and simultaneously hypercyclic tuples of unilateral pseudo-shift operators on $\ell^p(\mathbb{N})$. As a consequence, complementing the results of Bernal and Jung, we give a characterization for simultaneously…