Combinatorics with a Geometric Flavor: Some Examples

See this document in CiteSeerX!

Combinatorics with a Geometric Flavor: Some Examples (2000) (Make Corrections) (1 citation)
Gil Kalai

View or download:
ma.huji.ac.il/~kalai/VIS.ps
Cached: PS.gz PS PDF Image Update Help

From: ma.huji.ac.il/~kalai/papers (more)
(Enter author homepages)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: In this paper I try to present my field, combinatorics, via five examples of combinatorial studies which have some geometric avor. The first topic is Tverberg's theorem, a gem in combinatorial geometry, and various of its combinatorial and topological extensions. McMullen's upper bound theorem for the face numbers of convex polytopes and its many extensions is the second topic. Next are general properties of subsets of the vertices of the discrete n-dimensional cube and some relations with... (Update)

Cited by: More
On Radon's theorem and representations of separoids - Strausz (2003) (Correct)

Active bibliography (related documents): More All
3.7: Algebraic Shifting - Kalai (2001) (Correct)
1.3: First Passage Percolation Has Sublinear Distance Variance - Benjamini, Kalai, Schramm (2002) (Correct)
1.2: Polytope Skeletons And Paths - Kalai (1997) (Correct)

Similar documents based on text: More All
0.6: Topological Methods in Combinatorics and Geometry - Lecture Notes - Matousek (Correct)
0.2: Enumeration Of Ad-Nilpotent B-Ideals For Simple Lie Algebras - Krattenthaler, Orsina, Papi (Correct)
0.2: Chain Decomposition And The Flag F-Vector - Hersh (Correct)

Related documents from co-citation: More All
2: Universidad Nacional Autonoma de Mexico (context) - Strausz, Separoids et al. - 2003

BibTeX entry: (Update)

G. Kalai; Combinatorics with a geometric flavor: some examples. GAFA, Geom. Funct. Anal., 10, Birkhauser Verlag, Basel, 2000. http://citeseer.ist.psu.edu/332522.html More

@misc{ kalai00combinatorics,
  author = "G. Kalai",
  title = "Combinatorics with a geometric flavor: some examples",
  text = "G. Kalai; Combinatorics with a geometric flavor: some examples. GAFA, Geom.
    Funct. Anal., 10, Birkhauser Verlag, Basel, 2000.",
  year = "2000",
  url = "citeseer.ist.psu.edu/332522.html" }

