On absolutely universal embeddings
نویسندگان
چکیده
It is well known that, given a point-line geometry Γ and a projective embedding ε : Γ → PG(V ), if dim(V ) equals the size of a generating set of Γ, then ε is not derived from any other embedding. Thus, if Γ admits an absolutely universal embedding, then ε is absolutely universal. In this paper, without assuming the existence of any absolutely universal embedding, we give sufficient conditions for an embedding ε as above to be absolutely universal.
منابع مشابه
Point-Set Embeddability of 2-Colored Trees
In this paper we study bichromatic point-set embeddings of 2-colored trees on 2-colored point sets, i.e., point-set embeddings of trees (whose vertices are colored red and blue) on point sets (whose points are colored red and blue) such that each red (blue) vertex is mapped to a red (resp. blue) point. We prove that deciding whether a given 2-colored tree admits a bichromatic point-set embeddin...
متن کاملA Universal Semantic Space
Multilingual embeddings build on the success of monolingual embeddings and have applications in crosslingual transfer, in machine translation and in the digital humanities. We present the first multilingual embedding space for thousands of languages, a much larger number of languages than in prior work.
متن کاملRepresentation theory for strange attractors.
Embeddings are diffeomorphisms between some unseen physical attractor and a reconstructed image. Different embeddings may or may not be equivalent under isotopy. We regard embeddings as representations of the attractor, review the labels required to distinguish inequivalent representations for an important class of dynamical systems, and discuss the systematic ways inequivalent embeddings becom...
متن کاملThe Universal Embedding of the Near Polygon Gn
In [12], it was shown that the dual polar space DH(2n − 1, 4), n ≥ 2, has a sub near-2n-gon Gn with a large automorphism group. In this paper, we determine the absolutely universal embedding of this near polygon. We show that the generating and embedding ranks of Gn are equal to (2n n ) . We also show that the absolutely universal embedding of Gn is the unique full polarized embedding of this n...
متن کاملColored Simultaneous Geometric Embeddings
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored with two or three colors. We use these results to show that colored simultaneous geometric embeddings exist for: (1) a 2-colored tree together with any number of 2-colored p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 267 شماره
صفحات -
تاریخ انتشار 2003