Search arXivSearch

arXiv · 2309.15043

Alternating Sign Pentagons and Magog Pentagons

Abstract

Alternating sign triangles have been introduced by Ayyer, Behrend and Fischer in 2016 and it was proven that there is the same number of alternating sign triangles with $n$ rows as there is of $n\times n$ alternating sign matrices. Later on Fischer gave a refined enumeration of alternating sign triangles with respect to a statistic $ρ$, having the same distribution as the unique 1 in the top row of an alternating sign matrix, by connecting alternating sign triangles to $(0,n,n)$- Magog trapezoids. We introduce two more statistics counting the all $0$-columns on the left and right in an alternating sign triangle yielding objects we call alternating sign pentagons. We then show the equinumeracy of these alternating sign pentagons with Magog pentagons of a certain shape taking into account the statistic $ρ$. Furthermore we deduce a generating function of these alternating sign pentagons with respect to the statistic $ρ$ in terms of a Pfaffian and consider the implications of our new results on some open conjectures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Moritz Gangl. 2023-09-26. Alternating Sign Pentagons and Magog Pentagons. https://arxiv.org/abs/2309.15043

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

KEEP EXPLORING

Related papers

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

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