Search arXivSearch

arXiv · 1606.02928

Elliptic extensions of the alpha-parameter model and the rook model for matchings

Abstract

We construct elliptic extensions of the alpha-parameter rook model introduced by Goldman and Haglund and of the rook model for matchings of Haglund and Remmel. In particular, we extend the product formulas of these models to the elliptic setting. By specializing the parameter alpha in our elliptic extension of the alpha-parameter model and the shape of the Ferrers board in different ways, we obtain elliptic analogues of the Stirling numbers of the first kind and of the Abel polynomials, and obtain an a,q-analogue of the matching numbers. We further generalize the rook theory model for matchings by introducing l-lazy graphs which correspond to l-shifted boards, where l is a finite vector of positive integers. The corresponding elliptic product formula generalizes Haglund and Remmel's product formula for matchings already in the non-elliptic basic case.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael J. Schlosser, Meesue Yoo. 2016-06-09. Elliptic extensions of the alpha-parameter model and the rook model for matchings. https://doi.org/10.1016/j.aam.2016.10.001

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