David W. Walkup

Available identifiers

zbMath Open walkup.david-wWikidataQ102157094 ScholiaQ102157094MaRDI QIDQ1137578

List of research outcomes

Publication	Date of Publication	Type
A 3-Sphere Counterexample to the W_v-Path Conjecture	1980-01-01	Paper
Matchings in random regular bipartite digraphs	1980-01-01	Paper
How many ways can a permutation be factored into two n-cycles?	1979-01-01	Paper
On the Expected Value of a Random Assignment Problem	1979-01-01	Paper
The Hirsch Conjecture Fails for Triangulated 27-Spheres	1978-01-01	Paper
Pólya sequences, binomial convolution and the union of random sets	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5677675	1973-01-01	Paper
The number of plane trees	1972-01-01	Paper
A generalized lower‐bound conjecture for simplicial polytopes	1971-01-01	Paper
The lower bound conjecture for 3- and 4-manifolds	1970-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5682157	1970-01-01	Paper
A nonsolvable group of exponent 5	1970-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5667263	1970-01-01	Paper
A Lipschitzian Characterization of Convex Polyhedra	1969-01-01	Paper
Lifting projections of convex polyhedra	1969-01-01	Paper
Stochastic Programs with Recourse II: On the Continuity of the Objective	1969-01-01	Paper
Some Practical Regularity Conditions for Nonlinear Programs	1969-01-01	Paper
An Example of the Difference Between the Levy and Levy-Prokhorov Metrics	1969-01-01	Paper
A Simplex with a Large Cross Section	1968-01-01	Paper
A note on decision rules for stochastic programs	1968-01-01	Paper
Minimal Conditions for Association of Binary Variables	1968-01-01	Paper
Association of Random Variables, with Applications	1967-01-01	Paper
Continuity of Some Convex-Cone-Valued Mappings	1967-01-01	Paper
Stochastic Programs with Recourse	1967-01-01	Paper
The \(d\)-step conjecture for polyhedra of dimension \(d<6\)	1967-01-01	Paper
Order-preserving functions; applications to majorization and order statistics	1967-01-01	Paper
Covering a Rectangle with T-Tetrominoes	1965-01-01	Paper
Minimal Interchanges of (0, 1)-Matrices and Disjoint Circuits in a Graph	1965-01-01	Paper

Research outcomes over time

This page was built for person: David W. Walkup