Related papers: Periodic Points of Consecutive-Pattern-Avoiding St…

Recently, Babson and Steingrimsson have introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider pattern avoidance for such patterns, and…

Given an SFT $\Sigma$ and a finite set $S$ of finite words, let $\Sigma\langle S\rangle$ denote the subshift of $\Sigma$ that avoids $S$. We establish a general criterion under which we can bound the entropy perturbation…

In this article, we provide a bijection between the set of inversion sequences avoiding the pattern 102 and the set of 2-Schr\"{o}der paths having neither peaks nor valleys and ending with a diagonal step. To achieve this, we introduce two…

This short paper is concerned with the enumeration of permutations avoiding the following four patterns: $2431$, $4231$, $1432$ and $4132$. Using a bijective construction, we prove that these permutations are counted by the central binomial…

Let $\pi$ be a cyclic permutation that can be expressed in its one-line form as $\pi = \pi_1\pi_2 \cdot\cdot\cdot \pi_n$ and in its standard cycle form as $\pi = (c_1,c_2, ..., c_n)$ where $c_1=1$. Archer et al. introduced the notion of…

By studying various rational integrable maps on $\mathbf{\hat C}^d$ with $p$ invariants, we show that periodic points form an invariant variety of dimension $\ge p$ for each period, in contrast to the case of nonintegrable maps in which…

We consider the distribution of ascents, descents, peaks, valleys, double ascents, and double descents over permutations avoiding a set of patterns. Many of these statistics have already been studied over sets of permutations avoiding a…

Drmota and Stufler proved recently that the expected number of pattern occurrences of a given map is asymptotically linear when the number of edges goes to infinity. In this paper we improve their result by means of a different method. Our…

We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for…

For an integer $m \geq 2$, let $\mathcal{P}_m$ be the partition of the unit interval $I$ into $m$ equal subintervals, and let $\mathcal{F}_m$ be the class of piecewise linear maps on $I$ with constant slope $\pm m$ on each element of…

We study classes of set partitions determined by the avoidance of multiple patterns, applying a natural notion of partition containment that has been introduced by Sagan. We say that two sets S and T of patterns are equivalent if for each…

We extend earlier work of the same author to enumerate alternating permutations avoiding the permutation pattern 2143. We use a generating tree approach to construct a recursive bijection between the set A_{2n}(2143) of alternating…

We study chain-recurrence and chain-transitivity in compact dynamical systems without any regularity assumptions on the map. We prove that every compact system has a chain-recurrent point and a closed, invariant, chain-transitive subsystem.…

There are several approaches to study occurrences of consecutive patterns in permutations such as the inclusion-exclusion method, the tree representations of permutations, the spectral approach and others. We propose yet another approach to…

Cohn and Kumar showed that the permutation on the set of the classes of left associated Hurwitz primes above an odd prime $p$ induced through metacommutation by a Hurwitz prime $\xi$ of norm $q$ has either $0$, $1$ or $2$ fixed points, and…

We prove that spiral sinks (stable foci of vector fields) can be transformed into strange attractors exhibiting sustained, observable chaos if subjected to periodic pulsatile forcing. We show that this phenomenon occurs in the context of…

We consider the problem of enumerating permutations in the symmetric group on $n$ elements which avoid a given set of consecutive pattern $S$, and in particular computing asymptotics as $n$ tends to infinity. We develop a general method…

Starting with the zero-square "zeon algebra" the connection with permanents is shown. Permanents of sub-matrices of a linear combination of the identity matrix and all-ones matrix leads to moment polynomials with respect to the exponential…

We study orbits of semigroups of $\text{SL}(2,\mathbb{Z})$, and demonstrate reciprocity obstructions: we show that certain such orbits avoid squares, but not as a consequence of obstructions inherited from an algebraic set, and not as a…

The extension of pattern avoidance from ordinary permutations to those on multisets gave birth to several interesting enumerative results. We study permutations on regular multisets, i.e., multisets in which each element occurs the same…