Log-concave inequalities for posets

Thu Sep 30, 21:00-22:00 (2 months ago)

Abstract: The study of log-concave inequalities for combinatorial objects have seen much progress in recent years. One such progress is the solution to the strongest form of Mason's conjecture (independently by Anari et. al. and Brándën-Huh) that the f-vectors of matroid independence complex is ultra-log-concave. In this talk, we discuss a new proof of this result through linear algebra and discuss generalizations to greedoids and posets. This is a joint work with Igor Pak.

The talk is aimed at a general audience.

combinatorics

Audience: learners

( slides | video )


UCLA Combinatorics Seminar

Series comments: The seminar will run in hybrid format: most talks will physically take part at UCLA while simultaneously being streamed to Zoom. Zoom participants are welcome to attend and ask questions!

Zoom link: ucla.zoom.us/j/92833028016

Password: the missing term in the sequence 1, 2, 5, ??, 42, 132, 429. (The password is a number, e.g., "13" as opposed to "thirteen.") Alternatively, feel free to email one of the organizers.

Organizers: Pavel Galashin*, Igor Pak*
*contact for this listing

Export talk to