English
Related papers

Related papers: Potential Polynomials and Motzkin Paths

200 papers

We provide new interpretations for a subset of Raney numbers, involving threshold sequences and Motzkin-like paths with long up and down steps. Given three integers n, k, l such that n >= 1, k >= 2 and 0 <= l <= k-2, a (k,l)-threshold…

Combinatorics · Mathematics 2021-09-14 Irena Rusu

For lattice paths in strips which begin at $(0,0)$ and have only up steps $U: (i,j) \rightarrow (i+1,j+1)$ and down steps $D: (i,j)\rightarrow (i+1,j-1)$, let $A_{n,k}$ denote the set of paths of length $n$ which start at $(0,0)$, end on…

Combinatorics · Mathematics 2020-04-03 Nancy S. S. Gu , Helmut Prodinger

Fix two lattice paths $P$ and $Q$ from $(0,0)$ to $(m,r)$ that use East and North steps with $P $ never going above $Q$. Bonin et al. show that the lattice paths that go from $(0,0)$ to $(m,r)$ and remain bounded by $P$ and $Q$ can be…

Combinatorics · Mathematics 2012-12-27 Hoda Bidkhori

Counting the number of permutations of a given total displacement is equivalent to counting weighted Motzkin paths of a given area (Guay-Paquet and Petersen, 2014). The former combinatorial problem is still open. In this work, we show that…

Data Structures and Algorithms · Computer Science 2020-08-27 Andreas Bärtschi , Barbara Geissmann , Daniel Graf , Tomas Hruz , Paolo Penna , Thomas Tschager

Non-negative {\L}ukasiewicz paths are special two-dimensional lattice paths never passing below their starting altitude which have only one single special type of down step. They are well-known and -studied combinatorial objects, in…

Combinatorics · Mathematics 2018-09-07 Benjamin Hackl , Clemens Heuberger , Helmut Prodinger

A well-known bijection between Motzkin paths and ordered trees with outdegree always $\le2$, is lifted to Grand Motzkin paths (the nonnegativity is dropped) and an ordered list of an odd number of such $\{0,1,2\}$ trees. This offers an…

Combinatorics · Mathematics 2023-08-16 Helmut Prodinger

These lectures are intended for graduate students who want to acquire a working knowledge of path integral methods in a wide variety of fields in physics. In general the presentation is elementary and path integrals are developed in the…

Nuclear Theory · Physics 2017-08-01 R. Rosenfelder

We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like…

Combinatorics · Mathematics 2015-05-13 R. Brak , J. Osborn

For any pattern $\alpha$ of length at most two, we enumerate equivalence classes of \L{}ukasiewicz paths of length $n\geq 0$ where two paths are equivalent whenever the occurrence positions of $\alpha$ are identical on these paths. As a…

Combinatorics · Mathematics 2018-04-05 Jean-Luc Baril , Sergey Kirgizov , Armen Petrossian

Given two relatively prime positive integers $\alpha$ and $\beta$, we consider simple lattice paths (with unit East and unit North steps) from $(0,0)$ to $(\alpha k,\beta k)$, and enumerate them by their left and right bounces with respect…

Combinatorics · Mathematics 2017-08-01 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

We consider paths in the plane with $(1,0),$ $(0,1),$ and $(a,b)$-steps that start at the origin, end at height $n,$ and stay to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at…

Combinatorics · Mathematics 2007-09-27 Joseph P. S. Kung , Anna de Mier , Xinyu Sun , Catherine H. Yan

We analyse weighted Motzkin paths with step multiplicities that vary linearly with height. In the balanced case the associated exponential generating function satisfies a Pearson-type PDE, and solving by characteristics yields closed…

Probability · Mathematics 2026-01-27 Alexander Omelchenko

Riordan paths are Motzkin paths without horizontal steps on the x-axis. We establish a correspondence between Riordan paths and $(321,3\bar{1}42)$-avoiding derangements. We also present a combinatorial proof of a recurrence relation for the…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Eva Y. P. Deng , Laura L. M. Yang

New formulas for the nth moment of the Askey-Wilson polynomials are given. These are derived using analytic techniques, and by considering three combinatorial models for the moments: Motzkin paths, matchings, and staircase tableaux. A…

Combinatorics · Mathematics 2013-02-11 Jang Soo Kim , Dennis Stanton

This thesis deals with some $(1+1)$-dimensional lattice path models from the KPZ universality class: the directed random polymer with inverse-gamma weights (known as log-gamma polymer) and its zero temperature degeneration, i.e. the last…

Probability · Mathematics 2019-05-27 Elia Bisi

We use the inversion of coefficient arrays to define dual polynomials to the Fibonacci and Catalan-Fibonacci polynomials, and we explore the properties of these new polynomials sequences. Many of the arrays involved are Riordan arrays.…

Combinatorics · Mathematics 2021-01-26 Paul Barry

This note presents a formula for the enumerative invariants of arbitrary genus in toric surfaces. The formula computes the number of curves of a given genus through a collection of generic points in the surface. The answer is given in terms…

Algebraic Geometry · Mathematics 2007-05-23 Grigory Mikhalkin

Iterative linear solvers have gained recent popularity due to their computational efficiency and low memory footprint for large-scale linear systems. The relaxation method, or Motzkin's method, can be viewed as an iterative method that…

Numerical Analysis · Mathematics 2018-10-30 Jamie Haddock , Deanna Needell

A path integral formalism for non-equilibrium systems is proposed based on a manifold of quasi-equilibrium densities. A generalized Boltzmann principle is used to weight manifold paths with the exponential of minus the information…

Mathematical Physics · Physics 2015-03-17 Richard Kleeman

In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not…

Combinatorics · Mathematics 2023-06-22 Cyril Banderier , Michael Wallner