相关论文: An observation on highest weight crystals

For irreducible integrable highest weight modules of the finite and affine Lie algebras of type A and D, we define an isomorphism between the geometric realization of the crystal graphs in terms of irreducible components of Nakajima quiver…

For a finite group $G$, let $B$ be an equivalence (equality, conjugacy or order) relation on $G$ and let $A$ be a (power, enhanced power or commuting) graph with vertex set $G$. The $B$ super $A$ graph is a simple graph with vertex set $G$…

Let $ \Phi=(G, \varphi) $ be a connected complex unit gain graph ($ \mathbb{T} $-gain graph) on a simple graph $ G $ with $ n $ vertices and maximum vertex degree $ \Delta $. The associated adjacency matrix and degree matrix are denoted by…

Matrix-based centrality measures have enjoyed significant popularity in network analysis, in no small part due to our ability to rigorously analyze their behavior as parameters vary. Recent work has considered the relationship between…

We define highest weight categorical actions of sl_2 on highest weight categories and show that basically all known examples of categorical sl_2-actions on highest weight categories (including rational and polynomial representations of…

High-quality and sizable single crystals are crucial for studying the intrinsic properties of unconventional superconductors, which are lacking in the 1111 phase of the Fe-based superconductors. Here we report the successful growth of…

In equivariant geometry, a localization (a.k.a., concentration) theorem is typically interpreted as a relationship between the equivariant geometry of a space with a group action and the geometry of its fixed locus. We take a different…

We develop a combinatorial model of networks on orientable surfaces, and study weight and homology generating functions of paths and cycles in these networks. Network transformations preserving these generating functions are investigated.…

We present a list of ``local'' axioms and an explicit combinatorial construction for the regular $B_2$-crystals (crystal graphs of highest weight integrable modules over $U_q(sp_4)$). Also a new combinatorial model for these crystals is…

In this paper we investigate commuting involution graphs in classical affine Weyl groups. Let $W$ be a classical Weyl group of rank $n$, with $\tilde W$ its corresponding affine Weyl group. Our main result is that if $X$ is a conjugacy…

In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and…

For an additive submonoid $\mathcal{M}$ of $\mathbb{R}_{\ge 0}$, the weight of an $\mathcal{M}$-labeled directed graph is the sum of all of its edge labels, while the content is the product of the labels. Having fixed $\mathcal{M}$ and a…

Empirical networks possess considerable heterogeneity of node connections, resulting in a small portion of nodes playing crucial roles in network structure and function. Yet, how to characterize nodes' influence and identify vital nodes is…

The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…

We consider crystal formation of particles with dipole-dipole interactions that are confined to move in a one-dimensional helical geometry with their dipole moments oriented along the symmetry axis of the confining helix. The stable…

We introduce a fermionic formula associated with any quantum affine algebra U_q(X^{(r)}_N). Guided by the interplay between corner transfer matrix and Bethe ansatz in solvable lattice models, we study several aspects related to…

Atom arrangement plays a critical role in determining material properties. It is, therefore, essential for materials science and engineering to identify and characterize distinct atom configurations. Currently, crystal structures can be…

We study the problem of finding the maximum of a function defined on the nodes of a connected graph. The goal is to identify a node where the function obtains its maximum. We focus on local iterative algorithms, which traverse the nodes of…

Let $G$ be an $n$-vertex graph with adjacency matrix $A$, and $W=[e,Ae,\ldots,A^{n-1}e]$ be the walk matrix of $G$, where $e$ is the all-one vector. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author showed that any graph…

A graph matroid family $\mathcal{M}$ is a family of matroids $\mathcal{M}(G)$ defined on the edge set of each finite graph $G$ in a compatible and isomorphism-invariant way. We say that $\mathcal{M}$ has the Whitney property if there is a…