Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1810.05750

Topology of Z_3 equivariant Hilbert schemes

Deborah Castro·Dustin Ross
View original source ↗Read source document ↗Export metadata ↓

Abstract

Motivated by work of Gusein-Zade, Luengo, and Melle-Hernández, we study a specific generating series of arm and leg statistics on partitions, which is known to compute the Poincaré polynomials of Z_3-equivariant Hilbert schemes of points in the plane, where Z_3 acts diagonally. This generating series has a conjectural product formula, a proof of which has remained elusive over the last ten years. We introduce a new combinatorial correspondence between partitions of n and {1,2}-compositions of n, which behaves well with respect to the statistic in question. As an application, we use this correspondence to compute the highest Betti numbers of the Z_3 equivariant Hilbert schemes.

Explore related subjects

math.COmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Deborah Castro, Dustin Ross. 2018-10-12. Topology of Z_3 equivariant Hilbert schemes. https://arxiv.org/abs/1810.05750

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