Citations (may not include all citations):
957 The Probabilistic Method (context) - Alon, Spencer - 1992
717 Theory of Linear and Integer Programming (context) - Schrijver - 1986
201 Commutative Algebra with a View toward Algebraic Geometry (context) - Eisenbud - 1995
193 Extremal Graph Theory (context) - Bollob - 1978
153 Graph Coloring Problems (context) - Jensen, Toft - 1995
134 Geometric Algorithms and Combinatorial Optimization (context) - Gr, Lov et al. - 1988
131 Combinatorial Geometry (context) - Pach, Agarwal - 1995
129 A polynomial algorithm in linear programming (context) - Khachiyan - 1979
98 Springer-Verlag (context) - Grimmett - 1989
91 Concentration of measure and isoperimetric inequalities in p.. - Talagrand - 1995
90 Introduction to coding theory (context) - van Lint - 1999
86 Combinatorics and Commutative Algebra (context) - Stanley - 1994
83 Handbook of Discrete and Computational Geometry (context) - Goodman, O'Rourke - 1997
81 A subexponential bound for linear programming - Matou, Sharir et al. - 1992
75 Matching Theory (context) - Lov, Plummer - 1986
69 Small-dimensional linear programming and convex hulls made e.. (context) - Seidel - 1991
66 Constant depth circuits (context) - Linial, Mansour et al. - 1993
62 Random Walks and Electric Networks (context) - Doyle, Snell - 1984
53 Cambridge University Press (context) - Bj, Vergnas et al. - 1993
51 The Theory of Information and Coding (context) - McEliece - 1977
49 Generating random spanning trees (context) - Broder - 1989
47 Cambridge Studies in Advanced Mathematics (context) - Stanley, Combinatorics - 1999
46 A Combinatorial bound for linear programming and related pro.. (context) - Sharir, Welzl - 1992
46 Helly's theorem and its relatives (context) - Danzer, Gr et al. - 1963
45 How good is the simplex algorithm (context) - Klee, Minty - 1972
45 A strongly polynomial algorithm to solve combinatorial linea.. (context) - Tardos - 1986
43 A subexponential randomized simplex algorithm (context) - Kalai - 1992
43 Inequalities in Fourier analysis (context) - Beckner - 1975
42 The maximum numbers of faces of a convex polytopes (context) - McMullen - 1970
42 Improved bounds on planar k-sets and related problems (context) - Dey - 1998
40 Allowable sequences and order types in discrete and computat.. (context) - Goodman, Pollack - 1993
38 A new look at independence (context) - Talagrand - 1996
38 Every monotone graph property has a sharp threshold - Friedgut, Kalai - 1996
37 Probability on Trees and Networks (context) - Lyons, Peres
35 Topological methods (context) - Bj
33 An Introduction Through Randomized Algorithms (context) - Mulmuley, Geometry - 1994
30 Proofs from THE BOOK (context) - Aigner, Ziegler - 1998
30 The number of faces of simplicial convex polytopes (context) - Stanley - 1980
30 Modern Graph Theory (context) - Bollob - 1998
29 A Las Vegas Algorithm for linear programming when the dimens.. (context) - Clarkson - 1995
28 Conjectures on the quotient ring by diagonal invariants - Haiman - 1994
28 New concentration inequalities in product spaces (context) - Talagrand - 1996
27 Wiley Interscience (context) - Gr, Convex - 1967
26 Colorings and orientations of graphs (context) - Alon, Tarsi - 1992
25 Necessary and sucient conditions for sharp thresholds of gra.. (context) - Friedgut - 1999
23 Uniform spanning forests - Benjamini, Lyons et al.
22 Map Color Theorem (context) - Ringel - 1974
22 the number of halving planes (context) - ar, uredi et al. - 1990
18 The colored Tverberg's problem and complexes of injective fu.. (context) - Zivaljevi, Vre - 1992
18 Noise sensitivity of Boolean functions and applications to p.. - Benjamini, Kalai et al.
18 A generalization of Radon's Theorem (context) - Tverberg - 1966
17 Rigidity and the lower bound theorem (context) - Kalai - 1987
16 Vol 1: Fundamental algorithms (context) - Knuth, of et al. - 1975
16 Boolean functions with low average sensitivity (context) - Friedgut - 1998
15 Polynomial threshold functions (context) - Bruck, Smolensky - 1992
14 Intersection homology theory (context) - Goresky, MacPherson - 1980
13 Some intersection theorems for ordered sets and graphs (context) - Chung, Frankl et al. - 1986
13 Game-theoretic aspects of computing (context) - Linial - 1994
13 logarithmic Sobolev inequalities on the discrete cube (context) - Talagrand - 1993
12 many questions and a few answers (context) - Benjamini, Schramm et al. - 1996
12 The upper bound conjecture and Cohen-Macaulay rings (context) - Stanley - 1975
12 Turan type problems (context) - Furedi - 1991
11 Convex and linear orientations of polytopal graphs (context) - Mihalisin, Klee
11 Scaling limits for minimal and random spanning trees in two .. (context) - Aizenman, Burchard et al. - 1999
11 Values of Brownian intersection exponents I: Half-plane expo.. - Lawler, Schramm et al.
11 in uence of variables on Boolean functions (context) - Kahn, Kalai et al. - 1988
11 Tools from higher algebra (context) - Alon
11 The Euler characteristic of a nonpositively curved (context) - Charney, Davis - 1995
10 Graduate Texts in Math (context) - Ziegler, Polytopes - 1995
10 Society for Industrial and Applied Mathematics (context) - Steele, theory et al. - 1997
10 On Russo's approximate zero-one law (context) - Talagrand - 1994
10 sets in three dimensions (context) - Sharir, Smorodinsky et al. - 2000
10 Scaling limits of loop-erased random walks and uniform spann.. - Schramm - 2000
10 The diameter of graphs of convex polytopes and f-vector theo.. (context) - Kalai - 1991
10 Randomized simplex algorithms on Klee-Minty cubes - artner, Henk et al. - 1998
10 The average sensitivity of bounded depth circuits (context) - Boppana - 1997
9 Uniform random spanning trees (context) - Pemantle - 1994
9 Canadian Mathematical Congress (context) - Moon, trees - 1970
9 Transversal uctuations for increasing subsequences on the pl.. (context) - Johansson
9 The asymptotic determinant of the discrete Laplacian - Kenyon
8 and tree inversions (context) - Stanley, arrangements et al. - 1998
8 There are asymptotically far fewer polytopes than we thought (context) - Goodman, Pollack - 1986
8 Algorithms and Combinatorics (context) - Borgwardt, Method et al. - 1987
8 Topological methods (context) - Zivaljevi
8 A combinatorial analogue of Poincare's duality theorem (context) - Klee - 1964
8 Entering and Leaving j-Facets - Welzl
8 Electronic Communication in Probability (context) - Schramm, Tsirelson et al. - 1999
8 An update on the four-color theorem - Thomas - 1998
8 A proof of the suciency of McMullen's conditions for f-vecto.. (context) - Billera, Lee - 1981
7 A new cubical h-vector (context) - Adin - 1996
7 Deformed products and maximal shadows (context) - Amenta, Ziegler - 1998
7 Face numbers of polytopes and complexes - Billera, Bj
7 Neighborly cubical polytopes - Joswig, Ziegler
6 Neighborly cubical spheres and a cubical lower bound conject.. - Babson, Billera et al. - 1997
6 the speed of convergence in rst passage percolation (context) - Kesten - 1993
6 Generic initial ideals (context) - Green - 1998
6 Neighborly polytopes (context) - Shemer - 1982
6 The signature of a toric variety - Leung, Reiner - 1999
6 Encyclopedia of Mathematics and its Applications (context) - Engel, theory - 1997
6 The story of the alternating sign matrix conjecture (context) - Bressoud, conrmations - 1999
6 Some aspects in the combinatorial theory of convex polytopes - Kalai
5 A Borsuk theorem for antipodal links and a spectral characte.. - Lov, Schrijver - 1998
5 vectors of simplicial polytopes and spheres (context) - Bj, Partial et al. - 1994
5 How much are increasing sets positively correlated (context) - Talagrand - 1996
5 vectors and homology (context) - Bj, Kalai et al. - 1989
5 Noncryptographic Selection Protocols (context) - Feige - 1999
5 Intersection homology of toric varieties and a conjecture of.. (context) - Braden, MacPherson - 1999
4 Equidecomposable and weakly neighborly polytopes (context) - Bayer - 1993
4 the number of complete subgraphs of a graph (context) - Lov, Simonovits - 1983
4 graphs and complexes (context) - Gr, Polytopes - 1970
4 Elsevier Science Publishers (context) - Gruber, Wills et al. - 1993
4 Finite-size scaling and correlation length for disordered sy.. (context) - Chayes, Chayes et al. - 1986
4 Witt spaces: A geometric cycle theory for KO homology at odd.. (context) - Siegel - 1983
4 Positivity problems and conjectures in algebraic combinatori.. - Stanley - 2000
4 Convex polytopes and related complexes (context) - Klee, Kleinschmidt
4 the number of copies of one hypergraph in another - Friedgut, Kahn - 1998
4 Divergence of shape uctuations in two dimensions (context) - Newman, Piza - 1995
3 Random Graphs (context) - Bolloba - 1985
3 Tverberg's theorem via number elds (context) - Sarkaria - 1992
3 An entropy approach to the hard-core model on bipartite grap.. (context) - Kahn - 1999
3 On boundaries and in uences (context) - Talagrand - 1997
3 Acyclic simplicial complexes (context) - Kalai, Q- - 1983
3 Coin- ipping games immune against linear-sized coalitions (context) - Alon, Naor - 1993
3 Balancing vectors and Gaussian measures of n-dimensional con.. (context) - Banaszczyk - 1998
3 eodory type theorems (context) - Eckho, Radon
3 Collective coin ipping (context) - Ben-Or, Linial - 1990
2 Borisov: Mirror duality and string theoretic Hodge numbers (context) - Batyrev - 1996
2 Lectures on Mathematical Programming (context) - Kalai, programming et al. - 1997
2 Combinatorial linear programming: Geometry can help (context) - artner - 1998
2 totally unimodular matrices and a randomized dual simplex al.. (context) - Dyer, Frieze et al. - 1994
2 Lecture Note Ser (context) - Saks, hypercube et al. - 1993
2 Convex polytopes (context) - Bayer, Lee
2 Etude des coecients Fourier des fonctiones de L p (context) - Bonami - 1970
2 Tight Polyhedral Submanifolds and Tight Triangulations (context) - uhnel - 1995
2 Intersection Homology (context) - Borel - 1984
2 Planar rst-passage percolation times are not tight (context) - Pemantle, Peres - 1993
2 Long-range properties of spanning trees in Z (context) - Kenyon - 2000
2 Lower bounds for a subexponential optimization algorithm (context) - Matou - 1994
2 Upper Bound Theorems for homology manifolds (context) - Novik - 1998
2 An entropy proof of Bregman's theorem (context) - Radhakrishnan - 1997
2 Partitions of points into simplices with k-dimensional inter.. (context) - Roudne
2 Partitions of points into simplices with k-dimensional inter.. (context) - Roudne
2 Discrete isoperimetric and Poincare-type inequalities (context) - Bobkov, otze - 1999
2 a topological generalization of the Tverberg theorem (context) - Yu, On - 1996
2 Halving point sets - Andrzejak, Welzl - 1998
2 Loop-erased self-avoiding random walk in two and three dimen.. (context) - Lawler - 1988
2 vertex complex projective plane (context) - uhnel, Bancho - 1983
2 concentration of polynomials andits applications (context) - Kim, Vu
2 Noise sensitivity on continuous products: an answer to an ol.. (context) - Tsirelson
2 Note on a conjecture by Seirksma (context) - Vu, Zivaljevic - 1993
2 in uence of large coalitions (context) - Ajtai, Linial - 1993
2 Dominos and the Gaussian free eld (context) - Kenyon
2 New cases of the colored Tverberg Theorem (context) - Zivaljevi, Vre - 1994
2 A simple proof of the upper bound theorem (context) - Alon, Kalai - 1985
2 Generic initial ideals and shifting (context) - Aramova, Herzog - 1999
1 Convex polytopes and enumeration (context) - Simion - 1997
1 Perplexing problems in probability (context) - Bramson, Durrett - 1999
1 On combinatorial applications of topology (context) - Matou
1 Cohen-Macauley-Komplexe und ihre Parametrisierung (context) - Kind, Kleinschmidt - 1979
1 the concentration of multi-variable polynomials with small e.. (context) - Vu
1 Counting colorful multi-dimensional trees (context) - Adin - 1992
1 concentration of measure and rst passage percolation (context) - Benjamini, Kalai et al.
1 The random walk construction of uniform random spanning tree.. (context) - Aldous - 1990
1 ucs On a topological generalization of a theorem of Tverberg (context) - ar, Shlosman et al. - 1981
1 the probability that a random 1-matrix is singular (context) - Kahn, Koml et al. - 1995
1 On sets with many k-sets (context) - Toth - 1999
1 An upper bound theorem for rational polytopes (context) - Bayer - 1998
1 Mathematical Sciences Research Institute Publications (context) - Billera, Bj et al. - 1999
1 Convex and Computational Kluwer (context) - Bisztriczky, Polytopes - 1994
1 On sets projectively equivalent to the vertices of a convex .. (context) - Larman - 1972
1 North-Holland/Elsevier (context) - Graham, Gr et al. - 1995
1 Conformal invariance of domino tiling to appear (context) - Kenyon
1 Random walks on truncated cubes and sampling 0-1 napsack sol.. (context) - Morris, Sinclair
1 in uence and concentration (context) - Talagrand - 1999
1 Scaling limit of Fourier-Walsh coecients (context) - Tsirelson
1 the unique 3-neighborly 4 manifold with 9 vertices (context) - uhnel, Lassman - 1983
1 Toward stochastic analysis beyond the white noise (context) - Tsirelson - 1999
1 Methods Nonlinear Anal (context) - Vassiliev, submanifolds et al. - 1998
1 Origin-Embracing distributions or a continuous analogue of t.. (context) - Wagner, Welzl - 1999
1 the spanning trees of self-dual maps (context) - Tutte - 1979
1 Lecture notes available at [Matousek (context) - Matou, Piercing et al.
1 ACM Sympos (context) - Wilson, spanning et al. - 1996
1 conformal invariance and planar Browninan motion (context) - Werner, exponents - 2000
1 Appendix to (context) - Bourgain

Documents on the same site (http://www.ma.huji.ac.il/~kalai/papers.html): More
On the Distance Distribution of Codes - Kalai, Linial (1995) (Correct)
Influences Of Variables And Threshold Intervals Under Group.. - Bourgain, Kalai (Correct)
Combinatorics and Convexity - Kalai (1995) (Correct)

Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback

CiteSeer.IST - Copyright Penn State and NEC