Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 80 tok/s
Gemini 2.5 Pro 60 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 87 tok/s Pro
Kimi K2 173 tok/s Pro
GPT OSS 120B 433 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Diagonally and antidiagonally symmetric alternating sign matrices of odd order (1512.06030v3)

Published 18 Dec 2015 in math.CO, math-ph, and math.MP

Abstract: We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASASMs) of fixed odd order by introducing a case of the six-vertex model whose configurations are in bijection with such matrices. The model involves a grid graph on a triangle, with bulk and boundary weights which satisfy the Yang-Baxter and reflection equations. We obtain a general expression for the partition function of this model as a sum of two determinantal terms, and show that at a certain point each of these terms reduces to a Schur function. We are then able to prove a conjecture of Robbins from the mid 1980's that the total number of $(2n+1)\times(2n+1)$ DASASMs is $\prod_{i=0}n\frac{(3i)!}{(n+i)!}$, and a conjecture of Stroganov from 2008 that the ratio between the numbers of $(2n+1)\times(2n+1)$ DASASMs with central entry $-1$ and $1$ is $n/(n+1)$. Among the several product formulae for the enumeration of symmetric alternating sign matrices which were conjectured in the 1980's, that for odd-order DASASMs is the last to have been proved.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.