WorldCat Identities

Kahn, Jeffrey A.

Overview
Works: 6 works in 15 publications in 1 language and 52 library holdings
Genres: Software  History 
Roles: Author
Classifications: HF5548.4.L67, 650.02855369
Publication Timeline
.
Most widely held works by Jeffrey A Kahn
Inside the Lotus add-in toolkit : the definitive guide by J. David McCall( Book )

9 editions published in 1990 in 3 languages and held by 41 WorldCat member libraries worldwide

An add-in utility for Lotus 1-2-3. The text covers data base fundamentals, structure, and queries; screen forms, report groups and queries, graphs, and labels, among other topics
The history of the Jewish colony in Cuba by Jeffrey A Kahn( )

2 editions published in 1981 in English and held by 3 WorldCat member libraries worldwide

A counterexample to Borsuk's conjecture by Jeffrey A Kahn( Book )

1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide

Abstract: "Let f(d) be the smallest number so that every set in R[superscript d] of diameter 1 can be partitioned into f(d) sets of diameter smaller than 1. Borsuk's conjecture was that f(d) = d + 1. We prove that f(d) [> or =] (1.1)[superscript the square root of d]."
A problem of Füredi and Seymour on covering intersecting families by pairs by Jeffrey A Kahn( Book )

1 edition published in 1992 in English and held by 1 WorldCat member library worldwide

Abstract: "We disprove the following conjecture of Füredi and Seymour: Conjecture If F is an intersecting hypergraph on n vertices, then there is a set of n pairs of vertices such that each member of F contains one of the pairs."
Singularity probabilities for random [+ and -]1 matrices by Jeffrey A Kahn( Book )

1 edition published in 1991 in English and held by 1 WorldCat member library worldwide

Abstract: "We report some progress on the old problem of estimating the probability, P[subscript n], that a random n x n [+ and -]1 matrix is singular: Theorem. There is a positive constant [epsilon] for which P[subscript n] <(1 - [epsilon])[superscript n]. This is a considerable improvement on the best previous bound, P[subscript n] = 0(1/[square root n]), given by Komlós in 1977, but still falls short of the often-conjectured [formula]. A Fourier-analytic idea of Halász is a key ingredient of the proof."
Coloring nearly-disjoint hypergraphs with n+o(n) colors by DIMACS (Group)( Book )

1 edition published in 1990 in English and held by 1 WorldCat member library worldwide

Abstract: "It is shown that the chromatic index of a nearly- disjoint hypergraph on n vertices is at most n+o(n). This is an approximate version of the well-known Conjecture of Erdös, Faber and Lovász stating that the chromatic index is at most n."
 
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.67 (from 0.53 for Singularit ... to 0.78 for The histor ...)

Languages
English (13)