Sums of binomial determinants, non-intersecting lattice paths and positivity of Chern-Schwartz-MacPherson classes
Leonardo Constantin Mihalcea
Abstract
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 determinants consisting of binomial coefficients, generalizing the classical Theorem of Lindstrom-Gessel-Viennot et al. which computes these determinants in terms of non-intersecting lattice paths. We prove this conjecture for p=2,3.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.