Related papers: Bells, Motels and Permutation Groups
A permutiple is a natural number that is a nontrivial multiple of a permutation of its digits in some base. Special cases of permutiples include cyclic numbers (multiples of cyclic permutations of their digits) and palintiple numbers…
This article is dedicated to the following class of problems. Start with an $N\times N$ Hermitian matrix randomly picked from a matrix ensemble - the reference matrix. Applying a rank-$t$ perturbation to it, with $t$ taking the values $1\le…
This paper investigates the effect of permutations on blocks of a prime reciprocal sequence on its randomness. A relationship between the number of permutations used and the improvement of performance is presented. This can be used as a…
In this work we obtain recurrent formulae for the number of permutations with either increasing or monotonic (i.e., both increasing and decreasing) runs of bounded length. Our formulae allow one to efficiently compute the number of such…
We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.
Let $p>3$ be a prime number. We compute the rings of invariants of the elementary abelian $p$-group $(\mathbb Z/p\mathbb Z)^r$ for $3$-dimensional generic representations. Furthermore we show that these rings of invariants are complete…
This chapter covers methodological issues related to estimation, testing and computation for models involving structural changes. Our aim is to review developments as they relate to econometric applications based on linear models.…
In this paper, we explore a ring invariant which is closely related to the Davenport constant of a group. In particular, we will calculate this invariant for a certain class of rings of integers and their orders and use it to understand…
We introduce and study a new notion of patterns in Stirling and $k$-Stirling permutations, which we call block patterns. We prove a general result which allows us to compute generating functions for the occurrences of various block patterns…
We give an overview of various counting problems for Apollonian circle packings, which turn out to be related to problems in dynamics and number theory for thin groups. This survey article is an expanded version of my lecture notes prepared…
This paper studies statistics of riffle shuffles by relating them to random word statistics with the use of inverse shuffles. Asymptotic normality of the number of descents and inversions in riffle shuffles with convergence rates of order…
In this paper we introduce new modules over the ring of ponderation functions, so we recover old results in harmonic analysis from the side of ring theory. Moreover, we prove that Laplace transform, Fourier transform and Hankel transform…
We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…
We investigate a classical statistical model and show that Mermin's version of a Bell inequality is violated. We get this violation, if the measurement modifies the ensemble, a feature, which is also characteristic for measurement processes…
The question raised by [Bastin and Martin 2003 J. Phys. B: At. Mol. Opt. Phys. 36, 4201] is examined and used to explain in more detail a key point of our calculations. They have sought to rebut criticisms raised by us of certain techniques…
The existence of the Herman ring of a function adds interest and complexity to the dynamics of the function. We present a detailed and understandable summary of the core discoveries and recent developments on the Herman ring of rational and…
Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…
Entringer numbers occur in the Andr\'e permutation combinatorial set-up under several forms. This leads to the construction of a matrix-analog refinement of the tangent (resp. secant) numbers. Furthermore, closed expressions for the…
In the present article, real number representations, that are generalizations of classical positive and alternating representations of numbers, are introduced and investigated. The main metric relation, properties of cylinder sets are…
Python implementation of permutations is presented. Three classes are introduced: Perm for permutations, Group for permutation groups, and PermError to report any errors for both classes. The class Perm is based on Python dictionaries and…