- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
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
- Urheber
-
Brubaker, Ben
Buciumas, Valentin
Bump, Daniel
Gustafsson, Henrik P. A.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00029-024-00950-6
- URN
-
urn:nbn:de:101:1-2412122115565.491478648212
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:35 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Brubaker, Ben
- Buciumas, Valentin
- Bump, Daniel
- Gustafsson, Henrik P. A.
- SpringerLink (Online service)
Ähnliche Objekte (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
Plethysms, Replicated Schur Functions and Series, with Applications to Vertex Operators
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
Plethysms, Replicated Schur Functions and Series, with Applications to Vertex Operators
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