498 citations
- University of California, DavisUS14 papers
- University of California, Santa CruzUS5 papers
- The University of MelbourneAU4 papers
- University of EdinburghGB4 papers
- Weizmann Institute of ScienceIL4 papers
- UCLA HealthUS3 papers
- University of ChicagoUS3 papers
- University UcinfCL3 papers
- Brown UniversityUS2 papers
- Cornell UniversityUS2 papers
- Fermi National Accelerator LaboratoryUS2 papers
- Louisiana State UniversityUS2 papers
12 papers · 1 filter
Soliton equations, vertex operators, and simple singularities
E. Frenkel, A. Givental, T. Milanov
We prove the equivalence of two hierarchies of soliton equations associated to a simply-laced finite Dynkin diagram. The first was defined by Kac and Wakimoto using the principal r…
Torus-invariant prime ideals in quantum matrices, totally nonnegative cells and symplectic leaves
K. R. Goodearl, S. Launois, T. H. Lenagan
The algebra of quantum matrices of a given size supports a rational torus action by automorphisms. It follows from work of Letzter and the first named author that to understand the…
The structure of parafermion vertex operator algebras: general case
Chongying Dong, Qing Wang
The structure of the parafermion vertex operator algebra associated to an integrable highest weight module for any affine Kac-Moody algebra is studied. In particular, a set of gene…
Computational Dynamics of a 3D Elastic String Pendulum Attached to a Rigid Body and an Inertially Fixed Reel Mechanism
Taeyoung Lee, Melvin Leok, N. Harris McClamroch
A high fidelity model is developed for an elastic string pendulum, one end of which is attached to a rigid body while the other end is attached to an inertially fixed reel mechanis…
Infinite Dimensional Multiplicity Free Spaces III: Matrix Coefficients and Regular Functions
Joseph A. Wolf
In earlier papers we studied direct limits of two types of Gelfand pairs. The first type was that in which the are compact Riemannian symme…
Algorithms for Placing Monitors in a Flow Network
Francis Chin, Marek Chrobak, Li Yan
In the Flow Edge-Monitor Problem, we are given an undirected graph G=(V,E), an integer k > 0 and some unknown circulation ψon G. We want to find a set of k edges in G, so that if w…