Fighting fish: enumerative properties

MaRDI QIDQ1745138zbMATH OpenFDO

Authors Enrica Duchi, Veronica Guerrini, S. Rinaldi, Gilles Schaeffer

Publication date 20 April 2018

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1611.04625, http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2017/43%20Duchi%20Guerrini%20Rinaldi%20Schaeffer.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

algebraic generating functionsenumerative combinatoricsexact formulas

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Abstract: Fighting fish were very recently introduced by the authors as combinatorial structures made of square tiles that form two dimensional branching surfaces. A main feature of these fighting fish is that the area of uniform random fish of size $n$ scales like $n^{5/4}$ as opposed to the typical $n^{3/2}$ area behavior of the staircase or direct convex polyominoes that they generalize. In this extended abstract we concentrate on enumerative properties of fighting fish: in particular we provide a new decomposition and we show that the number of fighting fish with $i$ left lower free edges and $j$ right lower free edges is equal to �egin{equation*} frac{(2i+j-2)!(2j+i-2)!}{i!j!(2i-1)!(2j-1)!}. end{equation*} These numbers are known to count rooted planar non-separable maps with $i+1$ vertices and $j+1$ faces, or two-stack-sortable permutations with respect to ascending and descending runs, or left ternary trees with respect to vertices with even and odd abscissa. However we have been unable until now to provide any explicit bijection between our fish and such structures. Instead we provide new refined generating series for left ternary trees to prove further equidistribution results.

Recommendations

• Fighting fish
• Fighting fish and two-stack sortable permutations
• A bijection between Tamari intervals and extended fighting fish
• Fish wars with changing area for a fishery
• Fish wars: cooperative and non-cooperative approaches
• Fish wars with many players
• The compleat fish wars: Biological and dynamic interactions
• The saga of a fish: from a survival guide to closing lemmas
• Model problems for fish schooling
• scientific article; zbMATH DE number 1057947

Cites work

• A bijective census of nonseparable planar maps
• A note on naturally embedded ternary trees
• A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
• Enumeration of Non-Separable Planar Maps
• Exactly solved models
• Fighting fish
• Geodesic distance in planar graphs: an integrable approach
• Left ternary trees and non-separable rooted planar maps
• Limit distributions and scaling functions
• Polygons, polyominoes and polycubes
• Polynomial equations with one catalytic variable, algebraic series and map enumeration
• Sorting twice through a stack

Cited in

(12)

• A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate
• Fighting fish and two-stack sortable permutations
• A bijection between Tamari intervals and extended fighting fish
• Fighting fish
• Injectively \(k\)-colored rooted forests
• Fishburn trees
• Bijections between fighting fish, planar maps, and Tamari intervals
• Parking on Cayley trees and frozen Erdős-Rényi
• More bijective combinatorics of weakly increasing trees
• A direct bijection between two-stack sortable permutations and fighting fish (extended abstract)
• A symmetry on weakly increasing trees and multiset Schett polynomials
• A bijection between non-separable planar maps and fighting fish

This page was built for publication: Fighting fish: enumerative properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1745138)