• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 5,940
Next 10 →

Necklace Maps

by Bettina Speckmann, Kevin Verbeek , 2010
"... ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract not found

Reversible Markov chains and random walks on graphs

by David Aldous, James Allen Fill , 2002
"... ..."
Abstract - Cited by 549 (13 self) - Add to MetaCart
Abstract not found

Liouville Correlation Functions from Four-dimensional Gauge Theories

by Luis F. Alday, Davide Gaiotto, Yuji Tachikawa - SIMONS CENTER FOR GEOMETRY AND PHYSICS, STONY BROOK UNIVERSITY , 2009
"... We conjecture an expression for the Liouville theory conformal blocks and correlation functions on a Riemann surface of genus g and n punctures as the Nekrasov partition function of a certain class of N = 2 SCFTs recently defined by one of the authors. We conduct extensive tests of the conjecture ..."
Abstract - Cited by 394 (22 self) - Add to MetaCart
We conjecture an expression for the Liouville theory conformal blocks and correlation functions on a Riemann surface of genus g and n punctures as the Nekrasov partition function of a certain class of N = 2 SCFTs recently defined by one of the authors. We conduct extensive tests of the conjecture at genus 0, 1.

The Hero with a Thousand Faces

by Joseph Campbell , 1972
"... Botiingen Foundation, andpttt.!.,.: b % / ,.,;:,c,m B<,.ik.*, second ..."
Abstract - Cited by 353 (0 self) - Add to MetaCart
Botiingen Foundation, andpttt.!.,.: b % / ,.,;:,c,m B<,.ik.*, second

SPLITTING MULTIDIMENSIONAL NECKLACES

by Mark De Longueville, Rade T. ˇ Zivaljevi Ć , 2006
"... Abstract. The well-known “splitting necklace theorem ” of Alon [1] says that each necklace with k · ai beads of color i = 1,..., n can be fairly divided between k “thieves ” by at most n(k − 1) cuts. Alon deduced this result from the fact that such a division is possible also in the case of a contin ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
Abstract. The well-known “splitting necklace theorem ” of Alon [1] says that each necklace with k · ai beads of color i = 1,..., n can be fairly divided between k “thieves ” by at most n(k − 1) cuts. Alon deduced this result from the fact that such a division is possible also in the case of a

Galaxy filaments as pearl necklaces

by E. Tempel, E. Saar, M. Bussov, J. Pelt , 2014
"... Context. Galaxies in the Universe form chains (filaments) that connect groups and clusters of galaxies. The filamentary network includes nearly half of the galaxies and is visually the most striking feature in cosmological maps. Aims. We study the distribution of galaxies along such a filamentary ne ..."
Abstract - Add to MetaCart
Context. Galaxies in the Universe form chains (filaments) that connect groups and clusters of galaxies. The filamentary network includes nearly half of the galaxies and is visually the most striking feature in cosmological maps. Aims. We study the distribution of galaxies along such a filamentary

THE BRAID GROUP OF A NECKLACE

by Paolo Bellingeri, Arnaud Bodin
"... Abstract. We study several geometric and algebraic properties of a necklace: a link composed with a core circle and a series of circles linked to this core. We first prove that the fundamental group of the con-figuration space of necklaces is isomorphic to the braid group over an annulus. We then de ..."
Abstract - Add to MetaCart
Abstract. We study several geometric and algebraic properties of a necklace: a link composed with a core circle and a series of circles linked to this core. We first prove that the fundamental group of the con-figuration space of necklaces is isomorphic to the braid group over an annulus. We

Gray-ordered Binary Necklaces

by Christopher Degni, Arthur A. Drisko, Fort George G. Meade
"... A k-ary necklace of order n is an equivalence class of strings of length n of symbols from {0, 1,..., k − 1} under cyclic rotation. In this paper we define an ordering on the free semigroup on two generators such that the binary strings of length n are in Gray-code order for each n. We take the bina ..."
Abstract - Add to MetaCart
A k-ary necklace of order n is an equivalence class of strings of length n of symbols from {0, 1,..., k − 1} under cyclic rotation. In this paper we define an ordering on the free semigroup on two generators such that the binary strings of length n are in Gray-code order for each n. We take

Underscreened Kondo Necklace

by P. Fazekas , 1993
"... It has been suggested recently by Gan, Coleman, and Andrei that studying the underscreened Kondo problem may help to understand the nature of magnetism in heavy fermion systems. Motivated by Doniach’s work on the S = 1/2 Kondo necklace, we introduce the underscreened Kondo necklace models with S> ..."
Abstract - Add to MetaCart
It has been suggested recently by Gan, Coleman, and Andrei that studying the underscreened Kondo problem may help to understand the nature of magnetism in heavy fermion systems. Motivated by Doniach’s work on the S = 1/2 Kondo necklace, we introduce the underscreened Kondo necklace models with S

ON THE STRUCTURE OF THE NECKLACE LIE ALGEBRA

by Jacques Alev, Geert Van De Weyer , 2008
"... The necklace Lie algebra for a quiver was introduced simultaneously by Bocklandt and Le Bruyn in [2] and Ginzburg in [5] to study the noncommutative symplectic geometry of preprojective algebras. Later, Van den Bergh in [10] linked the necklace Lie algebra to double Poisson structures and used it ..."
Abstract - Add to MetaCart
The necklace Lie algebra for a quiver was introduced simultaneously by Bocklandt and Le Bruyn in [2] and Ginzburg in [5] to study the noncommutative symplectic geometry of preprojective algebras. Later, Van den Bergh in [10] linked the necklace Lie algebra to double Poisson structures and used
Next 10 →
Results 1 - 10 of 5,940
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University