中文
相关论文

相关论文: Lah numbers and Lindstr\"om's lemma

200 篇论文

In 2015, Chen, Liang and Wang provided several sufficient conditions for the total positivity of Riordan arrays and asked for combinatorial proofs of these results. In this paper, we present such proofs by constructing suitable planar…

组合数学 · 数学 2025-12-15 Lanqi Du , Ethan Y. H. Li

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

Many combinatorial matrices --- such as those of binomial coefficients, Stirling numbers of both kinds, and Lah numbers --- are known to be totally non-negative, meaning that all minors (determinants of square submatrices) are non-negative.…

组合数学 · 数学 2019-06-06 David Galvin , Adrian Pacurar

We present a common sufficient condition for the total positivity of combinatorial triangles and their reversals, as well as the real-rootedness of generating functions of the rows. The proof technique is to construct a unified planar…

组合数学 · 数学 2025-12-10 Xi Chen , Lang Fu , Jiajie Ruan

A linear polyomial non-negative on the non-negativity domain of finitely many linear polynomials can be expressed as their non-negative linear combination. Recently, under several additional assumptions, Helton, Klep, and McCullough…

算子代数 · 数学 2012-11-28 Aljaž Zalar

In the paper, the authors find some integral representations and discover some properties of Lah numbers.

组合数学 · 数学 2014-10-28 Bai-Ni Guo , Feng Qi

In this paper we introduce and study two generalizations of Lah numbers, analogous to the Stirling numbers with higher level - a combinatorial one (Lah numbers with higher level) and an algebraic one (Lah numbers of order $s$). We define…

综合数学 · 数学 2025-11-03 Aleks Žigon Tankosič

Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…

量子代数 · 数学 2014-10-20 Simon Lentner , Daniel Nett

In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first $r$ elements are in distinct blocks, respectively. We introduce a generalization of the Lah numbers. For…

组合数学 · 数学 2020-06-05 Beáta Bényi , Miguel Méndez , José L. Ramirez

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

For positive integers $n,n'$, we give a combinatorial characterization for the set of quadratic inequalities on minors that are valid for all $n\times n'$ totally nonnegative matrices. This is obtained as a consequence from our earlier…

组合数学 · 数学 2025-08-05 Vladimir I. Danilov , Alexander V. Karzanov , Gleb A. Koshevoy

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

组合数学 · 数学 2021-04-05 Elisa Palezzato , Michele Torielli

A uniqueness theorem for an LU decomposition of a totally nonnegative matrix is obtained.

环与代数 · 数学 2011-06-14 K R Goodearl , T H Lenagan

Let $R=\mathcal{O}_{\Q(\sqrt{d})}$ for $d<0$, squarefree, $d\neq -1,-3$. We prove Lehmer's conjecture for associated reciprocal polynomials of $R$-matrices; that is, any noncyclotomic $R$-matrix has Mahler measure at least…

数论 · 数学 2011-03-24 G. Taylor

Using the relationship between totally nonnegative matrices and directed acyclic weighted planar networks, we show that $2\times 2$ minors of minor matrices of totally nonnegative matrices are also nonnegative. We give a combinatorial…

组合数学 · 数学 2015-03-17 David A. Cardon , Pace P. Nielsen

We consider the Ehrhart polynomial of hypersimplices. It is proved that these polynomials have positive coefficients and we give a combinatorial formula for each of them. This settles a problem posed by Stanley and also proves that uniform…

组合数学 · 数学 2020-11-23 Luis Ferroni

We show that recent determinant evaluations involving Catalan numbers and generalisations thereof have most convenient explanations by combining the Lindstr\"om-Gessel-Viennot theorem on non-intersecting lattice paths with a simple…

组合数学 · 数学 2010-04-27 Christian Krattenthaler

We prove the positivity of Kazhdan-Lusztig polynomials for sparse paving matroids, which are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids. The positivity follows from a remarkably simple…

组合数学 · 数学 2020-06-19 Kyungyong Lee , George D. Nasr , Jamie Radcliffe

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

组合数学 · 数学 2016-07-04 Ben Elias , Nicholas Proudfoot , Max Wakefield

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
‹ 上一页 1 2 3 10 下一页 ›