中文
相关论文

相关论文: Sums of binomial determinants, non-intersecting la…

200 篇论文

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

In this paper, we show how general determinants may be viewed as generating functions of nonintersecting lattice paths, using the Lindstr\"om-Gessel-Viennot interpretation of semistandard Young tableaux and the Jacobi-Trudi identity…

组合数学 · 数学 2010-10-20 Markus Fulmek

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

Ismail et al. (Constr. Approx. {\bf 15} (1999) 69--81) proved the positivity of some trigonometric polynomials with single binomial coefficients. In this paper, we prove some similar results by replacing the binomial coefficients with…

组合数学 · 数学 2011-03-25 Victor J. W. Guo , Jiang Zeng

We find the joint distribution of three simple statistics on lattice paths of n upsteps and n downsteps leading to a triple sum identity for the central binomial coefficient {2n}-choose-{n}. We explain why one of the constituent double sums…

组合数学 · 数学 2012-06-15 David Callan

In recent preprints, Cigler considered certain Hankel determinants of convoluted Catalan numbers and conjectured identities for these determinants. In this note, we shall give a bijective proof of Cigler's Conjecture by interpreting…

组合数学 · 数学 2024-03-29 Markus Fulmek

Koutschan, Krattenthaler and Schlosser recently considered a family of binomial determinants. In this work, we give combinatorial interpretations of two subclasses of these determinants in terms of domino tilings and nonintersecting lattice…

组合数学 · 数学 2025-09-18 Qipin Chen , Shane Chern , Atsuro Yoshida

We give a family of congruences for the binomial coefficients ${kp-1\choose p-1}$ in terms of multiple harmonic sums, a generalization of the harmonic numbers. Each congruence in this family (which depends on an additional parameter $n$)…

数论 · 数学 2018-10-16 Julian Rosen

We consider a family of determinantal random point processes on the two-dimensional lattice and prove that members of our family can be interpreted as a kind of Gibbs ensembles of nonintersecting paths. Examples include probability measures…

数学物理 · 物理学 2015-05-13 Alexei Borodin , Senya Shlosman

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…

数论 · 数学 2024-09-04 Fernando Szechtman

In this paper we compare different notions of transversality for possible singular complex algebraic or analytic subsets of an ambient complex manifold and prove a refined intersection formula for their Chern-Schwartz-MacPherson classes. In…

代数几何 · 数学 2016-01-07 Joerg Schuermann

In previous work of this author it was conjectured that the sum of power sums $p_\lambda,$ for partitions $\lambda$ ranging over an interval $[(1^n), \mu]$ in reverse lexicographic order, is Schur-positive. Here we investigate this…

组合数学 · 数学 2025-09-09 Sheila Sundaram

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…

组合数学 · 数学 2019-02-22 Michael Schlosser

Let $C(n,p)$ be the set of $p$-compositions of an integer $n$, i.e., the set of $p$-tuples $\bm{\alpha}=(\alpha_1,...,\alpha_p)$ of nonnegative integers such that $\alpha_1+...+\alpha_p=n$, and $\mathbf{x}=(x_1,...,x_p)$ a vector of…

组合数学 · 数学 2007-05-23 Josep M. Brunat , Antonio Montes

We prove a strengthened form of a conjecture of Sun on a determinant attached to a binary quadratic form. Let $n>3$ and let $c,d\in\Z$. If $n$ is composite, then \[ \det\big[(i^2+cij+dj^2)^{n-2}\big]_{0\leq i,j\leq n-1}\equiv 0\pmod {n^2}…

数论 · 数学 2026-05-29 Yutong Zhang , Yaoran Yang

Let p be any prime, and let a and n be nonnegative integers. Let $r\in Z$ and $f(x)\in Z[x]$. We establish the congruence $$p^{\deg f}\sum_{k=r(mod p^a)}\binom{n}{k}(-1)^k f((k-r)/p^a) =0 (mod p^{\sum_{i=a}^{\infty}[n/p^i]})$$ (motivated by…

数论 · 数学 2007-07-25 Zhi-Wei Sun , Donald M. Davis

In this work we establish a connection between copositivity, that is, nonnegativity on the positive orthant, of sparse real Laurent polynomials and discriminants. Specifically, we consider Laurent polynomials in the positive orthant with…

代数几何 · 数学 2025-12-10 Elisenda Feliu , Joan Ferrer , Máté L. Telek

In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…

数论 · 数学 2007-05-23 Zhi-Wei Sun

We prove a combinatorial formula for LLT cumulants of melting lollipops as a positive combination of LLT polynomials indexed by spanning trees. The result gives an affirmative answer to a general positivity question for this class of…

组合数学 · 数学 2023-11-16 Maciej Kowalski

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