Related papers: Multiple recurrence for two commuting transformati…
In this paper, we count a dual set of Stirling permutations by the number of alternating runs. Properties of the generating functions, including recurrence relations, grammatical interpretations and convolution formulas are studied.
We use the octahedron recurrence to give a simplified statement and proof of a formula for iterated birational rowmotion on a product of two chains, first described by Musiker and Roby. Using this, we show that weights of certain chains in…
We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some results previously proven separately by different methods for the two types of objects as well as some new results. We also…
We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., random walks whose transition probabilities depend both on the walker's position and incoming direction. We use results by Toth and Schmidt-Conze…
Huang, Shao and Ye recently studied pointwise multiple averages by using suitable topological models. Using a notion of dynamical cubes introduced by the authors, the Huang-Shao-Ye technique and the Host machinery of magic systems, we prove…
We prove that the commutator is stable in permutations endowed with the Hamming distance, that is, two permutations that almost commute are near two commuting permutations. Our result extends to $k$-tuples of almost commuting permutations,…
We show that if $p_1,p_2$ are injective, integer polynomials that vanish at the origin, such that either both are of degree $1$ or both are of degree $2$ or higher, then double recurrence fails for non-commuting, mixing, zero entropy…
In this paper we improve drastically the estimate for the multiplicity of a binary recurrence. The main contribution comes from an effective version of the Faltings' Product Theorem.
We prove a conjecture by Shannon Starr regarding the asymptotics for the number of tuples of commuting permutations with given number of joint orbits. These numbers generalize unsigned Stirling numbers of the first kind which count how many…
This work contributes to the programme of studying effective versions of "almost everywhere" theorems in analysis and ergodic theory via algorithmic randomness. We determine the level of randomness needed for a point in a Cantor space $…
We consider commuting pairs of holomorphic endomorphisms of P^2 with disjoint sequence of iterates. The remaining case to be studied is when their degrees coincide after some number of iterations. We show in this case that they are either…
In this paper, algorithms are developed for computing the Stirling transform and the inverse Stirling transform; specifically, we investigate a class of sequences satisfying a two-term recurrence. We derive a general identity which…
We present two alternative proofs of Mandrekar's theorem, which states that an invariant subspaces of the Hardy space on the bidisc is of Beurling type precisely when the shifts satisfy a doubly commuting condition. The first proof uses…
We review a known method of compounding two magic square matrices of order m and n with the all-ones matrix to form two magic square matrices of order mn. We show that these compounded matrices commute. Simple formulas are derived for their…
We elaborate further on the evolution properties of cosmological fluctuations through a bounce. We show this evolution to be describable either by ``transmission'' and ``reflection'' coefficients or by an effective unitary S-matrix. We also…
The aim of our paper is to formulate and solve problems concerning multitime multiple recurrence equations. We discuss in detail the generic properties and the existence and uniqueness of solutions. Among the general things, we discuss in…
In the literature, we have several results associated with canonical decomposition of commuting contractions. In this paper, we generalize a few of these results to $Q$-commuting contractions. Here we mainly deal with $Q$-commuting and…
This paper describes a scheme, through which the quantum information as well as the structural information of a time-reversal invariant system can be teleported over a distance. I show that my teleportation scheme can be viewed as a form of…
The "carries" when n random numbers are added base b form a Markov chain with an "amazing" transition matrix determined by Holte. This same Markov chain occurs in following the number of descents or rising sequences when n cards are…
Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate…