首页/论文/2009.01410

arXiv 2009.014102020-09-03math.CO

Encoding labelled $p$-Riordan graphs by words and pattern-avoiding permutations

Kittitat Iamthong, Ji-Hwan Jung, Sergey Kitaev

备注：: To appear in Graphs and Combinatorics, 14 pages, 1 fiugure

英文摘要：

The notion of a $p$-Riordan graph generalizes that of a Riordan graph, which, in turn, generalizes the notions of a Pascal graph and a Toeplitz graph. In this paper we introduce the notion of a $p$-Riordan word, and show how to encode $p$-Riordan graphs by $p$-Riordan words. For special important cases of Riordan graphs (the case $p=2$) and oriented Riordan graphs (the case $p=3$) we provide alternative encodings in terms of pattern-avoiding permutations and certain balanced words, respectively. As a bi-product of our studies, we provide an alternative proof of a known enumerative result on closed walks in the cube.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Motzkin 路径、321-避免排列以及行奇偶性相同的标准杨表

Motzkin paths, 321-avoiding permutations, and standard Young tableaux with rows of equal parity

Penn State Altoona（宾夕法尼亚州立大学阿尔图纳分校）

本文引入一类由 Motzkin 数计数的 321-避免排列，建立其与 Motzkin 路径及三行标准杨表的双射，使 Riordan 路径对应 Riordan 排列，并连接至更多 Riordan 数计数族。

2026-09-29math.CO

Pattern Avoidance of Generalized Permutations

In this paper, we study pattern avoidances of generalized permutations and show that the number of all generalized permutations avoiding $π$ is independent of the choice of $π\in S_3$, which extends the classic results on permutations avoiding $π\in S_3$. Extending both Dyck path and Riordan path, we introduce the Catalan-Riordan path which turns out to be a combinatorial interpretation of the difference array of Catalan numbers. As applications, we interpret both Motzkin and Riordan numbers in two ways, via semistandard Young tableaux of two rows and generalized permutations avoiding $π\in S_…

2018-05-14math.CO

关于自然标号偏序集与避免12-34的排列

On naturally labelled posets and permutations avoiding 12-34

本文建立了{3, 2+2}-free自然标号偏序集与避免12-34排列间的双射，通过级数分析探究其渐近增长，并揭示了3-free自然标号偏序集与其他组合对象及区间序层级结构的联系。

2024-12-19math.CO

避免4321及另一个长度为四的模式的对合

Involutions avoiding 4321 and another pattern of length four

Università di Bologna（博洛尼亚大学）；Istituto Comprensivo “E. Rosetti”（E. Rosetti综合学院）

本文通过Biane双射和生成函数，枚举了避免4321及另一个长度四模式的对合族，给出了精确的二元生成函数和结构描述，并对剩余情况提供了函数方程和连分数表示。

2026-10-01math.CO

标号树中的模式避免

Pattern avoidance in labelled trees

我们讨论了一个新的概念，模式避免的动机的操作理论：模式避免平面标记树。这是一个概括的各种类型的连续模式避免研究之前：连续模式的话，排列，彩色排列等概念的Wilf等价的模式排列承认一个简单的概括（套）树模式，我们描述了类树与少量的叶子，并给出几个双射树之间避免模式集从同一个类。我们还解释了一些一般结果树模式避免，无论是精确和渐近枚举。

2012-01-13math.COmath.CT

Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs

Let $Δ=\{ δ_1,δ_2,...,δ_m \} $ be a finite set of 2-connected patterns, i.e. graphs up to vertex relabelling. We study the generating function $D_{Δ}(z,u_1,u_2,...,u_m),$ which counts polygon dissections and marks subgraph copies of $δ_i$ with the variable $u_i$. We prove that this is always algebraic, through an explicit combinatorial decomposition depending on $Δ$. The decomposition also gives a defining system for $D_{Δ}(z,\mathbf{0})$, which encodes polygon dissections that restrict these patterns as subgraphs. In this way, we are able to extract normal limit laws for the patterns when the…

2018-08-28math.CO

更多相关论文收起更多论文

模式回避单射词复形

Complexes of pattern-avoiding injective words

Dartmouth College（达特茅斯学院）；University of Oregon（俄勒冈大学）

本文通过固定置换模式定义单射词复形的自然子复形，证明其在多数模式下的可壳性并构造同调基，同时利用枚举组合学证明可壳性，并推导出模式回避置换的新的精细计数公式。

2026-10-07math.CO

The language of self-avoiding walks

Let $X=(V\!X,E\!X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E\!X$ is equipped with an involution which inverts the orientation. Each oriented edge is labelled by an element of a finite alphabet $\mathbfΣ$. The labelling is assumed to be deterministic: edges with the same initial (resp. terminal) vertex have distinct labels. Furthermore it is assumed that the group of label-preserving automorphisms of $X$ acts quasi-transitively. For any vertex $o$ of $X$, consider the language of all words over $\mathbfΣ$ which…

2019-03-06math.COmath.GR

A decomposition of ballot permutations, pattern avoidance and Gessel walks

A permutation whose any prefix has no more descents than ascents is called a ballot permutation. In this paper, we present a decomposition of ballot permutations that enables us to construct a bijection between ballot permutations and odd order permutations, which proves a set-valued extension of a conjecture due to Spiro using the statistic of peak values. This bijection also preserves the neighbors of the largest letter in permutations and thus resolves a refinement of Spiro' s conjecture proposed by Wang and Zhang. Our decomposition can be extended to well-labelled positive paths, a class o…

2021-03-08math.CO

The Stanley-Stembridge 猜想在 $\f 2 + 1 +1$-avoiding 单位区间序上的图解证明

The Stanley-Stembridge Conjecture for $\bf 2 + 1 +1$-avoiding unit interval orders: a diagrammatic proof

本文用图解方法重新证明了 Stanley-Stembridge 猜想在避免模式 $\f 2+1+1$ 的单位区间序上的特例，该特例最初由 Gebhard 和 Sagan 证明。

2024-04-20math.COmath.RT

Self-avoiding walks and multiple context-free languages

Let $G$ be a quasi-transitive, locally finite, connected graph rooted at a vertex $o$, and let $c_n(o)$ be the number of self-avoiding walks of length $n$ on $G$ starting at $o$. We show that if $G$ has only thin ends, then the generating function $F_{\mathrm{SAW},o}(z)=\sum_{n \geq 0} c_n(o) z^n$ is an algebraic function. In particular, the connective constant of such a graph is an algebraic number. If $G$ is deterministically edge labelled, that is, every (directed) edge carries a label such that any two edges starting at the same vertex have different labels, then the set of all words which…

2022-05-10cs.FLmath.COmath.GR

上下铺图上的最大流与自避行走

Maximum flow and self-avoiding walk on bunkbed graphs

本文研究上下铺图上的最大流与自避行走，证明反射对称容量下同层最大流不小于跨层最大流，并证明完全图足够大时跨层自避行走更多，同时给出反例并提出割边条件下的待解问题。

2025-02-10math.COmath.PR

Hereditary classes of ordered sets of width at most two

This paper is a contribution to the study of hereditary classes of relational structures, these classes being quasi-ordered by embeddability. It deals with the specific case of ordered sets of width two and the corresponding bichains and incomparability graphs. Several open problems about hereditary classes of relational structures which have been considered over the years have positive answer in this case. For example, well-quasi-ordered hereditary classes of finite bipartite permutation graphs, respectively finite 321-avoiding permutations, have been characterized by Korpelainen, Lozin and M…

2022-08-26math.CO