English
Related papers

Related papers: An algorithm for Berenstein-Kazhdan decoration fun…

200 papers

For a simply connected connected simple algebraic group $G$, it is known that a variety $B_{w_0}^-:=B^-\cap U\overline{w_0}U$ has a geometric crystal structure with a positive structure…

Quantum Algebra · Mathematics 2022-07-19 Yuki Kanakubo , Gleb Koshevoy , Toshiki Nakashima

For any simple complex algebraic group, we define upper/lower half-decorated geometric crystals and show that their tropicalization will be upper/lower normal Kashiwara's crystals. In particular, we show that the tropicalization of the…

Quantum Algebra · Mathematics 2022-07-15 Yuki Kanakubo , Toshiki Nakashima

Using the theory of PBW bases, one can realize the crystal $B(\infty)$ for any semisimple Lie algebra over $\mathbf{C}$ using Kostant partitions as the underlying set. In fact there are many such realizations, one for each reduced…

Quantum Algebra · Mathematics 2025-05-14 Ben Salisbury , Adam Schultze , Peter Tingley

The stabilization algorithm of Weisfeiler and Leman has as an input any square matrix A of order n and returns the minimal cellular (coherent) algebra W(A) which includes A. In case when A=A(G) is the adjacency matrix of a graph G the…

Combinatorics · Mathematics 2010-02-10 Luitpold Babel , Irina V. Chuvaeva , Mikhail Klin , Dmitrii V. Pasechnik

We establish the relation of the potential function constructed by Gross-Hacking-Keel-Kontsevich's and Berenstein-Kazhdan's decoration function on the open double Bruhat cell in the base affine space $G/\mathcal{N}$ of a simple, simply…

Representation Theory · Mathematics 2017-11-21 Volker Genz , Gleb Koshevoy , Bea Schumann

The Kashiwara $B(\infty)$ crystal pertains to a Verma module for a Kac- Moody Lie algebra. Ostensibly it provides only a parametrisation of the global/canonical basis for the latter. Yet it is much more having a rich combinatorial structure…

Combinatorics · Mathematics 2015-10-22 Anthony Joseph

This paper presents a new and efficient numerical algorithm for the biharmonic equation by using weak Galerkin (WG) finite element methods. The WG finite element scheme is based on a variational form of the biharmonic equation that is…

Numerical Analysis · Mathematics 2013-09-24 Chunmei Wang , Junping Wang

Formal mathematics and computer science proofs are formalized using Hilbert-Russell-style logical systems which are designed to not admit paradoxes and self-refencing reasoning. These logical systems are natural way to describe and reason…

Programming Languages · Computer Science 2024-09-10 Ronie Salgado

We construct a geometric crystal for the affine Lie algebra D^{(1)}_n in the sense of Berenstein and Kazhdan. Based on a matrix realization including a spectral parameter, we prove uniqueness and explicit form of the tropical R, the…

Quantum Algebra · Mathematics 2018-10-24 Atsuo Kuniba , Masato Okado , Taichiro Takagi , Yasuhiko Yamada

Let (W, S) be a Coxeter system. A W-graph is an encoding of a representation of the corresponding Iwahori-Hecke algebra. Especially important examples include the W-graph corresponding to the action of the Iwahori-Hecke algebra on the…

Combinatorics · Mathematics 2013-08-01 Michael Chmutov

Let $G$ be a compact semisimple Lie group and $T$ be a maximal torus of $G$. We describe a method for weight multiplicity computation in unitary irreducible representations of $G$, based on the theory of Berezin quantization on $G/T$. Let…

Mathematical Physics · Physics 2009-09-25 David Bar-Moshe

Graph representations are the generalization of geometric graph drawings from the plane to higher dimensions. A method introduced by Tutte to optimize properties of graph drawings is to minimize their energy. We explore this minimization…

Computational Geometry · Computer Science 2023-09-07 Matt DeVos , Danielle Rogers , Alexandra Wesolek

n this paper I introduce a new description of the crystal $B(\Lambda_0)$ of $\hat{\mathfrak{sl}_\ell}$. As in the Misra-Miwa model of $B(\Lambda_0)$, the nodes of this crystal are indexed by partitions and the $i$-arrows correspond to…

Combinatorics · Mathematics 2011-07-20 Chris Berg

A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…

Mathematical Physics · Physics 2024-01-19 Alberto Ibort , Alberto López-Yela , Julio Moro

The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory and machine learning. In fact, the algorithms form a…

Discrete Mathematics · Computer Science 2025-10-29 Thomas Schneider , Pascal Schweitzer

Lusztig's theory of PBW bases gives a way to realize the infinity crystal for any simple complex Lie algebra where the underlying set consists of Kostant partitions. In fact, there are many different such realizations, one for each reduced…

Combinatorics · Mathematics 2025-05-14 Ben Salisbury , Adam Schultze , Peter Tingley

We calculate Bernstein-Sato b-functions for $f_{G^3}^\lambda$, a $SL_n$-invariant section of a line bundle on $SL_n/B \times SL_n/B \times \mathbb{P}^{n - 1}$ whose zero-set is the complement of the open $G$-diagonal orbit. The proof uses a…

Representation Theory · Mathematics 2015-07-01 Henry Scher

By utilizing the combinatorial properties of various tableau models, we establish an explicit correspondence between the polyhedral realizations of the crystal bases $\mathcal B(\lambda)$ (resp. $\mathcal B(\infty)$) of type $A_n$ and the…

Representation Theory · Mathematics 2026-05-12 Shaolong Han

We state combinatorial formulas for hyperoctahedral group ($\mathfrak B_n$) character evaluations of the form $\chi( {{\widetilde C}_w}^{\negthickspace\negthickspace BC}\negthickspace(1))$, where ${{\widetilde…

Combinatorics · Mathematics 2025-09-16 Mark Skandera

For a fixed finite collection of graphs ${\cal F}$, the ${\cal F}$-M-DELETION problem asks, given an $n$-vertex input graph $G,$ for the minimum number of vertices that intersect all minor models in $G$ of the graphs in ${\cal F}$. by…

Data Structures and Algorithms · Computer Science 2021-03-12 Julien Baste , Ignasi Sau , Dimitrios M. Thilikos
‹ Prev 1 2 3 10 Next ›