Results 11  20
of
1,810
MONODROMY OF TRIGONOMETRIC KZ EQUATIONS
, 2006
"... Abstract. The famous DrinfeldKohno theorem for simple Lie algebras states that the monodromy representation of the KnizhnikZamolodchikov equations for these Lie algebras expresses explicitly via Rmatrices of the corresponding DrinfeldJimbo quantum groups. This result was generalized by the secon ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The famous DrinfeldKohno theorem for simple Lie algebras states that the monodromy representation of the KnizhnikZamolodchikov equations for these Lie algebras expresses explicitly via Rmatrices of the corresponding DrinfeldJimbo quantum groups. This result was generalized
Symmetries in Connection Preserving Deformations
, 2011
"... We wish to show that the root lattice of Bäcklund transformations of the qanalogue of the third and fourth Painlevé equations, which is of type (A2 + A1) (1) , may be expressed as a quotient of the lattice of connection preserving deformations. Furthermore, we will show various directions in the l ..."
Abstract
 Add to MetaCart
in the lattice of connection preserving deformations present equivalent evolution equations under suitable transformations. These transformations correspond to the Dynkin diagram automorphisms.
Complex reflection groups, Braid groups, Hecke algebras
, 1997
"... Presentations "a la Coxeter" are given for all (irreducible) finite complex reflection groups. They provide presentations for the corresponding generalized braid groups (for all but six cases), which allow us to generalize some of the known properties of finite Coxeter groups and their a ..."
Abstract

Cited by 174 (9 self)
 Add to MetaCart
and their associated braid groups, such as the computation of the center of the braid group and the construction of deformations of the finite group algebra (Hecke algebras). We introduce monodromy representations of the braid groups which factorize through the Hecke algebras, extending results of Cherednik, Opdam
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
, sampling along a Cartesian grid in kspace corresponding to standard Fourier imaging with reduced FOV. Owing to the underlying principle, the concepts outlined in this work have been named SENSE, short for SENSitivity Encoding (810). Together with SENSE theory and methods, a detailed SNR analysis
A qanalog of the sixth Painlevé equation
, 1995
"... A qdifference analog of the sixth Painlevé equation is presented. It arises as the condition for preserving the connection matrix of linear qdifference equations, in close analogy with the monodromy preserving deformation of linear differential equations. The continuous limit and special solutions ..."
Abstract

Cited by 71 (3 self)
 Add to MetaCart
A qdifference analog of the sixth Painlevé equation is presented. It arises as the condition for preserving the connection matrix of linear qdifference equations, in close analogy with the monodromy preserving deformation of linear differential equations. The continuous limit and special
Symplectic manifolds and isomonodromic deformations
 ADV. MATH
"... We study moduli spaces of meromorphic connections (with arbitrary order poles) over Riemann surfaces together with the corresponding spaces of monodromy data (involving Stokes matrices). Natural symplectic structures are found and described both explicitly and from an infinite dimensional viewpoint ..."
Abstract

Cited by 43 (6 self)
 Add to MetaCart
We study moduli spaces of meromorphic connections (with arbitrary order poles) over Riemann surfaces together with the corresponding spaces of monodromy data (involving Stokes matrices). Natural symplectic structures are found and described both explicitly and from an infinite dimensional
Inverse Problem for Semisimple Frobenius Manifolds Monodromy Data and the Painlevé VI Equation
, 2000
"... This work is a part the Ph.D. thesis of Davide Guzzetti, with the supervision of professor B. Dubrovin. We study the inverse problem for semisimple Frobenius manifolds of dimension three. We explicitly compute a parametric form of the solutions of the WDVV equations of associativity in terms of solu ..."
Abstract
 Add to MetaCart
of solutions of a special Painlevé VI equation and we show that the solutions are labelled by a set of monodromy data. The procedure is a relevant application of the theory of isomonodromic deformations. We use the parametric form to construct polynomial and algebraic solutions of the WDVV equations. We also
Monodromy evolving deformations and confluent Halphen’s systems
"... We study Halphen’s confluent systems corresponding to Whittaker, Bessel, Weber and Airy functions. We show that Halphen’s confluent systems are represented by Monodromy evolving deformation found by Chakravarty and Ablowitz. 1 ..."
Abstract
 Add to MetaCart
We study Halphen’s confluent systems corresponding to Whittaker, Bessel, Weber and Airy functions. We show that Halphen’s confluent systems are represented by Monodromy evolving deformation found by Chakravarty and Ablowitz. 1
The Correlated Correspondence Algorithm for Unsupervised Registration of Nonrigid Surfaces.
 In Proc. of Neural Information Processing Systems (NIPS).
, 2004
"... Figure 1 : Several frames from a motion animation generated by interpolating two scans of a puppet (far left and far right), which were automatically registered using the Correlated Correspondence algorithm. Abstract We present an unsupervised algorithm for registering 3D surface scans of a deforma ..."
Abstract

Cited by 113 (4 self)
 Add to MetaCart
deformable object in very different configurations. Our algorithm does not use markers, nor does it assume prior knowledge about object shape, the dynamics of its deformation, or its alignment. The algorithm finds the correspondences between points in the two meshes using a joint probabilistic model over all
Results 11  20
of
1,810