English
Related papers

Related papers: The Foata correspondence, cycle lengths and anomal…

200 papers

We present bijections enumerating (k,m)-trees, k-gon trees, edge labelled (2,1)-trees, and other tree-like structures. Our constructions are based on Foata's (1971) bijection for cycle-free functions, which is simplified here.

Combinatorics · Mathematics 2007-05-23 Oleg Pikhurko

We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…

Combinatorics · Mathematics 2007-11-05 Robert Parviainen

We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…

Combinatorics · Mathematics 2020-06-16 Arvind Ayyer

In this short paper, we give bijective proofs of two recent equidistribution results connecting cyclic and linear statistics in the spirit of the Foata's ``transformation fondamentale''.

Combinatorics · Mathematics 2024-04-03 Umesh Shankar

A permutation $\pi$ contains a pattern $\sigma$ if and only if there is a subsequence in $\pi$ with its letters are in the same relative order as those in $\sigma$. Partially ordered patterns (POPs) provide a convenient way to denote…

Combinatorics · Mathematics 2021-01-29 Kai Ting Keshia Yap , David Wehlau , Imed Zaguia

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…

Dynamical Systems · Mathematics 2011-10-27 Primitivo B. Acosta-Humánez , Eduardo Martínez Castiblanco

We consider the two permutation statistics which count the distinct pairs obtained from the last two terms of occurrences of patterns t_1...t_{m-2}m(m-1) and t_1...t_{m-2}(m-1)m in a permutation, respectively. By a simple involution in…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste

We investigate, theoretically and experimentally,the properties of diffraction spectra of Fibonacci lattices with arbitrary spacings. We show that, by means of a suitable composition rule, a Fibonacci sequence can be mapped into another one…

Other Condensed Matter · Physics 2016-08-31 N. Lo Gullo , L. Vittadello , M. Bazzan , L. Dell'Anna

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commu-tative ring. A main tool for this study is the construction of a correspondence functor associated…

Representation Theory · Mathematics 2019-02-15 Serge Bouc , Jacques Thévenaz

We present a bijection between 321- and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson, Saracino and Zeilberger, and…

Combinatorics · Mathematics 2007-05-23 Sergi Elizalde , Igor Pak

Let (G,H) be one of the equal rank reductive dual pairs (Mp_{2n},O_{2n+1}) or (U_n,U_n) over a non-archimedean local field of characteristic zero. It is well-known that the theta correspondence establishes a bijection between certain…

Representation Theory · Mathematics 2024-07-18 Bram Mesland , Mehmet Haluk Sengun

A category used by de Paiva to model linear logic also occurs in Vojtas's analysis of cardinal characteristics of the continuum. Its morphisms have been used in describing reductions between search problems in complexity theory. We describe…

Logic · Mathematics 2009-09-25 Andreas Blass

Quantum-classical correspondence in conservative chaotic Hamiltonian systems is examined using a uniform structure measure for quantal and classical phase space distribution functions. The similarities and differences between quantum and…

Quantum Physics · Physics 2009-11-10 Jiangbin Gong , Paul Brumer

We give bijective results between several variants of lattice paths of length $2n$ (or $2n-2$) and integer compositions of n, all enumerated by the seemingly innocuous formula $4^{n-1}$. These associations lead us to make new connections…

Combinatorics · Mathematics 2024-06-25 Manosij Ghosh Dastidar , Michael Wallner

We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…

Combinatorics · Mathematics 2023-09-26 Peter M. Higgins

The knots-quivers correspondence states that various characteristics of a knot are encoded in the corresponding quiver and the moduli space of its representations. However, this correspondence is not a bijection: more than one quiver may be…

High Energy Physics - Theory · Physics 2021-10-20 Jakub Jankowski , Piotr Kucharski , Hélder Larraguível , Dmitry Noshchenko , Piotr Sułkowski

This paper is concerned with the regularity theory of a transmission problem arising in composite materials. We give a new self-contained proof for the $C^{k,\alpha}$ estimates on both sides of the interface under the minimal assumptions on…

Analysis of PDEs · Mathematics 2020-08-28 Jinping Zhuge

The Lusztig correspondence is a bijective mapping between the Lusztig series indexed by the conjugacy class of a semisimple element $s$ in the connected component $(G^*)^0$ of the dual group of $G$ and the set of irreducible unipotent…

Representation Theory · Mathematics 2022-06-13 Shu-Yen Pan

We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of $k$-modules, where $k$ is a commutative ring.They have various specific properties which do not hold for…

Representation Theory · Mathematics 2019-03-19 Serge Bouc , Jacques Thévenaz

We study the satisfiability problem for the fluted fragment extended with transitive relations. The logic enjoys the finite model property when only one transitive relation is available and the finite model property is lost when…

Logic in Computer Science · Computer Science 2024-05-22 Ian Pratt-Hartmann , Lidia Tendera