On 120-avoiding inversion and ascent sequences

03/26/2020
by   Zhicong Lin, et al.
0

Recently, Yan and the first named author investigated systematically the enumeration of inversion or ascent sequences avoiding vincular patterns of length 3, where two of the three letters are required to be adjacent. They established many connections with familiar combinatorial families and proposed several interesting conjectures. The objective of this paper is to address two of their conjectures concerning the enumeration of 120-avoiding inversion or ascent sequences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/13/2018

Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers

The first problem addressed by this article is the enumeration of some f...
research
09/25/2022

Burstein's permutation conjecture, Hong and Li's inversion sequence conjecture, and restricted Eulerian distributions

Recently, Hong and Li launched a systematic study of length-four pattern...
research
10/12/2021

Emerging Directions in Geophysical Inversion

In this chapter, we survey some recent developments in the field of geop...
research
12/22/2019

Catalan words avoiding pairs of length three patterns

Catalan words are particular growth-restricted words counted by the epon...
research
04/16/2019

Inversion formula with hypergeometric polynomials and its application to an integral equation

For any complex parameters x and ν, we provide a new class of linear inv...
research
09/05/2018

Extending Mandelbox Fractals with Shape Inversions

The Mandelbox is a recently discovered class of escape-time fractals whi...
research
06/12/2020

Analysis, Design, and Generalization of Electrochemical Impedance Spectroscopy (EIS) Inversion Algorithms

We introduce a framework for analyzing and designing EIS inversion algor...

Please sign up or login with your details

Forgot password? Click here to reset