Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSome nonlinear inverse relations of Bell polynomials via the Lagrange inversion formula
77
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper, by means of the classical Lagrange inversion formula, we establish a general nonlinear inverse relations which is a partial solution to the problem proposed in the paper [J. Wang, Nonlinear inverse relations for the Bell polynomials via the Lagrange inversion formula, J. Integer Seq., Vol. 22 (2019), Article 19.3.8. (https://cs.uwaterloo.ca/journals/JIS/VOL22/Wang/wang53.pdf). As applications of this inverse relation, we not only find a short proof of another nonlinear inverse relation due to Birmajer et al., but also set up a few convolution identities concerning the Mina polynomials.
rate research
Read More
In this note, by the umbra calculus method, the Sun and Zagiers congruences involving the Bell numbers and the derangement numbers are generalized to the polynomial cases. Some special congruences are also provided.
We derive self-reciprocity properties for a number of polyomino generating functions, including several families of column-convex polygons, three-choice polygons and staircase polygons with a staircase hole. In so doing, we establish a connection between the reciprocity results known to combinatorialists and the inversion relations used by physicists to solve models in statistical mechanics. For several classes of convex polygons, the inversion (reciprocity) relation, augmented by certain symmetry and analyticity properties, completely determines the anisotropic perimeter generating function.
We prove a generalization of a conjecture of Dokos, Dwyer, Johnson, Sagan, and Selsor giving a recursion for the inversion polynomial of 321-avoiding permutations. We also answer a question they posed about finding a recursive formulas for the major index polynomial of 321-avoiding permutations. Other properties of these polynomials are investigated as well. Our tools include Dyck and 2-Motzkin paths, polyominoes, and continued fractions.
A {em k-generalized Dyck path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $mathbb{Z}timesmathbb{Z}$ consisting of horizontal-steps $(k, 0)$ for a given integer $kgeq 0$, up-steps $(1,1)$, and down-steps $(1,-1)$, which never passes below the x-axis. The present paper studies three kinds of statistics on $k$-generalized Dyck paths: number of $u$-segments, number of internal $u$-segments and number of $(u,h)$-segments. The Lagrange inversion formula is used to represent the generating function for the number of $k$-generalized Dyck paths according to the statistics as a sum of the partial Bell polynomials or the potential polynomials. Many important special cases are considered leading to several surprising observations. Moreover, enumeration results related to $u$-segments and $(u,h)$-segments are also established, which produce many new combinatorial identities, and specially, two new expressions for Catalan numbers.
In this note we characterize when non-classical polynomials are necessary in the inverse theorem for the Gowers $U^k$-norm. We give a brief deduction of the fact that a bounded function on $mathbb F_p^n$ with large $U^k$-norm must correlate with a classical polynomial when $kleq p+1$. To the best of our knowledge, this result is new for $k=p+1$ (when $p>2$). We then prove that non-classical polynomials are necessary in the inverse theorem for the Gowers $U^k$-norm over $mathbb F_p^n$ for all $kgeq p+2$, completely characterizing when classical polynomials suffice.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
