About: Block subsequence theorem   Sponge Permalink

An Entity of Type : dbkwik:resource/4aznwUI91u-_lcyx_rD8kQ==, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

Suppose we have a string x1, x2, ... (We call such a string a Friedman string.) made of an alphabet of k letters, such that no block of letters xi, ..., x2i is a substring of any later block xj, ..., x2j. Friedman showed that such a string cannot be infinite, and for every k there is a sequence of maximal length. Call this length n(k).

AttributesValues
rdf:type
rdfs:label
  • Block subsequence theorem
rdfs:comment
  • Suppose we have a string x1, x2, ... (We call such a string a Friedman string.) made of an alphabet of k letters, such that no block of letters xi, ..., x2i is a substring of any later block xj, ..., x2j. Friedman showed that such a string cannot be infinite, and for every k there is a sequence of maximal length. Call this length n(k).
dcterms:subject
dbkwik:googology/p...iPageUsesTemplate
Name
  • N function
Author
  • Harvey Friedman
Year
  • 1998(xsd:integer)
growthrate
abstract
  • Suppose we have a string x1, x2, ... (We call such a string a Friedman string.) made of an alphabet of k letters, such that no block of letters xi, ..., x2i is a substring of any later block xj, ..., x2j. Friedman showed that such a string cannot be infinite, and for every k there is a sequence of maximal length. Call this length n(k).
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software