Corpus ID: 237581557

L-convex polyominoes and 201-avoiding ascent sequences

@inproceedings{Guttmann2021LconvexPA,
  title={L-convex polyominoes and 201-avoiding ascent sequences},
  author={Anthony J. Guttmann and V{\'a}clav Kotesovec},
  year={2021}
}
For L-convex polyominoes we give the asymptotics of the generating function coefficients, obtained by analysis of the coefficients derived from the functional equation given by Castiglione et al. [3]. For 201-avoiding ascent sequences, we conjecture the solution, obtained from the first 23 coefficients of the generating function. The solution is D-finite, indeed algebraic. The conjectured solution then correctly generates all subsequent coefficients. We also obtain the asymptotics, both from… 
Pattern-avoiding ascent sequences of length 3
Pattern-avoiding ascent sequences have recently been related to setpartition problems and stack-sorting problems. While the generating functions for several length-3 pattern-avoiding ascent sequences

References

SHOWING 1-10 OF 10 REFERENCES
Combinatorial aspects of L-convex polyominoes
TLDR
The paper proves bijectively that the number f"n of L-convex polyominoes with perimeter 2(n+2) satisfies the linear recurrence relation f" n+"2=4f"n"+"1-2f"N, by first establishing a recurrence of the same form for the cardinality of the ''2-compositions'' of a natural number n.
Pattern Avoidance in Ascent Sequences
TLDR
This work studies pattern avoidance in ascent sequences, giving several results for patterns of lengths up to 4, for Wilf equivalence and for growth rates, and establishes bijective connections between pattern avoiding ascent sequences and various other combinatorial objects, in particular with set partitions.
(2+2)-free Posets, Ascent Sequences and Pattern Avoiding Permutations
TLDR
The ascent sequences that correspond to permutations avoiding the barred pattern $3\bar{1}52\ bar{4}$, and enumerate those permutations, thus settling a conjecture of Pudwell.
Patterns in Permutations and Words
  • S. Kitaev
  • Mathematics, Computer Science
    Monographs in Theoretical Computer Science. An EATCS Series
  • 2011
TLDR
The author collects the main results in the field in this up-to-date, comprehensive reference volume and highlights significant achievements in the area, and points to research directions and open problems.
Stack sorting with restricted stacks
TLDR
It is proved that the set of $\sigma$-machines whose associated sortable permutations are not a class is counted by Catalan numbers, providing for each of them a complete characterization and enumeration of sortablepermutations.
Analysis of series expansions for non-algebraic singularities
Existing methods of series analysis are largely designed to analyse the structure of algebraic singularities. Functions with such singularities have their $n^{th}$ coefficient behaving asymptotically
Introduction to Numerical Analysis
1. The numerical evaluation of expressions 2. Linear systems of equations 3. Interpolation and numerical differentiation 4. Numerical integration 5. Univariate nonlinear equations 6. Systems of
2+2)free posets
  • ascent sequences and pattern-avoiding permutations, J. Comb. Theory Ser. A 117(7) 884-909,
  • 2010
On-line encylopedia of integer sequences