Convex Bounds for the 0,1 Co-Ordinate Deletions Function
Let V(n) be the set of 0,1 co-ordinate vectors of dimension n. For A ⊆ V(n) let ΔA be the set of vectors in V(n − 1) obtained by deleting a co-ordinate from a vector of A in all ways. The 0,1 co-ordinate deletions function δ(k, n) is min |ΔA| over all A ⊑ V(n)with |A| = k.
KeywordsConvex Hull Diophantine Equation Integer Vector Tunnel Line Convex Bound
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
R. Ahlswede and N. Cai, “Shadows and isoperimetry under the sequence subsequence relation”, Combinatorica (1) 17, 1997, 11–29.MathSciNetMATHCrossRefGoogle Scholar
T-N. Danh and D.E. Daykin, “Ordering integer vectors for co-ordinate deletions”, J. London Math. Soc
. (2) 55, 1997, 417–426.MathSciNetCrossRefGoogle Scholar
T-N. Danh and D.E. Daykin, “Sets of 0,1 vectors with minimal sets of subvectors”, Rostock Math. Kolloq.
50, 1997, 47–52.MATHGoogle Scholar
D.E. Daykin, “To find all ”suitable“ orders of 0,1 vectors”, Congr. Numer
113, 1996, 55–60.MathSciNetMATHGoogle Scholar
D.E. Daykin, “A cascade proof of a finite vectors theorem”, Southeast Asian Bull. Math.
21, 1997, 167–172.MathSciNetMATHGoogle Scholar
D.E. Daykin, “On deleting co-ordinates from integer vectors”, submitted.Google Scholar
E.H. Neville, The Farey Series of order
1025. Displaying solutions of the Diophantine equation bx - ay = 1
. ( University Press: Cambridge, 1950 ).Google Scholar
© Springer Science+Business Media New York 2000