中文
相关论文

相关论文: Enumeration of interval-closed sets via Motzkin pa…

200 篇论文

A plateau in a Motzkin path is a sequence of three steps: an up step, a horizontal step, then a down step. We find three different forms for the bivariate generating function for plateaus in Motzkin paths, then generalize to longer…

组合数学 · 数学 2011-09-16 Dan Drake , Ryan Gantner

This short note gives a bijection between quarter plane walks using the steps $\{\rightarrow, \searrow, \downarrow, \leftarrow, \nwarrow, \uparrow\}$ and bicoloured Motzkin paths.

组合数学 · 数学 2014-12-05 Karen Yeats

In this paper, I derive a generating function for discrete Motzkin paths of step size +2,+1,-1, restricted between two absorbing parallel lines, and generalized to arbitrary step weights. This continues off work of similar problems…

组合数学 · 数学 2023-06-13 Cetin Hakimoglu-Brown

Using a recursive approach, we show that the generating function for sets of Motzkin paths avoiding a single (not necessarily consecutive) pattern is rational over $x$ and the Catalan generating function $C(x) =…

组合数学 · 数学 2022-02-28 Christian Bean , Antonio Bernini , Matteo Cervetti , Luca Ferrari

We address the enumeration of walks with small steps confined to a two-dimensional cone, for example the quarter plane, three-quarter plane or the slit plane. In the quarter plane case, the solutions for unweighted step-sets are already…

组合数学 · 数学 2023-12-20 Andrew Elvey Price

We derive the length and area generating function of planar height-restricted forward-moving discrete paths of increments +1, 0, or -1 with arbitrary starting and ending points, the so-called Motzkin meanders, and the more general…

数学物理 · 物理学 2022-02-04 Alexios P. Polychronakos

We study three different poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The…

组合数学 · 数学 2007-05-23 Jan Snellman

Motzkin excursions and meanders are revisited. This is considered in the context of forbidden patterns. Previous work by Asinowski, Banderier, Gittenberger, and Roitner is continued. Motzkin paths of bounded height are considered, leading…

组合数学 · 数学 2023-11-21 Helmut Prodinger

We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…

组合数学 · 数学 2018-10-03 Keith Copenhaver

We investigate paths in the hexagonal circle packing and enumerate them with respect to width, height, number of steps, area, and kissing number. Functional equations and the kernel method yield closed bivariate generating functions…

组合数学 · 数学 2025-11-18 Jean-Luc Baril , José Luis Ramí rez

We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…

组合数学 · 数学 2007-08-01 Sergi Elizalde

We study nearest-neighbors walks on the two-dimensional square lattice, that is, models of walks on $\mathbb{Z}^2$ defined by a fixed step set that is a subset of the non-zero vectors with coordinates 0, 1 or $-1$. We concern ourselves with…

组合数学 · 数学 2016-10-21 Alin Bostan , Frédéric Chyzak , Mark van Hoeij , Manuel Kauers , Lucien Pech

The $P$-partition generating function of a (naturally labeled) poset $P$ is a quasisymmetric function enumerating order-preserving maps from $P$ to $\mathbb{Z}^+$. Using the Hopf algebra of posets, we give necessary conditions for two…

组合数学 · 数学 2019-09-17 Ricky Ini Liu , Michael Weselcouch

The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…

组合数学 · 数学 2024-06-11 Mathilde Bouvel , Lapo Cioni , Benjamin Izart

In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded Motzkin prefixes that induces a bijection from a set of bounded free Dyck paths to a set of bounded Dyck prefixes. We also give bijections…

组合数学 · 数学 2022-06-01 Hyunsoo Cho , JiSun Huh , Hayan Nam , Jaebum Sohn

The aim of this article is to introduce a unified method to obtain explicit integral representations of the trivariate generating function counting the walks with small steps which are confined to a quarter plane. For many models, this…

组合数学 · 数学 2012-05-16 Kilian Raschel

Models of spatially homogeneous walks in the quarter plane ${\bf Z}_+^{2}$ with steps taken from a subset $\mathcal{S}$ of the set of jumps to the eight nearest neighbors are considered. The generating function $(x,y,z)\mapsto Q(x,y;z)$ of…

组合数学 · 数学 2012-11-06 Irina Kurkova , Kilian Raschel

Valid hook configurations are combinatorial objects used to understand West's stack-sorting map. We extend existing bijections corresponding valid hook configurations to intervals in partial orders on Motzkin paths. To enumerate valid hook…

组合数学 · 数学 2019-10-22 Maya Sankar

An unlabeled poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Let $p_n$ denote the number of (2+2)-free posets of size $n$. In a recent paper,…

组合数学 · 数学 2010-04-20 Sergey Kitaev , Jeffrey Remmel

Generating functions for asymmetric step-size paths restricted by two absorbing barriers are derived. The method begins by applying the Lagrange inversion formula to arbitrary powers of roots of the characteristic equation, that being a…

概率论 · 数学 2022-12-21 Cetin Hakimoglu-Brown
‹ 上一页 1 2 3 10 下一页 ›