Queen Ṭǝru Wärq’s Necklace

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Random Necklace Model

We consider a Laplace operator on a random graph consisting of infinitely many loops joined symmetrically by intervals of unit length. The arc lengths of the loops are considered to be independent, identically distributed random variables. The integrated density of states of this Laplace operator is shown to have discontinuities provided that the distribution of arc lengths of the loops has a n...

متن کامل

A Carbon Nanofilament-Bead Necklace

Li Song,*,† Alexander W. Holleitner,‡ Huihong Qian,§ Achim Hartschuh,§ Markus Döblinger,§ Eva M. Weig,† and Jörg P. Kotthaus† Center for NanoScience (CeNS) und Fakultät für Physik, Ludwig-Maximilians-UniVersität, Geschwister-Scholl-Platz 1, 80539 Munich, Germany, Walter Schottky Institut (WSI), Technische UniVersität München, Am Coulombwall 3, 85748 Munich, Germany, and Department Chemie und Bi...

متن کامل

Necklace-ring vector solitons.

We introduce novel classes of optical vector solitons that consist of incoherently coupled self-trapped "necklace" beams carrying zero, integer, and even fractional angular momentum. Because of the stabilizing mutual attraction between the components, such stationary localized structures exhibit quasistable propagation for much larger distances than the corresponding scalar vortex solitons and ...

متن کامل

Solving Necklace Constraint Problems

Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to be permuted (unlabelled necklaces), without getting an essentially different solution. We bring together the fields of combinatorial enumeration, where efficient algorithms have been designed for (special cases of) some of thes...

متن کامل

Combinatorial Necklace Splitting

We give a new, combinatorial proof for the necklace splitting problem for two thieves using only Tucker's lemma (a combinatorial version of the Borsuk-Ulam theorem). We show how this method can be applied to obtain a related recent result of Simonyi and even generalize it. 1 Necklace Splitting This paper was inspired by the combinatorial proof of Matou2ek [7] of the Lovász-Kneser theorem [6]. H...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Aethiopica

سال: 2012

ISSN: 2194-4024,1430-1938

DOI: 10.15460/aethiopica.12.1.104