- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Colored vertex models and Iwahori Whittaker functions ; volume:30 ; number:4 ; day:6 ; month:9 ; year:2024 ; pages:1-58 ; date:9.2024
Selecta mathematica ; 30, Heft 4 (6.9.2024), 1-58, 9.2024
- Creator
-
Brubaker, Ben
Buciumas, Valentin
Bump, Daniel
Gustafsson, Henrik P. A.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00029-024-00950-6
- URN
-
urn:nbn:de:101:1-2412122115565.491478648212
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:35 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Brubaker, Ben
- Buciumas, Valentin
- Bump, Daniel
- Gustafsson, Henrik P. A.
- SpringerLink (Online service)
Other Objects (12)
Independent colorful vertex sets in large dynamic vertex colored conflict graphs
An Erdős-Gallai type theorem for vertex colored graphs
Dynamic vertex colored conflict graphs for time-sensitive networks
Vertex models and n - algebras
The colored Jones polynomials as vortex partition functions
Weighted independent colorful sets in large vertex colored conflict graphs for timetriggered flow scheduling
The Orthogonal and Symplectic Schur Functions, Vertex Operators and Integrable Hierarchies
Vertex models on random graphs
Vertex models on random graphs
Generalized vertex algebras and relative vertex operators
On the vertex functions of type A quiver varieties
On the Cut-Vertex and the Interval Transit Functions of Hypergraphs
Independent colorful vertex sets in large dynamic vertex colored conflict graphs
An Erdős-Gallai type theorem for vertex colored graphs
Dynamic vertex colored conflict graphs for time-sensitive networks
Vertex models and n - algebras
The colored Jones polynomials as vortex partition functions
Weighted independent colorful sets in large vertex colored conflict graphs for timetriggered flow scheduling
The Orthogonal and Symplectic Schur Functions, Vertex Operators and Integrable Hierarchies
Vertex models on random graphs
Vertex models on random graphs
Generalized vertex algebras and relative vertex operators
On the vertex functions of type A quiver varieties
On the Cut-Vertex and the Interval Transit Functions of Hypergraphs
Independent colorful vertex sets in large dynamic vertex colored conflict graphs
An Erdős-Gallai type theorem for vertex colored graphs
Dynamic vertex colored conflict graphs for time-sensitive networks
Vertex models and n - algebras
The colored Jones polynomials as vortex partition functions
Weighted independent colorful sets in large vertex colored conflict graphs for timetriggered flow scheduling
The Orthogonal and Symplectic Schur Functions, Vertex Operators and Integrable Hierarchies
Vertex models on random graphs
Vertex models on random graphs
Generalized vertex algebras and relative vertex operators
On the vertex functions of type A quiver varieties