Gorenstein braid cones and crepant resolutions

DOI10.1007/S00454-023-00589-8MaRDI QIDQ6204770FDO

Authors Joshua Hallam, John Machacek

Publication date 2 April 2024

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2112.15308

zbMATH Keywords

toric varietyposetGorenstein varietyMöbius functionbraid cone

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorics of partially ordered sets (06A07) Combinatorial aspects of algebraic geometry (05E14)

Abstract: To any poset $P$, we associate a convex cone called a braid cone. We also associate a fan and study the toric varieties the cone and fan define. The fan always defines a smooth toric variety $X_P$, while the toric variety $U_P$ of the cone may be singular. We show that $X_{P}dashrightarrow{U}_P$ is a crepant resolution of singularities if and only if $P$ is bounded. Next, we aim to determine when $U_P$ is Gorenstein or $mathbbQ$-Gorenstein. We prove that whether or not $U_P$ is ($mathbbQ$)-Gorenstein depends only on the biconnected components of the Hasse diagram of $P$. In the case that $P$ has a minimum or maximum element, we show that the Gorenstein property of $U_P$ is completely determined by the M"obius function of $P$. We also provide a recursive method that determines if $U_P$ is ($mathbbQ$)-Gorenstein in this case. We conjecture that $U_P$ is Gorenstein if and only if it is $mathbbQ$-Gorenstein. We verify this conjecture for posets of length $1$ and also for posets with a minimum or maximum element.

Cites work

• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 4067064 (Why is no real title available?)
• scientific article; zbMATH DE number 1975168 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Combinatorics: the art of counting
• Coxeter cones and their \(h\)-vectors
• Faces of generalized permutohedra
• Flag \(f\)-vectors and the \(cd\)-index
• Generating all vertices of a polyhedron is hard
• Generic torus orbit closures in Schubert varieties
• Gorenstein graphic matroids
• Gorenstein graphic matroids from multigraphs
• Linear extension sums as valuations on cones
• On the toric ideal of a matroid
• Parameterized algorithms
• Quotients of Coxeter complexes and 𝑃-partitions
• Rings of Invariants of Tori, Cohen-Macaulay Rings Generated by Monomials, and Polytopes
• Singularities of toric varieties associated with finite distributive lattices
• Strong factorization and the braid arrangement fan
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Toric varieties
• Whitney numbers for poset cones
• \(p\)-partitions revisited

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Gorenstein braid cones and crepant resolutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204770)