Search arXivSearch

arXiv · 1605.01572

The Laurent coefficients of the Hilbert series of a Gorenstein algebra

Abstract

By a theorem of R. Stanley, a graded Cohen-Macaulay domain $A$ is Gorenstein if and only if its Hilbert series satisfies the functional equation \[ \operatorname{Hilb}_A(t^{-1})=(-1)^d t^{-a}\operatorname{Hilb}_A(t), \] where $d$ is the Krull dimension and $a$ is the a-invariant of $A$. We reformulate this functional equation in terms of an infinite system of linear constraints on the Laurent coefficients of $\operatorname{Hilb}_A(t)$ at $t=1$. The main idea consists of examining the graded algebra $\mathcal F=\bigoplus_{r\in \mathbb{Z}}\mathcal F_r$ of formal power series in the variable $x$ that fulfill the condition $φ(x/(x-1))=(1-x)^rφ(x)$. As a byproduct, we derive quadratic and cubic relations for the Bernoulli numbers. The cubic relations have a natural interpretation in terms of coefficients of the Euler polynomials. For the special case of degree $r=-(a+d)=0$, these results have been investigated previously by the authors and involved merely even Euler polynomials. A link to the work of H. W. Gould and L. Carlitz on power sums of symmetric number triangles is established.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hans-Christian Herbig, Daniel Herden, Christopher Seaton. 2017-11-01. The Laurent coefficients of the Hilbert series of a Gorenstein algebra. https://doi.org/10.1080/10586458.2018.1492473

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO