A generalization of Apollonian packing of circles Gerhard Guettler Colin Mallowsy Abstract Three circles touching one another at distinct points form two curvilinear triangles. Into one of these we can pack three new circles, touching each other, with each new circle touching two of the original circles. In such a sextuple of circles there are three pairs of circles, with each of the circles in...

We discuss how to recover the private key for DSA style signature schemes if partial information about the ephemeral keys is revealed. The partial information we examine is of a second order nature that allows the attacker to know whether certain bits of the ephemeral key are equal, without actually knowing their values. Therefore, we extend the work of Howgrave-Graham, Smart, Nguyen and Shparl...

the species dibrachys lignicola graham is newly recorded from rayen region of kerman province, iran. the diagnostic characters and geographical distribution of the species are briefly discussed.

This paper presents a new parallel algorithm for the convex hull problem. This algorithm is a parallel adaptation of the Graham Scan Algorithm. The computational model selected for this algorithm is the associative computing model (ASC) which supports massive parallelism through the use of data parallelism and constant time associative search and maximum functions. Also, ASC can be supported on...

This paper presents a new static and dynamic recursive parallel algorithm for the convex hull problem. This algorithm is a parallel adaptation of the Graham Scan and Quick Hull algorithms. The computational model selected for this algorithm is the associative computing model (ASC) which supports massive parallelism through the use of data parallelism and constant time associative search and max...

The idea of a specialist journal focused on combinatorics was first conceived in the early 1960s by Frank Harary and Gian-Carlo Rota, and successfully brought to fruition a few years later with the publication of the first issue, in 1966, of the Journal of Combinatorial Theory. Many eminent mathematicians contributed to this issue, including Paul Erdős, Ron Graham, Daniel Kleitman, and Marcel-P...

We present a range of mesh-dependent inequalities for piecewise constant and continuous piecewise linear finite element functions u defined on locally refined shape-regular (but possibly nonquasi-uniform) meshes. These inequalities involve norms of the form �h � u� W s,p (Ω) for positive and negative s and �, where h is a function which reflects the local mesh diameter in an appropriate way. Th...

The concept of generating trees has been introduced in the literature by Chung, Graham, Hoggat and Kleiman in [4] to examine Baxter permutations. This technique has been successfully applied by West [17, 18] to other classes of permutations and more recently to some other combinatorial classes such as plane trees and lattice paths (see Barcucci et al. [2]). In all these cases, a generating tree...

‎we investigate graham higman's paper enumerating $p$-groups‎, ‎ii‎, ‎in which he formulated his famous porc conjecture‎. ‎we are able to simplify some of the theory‎. ‎in particular‎, ‎higman's paper contains five pages of homological algebra which he uses in‎ ‎his proof that the number of solutions in a finite field to a finite set of‎ ‎monomial equations is porc‎. ‎it turns out tha...