Related papers: An observation on highest weight crystals

Variational monotone recurrence relations arise in solid state physics as generalizations of the Frenkel-Kontorova model for a ferromagnetic crystal. For such problems, Aubry-Mather theory establishes the existence of "ground states" or…

We generalize, and then use, a recently introduced formalism to study thermal fluctuations of atomic displacements in several two and three dimensional crystals. We study both close packed as well as open crystals with multi atom bases.…

In this work we propose Lasagne, a methodology to learn locality and structure aware graph node embeddings in an unsupervised way. In particular, we show that the performance of existing random-walk based approaches depends strongly on the…

We study a one-parameter family of interval maps $\{T_\alpha\}_{\alpha\in[1,\beta]}$, with $\beta$ the golden mean, defined on $[-1,1]$ by $T_\alpha(x)=\beta^{1+|t|}x-t\beta\alpha$ where $t\in\{-1,0,1\}$. For each $T_\alpha,\ \alpha>1$, we…

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

We present classes of models in which particles are dropped on an arbitrary fixed finite connected graph, obeying adhesion rules with screening. We prove that there is an invariant distribution for the resulting height profile, and Gaussian…

Crystal material representation is the foundation of crystal material research. Existing works consider crystal molecules as graph data with different representation methods and leverage the advantages of techniques in graph learning. A…

We present a simple combinatorial model for the characters of the irreducible integrable highest weight modules for complex symmetrizable Kac-Moody algebras. This model can be viewed as a discrete counterpart to the Littelmann path model.…

We prove an inductive formula to construct a path from the highest weight element to any given vertex in the crystal graph of the polytope realization of the Kirillov-Reshetikhin crystal $KR^{i,m}$ of type $A$. For $i \leq 2$ or $i \geq…

We prove that the category of finitely generated graded modules over the quiver Hecke algebra of arbitrary type admits numerous stratifications in the sense of Kleshchev. A direct consequence is that the full subcategory corresponding to…

We prove a Sidorenko-type inequality for directed trees: for every oriented tree $T$ on $k$ vertices and every finite directed graph $G$, the homomorphism count hom$(T,G)$ is bounded above by the maximum of the two pure star counts…

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…

For an $n$-vertex graph $G$, the walk matrix of $G$, denoted by $W(G)$, is the matrix $[e,A(G)e,\ldots,(A(G))^{n-1}e]$, where $A(G)$ is the adjacency matrix of $G$ and $e$ is the all-ones vector. For two integers $m$ and $\ell$ with $1\le…

We introduce coplactic raising and lowering operators $E'_i$, $F'_i$, $E_i$, and $F_i$ on shifted skew semistandard tableaux. We show that the primed operators and unprimed operators each independently form type A Kashiwara crystals (but…

Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…

The notion of hereditarily equivalent continua is classical in continuum theory with only two known nondegenerate examples (arc, and pseudoarc). In this paper we introduce generically hereditarily equivalent continua, i.e. continua which…

A $\Gamma$-distance magic labeling of a graph $G=(V,E)$ with $|V | = n$ is a bijection $f$ from $V$ to an Abelian group $\Gamma$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every vertex $x \in V$ is equal to the same…

We give a realization of crystal graphs for basic representations of the quantum affine algebra $U_q(C_2^{(1)})$ in terms of new combinatorial objects called the Young walls.

We consider the boundary-path groupoids of topological higher-rank graphs. We show that the all such groupoids are topologically amenable. We deduce that the C*-algebras of topological higher-rank graphs are nuclear and prove versions of…

The spectral properties of traditional (dyadic) graphs, where an edge connects exactly two vertices, are widely studied in different applications. These spectral properties are closely connected to the structural properties of dyadic…