Kalai, Gil 1955
Overview
Works:  26 works in 51 publications in 2 languages and 490 library holdings 

Genres:  Conference proceedings Criticism, interpretation, etc 
Roles:  Author, Editor 
Classifications:  QA164, 511.6 
Publication Timeline
.
Most widely held works by
Gil Kalai
Polytopes : combinatorics and computation
by
Gil Kalai(
Book
)
12 editions published in 2000 in English and held by 229 WorldCat member libraries worldwide
Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by the desire to understand the complexity of the simplex algorithm, or the need to study facets for use in cutting plane procedures. In addition, algorithms now provide the means to computationally study polytopes, to compute their parameters such as flag vectors, graphs and volumes, and to construct examples of large complexity. The papers of this volume thus display a wide panorama of connections of polytope theory with other fields. Areas such as discrete and computational geometry, linear and combinatorial optimization, and scientific computing have contributed a combination of questions, ideas, results, algorithms and, finally, computer programs
12 editions published in 2000 in English and held by 229 WorldCat member libraries worldwide
Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by the desire to understand the complexity of the simplex algorithm, or the need to study facets for use in cutting plane procedures. In addition, algorithms now provide the means to computationally study polytopes, to compute their parameters such as flag vectors, graphs and volumes, and to construct examples of large complexity. The papers of this volume thus display a wide panorama of connections of polytope theory with other fields. Areas such as discrete and computational geometry, linear and combinatorial optimization, and scientific computing have contributed a combination of questions, ideas, results, algorithms and, finally, computer programs
Jerusalem Combinatorics '93 : an international conference in combinatorics, May 917, 1993, Jerusalem, Israel
by Jerusalem Combinatorics '93(
Book
)
10 editions published in 1994 in English and held by 220 WorldCat member libraries worldwide
10 editions published in 1994 in English and held by 220 WorldCat member libraries worldwide
Noise sensitivity of Boolean functions and applications to percolation
by
Itai Benjamini(
Book
)
2 editions published in 1999 in English and held by 7 WorldCat member libraries worldwide
2 editions published in 1999 in English and held by 7 WorldCat member libraries worldwide
Noise sensitivity of Boolean functions and applications to percolation. A 1homotopy theory of schemes / by Fabien Morel ; Vladimir Voevodsky [u.a.]
by
Itai Benjamini(
Book
)
1 edition published in 2001 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 2001 in English and held by 5 WorldCat member libraries worldwide
A lower bound on the complexity of regional matchings on the hypercube
by
Gil Kalai(
Book
)
1 edition published in 1991 in English and held by 3 WorldCat member libraries worldwide
Abstract: "As defined by Awerbuch and Peleg, an mregional matching for a graph G = (V, E) is a family of sets R(u), W(u) [subset of] V for u [member of] V, such that if the distance between vertices v and w is at most m then R(v) intersects W(w). We define a probabilistic generalization of a regional matching, and prove a lower bound on the complexity of any mregional matching for the hypercube graph, where the complexity is measured in terms of the maximum size and radius of the sets R(u) and W(u). We use this lower bound to give a lower bound on the communication complexity of any probabilistic algorithm for the problem of online tracking of a mobile user on the hypercube. In the course of proving the lower bound on the complexity of regional matchings, we consider a generalization of the vertex isoperimetric problem on the cube."
1 edition published in 1991 in English and held by 3 WorldCat member libraries worldwide
Abstract: "As defined by Awerbuch and Peleg, an mregional matching for a graph G = (V, E) is a family of sets R(u), W(u) [subset of] V for u [member of] V, such that if the distance between vertices v and w is at most m then R(v) intersects W(w). We define a probabilistic generalization of a regional matching, and prove a lower bound on the complexity of any mregional matching for the hypercube graph, where the complexity is measured in terms of the maximum size and radius of the sets R(u) and W(u). We use this lower bound to give a lower bound on the communication complexity of any probabilistic algorithm for the problem of online tracking of a mobile user on the hypercube. In the course of proving the lower bound on the complexity of regional matchings, we consider a generalization of the vertex isoperimetric problem on the cube."
An extended EulerPoincaré theorem
by
Anders Björner(
Book
)
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
Learnability and rationality of choice
by
Gil Kalai(
Book
)
2 editions published in 2001 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 2001 in English and held by 2 WorldCat member libraries worldwide
Polytope skeletons and paths
by
Gil Kalai(
)
1 edition published in 1997 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1997 in English and held by 2 WorldCat member libraries worldwide
The Branko Grünbaum birthday issue
(
Book
)
2 editions published in 2000 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 2000 in English and held by 2 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]."
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]."
The influence of variables on boolean functions
by
Jeff Kahn(
Book
)
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
Algebraic and geometriec combinatorics 05.02.  11.02.1995
(
Book
)
1 edition published in 1995 in English and held by 1 WorldCat member library worldwide
1 edition published in 1995 in English and held by 1 WorldCat member library worldwide
Solving the bible code puzzle
by
B. D McKay(
Book
)
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
How quantum computers can fail
by
Gil Kalai(
Book
)
1 edition published in 2009 in English and held by 1 WorldCat member library worldwide
1 edition published in 2009 in English and held by 1 WorldCat member library worldwide
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."
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."
The Bible code : the genesis of equidistant letter sequences
by
B. D McKay(
Book
)
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
Rationalizing choice functions by multiple rationales
by
Gil Kalai(
Book
)
1 edition published in 2001 in English and held by 1 WorldCat member library worldwide
1 edition published in 2001 in English and held by 1 WorldCat member library worldwide
A law of large numbers for weighted majority
by
Olle Häggström(
Book
)
1 edition published in 2004 in English and held by 1 WorldCat member library worldwide
1 edition published in 2004 in English and held by 1 WorldCat member library worldwide
Elections can be manipulated often
by
Ehud Friedgut(
Book
)
1 edition published in 2008 in English and held by 1 WorldCat member library worldwide
1 edition published in 2008 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Algebra, Boolean Bible.Genesis Combinatorial analysis Complexes Convex domains Decision makingMathematical models Economics Euler characteristic Geometry Hypercube Hypergraphs Learning ability Learning abilityTesting Linear orderings Mathematics Polytopes Rational choice theory Rationalism Schemes (Algebraic geometry) Semiotics Variables (Mathematics)