A combinatorial problem connected with differential equations II

DOI10.4064/AA-17-4-363-372MaRDI QIDQ5619850zbMATH OpenOpenAlexFDO

Authors Harold Davenport

Publication date 1971

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/204964

Mathematics Subject Classification ID

Enumerative combinatorics (05A99)

Cited in

(18)

• Some dynamic computational geometry problems
• Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Almost linear upper bounds on the length of general Davenport-Schinzel sequences
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• Finite sphere packing and sphere covering
• Improved lower bounds on the length of Davenport-Schinzel sequences
• A simplified construction of nonlinear Davenport-Schinzel sequences
• A survey of motion planning and related geometric algorithms
• Davenport-Schinzel theory of matrices
• Generalized Davenport-Schinzel sequences with linear upper bound
• A linear upper bound in extremal theory of sequences
• Generalized Davenport-Schinzel sequences
• Combinatorial aspects of Davenport-Schinzel sequences
• On the two-dimensional Davenport-Schinzel problem
• Enumerating Davenport-Schinzel sequences
• Interview with Micha Sharir
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences

This page was built for publication: A combinatorial problem connected with differential equations II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5619850)