Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1509.06421

Another dual of MacMahon's theorem on plane partitions

Mihai Ciucu
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we introduce a counterpart structure to the shamrocks studied in the paper "A dual of Macmahon's theorem on plane partitions" by M. Ciucu and C. Krattenthaler (Proc. Natl. Acad. Sci. USA, vol. 110 (2013), 4518-4523), which, just like the latter, can be included at the center of a lattice hexagon on the triangular lattice so that the region obtained from the hexagon by removing it has its number of lozenge tilings given by a simple product formula. The new structure, called a fern, consists of an arbitrary number of equilateral triangles of alternating orientations lined up along a lattice line. The shamrock and the fern seem to be the only structures with this property. It would be interesting to understand why these are the only two such structures.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mihai Ciucu. 2015-09-21. Another dual of MacMahon's theorem on plane partitions. https://arxiv.org/abs/1509.06421

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↗