English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The most amazing (at least to me) result in Enumerative Combinatorics isDominique Gouyou-Beauchamps and Xavier Viennot's theorem that states that thenumber of so-called directed animals with compact source (that are equivalent,via Viennot's beautiful concept of heaps, to towers of dominoes, that I takethe liberty of renaming xaviers) with n+1 points equals 3^n. This amazingresult received an even more amazing proof by Jean B\'etrema and Jean-GuyPenaud. Both theorem and proof deserve to be better known! Hence this article,that is also accompanied by a comprehensive Maple packagehttp://www.math.rutgers.edu/~zeilberg/tokhniot/BORDELAISE that implementseverything (and much more)

The Amazing $3^n$ Theorem and its even more Amazing Proof [Discovered by Xavier G. Viennot and his \'Ecole Bordelaise gang]