Related papers: On the intriguing search for good permutations
The discrete Fourier transform has proven to be an essential tool in many geometric and combinatorial problems in vector spaces over finite fields. In general, sets with good uniform bounds for the Fourier transform appear more `random' and…
Techniques for detecting critical phenomena -- phase transitions where correlation length diverges and small perturbations have large effects -- have been developed across multiple fields over nine decades. We survey between six and twelve…
In this work we address the problem of finding serendipity versions of approximate de Rham complexes with enhanced regularity. The starting point is a new abstract construction of general scope which, given three complexes linked by…
The increasing availability of high throughput data arising from gene expression studies leads to the necessity of methods for summarizing the available information. As annotation quality improves it is becoming common to rely on the Gene…
Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of $n$. Our central example is a two-parameter family of random permutations that are…
Donald Knuth, in a draft of a coming volume of The Art of Computer Programming, has recently conjectured that in Depth-First Search of a random digraph with geometric outdegree distribution, the numbers of back and forward arcs have the…
We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to extend this to permutations that have exactly one (132) pattern.…
We propose a natural, bivariate, generalization of the nonsingular similarity relations considered by T. Fine. We also provide an enumeration formulae and a generating tree for those relations. The latter allow us to give a new bijection…
This article introduces an algorithm to draw random discrete uniform variables within a given range of size n from a source of random bits. The algorithm aims to be simple to implement and optimal both with regards to the amount of random…
In quasi-Monte Carlo methods, generating high-dimensional low discrepancy sequences by generator matrices is a popular and efficient approach. Historically, constructing or finding such generator matrices has been a hard problem. In…
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…
In this paper we associate to any $LS$-sequence of partitions ${\rho_{L,S}^n}$ the corresponding $LS$-sequence of points ${\xi_{L,S}^n}$ obtained reordering the points of each partition with an explicit algorithm. The procedure begins with…
The LS-sequences of points recently introduced by the author are a generalization of van der Corput sequences. They were constructed by reordering the points of the corresponding LS-sequences of partitions. Here we present another algorithm…
Understanding the fluctuations of observables is one of the main goals in science, be it theoretical or experimental, quantum or classical. We investigate such fluctuations when only a subregion of the full system can be observed, focusing…
We discuss the problem for detecting long-range correlations in sequences of values obtained by generators of pseudo-random numbers. The basic idea is that the H{\"o}lder exponent for a sufficiently long sequence of uncorrelated random…
In this paper, we study pattern avoidances of generalized permutations and show that the number of all generalized permutations avoiding $\pi$ is independent of the choice of $\pi\in S_3$, which extends the classic results on permutations…
By using the matrix formulation of the two-step approach to distributions of patterns in random sequences, recurrence and explicit formulas for the generating functions of successions in random permutations of arbitrary multisets are…
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…
We present a different proof of the characterization of non--degenerate recurrence sequences, which are also divisibility sequences, given by Van der Poorten, Bezevin, and Petho in their paper "A Full Characterisation of Divisibility…
We study the distribution of the number of permutations with a given periodic up-down sequence w.r.t. the last entry, find exponential generating functions and prove asymptotic formulas for this distribution.