On a problem of Davenport and Schinzel
From MaRDI portal
Publication:4041583
DOI10.4064/aa-25-2-213-224zbMath0291.05003OpenAlexW760596467MaRDI QIDQ4041583
Publication date: 1974
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/205268
Permutations, words, matrices (05A05) Other combinatorial number theory (11B75) Special sequences and polynomials (11B83)
Related Items
A linear upper bound in extremal theory of sequences, Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram, Planar realizations of nonlinear Davenport-Schinzel sequences by segments, On the two-dimensional Davenport-Schinzel problem, Combinatorial aspects of Davenport-Schinzel sequences, Extremal functions for sequences, A simplified construction of nonlinear Davenport-Schinzel sequences, A survey of motion planning and related geometric algorithms, Enumerating Davenport-Schinzel sequences, Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights, Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences, A convex hull algorithm for discs, and applications, Davenport-Schinzel theory of matrices, Generalized Davenport-Schinzel sequences with linear upper bound, Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts, Dynamic computational geometry on meshes and hypercubes, Computing the external geodesic diameter of a simple polygon, An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space, On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space, Extremal problems for colored trees and Davenport-Schinzel sequences, On numbers of Davenport-Schinzel sequences, Some dynamic computational geometry problems
