Constructing Highly Incident Configurations
نویسندگان
چکیده
منابع مشابه
Erratum to: Constructing Highly Incident Configurations
The paper “Constructing Highly Incident Configurations” contains a confusing typo in Sect. 4.2, proving the inductive step, Case 1: vertices. In this section, we wish to show that the set of vertices (v τ )i is well-defined. To do this, we need to show that for any g and h in τ , the previously constructed pairs of lines {(Lgτ )i , (Lgτ )i+tg} and {(Lhτ )i , (Lσ̂hτ )i+th} intersect in a single p...
متن کاملConstructing Prime-field Planar Configurations
An infinite class of planar configurations is constructed with distinct prime-field characteristic sets (i.e., configurations represented over a finite set of prime fields but over fields of no other characteristic). It is shown that if p is sufficiently large, then every subset of k primes between p and f(p, k) forms such a set (where f(p, k) = 2[(f-Ak3//2)Bk3/21 for constants A and B). In par...
متن کاملConstructing 5-Configurations with Chiral Symmetry
A 5-configuration is a collection of points and straight lines in the Euclidean plane so that each point lies on five lines and each line passes through five points. We describe how to construct the first known family of 5-configurations with chiral (that is, only rotational) symmetry, and prove that the construction works; in addition, the construction technique produces the smallest known geo...
متن کاملConstructing SCI-configurations that are free from deadlocks
We study the problem of possible deadlocks in an SCI-interconnect. We show that it is possible to automatically decide whether an SCI-configuration is prone to deadlocks, and we indicate an algorithm that checks this effectively by searching a graph for cycles. Then we present another algorithm that automatically modifies a deadlocking configuration, such that it becomes deadlock free. We apply...
متن کاملConstructing Highly-Available Internet Services Based on Partitionable Group Communication
Group communication is a middleware technology that may simplify development of highly available applications through replication. In this paper we propose a replicated service implementation based on partitionable group communication. Unlike its primary-partition counterpart, a partitionable group communication system never blocks an application because network failures may have caused it to p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2010
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-010-9279-7