On multi-dimensional patterns

Kitaev, Sergey and Robbins, Jakayla (2007) On multi-dimensional patterns. Pure Mathematics and Applications, 18 (3-4). pp. 291-299. ISSN 1218-4586

Abstract

We generalize the concept of pattern occurrence in permutations, words or matrices to that in n-dimensional objects, which are basically sets of (n + 1)-tuples. In the case n = 3, we give a possible interpretation of such patterns in terms of bipartite graphs. For zero-box patterns we study vanishing borders related to bipartite Ramsey problems in the case of two dimensions. Also, we study the maximal number of 1’s in binary objects avoiding (in two different senses) a zero-box pattern.

ORCID iDs

Kitaev, Sergey ORCID: https://orcid.org/0000-0003-3324-1647

• Share and Export
  

  RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSHTML CitationASCII CitationOpenURL ContextObjectEndNoteOpenURL ContextObject in SpanMODSMPEG-21 DIDLEP3 XMLData Cite XMLRIS (EndNote Online, Zotero, Ref manager, etc)RDF+N3Multiline CSV
• Item metadata

  Item type:	Article
  ID code:	49826
  Dates:	Date Event 2007 Published
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Pure Administrator
  Date deposited:	15 Oct 2014 10:16
  Last modified:	11 Nov 2024 10:49
  Related URLs:	https://personal.cis.strath.ac.uk/sergey... Journal or Publication
  URI:	https://strathprints.strath.ac.uk/id/eprint/49826