中文
相关论文

相关论文: Planar networks and total positivity of Riordan ar…

200 篇论文

We present sufficient conditions for total positivity of Riordan arrays. As applications we show that many well-known combinatorial triangles are totally positive and many famous combinatorial numbers are log-convex in a unified approach.

组合数学 · 数学 2016-01-22 Xi Chen , Huyile Liang , Yi Wang

The Hankel matrix of type B Narayana polynomials was proved to be totally positive by Wang and Zhu, and independently by Sokal. Pan and Zeng raised the problem of giving a planar network proof of this result. In this paper, we present such…

组合数学 · 数学 2021-07-23 Ethan Y. H. Li , Grace M. X. Li , Arthur L. B. Yang , Candice X. T. Zhang

We provide a combinatorial interpretation of Lah numbers by means of planar networks. Henceforth, as a conesquence of Lindstr\"om's lemma, we conclude that the related Lah matrix possesses a remarkable property of total non-negativity.

组合数学 · 数学 2017-11-15 Ivica Martinjak , Riste Škrekovski

The aim of this paper is to discuss a relationship between total positivity and planar directed networks. We show that the inverse boundary problem for these networks is naturally linked with the study of the totally nonnegative…

组合数学 · 数学 2007-05-23 Alexander Postnikov

In this paper, we consider matrices whose entries are combinatorial sequences which can be expressed in terms of a convolution of elementary and complete homogeneous symmetric functions. We establish the total positivity of these matrices…

组合数学 · 数学 2018-09-12 Ken Joffaniel M. Gonzales

Let $R=\mathcal{R}(d(t),h(t))$ be a Riordan array, where $d(t)=\sum_{n\ge 0}d_nt^n$ and $h(t)=\sum_{n\ge 0}h_nt^n$. We show that if the matrix \begin{equation*} \left[\begin{array}{ccccc} d_0 & h_0 & 0 & 0 &\cdots\\ d_1 & h_1 & h_0 & 0 &\\…

组合数学 · 数学 2021-07-20 Jianxi Mao , Lili Mu , Yi Wang

Consider a weighted directed acyclic graph $G$ having an upward planar drawing. We give a formula for the total weight of the families of non-intersecting paths on $G$ with any given starting and ending points. While the…

组合数学 · 数学 2026-04-28 Yi-Lin Lee

In this paper the total positivity of quasi-Riordan arrays is investigated with use of the sequence characterization of quasi-Riordan arrays. Due to the correlation between quasi-Riordan arrays and Riordan arrays, this study is an in-depth…

组合数学 · 数学 2024-06-12 Tian-Xiao He , Roksana Słowik

We prove a general theorem that gives a linear recurrence for tuples of paths in every cylindrical network. This can be seen as a cylindrical analog of the Lindstr\"om-Gessel-Viennot theorem. We illustrate the result by applying it to Schur…

组合数学 · 数学 2018-05-04 Pavel Galashin , Pavlo Pylyavskyy

As an improvement of the combinatorial realization of totally positive matrices via the essential positive weightings of certain planar network by S.Fomin and A.Zelevisky \cite{[4]}, in this paper, we give the test method of positive…

环与代数 · 数学 2014-06-27 Fang Li , Yichao Yang

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…

组合数学 · 数学 2012-10-10 Colin McDiarmid

We consider matrices with entries that are polynomials in $q$ arising from natural $q$-generalisations of two well-known formulas that count: forests on $n$ vertices with $k$ components; and trees on $n+1$ vertices where $k$ children of the…

组合数学 · 数学 2021-06-03 Tomack Gilmore

We consider matrices whose elements enumerate weights of walks in planar directed weighted graphs (not necessarily acyclic). These matrices are totally nonnegative; more precisely, all their minors are formal power series in edge weights…

组合数学 · 数学 2007-05-23 Sergey Fomin

We study three combinatorial models for the lower-triangular matrix with entries $t_{n,k} = \binom{n}{k} n^{n-k}$: two involving rooted trees on the vertex set $[n+1]$, and one involving partial functional digraphs on the vertex set $[n]$.…

组合数学 · 数学 2024-04-24 Xi Chen , Alan D. Sokal

By the Choi matrix criteria it is easy to determine if a specific linear matrix map is completely positive, but to establish whether a linear matrix map is positive is much less straightforward. In this paper we consider classes of linear…

泛函分析 · 数学 2021-03-29 Sanne ter Horst , Alma Naude

In this paper we study the total positivity of almost-Riordan arrays $(d(t)|\, g(t), f(t))$ and establish its necessary conditions and sufficient conditions, particularly, for some well used formal power series $d(t)$. We present a…

组合数学 · 数学 2024-06-07 Tian-Xiao He , Roksana Słowik

We discuss the application of the determinantal method to the proof of the Riemann hypothesis. We start from the fact that, if a certain doubly infinite set of determinants are all positive, then the hypothesis is true. This approach…

数论 · 数学 2011-11-07 John Nuttall

A composition of birational maps given by Laurent polynomials need not be given by Laurent polynomials; however, sometimes---quite unexpectedly---it does. We suggest a unified treatment of this phenomenon, which covers a large class of…

组合数学 · 数学 2025-10-17 Sergey Fomin , Andrei Zelevinsky

In this paper, we give a new generalization of positive sectional curvature called positive weighted sectional curvature. It depends on a choice of Riemannian metric and a smooth vector field. We give several simple examples of Riemannian…

微分几何 · 数学 2014-10-08 Lee Kennard , William Wylie

We give a combinatorial interpretation of a certain positivity conjecture of Chern-Schwartz-MacPherson classes, as stated by P. Aluffi and the author in a previous paper. It translates into a positivity property for a sum of p by p…

组合数学 · 数学 2007-05-23 Leonardo Constantin Mihalcea
‹ 上一页 1 2 3 10 下一页 ›