Obstacles for splitting multidimensional necklaces
نویسندگان
چکیده
منابع مشابه
Splitting Multidimensional Necklaces
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 continuous necklace [0, 1] where beads of given color are interpreted as measurable sets Ai ⊂ [0, 1] (or more g...
متن کاملSplitting Necklaces and Measurable Colorings of the Real Line
A (continuous) necklace is simply an interval of the real line colored measurably with some number of colors. A well-known application of the Borsuk-Ulam theorem asserts that every k-colored necklace can be fairly split by at most k cuts (from the resulting pieces one can form two collections, each capturing the same measure of every color). Here we prove that for every k ≥ 1 there is a measura...
متن کاملCombinatorial identities for binary necklaces from exact ray-splitting trace formulae
Based on an exact trace formula for a one-dimensional ray-splitting system, we derive novel combinatorial identities for cyclic binary sequences (Pólya necklaces). 02.10.Eb, 02.30.Lt, 05.45.+b Typeset using REVTEX 1
متن کاملSplitting multidimensional BSDEs and finding local equilibria
We introduce a new notion of local solution of backward stochastic differential equations (BSDEs) and prove that multidimensional quadratic BSDEs are locally but not globally solvable. Applied in a financial context on optimal investment, our results show that there exist local but no global equilibria when agents take both the absolute and the relative performance compared to their peers into ...
متن کاملIncorporating linear discriminant analysis in neural tree for multidimensional splitting
In this paper, a new hybrid classifier is proposed by combining neural network and direct fractional-linear discriminant analysis (DF-LDA). The proposed hybrid classifier, neural tree with linear discriminant analysis called NTLD, adopts a tree structure containing either a simple perceptron or a linear discriminant at each node. The weakly performing perceptron nodes are replaced with DF-LDA i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2015
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-2015-12611-1