- of a
permutation σ is an
element i such that σ(j) < σ(i) for all j < i.
Foata's fundamental bijection transforms a
permutation σ with a
given canonical...
-
Dominique Foata (born
October 12, 1934) is a
mathematician who
works in
enumerative combinatorics. With
Pierre Cartier and Marcel-Paul Schützenberger...
-
While the
trace monoid had been
studied by
Pierre Cartier and
Dominique Foata for its
combinatorics in the 1960s,
trace theory was
first formulated by...
- some
cancers Théorie géométrique des polynômes eulériens, with
Dominique Foata, Berlin, Heidelberg, New York,
Springer (1970)/Geometric
theory of Euler...
- died in
Marcoussis on 17
August 2024, at the age of 92. Cartier, Pierre;
Foata,
Dominique (14
November 2006). Problèmes
combinatoires de
commutation et...
- the
opening of the drawers. Mathematically, this
equivalence is
based on
Foata's transition lemma, a one-to-one
correspondence of the (canonical) cycle...
- from MMT. In 1969,
Cartier and
Foata found a new
proof of MMT by
combining algebraic and
bijective ideas (built on
Foata's thesis) and
further applications...
-
monoid of traces.
Traces were
introduced by
Pierre Cartier and
Dominique Foata in 1969 to give a
combinatorial proof of Mac****n's
master theorem. Traces...
-
combinatorial classes and
their generating functions, as
found in
works by
Foata and Schützenberger on permutations,
Bender and
Goldman on prefabs, and Joyal...
- by
Kibble in 1945 and
proven by
Slepian in 1972
using Fourier analysis.
Foata gave a
combinatorial proof while Louck gave a
proof via
boson quantum mechanics...
