Search arXivSearch

arXiv · 2307.16794

Monotone links in DAHA and EHA

Abstract

We define monotone links on a torus, obtained as projections of curves in the plane whose coordinates are monotone increasing. Using the work of Morton-Samuelson, to each monotone link we associate elements in the double affine Hecke algebra and the elliptic Hall algebra. In the case of torus knots (when the curve is a straight line), we recover symmetric function operators appearing in the rational shuffle conjecture. We show that the class of monotone links viewed as links in $\mathbb R^3$ coincides with the class of Coxeter links, studied by Oblomkov-Rozansky in the setting of the flag Hilbert scheme. When the curve satisfies a convexity condition, we recover positroid links that we previously studied. In the convex case, we conjecture that the associated symmetric functions are Schur positive, extending a recent conjecture of Blasiak-Haiman-Morse-Pun-Seelinger, and we speculate on the relation to Khovanov-Rozansky homology. Our constructions satisfy a skein recurrence where the base case consists of piecewise almost linear curves. We show that convex piecewise almost linear curves give rise to algebraic links.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pavel Galashin, Thomas Lam. 2023-11-02. Monotone links in DAHA and EHA. https://arxiv.org/abs/2307.16794

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