Gabriel showed that for a unital ring R, there exists bijective correspondence between the set of filters R and Giraud subcategories Mod(R). In this paper we prove result analogous to one given by Gabriel: small preadditive category C, left C Mod(C).

Images in Electrophysiology A Two Loop Shoelace Granny Knot In The Coronary Sinus Gabriel Vanerio, MD CASMU Arrhythmia Service and British Hospital Montevideo, 2420 Av. Italia, Montevideo 1600, Uruguay. Address for correspondence: Gabriel Vanerio, MD, CASMU Arrhythmia Service and British Hospital Montevideo, 2420 Av. Italia, Montevideo 1600, Uruguay. E-mail: gvanerio/at/yahoo.com

In this paper we investigate the area requirement of proximity drawings and we prove an exponential lower bound. Namely, our main contribution is to show the existence of a class of Gabriel-drawable graphs that require exponential area for any Gabriel drawing and any resolution rule. Also, we extend the result to an innnite class of proximity drawings.

In this paper we investigate the area requirement of proximity drawings and we prove an exponential lower bound. Our main contribution is to show the existence of a class of Gabriel-drawable graphs that require exponential area for any Gabriel drawing and any resolution rule. The result is further extended to an innnite class of proximity drawings.

This is a book review of Paul Tillich and the Possibility of Revelation through Film by Jonathan Brant. Author Notes Dr. Kutter Callaway is Assistant Professor of Theology and Culture at Fuller Theological Seminary. His musings are typically focused on film, music, technology, and contemporary culture. Kutter teaches courses for Fuller’s Brehm Center for Worship, Theology, and the Arts, one of ...

Motivated by applications of Gabriel graphs andYao graphs in wireless ad-hoc networks, we show that the maximum degree of a random Gabriel graph or Yao graph defined on n points drawn uniformly at random from a unit square grows as (log n/ log log n) in probability.

In his 1961 paper, Marcel Golay showed how the search for pairs of binary sequences of length n with complementary autocorrelation is at worst a 2 3n 2 −6 problem. Andres, in his 1977 master’s thesis, developed an algorithm which reduced this to a 2 n 2 −1 search and investigated lengths up to 58 for existence of pairs. In this paper, we describe refinements to this algorithm, enabling a 2 n 2 ...