Anders Björner

According to our database1, Anders Björner authored at least 44 papers between 1980 and 2011.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2011
A <i>q</i>-analogue of the FKG inequality and some applications.
Comb., 2011

A cell complex in number theory.
Adv. Appl. Math., 2011

2010
Connectivity of chamber graphs of buildings and related complexes.
Eur. J. Comb., 2010

2009
Note: Combinatorial Alexander Duality - A Short and Elementary Proof.
Discret. Comput. Geom., 2009

2006
Rationality of the Möbius function of a composition poset.
Theor. Comput. Sci., 2006

2005
Bier Spheres and Posets.
Discret. Comput. Geom., 2005

Chain Polynomials of Distributive Lattices are 75% Unimodal.
Electron. J. Comb., 2005

2004
Face Numbers of Polytopes and Complexes.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Geometrically Constructed Bases for Homology of Partition Lattices of Types A, B and D.
Electron. J. Comb., 2004

2003
Nerves, fibers and homotopy groups.
J. Comb. Theory, Ser. A, 2003

Neighborhood Complexes of Stable Kneser Graphs.
Comb., 2003

2000
Simplicial Manifolds, Bistellar Flips and a 16-Vertex Triangulation of the Poincaré Homology 3-Sphere.
Exp. Math., 2000

Face Numbers of Scarf Complexes.
Discret. Comput. Geom., 2000

1999
Complexes of Directed Graphs.
SIAM J. Discret. Math., 1999

The Number of k -Faces of a Simple d -Polytope.
Discret. Comput. Geom., 1999

1998
A general homotopy complementation formula.
Discret. Math., 1998

1997
Note on a Combinatorial Application of Alexander Duality.
J. Comb. Theory, Ser. A, 1997

On <i>f</i>-Vectors and Betti Numbers of Multicomplexes.
Comb., 1997

1996
Affine permutations of type A.
Electron. J. Comb., 1996

An Improved Tableau Criterion for Bruhat Order.
Electron. J. Comb., 1996

1994
Extendable shellability for rank 3 matroid complexes.
Discret. Math., 1994

Nonpure Shellability, f-Vectors, Subspace Arrangements and Complexity.
Proceedings of the Formal Power Series and Algebraic Combinatorics, 1994

1993
The Möbius Function of Factor Order.
Theor. Comput. Sci., 1993

The mod p Rank of Incidence Matrices for Connected Uniform Hypergraphs.
Eur. J. Comb., 1993

The Mathematical Work of Bernt Lindström.
Eur. J. Comb., 1993

1992
Rationality of the Möbius Function of Subword Order.
Theor. Comput. Sci., 1992

Invertibility of the base Radon transform of a matroid.
Discret. Math., 1992

Communication Complexity of two Decision Problems.
Discret. Appl. Math., 1992

Linear Decision Trees: Volume Estimates and Topological Bounds
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991
Broken circuit complexes: Factorizations and generalizations.
J. Comb. Theory, Ser. B, 1991

Permutation statistics and linear extensions of posets.
J. Comb. Theory, Ser. A, 1991

Chip-firing Games on Graphs.
Eur. J. Comb., 1991

1990
Hyperplane Arrangements with a Lattice of Regions.
Discret. Comput. Geom., 1990

Extended Euler-Poincare Relations for Cell Complexes.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989
<i>q</i>-Hook length formulas for forests.
J. Comb. Theory, Ser. A, 1989

1987
The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem.
Comb., 1987

1984
Posets, Regular CW Complexes and Bruhat Order.
Eur. J. Comb., 1984

1983
A Homotopy Complementation Formula for Partially Ordered Sets.
Eur. J. Comb., 1983

1981
Homotopy Type of Posets and Lattice Complementation.
J. Comb. Theory, Ser. A, 1981

Fixed Points and Complements in Finite Lattices.
J. Comb. Theory, Ser. A, 1981

On complements in lattices of finite length.
Discret. Math., 1981

1980
The Minimum Number of Faces of a Simple Polyhedron.
Eur. J. Comb., 1980

A note on fixed points in semimodular lattices.
Discret. Math., 1980

Some matroid inequalities.
Discret. Math., 1980


  Loading...