The motif problem
From MaRDI portal
Publication:6236633
arXiv1210.6667MaRDI QIDQ6236633FDOQ6236633
Authors: E. Rodney Canfield, Ron A. Fertig, R. Daniel Mauldin, David Moews 
Publication date: 24 October 2012
Abstract: Fix a choice and ordering of four pairwise non-adjacent vertices of a parallelepiped, and call a motif a sequence of four points in R^3 that coincide with these vertices for some, possibly degenerate, parallelepiped whose edges are parallel to the axes. We show that a set of r points can contain at most r^2 motifs. Generalizing the notion of motif to a sequence of L points in R^p, we show that the maximum number of motifs that can occur in a point set of a given size is related to a linear programming problem arising from hypergraph theory, and discuss some related questions.
This page was built for publication: The motif problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6236633)
