Related papers: The Foata correspondence, cycle lengths and anomal…
The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Hum\'anez \& Bernhardt (power of two). It is well known that Sharkovskii's theorem shows the relationship between the cardinal of the set of…
We explore new connections between complete non-ambiguous trees (CNATs) and permutations. We give a bijection between tree-like tableaux and a specific subset of CNATs. This map is used to establish and solve a recurrence relation for the…
In this Letter we illustrate the possible cyclic fermion pairing states across Feshbach resonances in optical lattices. In cyclic fermion pairing, the pairing amplitude exhibits an oscillatory behavior as the detuning varies. We estimate…
In the context of the genome rearrangement problem, we analyze two well known models, namely the block transposition and the prefix block transposition models, by exploiting the connection with the notion of permutation pattern. More…
We observe two kinds of fractal approximating graphs, the background structures of the generalized Sierpinski Arrowhead Curve independently of the recursive curves. Both graphs related to the generalized Sierpinski Gasket and based on a…
We introduce a bijection between inequivalent minimal factorizations of the n-cycle (1 2 ... n) into a product of smaller cycles of given length, on one side, and trees of a certain structure on the other. We use this bijection to count the…
There is a huge amount of work on different kinds of theta functions, the theta correspondence, cohomology classes coming from special Schwartz classes via theta distribution, and much more. The aim of this text is to try to find joint…
We use a recently introduced combinatorial object, the interval-poset, to describe two bijections on intervals of the Tamari lattice. Both bijections give a combinatorial proof of some previously known results. The first one is an inner…
It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…
By investigating a recurrence relation about functions, we first give alternative proofs of various identities on Fibonacci numbers and Lucas numbers, and then, make certain well known identities visible via certain trivalent graph…
Let $d$ be a positive integer. In a previous article we established a bijective correspondence between the following classes of objects, considered up to the appropriate notion of equivalence: differential graded algebras with…
We establish a formal connection between algorithmic correspondence theory and certain dual characterization results for finite lattices, similar to Nation's characterization of a hierarchy of pseudovarieties of finite lattices,…
To illustrate the general results of the previous paper, we discuss here a large concrete example of the orbifold-string theories of permutation-type. For each of the many subexamples, we focus on evaluation of the \emph{target space-time…
We review a recent development at the interface between discrete mathematics on one hand and probability theory and statistics on the other, specifically the use of Markov chains and their boundary theory in connection with the asymptotics…
The bifurcation and chaotic behaviour of unidirectionally coupled deterministic ratchets is studied as a function of the driving force amplitude ($a$) and frequency ($\omega$). A classification of the various types of bifurcations likely to…
We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the…
We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both of these notions capture important structural properties of…
The subject of this note is a challenging conjecture about X-rays of permutations which is a special case of a conjecture regarding Skolem sequences. In relation to this, Brualdi and Fritscher [Linear Algebra and its Applications, 2014]…
According to Jae Suk Park, physicists use "canonical coordinate systems" to compute correlations in perturbative quantum field theories. One may interpret these canonical coordinate systems as equivalences of generalized differential Lie…
Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…