Paul H. Edelman

According to our database, Paul H. Edelman authored at least 32 papers between 1979 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

The core of a transferable utility game as the solution to a public good market demand problem.

Paul H. Edelman, Martin Van der Linden, John A. Weymark

Math. Program., January, 2024

2021

A new axiomatic approach to the impartial nomination problem.

Paul H. Edelman, Attila Pór

Games Econ. Behav., 2021

2015

Voting power apportionments.

Paul H. Edelman

Soc. Choice Welf., 2015

2013

Simplicial Complexes Obtained from Qualitative Probability Orders.

Paul H. Edelman, Tatiana Gvozdeva, Arkadii M. Slinko

SIAM J. Discret. Math., 2013

2010

The inverse Banzhaf problem.

Noga Alon, Paul H. Edelman

Soc. Choice Welf., 2010

2004

Voting power and at-large representation.

Paul H. Edelman

Math. Soc. Sci., 2004

2003

Geochemical Phase Diagrams and Gale Diagrams.

J. H. Stout, Paul H. Edelman, S. W. Peterson, Victor Reiner

SIAM J. Appl. Math., 2003

2002

Convex, Acyclic, and Free Sets of an Oriented Matroid.

Paul H. Edelman, Victor Reiner, Volkmar Welker

Discret. Comput. Geom., 2002

2001

Fair division of indivisible items among people with similar preferences.

Paul H. Edelman, Peter C. Fishburn

Math. Soc. Sci., 2001

2000

On Subdivision Posets of Cyclic Polytopes.

Paul H. Edelman, Jörg Rambau, Victor Reiner

Eur. J. Comb., 2000

Ordering Points by Linear Functionals.

Paul H. Edelman

Eur. J. Comb., 2000

Counting the Interior Points of a Point Configuration.

Paul H. Edelman, Victor Reiner

Discret. Comput. Geom., 2000

The Shapley value on convex geometries.

Jesús Mario Bilbao, Paul H. Edelman

Discret. Appl. Math., 2000

1998

Visibility Complexes and the Baues Problem for Triangulations in the Plane.

Paul H. Edelman, Victor Reiner

Discret. Comput. Geom., 1998

1997

Catalan Triangulations of the Möbius Band.

Paul H. Edelman, Victor Reiner

Graphs Comb., 1997

Erratum to Free Arrangement and Rhombic Tilings.

Paul H. Edelman, Victor Reiner

Discret. Comput. Geom., 1997

1996

Free Arrangements and Rhombic Tilings.

Paul H. Edelman, Victor Reiner

Discret. Comput. Geom., 1996

1995

Lexicographically first reduced words.

Paul H. Edelman

Discret. Math., 1995

1994

Chains in the lattice of noncrossing partitions.

Paul H. Edelman, Rodica Simion

Discret. Math., 1994

1992

Partition statistics on permutations.

Paul H. Edelman, Rodica Simion, Dennis White

Discret. Math., 1992

On the Average Number of k-Sets.

Paul H. Edelman

Discret. Comput. Geom., 1992

1990

Hyperplane Arrangements with a Lattice of Regions.

Anders Björner, Paul H. Edelman, Günter M. Ziegler

Discret. Comput. Geom., 1990

1989

Tableaux and chains in a new partial order of <i>S</i>_<i>n</i>.

Paul H. Edelman

J. Comb. Theory A, 1989

1987

On Inversions and Cycles in Permutations.

Paul H. Edelman

Eur. J. Comb., 1987

1984

The acyclic sets of an oriented matroid.

Paul H. Edelman

J. Comb. Theory B, 1984

1982

The lattice of convex sets of an oriented matroid.

Paul H. Edelman

J. Comb. Theory B, 1982

The Subposet Lattice and the Order Polynomial.

Paul H. Edelman, Paul Klingsberg

Eur. J. Comb., 1982

Multichains, non-crossing partitions and trees.

Paul H. Edelman

Discret. Math., 1982

1980

Zeta Polynomials and the Möbius Function.

Paul H. Edelman

Eur. J. Comb., 1980

Chain enumeration and non-crossing partitions.

Paul H. Edelman

Discret. Math., 1980

1979

Group labelings of graphs.

Paul H. Edelman, Michael E. Saks

J. Graph Theory, 1979

On a fixed point theorem for partially ordered sets.

Paul H. Edelman

Discret. Math., 1979