Related papers: Perforated Tableaux: A Combinatorial Model for Cry…
Predicting physical properties of materials from their crystal structures is a fundamental problem in materials science. In peripheral areas such as the prediction of molecular properties, fully connected attention networks have been shown…
We show that the Poincar\'e lemma we proved elsewhere in the context of crystalline cohomology of higher level behaves well with regard to the Hodge filtration. This allows us to prove the Poincar\'e lemma for transversal crystals of level…
We present explicit formulas for the Macdonald polynomials of types $C_n$ and $D_n$ in the one-row case. In view of the combinatorial structure, we call them "tableau formulas". For the construction of the tableau formulas, we apply some…
We review reformulation of the map from tensor product of crystals to the rigged configurations in terms of the energy function of affine crystals. Especially, we give intuitive picture of the inverse scattering formalism for the periodic…
A combinatorial description of the crystal $\mathcal{B}(\infty)$ for finite-dimensional simple Lie algebras in terms of Young tableaux was developed by J. Hong and H. Lee. Using this description, we obtain a combinatorial rule for…
In an earlier work, the authors developed a rigged configuration model for the crystal $B(\infty)$ (which also descends to a model for irreducible highest weight crystals via a cutting procedure). However, the result obtained was only valid…
We consider the problem of factorizing a structured 3-way tensor into its constituent Canonical Polyadic (CP) factors. This decomposition, which can be viewed as a generalization of singular value decomposition (SVD) for tensors, reveals…
We use the 0-1 tableaux as a tool for enumerating permutations and partitions with restricted minima. The method used is extended for permutation pairs and partition pairs generated by a bipartite 0-1 tableaux.
The standard techniques for online learning of combinatorial objects perform multiplicative updates followed by projections into the convex hull of all the objects. However, this methodology can be expensive if the convex hull contains many…
Gasharov introduced the combinatorial objects known as $P$-arrays to prove $s$-positivity for the chromatic symmetric functions of incomparability graphs of (3+1)-free posets. We define a crystal, a directed colored graph with some…
A Demazure crystal is the basis at $q=0$ of a Demazure module. Demazure crystals play an important role in Schubert calculus because the character of a Demazure crystal in type A is identical to a key polynomial, which is closely related to…
We present efficient combinatorial parameterized algorithms for several classical graph-based counting problems in computational chemistry, including (i) Kekule structures, (ii) the Hosoya index, (iii) the Merrifield-Simmons index, and (iv)…
We propose a new formula for the star product in deformation quantization of Poisson structures related in a specific way to a variational problem for a function $S$, interpreted as the action functional. Our approach is motivated by…
Let $U$ be a tensor product of highest weight modules of $GL_n(\mathbb C)$ corresponding to multiples of fundamental weights (i.e. rectangles). We consider three ways to stratify $U^{\otimes k}$ into components: using isotypic components of…
For any polynomial representation of the special linear group, the nodes of the corresponding crystal may be indexed by semi-standard Young tableaux. Under certain conditions, the standard Young tableaux occur, and do so with weight 0.…
We apply crystal theory to affine Schubert calculus, Gromov-Witten invariants for the complete flag manifold, and the positroid stratification of the positive Grassmannian. We introduce operators on decompositions of elements in the…
Following an idea of A. Berenstein, we define a commutor for the category of crystals of a finite dimensional complex reductive Lie algebra. We show that this endows the category of crystals with the structure of a coboundary category.…
Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and…
Accurately evaluating configurational integrals for dense solids remains a central and difficult challenge in the statistical mechanics of condensed systems. Here, we present a novel tensor network approach that reformulates the…
Extending the work arXiv:math/0508107, we introduce the affine crystal action on rigged configurations which is isomorphic to the Kirillov-Reshetikhin crystal B^{r,s} of type D_n^(1) for any r,s. We also introduce a representation of…