English
Related papers

Related papers: An observation on highest weight crystals

200 papers

Let $W$ be the Weyl group of a split semisimple group $G$. Its Hecke category $\mathsf{H}_W$ can be built from pure perverse sheaves on the double flag variety of $G$. By developing a formalism of generalized realization functors, we…

Representation Theory · Mathematics 2021-06-23 Minh-Tâm Quang Trinh

We propose high-order hypergraph walks as a framework to generalize graph-based network science techniques to hypergraphs. Edge incidence in hypergraphs is quantitative, yielding hypergraph walks with both length and width. Graph methods…

Physics and Society · Physics 2020-06-09 Sinan G. Aksoy , Cliff Joslyn , Carlos Ortiz Marrero , Brenda Praggastis , Emilie Purvine

Topological insulators are known to their metallic surface states, a result of strong-spin-orbital coupling, that show unique surface transport phenomenon. But these surface transports are buried in presence of metallic bulk conduction. We…

The purpose of this paper is to investigate the asymptotic behavior of random walks on three-dimensional crystal structures. We focus our attention on the 1h structure of the ice and the 2h structure of graphite. We establish the strong law…

Mathematical Physics · Physics 2024-06-19 Bernard Bercu , Fabien Montégut

We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…

Combinatorics · Mathematics 2019-05-17 Chris Godsil , Hanmeng Zhan

We introduce a Grothendieck ring of higher Artin stacks generalizing the Grothendieck ring of algebraic varieties. We show that this ring is not trivial by noticing that it factors the invariant "number of rational points over a finite…

Algebraic Geometry · Mathematics 2009-11-18 B. Toen

A simple undirected graph is weakly $G$-locally projective, for a group of automorphisms $G$, if for each vertex $x$, the stabiliser $G(x)$ induces on the set of vertices adjacent to $x$ a doubly transitive action with socle the projective…

Group Theory · Mathematics 2016-04-12 Michael Giudici , A. A. Ivanov , Luke Morgan , Cheryl E. Praeger

We consider random walks on comb- and brush-like graphs consisting of a base (of fractal dimension $D$) decorated with attached side-groups. The graphs are also characterized by the fractal dimension $D_a$ of a set of anchor points where…

Statistical Mechanics · Physics 2019-01-09 Alex V. Plyukhin , Dan Plyukhin

Although quantum walks exhibit peculiar properties that distinguish them from random walks, classical behavior can be recovered in the asymptotic limit by destroying the coherence of the pure state associated to the quantum system. Here I…

Quantum Physics · Physics 2016-06-16 Miquel Montero

Let $G$ be a simple connected graph. If every pendant path in $G$ is at least $P_s$, we denote that $G\in \mathbb{G}_s$. For $G \in \mathbb{G}_s$, let $Q_s(G)$ be the set of vertices in $G$ that are distance $s$ from the pendant vertex, and…

Spectral Theory · Mathematics 2024-12-10 Songnian Xu , Wenhao Zhen , Dein Wong

We study graph-theoretic properties of the trace of a random walk on a random graph. We show that for any $\varepsilon>0$ there exists $C>1$ such that the trace of the simple random walk of length $(1+\varepsilon)n\ln{n}$ on the random…

Combinatorics · Mathematics 2017-12-13 Alan Frieze , Michael Krivelevich , Peleg Michaeli , Ron Peled

We define the quaternionic quantum walk on a finite graph and investigate its properties. This walk can be considered as a natural quaternionic extension of the Grover walk on a graph. We explain the way to obtain all the right eigenvalues…

Quantum Physics · Physics 2016-04-21 Norio Konno , Hideo Mitsuhashi , Iwao Sato

We associate to a graphon $\gamma$ the sequence of $W$-random graphs $(G_n(\gamma))_{n \geq 1}$. We say that the graphon is singular if, for any finite graph $F$, the homomorphism density $t(F,G_n(\gamma))$ has a variance of order…

Probability · Mathematics 2021-03-30 Pierre-Loïc Méliot

We study the crystal graphs of irreducible $U_{v}(\hat{sl}}_{e})$-modules of higher level l. Generalizing works of the first author, we obtain a simple description of the bijections between the classes of multipartitions which naturally…

Representation Theory · Mathematics 2010-06-28 Nicolas Jacon , Cédric Lecouvey

We construct a Young wall model for higher level $A_2^{(2)}$-type adjoint crystals. The Young walls and reduced Young walls are defined in connection with affin energy function. We prove that the affine crystal consisiting of reduced Young…

Representation Theory · Mathematics 2017-10-13 Seok-Jin Kang

We study the transport properties of a Wigner crystal in one- and two-dimensional asymmetric periodic potential. We show that the Aubry transition takes place above a certain critical amplitude of potential with the sliding and pinned phase…

Mesoscale and Nanoscale Physics · Physics 2019-04-24 Mikhail Y. Zakharov , Denis Demidov , Dima L. Shepelyansky

We prove that the multiplicities of certain maximal weights of $\mathfrak{g}(A^{(1)}_{n})$-modules are counted by pattern avoidance on words. This proves and generalizes a conjecture of Misra-Rebecca. We also prove similar phenomena in…

Representation Theory · Mathematics 2015-11-11 Shunsuke Tsuchioka , Masaki Watanabe

Let $X\to Y^0$ be an abelian prime-to-$p$ Galois covering of smooth schemes over a perfect field $k$ of characteristic $p>0$. Let $Y$ be a smooth compactification of $Y^0$ such that $Y-Y^0$ is a normal crossings divisor on $Y$. We describe…

Representation Theory · Mathematics 2014-08-15 Elmar Grosse-Klönne

We prove that for the Activated Random Walks model on transitive unimodular graphs, if there is fixation, then every particle eventually fixates, almost surely. We deduce that the critical density is at most 1. Our methods apply for much…

Probability · Mathematics 2009-10-23 Gideon Amir , Ori Gurel-Gurevich

We reveal a one-class homophily phenomenon, which is one prevalent property we find empirically in real-world graph anomaly detection (GAD) datasets, i.e., normal nodes tend to have strong connection/affinity with each other, while the…

Social and Information Networks · Computer Science 2024-04-05 Hezhe Qiao , Guansong Pang