The g-theorem describes the face numbers of simplicial polytopes (and homology spheres over a field) as being described better in terms of a g-vector; and it says more precisely that this vector is always nonnegative and cannot grow to fast, that is, cannot be too large in terms of .
Now, one can ask: How are these numbers related to the shape of a polytope? Indeed, a number of years ago, we found out that polytopes that approximate a smooth convex body well cannot be too close to the lower bound; that is, with the exception of the trivial first entry, the entries of the g-vector had to grow.
But could they be close to the maximal growth? That remained an open question, and I hoped a quantitative Gotzman persitence type theorem would shed light on the situation.
Revizor
I am publishing my response to the Hebrew University’s story, together with supporting documents.
Ordinarily, prejudice, cant and calumny deserve no reply. But the public should be able to see how the University employs altered documents, treats witnesses and responds with bullying and misuse of power when its own conduct is challenged.
And in any case, to those who know me not, a truer information may be requisite.
Johanna’s death is a tragedy. I ask readers to respect her family’s privacy. To reduce unnecessary exposure of her name, I have removed her name from the documents and refer to her as J.
We continue to report any harassment of family, group members or witnesses to the relevant authorities.
You find the files below. Where files contain sensitive material about Johanna, I only share a redacted version. The unredacted original, along with further documentation, can be made available on (individually considered) request, with appropriate protection for private and third-party information.
Continue readingGromov’s angular spread theorem
I recently reported about a polyhedral proof of Stoker’s theorem using a lemma of Martin Winter; this, in turn, uses technique by Izmestiev.
I wanted to take a brief moment to illustrate that technique; Gromov, a few years ago, published a marvelous little paper. He used differential geometry techniques to show that a polytope cannot be too long in every direction. Specifically: Consider P a d-dimensional polytope, and map it cellularly to a d-cube C. Pick two opposing facets ,
of that d-cube. Their preimages in P are d-1-disks.
Nice enough. Now, try to go from the preimage of to the preimage of
. If you go from one facet to an adjacent one in
, then you “pay” the angle between their normals. All together, the optimal way you can take gives a minimal angular distance between the preimage of
to the preimage of
in
; it describes how far the two preimages are apart.
Now, it would be nice, and perhaps point towards the polynomial Hirsch conjecture, if we could say something about this distance. But Gromov says: geometry naturally gives something different: If I minimize over ALL the opposing pairs of facets of , then I obtain
, the angular spread… it describes the question whether P is long in every direction. Gromov’s paper obtains a displayed
bound by passing through smooth mean-curvature geometry [1]. He needs to smoothen the polytope first, and his argument for non-simple polytopes is a bit … fishy. In comes Izmestiev, and I want to illustrate his method here, and improve the bound using it.


IDP polytopes, hypersimplices, projective spaces
I wanted to update on 3 small new results.
First, Luis Ferroni used LLM (and a lot of persistence and cleverness) to prove something I long suspected: that IDP lattice polytopes do NOT have unimodal vectors. Unimodality is nice because it makes the sequence especially simple: it rises, then falls again… a dromedary, instead of a camel. And that IDP polytopes (that is, polytopes which are generated by atoms on the same level, that is, level one) satisfy it was a (I thought unlikely, but long standing) conjecture of Stanley….
Luis found, quite amazingly, that these are rather nice polytopes: smooth Cayley polytopes of rectangular prisms. This complements our work on IDP polytopes, proving among other things monotonicity of the vector in the second half. Congratulations Luis!
Continue reading“If you don’t want me to be nice, then I don’t have to be nice.”
There is nothing more to add, really. See also here. Somewhere on the level of “You wouldn’t be in so much trouble if you did not criticize the war”.
Misha, again
On 26 of August this year, Misha Verbitsky was fired from his position at IMPA for his blog.
I do not agree with many of his posts, and some verge on the barely tolerable for me. But I would also respect his opinion, discussion. Most of all, I think his opinion has no bearing on his mathematics.
University leadership and institutional actors may believe themselves immune to scrutiny. In this particular case, I want to highlight that merely two months ago, the same person that now fired him wrote an article about defending specifically his freedom of speech. Please share. I also attach the letter regarding his dismissal. It appears that Misha was not presented with an actual accusation he could answer, and that the posts he was (supposedly) dismissed for kept changing as the institute adapted its narrative, suggesting post hoc justification.

Stoker, again
I wanted to quickly mention an “almost” LLM result. I wrote previously about a marvelous new approach of Yuchen Bi to Stoker’s conjecture using differential geometry, but that still critically used quite extensively non-polyhedral techniques. Yesterday, Arseniy Akopyan wrote to me that he chatted with LLM and found a polyhedral only proof.
Not essentially new, Arseniy and I then noticed that the LLM had “stolen” a result of Martin Winter, who in 2023 found the proof without noticing, and wrote it in a very nice paper expanding our knowledge of Wachspress coordinates and Izmestiev matrices. Congratulations, Martin!

A little update on Stoker’s conjecture
Recovering from some surgeries, I wanted to write a little something on Stoker’s conjecture: It is best viewed as an angular converse to Cauchy’s rigidity theorem. Cauchy’s proves more than the usual statement that congruent corresponding faces determine a convex polyhedron: for a fixed combinatorial type, the angles inside the faces already determine the dihedral angles. In 1968, James J. Stoker asked whether the converse holds: do the dihedral angles determine the face angles?

(Ps: For health reasons, I am taking a break and may not check or respond to communication)
Continue readingMisha Verbitsky facing extradition to Russia
Misha Verbitsky, a distinguished mathematician and long-time public critic of the Russian state, has reportedly been detained at Yerevan airport on a Russian request.
Verbitsky is known not only for his mathematical work, but also for his uncompromising public writing: against war, against censorship, in favor of open culture and free expression. One need not agree with everything he has written to see the danger here. The Russian charges against him arise in the context of political speech and dissent. Extradition to Russia would therefore place him at grave risk.
Armenia should not hand him over. At minimum, Verbitsky must have immediate access to lawyers, independent observers, and a fair procedure in which the political nature of the Russian request is taken seriously.
This is urgent. Please circulate reliable information, contact academic and human-rights networks, and ask Armenian authorities not to extradite Misha Verbitsky to Russia.
For questions, please contact his daughter, Sima
see also change.org/free_misha_verbitsky

Update: he was freed and left Armenia
Pi(p)e dreams in commutative algebra, purity of Frobenius and Gorenstein domains: The Lefschetz property is (not so) ubiquitous
The one where some mathematicians meet on Lesbos, and observe that all F-pure standard graded Gorenstein rings have the hard Lefschetz property, but some Gorenstein domains do not.

You must be logged in to post a comment.