نتایج جستجو برای: cosets
تعداد نتایج: 753 فیلتر نتایج به سال:
A bstract We build a novel time-like coset sigma-model describing type-II superstring theory in charged rotating black-brane background that interpolates between local AdS 3 the IR and linear-dilaton geometry UV. This allows one to peform systematic study of holography non-AdS backgrounds which are smoothly connected . construct massless closed string states vertex operators NS-NS sector, calcu...
Abstract Using the invariant theory of arc spaces, we find minimal strong generating sets for certain cosets affine vertex algebras inside free field that are related to classical Howe duality. These results have several applications. First, any algebra ${{\mathcal {V}}}$, a surjective homomorphism differential $\mathbb {C}[J_{\infty }(X_{{{\mathcal {V}}}})] \rightarrow \text {gr}^{F}({{\mathca...
We provide an intrinsic notion of curved cosets for arbitrary Cartan geometries, simplifying the existing construction orbits a given holonomy reduction. To do this, we intrinsically define group, which is shown to coincide precisely with standard definition group geometries in terms associated principal connection. These retain many characteristics their homogeneous counterparts, and they beha...
The Todd-Coxeter algorithm described in [13] remains a primary reference for coset enumeration programs. It may be viewed as a means of constructing permutation representations of finitely presented groups. A number of effective computer programs for singlecoset enumeration have been described, see, for example, [2, 7, 8]. Enumerating double cosets, rather than single cosets, gives substantial ...
In this paper, we introduce a class of vertextransitive graphs induced by Quasigroups whose vertices are cosets. Also, many graph properties are expressed in terms of algebraic properties. This did not attract much attention in the literature.
Two efficient computer implemented algorithms are presented -=. :'or explicitly constructing all distinct labelings of a graph G :;ith a set of (not necessarily distinct) labels L , given the _;ymmetry group B of G . Two recursive reductions of the problem ,?_rld a precomputation involving certain orbits of stabilizer subgroups q--e the LAtechniques used by the algorithm. Moreover, for each la3...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید