A Combinatorial Problem Connected with Differential Equations

DOI10.2307/2373068zbMath0132.00601OpenAlexW2320799707WikidataQ56913440 ScholiaQ56913440MaRDI QIDQ5340927

Andrzej Schinzel

Publication date: 1965

Published in: American Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2373068

zbMATH Keywords

combinatorics

Related Items (51)

Generalized Davenport-Schinzel sequences ⋮ Three Generalizations of Davenport--Schinzel Sequences ⋮ 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 ⋮ On the two-dimensional Davenport-Schinzel problem ⋮ Combinatorial aspects of Davenport-Schinzel sequences ⋮ PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS ⋮ Incidence-polytopes with toroidal cells ⋮ A nonuniform matroid which violates the isotopy conjecture ⋮ Extremal functions for sequences ⋮ 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 ⋮ Enumerating Davenport-Schinzel sequences ⋮ Constructing sparse Davenport-Schinzel sequences ⋮ Finding cores of limited length ⋮ Bipartite Turán problems for ordered graphs ⋮ Bounding sequence extremal functions with formations ⋮ The combinatorial interpretation of the Jacobi identity from Lie algebras ⋮ Bounds on parameters of minimally nonlinear patterns ⋮ Tight bounds on the maximum size of a set of permutations with bounded VC-dimension ⋮ Common intersections of polygons ⋮ Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences ⋮ Unnamed Item ⋮ Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences ⋮ Catalan numbers and pattern restricted set partitions ⋮ Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions ⋮ A convex hull algorithm for discs, and applications ⋮ On the number of maximum empty boxes amidst \(n\) points ⋮ Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices ⋮ Generalized Davenport-Schinzel sequences with linear upper bound ⋮ An efficient algorithm for the three-dimensional diameter problem ⋮ Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts ⋮ Reduction of \(m\)-regular noncrossing partitions ⋮ Dynamic computational geometry on meshes and hypercubes ⋮ Largest empty circle centered on a query line ⋮ Finding the upper envelope of n line segments in O(n log n) time ⋮ Computing the external geodesic diameter of a simple polygon ⋮ A relationship between generalized Davenport-Schinzel sequences and interval chains ⋮ A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems ⋮ A Formal Calculus for the Enumerative System of Sequences-II. Applications ⋮ A Formal Calculus for the Enumerative System of Sequences-III. Further Developments ⋮ Energy-optimal routes for battery electric vehicles ⋮ Separable partitions ⋮ Extremal problems for colored trees and Davenport-Schinzel sequences ⋮ Crossings and nestings of matchings and partitions ⋮ On numbers of Davenport-Schinzel sequences ⋮ Unnamed Item ⋮ Some dynamic computational geometry problems

This page was built for publication: A Combinatorial Problem Connected with Differential Equations