Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPerfectness of Kirillov-Reshetikhin Crystals $B^{r,s}$ for types $E_{6}^{(1)}$ and $E_{7}^{(1)}$ with a minuscule node $r$
56
0
0.0
(
0
)
Authors
Toya Hiroshima
Ask ChatGPT about the research
No Arabic abstract
We prove the perfectness of Kirillov-Reshetikhin crystals $B^{r,s}$ for types $E_{6}^{(1)}$ and $E_{7}^{(1)}$ with $r$ being the minuscule node and $sgeq 1$ using the polytope model of KR crystals introduced by Jang.
rate research
Read More
We show that a tensor product of nonexceptional type Kirillov--Reshetikhin (KR) crystals is isomorphic to a direct sum of Demazure crystals; we do this in the mixed level case and without the perfectness assumption, thus generalizing a result of Naoi. We use this result to show that, given two tensor products of such KR crystals with the same maximal weight, after removing certain $0$-arrows, the two connected components containing the minimal/maximal elements are isomorphic. Based on the latter fact, we reduce a tensor product of higher level perfect KR crystals to one of single-column KR crystals, which allows us to use the uniform models available in the literature in the latter case. We also use our results to give a combinatorial interpretation of the Q-system relations. Our results are conjectured to extend to the exceptional types.
The ErdH{o}s-Simonovits stability theorem states that for all epsilon >0 there exists alpha >0 such that if G is a K_{r+1}-free graph on n vertices with e(G) > ex(n,K_{r+1}) - alpha n^2, then one can remove epsilon n^2 edges from G to obtain an r-partite graph. Furedi gave a short proof that one can choose alpha=epsilon. We give a bound for the relationship of alpha and varepsilon which is asymptotically sharp as epsilon to 0.
The grand unified group $E_6$~is a predictive scheme for physics beyond the standard model (SM). It offers the possibility of extra $Z$ bosons, new vector-like fermions, sterile neutrinos, and neutral scalars in addition to the SM Higgs boson. Some previous discussions of these features are updated and extended. Their relevance to present searches at the CERN Large Hadron Collider and in patterns of neutrino masses is noted. Addition of a small set of scalar bosons at the TeV scale permits gauge unification near a scale of $10^{16}$ GeV, and leads to bounds on masses of particles beyond those in the standard model.
Following Craw, Maclagan, Thomas and Nakamuras work on Hilbert schemes for abelian groups, we give an explicit description of the G-Hilbert scheme for G equal to a cyclic group of order r, acting on C^3 with weights 1,a,r-a. We describe how the combinatorial properties of the fan of G-Hilbert scheme relates to the Euclidean algorithm.
For a graph $H$, a graph $G$ is $H$-saturated if $G$ does not contain $H$ as a subgraph but for any $e in E(overline{G})$, $G+e$ contains $H$. In this note, we prove a sharp lower bound for the number of paths and walks on length $2$ in $n$-vertex $K_{r+1}$-saturated graphs. We then use this bound to give a lower bound on the spectral radii of such graphs which is asymptotically tight for each fixed $r$ and $ntoinfty$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
