相关论文: Equality cases of the Stanley--Yan log-concave mat…

In 1981, Stanley applied the Aleksandrov-Fenchel inequalities to prove a logarithmic concavity theorem for regular matroids. Using ideas from electrical network theory we prove a generalization of this for the wider class of matroids with…

We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…

We study combinatorial inequalities for various classes of set systems: matroids, polymatroids, poset antimatroids, and interval greedoids. We prove log-concavity inequalities for counting certain weighted feasible words, which generalize…

We show that if the ground set of a matroid can be partitioned into $k\ge 2$ bases, then for any given subset $S$ of the ground set, there is a partition into $k$ bases such that the sizes of the intersections of the bases with $S$ may…

For a full-rank integral lattice $\mathcal{L}\subset\mathbb{R}^n$, Regev and Stephens-Davidowitz proved that \[N_{=k}(\mathcal{L}):=|\{y\in\mathcal{L}:\lVert y\rVert^2=k\}|\le 2\binom{n+2k-2}{2k-1}.\] We classify the equality cases. For…

Recently, it was proved by Anari-Oveis Gharan-Vinzant, Anari-Liu-Oveis Gharan-Vinzant and Br\"{a}nd\'{e}n-Huh that, for any matroid $M$, its basis generating polynomial and its independent set generating polynomial are log-concave on the…

Stanley's inequalities for partially ordered sets establish important log-concavity relations for sequences of linear extensions counts. Their extremals however, i.e., the equality cases of these inequalities, were until now poorly…

We give a deterministic polynomial time $2^{O(r)}$-approximation algorithm for the number of bases of a given matroid of rank $r$ and the number of common bases of any two matroids of rank $r$. To the best of our knowledge, this is the…

As part of his work on special Lagrangian (sLag) submanifolds with isolated conical singularities, Joyce proved a criterion for the existence of sLag smoothings, along a small variation of complex structure, for the union of two connected,…

The present note is a strengthening of a recent paper by K. Takazawa and Y. Yokoi (A generalized-polymatroid approach to disjoint common independent sets in two matroids, Discrete Mathematics (2019)). For given two matroids on $E$, under…

We prove stability estimates for the Shannon-Stam inequality (also known as the entropy-power inequality) for log-concave random vectors in terms of entropy and transportation distance. In particular, we give the first stability estimate…

We give a self-contained proof of the strongest version of Mason's conjecture, namely that for any matroid the sequence of the number of independent sets of given sizes is ultra log-concave. To do this, we introduce a class of polynomials,…

The aim of this article is to report on recent progress in understanding mirror symmetry for some non-complete intersection Calabi-Yau threefolds. We first construct four new smooth non-complete intersection Calabi-Yau threefolds with…

In this paper we consider Harnack inequalities with respect to a symmetric $\alpha$-stable L\'evy process $X$ in $\mathbb{R}^d$, $\alpha \in (0,2)$, $d\geq 2$. We study the example from the article \cite{bg-sz-1}. There, the authors have…

We give an alternative look at the log-Sobolev inequality (LSI in short) for log-concave measures by semigroup tools. The similar idea yields a heat flow proof of LSI under some quadratic Lyapunov condition for symmetric diffusions on…

We derive a multiscale generalisation of the Bakry--\'Emery criterion for a measure to satisfy a Log-Sobolev inequality. Our criterion relies on the control of an associated PDE well known in renormalisation theory: the Polchinski equation.…

Let $M$ be a matroid satisfying a matroidal analogue of the Cayley-Bacharach condition. Given a number $k \ge 2$, we show that there is no nontrivial bound on ranks of a $k$-tuple of flats covering the underlying set of $M$. This addresses…

We partition in classes the set of matroids of fixed dimension on a fixed vertex set. In each class we identify two special matroids, respectively with minimal and maximal h-vector in that class. Such extremal matroids also satisfy a…

In a seminal paper published in 1980, P. C. Yang and S.-T. Yau proved an inequality bounding the first eigenvalue of the Laplacian on an orientable Riemannian surface in terms of its genus $\gamma$ and the area. The equality in Yang-Yau's…

In a recent paper, the first author proved the log-concavity of the coefficients of the characteristic polynomial of a matroid realizable over a field of characteristic 0, answering a long-standing conjecture of Read in graph theory. We…