首页/论文/1907.06363

arXiv 1907.063632019-07-15math.CO

Linked partition ideals, directed graphs and $q$-multi-summations

Shane Chern

英文摘要：

Finding an Andrews--Gordon type generating function identity for a linked partition ideal is difficult in most cases. In this paper, we will handle this problem in the setting of graph theory. With the generating function of directed graphs with an ``empty'' vertex, we then turn our attention to a $q$-difference system. This $q$-difference system eventually yields a factorization problem of a special type of column functional vectors involving $q$-multi-summations. Finally, using a recurrence relation satisfied by certain $q$-multi-summations, we are able to provide non-computer-assisted proofs of some Andrews--Gordon type generating function identities. These proofs also have an interesting connection with binary trees.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

有向子图III. 有向链接分解

Directed Minors III. Directed Linked Decompositions

研究将托马斯关于无向图的定理推广到有向图，证明有向图G分别有宽度等于其有向路径宽度和有向无环图宽度的链接有向路径分解和链接有向无环图分解。

2026-07-21math.CO

Linked partition ideals and a family of quadruple summations

Recently, $4$-regular partitions into distinct parts are connected with a family of overpartitions. In this paper, we provide a uniform extension of two relations due to Andrews for the two types of partitions. Such an extension is made possible with recourse to a new trivariate Rogers--Ramanujan type identity, which concerns a family of quadruple summations appearing as generating functions for the aforementioned overpartitions. More interestingly, the derivation of this Rogers--Ramanujan type identity is relevant to a certain well-poised basic hypergeometric series.

2023-01-26math.COmath.NT

Highly linked tournaments

A (possibly directed) graph is $k$-linked if for any two disjoint sets of vertices $\{x_1, \dots, x_k\}$ and $\{y_1, \dots, y_k\}$ there are vertex disjoint paths $P_1, \dots, P_k$ such that $P_i$ goes from $x_i$ to $y_{i}$. A theorem of Bollobás and Thomason says that every $22k$-connected (undirected) graph is $k$-linked. It is desirable to obtain analogues for directed graphs as well. Although Thomassen showed that the Bollobás-Thomason Theorem does not hold for general directed graphs, he proved an analogue of the theorem for tournaments - there is a function $f(k)$ such that every strongl…

2014-06-29math.CO

Intrinsically Knotted and 4-Linked Directed Graphs

We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically 3-linked and 4-linked directed graphs. We introduce two operations, consistent edge contraction and H-cyclic subcontraction, as special cases of minors for digraphs, and show that the property of having a linkless embedding is closed under these operations. We analyze the relationship between the number of distinct knots and links in an undirected graph $G$ an…

2017-12-28math.COmath.GT

well-linked sets的循环 II：有向网格定理的一个初等界

Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem

本文提出了一种新的证明方法，改进了有向网格定理中函数f的上界，通过引入well-linked sets的循环结构，证明了大有向树宽图包含大圆柱形网格。

2026-02-12cs.DMmath.CO

Directed and multi-directed animals on the king's lattice

This article introduces a new, simple solvable lattice for directed animals: the directed king's lattice, or square lattice with next nearest neighbor bonds and preferred directions {W, NW, N, NE, E}. We show that the directed animals in this lattice have an algebraic generating function linked to the Schröder numbers and belong to the same universality class as the ones in the square and triangular lattices. We also define multi-directed animals in the king's lattice, which form a superclass of directed animals. We compute their generating function and show that it is not D-finite. Finally, w…

2015-10-28math.CO

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

Network routing on regular directed graphs from spanning factorizations

Networks with a high degree of symmetry are useful models for parallel processor networks. In earlier papers, we defined several global communication tasks (universal exchange, universal broadcast, universal summation) that can be critical tasks when complex algorithms are mapped to parallel machines. We showed that utilizing the symmetry can make network optimization a tractable problem. In particular, we showed that Cayley graphs have the desirable property that certain routing schemes starting from a single node can be transferred to all nodes in a way that does not introduce conflicts. In …

2014-07-03math.CO

Directed path-decompositions

Many of the tools developed for the theory of tree-decompositions of graphs do not work for directed graphs. In this paper we show that some of the most basic tools do work in the case where the model digraph is a directed path. Using these tools we define a notion of a directed blockage in a digraph and prove a min-max theorem for directed path-width analogous to the result of Bienstock, Roberston, Seymour and Thomas for blockages in graphs. Furthermore, we show that every digraph with directed path width $\geq k$ contains each arboresence of order $\leq k + 1$ as a butterfly minor. Finally w…

2017-11-02math.CO

Intrinsic linking and knotting in tournaments

A directed graph $G$ is $\textit{intrinsically linked}$ if every embedding of that graph contains a non-split link $L$, where each component of $L$ is a consistently oriented cycle in $G$. A $\textit{tournament}$ is a directed graph where each pair of vertices is connected by exactly one directed edge. We consider intrinsic linking and knotting in tournaments, and study the minimum number of vertices required for a tournament to have various intrinsic linking or knotting properties. We produce the following bounds: intrinsically linked ($n=8$), intrinsically knotted ($9 \leq n \leq 12$), intri…

2019-01-11math.COmath.GT

有向环集的循环 I：有向环打包的一个初等界

Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing

本文提出了一种初等上界，证明了有向图中不包含k个不相交环时，存在大小受初等函数约束的反馈顶点集。

2026-02-17cs.DMmath.CO

任意哈密顿$H$-连通有向图的Dirac型定理

A Dirac-type theorem for arbitrary Hamiltonian $H$-linked digraphs

本文证明了对任意具有k条弧且最小度至少为1的有向图H，存在常数C0，使得阶数足够大且最小入度和出度至少为n/2+k的有向图D是任意哈密顿H-连通的，该度下界最优；进一步推广到k与n线性相关的情形，解决了Wang的猜想并部分回答了Pavez-Signé的问题。

2025-03-26math.CO

Elliptic enumeration of nonintersecting lattice paths

We enumerate lattice paths in the planar integer lattice consisting of positively directed unit vertical and horizontal steps with respect to a specific elliptic weight function. The elliptic generating function of paths from a given starting point to a given end point evaluates to an elliptic generalization of the binomial coefficient. Convolution gives an identity equivalent to Frenkel and Turaev's 10-V-9 summation. This appears to be the first combinatorial proof of the latter, and at the same time of some important degenerate cases including Jackson's 8-phi-7 and Dougall's 7-F-6 summation.…

2006-07-15math.CAmath.CO

关于分裂有向图的2-连通性问题

On the 2-Linkage Problem for Split Digraphs

本文证明了6强分裂有向图和5强半完全分裂有向图均为2-连通，解决了相关问题。

2026-03-08math.CO

替换图的格罗莫夫双曲性

Gromov Hyperbolicity of Substitution graphs

School of Mathematical Sciences, Beihang University（北京航空航天大学数学科学学院）；School of Mathematics and Information Science, Shandong Technology and Business University（山东工商学院数学与信息科学学院）

本文构造了纯组合自相似结构模型替换图，给出其为格罗莫夫双曲图的充要条件，还推导了仅依赖生成元G和J的双曲性相关条件。

2026-08-25math.CO

关于半完全有向图推广的 $k$-链接问题

On the $k$-linkage problem for generalizations of semicomplete digraphs

本文研究半完全与拟传递等广义有向图的 $k$-链接问题，证明 $3k$-强、最小出度至少 $23k$ 的相关图类及高连通 $l$-拟传递有向图可实现 $k$-链接，并利用最大入度顶点的丰富短路径结构作为关键工具。

2025-03-13math.CO