Search arXivSearch

arXiv · 2001.04399

Grossberg-Karshon twisted cubes and hesitant jumping walk avoidance

Abstract

Let $G$ be a complex simply-laced semisimple algebraic group of rank $r$ and $B$ a Borel subgroup. Let $\mathbf i \in [r]^n$ be a word and let $\mathbf \ell = (\ell_1,\dots,\ell_n)$ be a sequence of non-negative integers. Grossberg and Karshon introduced a virtual lattice polytope associated to $\mathbf i$ and $\mathbf \ell$ called a twisted cube, whose lattice points encode the character of a $B$-representation. More precisely, lattice points in the twisted cube, counted with sign according to a certain density function, yields the character of the generalized Demazure module determined by $\mathbf i$ and $\mathbf \ell$. In recent work, the author and Harada described precisely when the Grossberg-Karshon twisted cube is untwisted, i.e., the twisted cube is a closed convex polytope, in the situation when the integer sequence $\mathbf \ell$ comes from a weight $λ$ of $G$. However, not every integer sequence $\mathbf \ell$ comes from a weight of $G$. In the present paper, we interpret untwistedness of Grossberg-Karshon twisted cubes associated to any word $\mathbf i$ and any integer sequence $\mathbf \ell$ using the combinatorics of $\mathbf i$ and $\mathbf \ell$. Indeed, we prove that the Grossberg-Karshon twisted cube is untwisted precisely when $\mathbf i$ is hesitant-jumping-$\mathbf \ell$-walk-avoiding.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eunjeong Lee. 2020-01-10. Grossberg-Karshon twisted cubes and hesitant jumping walk avoidance. https://doi.org/10.37236/9278

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