Ambiguous space: Ádám Bodor’sSinistra District
نویسندگان
چکیده
منابع مشابه
On the Ádám Conjecture on Circulant Graphs
We investigate the condition for isomorphism between circulant graphs which is known as the Ádám property. We describe a wide class of graphs for which the Ádám conjecture holds (and even in a stronger form refering to isospectrality rather than to isomorphism of graphs. In the important case of double loop (circulant graphs of degree 4) we give an almost complete classification of all possible...
متن کاملAmbiguous Solicitation: Ambiguous Prescription
We conduct a two-phase laboratory experiment, separated by several weeks. In the first phase, we conduct urn games intended to measure ambiguity aversion on a representative population of undergraduate students. In the second phase, we invite the students back with four different solicitation treatments, varying in the ambiguity of information regarding the task and the payout of the laboratory...
متن کاملTesting set proportionality and the Ádám isomorphism of circulant graphs
Given two k element subsets S,T ⊆ Zn, we give a quasi-linear algorithm to either find λ ∈ Z∗n such that S = λT or prove that no such λ exists. This question is closely related to isomorphism testing of circulant graphs and has recently been studied in the literature. © 2005 Elsevier B.V. All rights reserved.
متن کاملDo Ambiguous Reconstructions Always Give Ambiguous Images?
In many cases self-calibration is not able to yield a unique solution for the 3D reconstruction of a scene. This is due to the occurrence of critical motion sequences. If this is the case, an ambiguity is left on the reconstruction. In this paper it is derived under which conditions correct novel views can be generated from ambiguous reconstructions. The problem is first approached from a theor...
متن کاملOn the spectral Ádám property for circulant graphs
We investigate a certain condition for isomorphism between circulant graphs (known as the Ad am property) in a stronger form by referring to isospectrality rather than to isomorphism of graphs. We describe a wide class of graphs for which the Ad am conjecture holds. We apply these results to establish an asymptotic formula for the number of non-isomorphic circulant graphs and connected circulan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hungarian Studies
سال: 2008
ISSN: 0236-6568,1588-2772
DOI: 10.1556/hstud.22.2008.1-2.12