Common substring with shifts in b-ary expansions

被引：0
|
作者：
Liao, Xin [1 ]
Yu, Dingding [1 ]
机构：
[1] Wuhan Univ, Sch Math & Stat, Wuhan 430072, Peoples R China
来源：
ARCHIV DER MATHEMATIK | 2024年 / 123卷 / 04期
关键词：
b-ary expansions; Common substring with shifts; Hausdorff dimension;
D O I：
10.1007/s00013-024-02038-1
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Denote by S-n(x,y) the length of the longest common substring of x and y with shifts in their first n digits of the b-ary expansions. We show that the sets of pairs (x, y), for which the growth rate of S-n(x,y) is alpha log n with 0 <= alpha <= infinity, have full Hausdorff dimension. Our method relies upon some estimation of the spectral radius of matrices.
引用
收藏
页码：369 / 377
页数：9
相关论文
共 50 条
  • [41] On the shortest distance between orbits and the longest common substring problem
    Barros, Vanessa
    Liao, Lingmin
    Rousseau, Jerome
    ADVANCES IN MATHEMATICS, 2019, 344 : 311 - 339
  • [42] Linear Time Algorithms for Generalizations of the Longest Common Substring Problem
    Arnold, Michael
    Ohlebusch, Enno
    ALGORITHMICA, 2011, 60 (04) : 806 - 818
  • [43] Efficient watermark detection by using the longest common substring technique
    Mohamed, Taha M.
    Elmahdy, Hesham N.
    Onsi, Hoda M.
    EGYPTIAN INFORMATICS JOURNAL, 2011, 12 (02) : 115 - 123
  • [44] A note on the longest common substring with k-mismatches problem
    Grabowski, Szymon
    INFORMATION PROCESSING LETTERS, 2015, 115 (6-8) : 640 - 642
  • [45] Shifts and loopless generation of k-ary trees
    Korsh, JF
    Lipschutz, S
    INFORMATION PROCESSING LETTERS, 1998, 65 (05) : 235 - 240
  • [46] Using the Longest Common Substring on Dynamic Traces of Malware to Automatically Identify Common Behaviors
    Acosta, Jaime
    PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON INFORMATION WARFARE AND SECURITY, 2011, : 1 - 7
  • [47] A practical algorithm to find longest common substring in linear time
    Hui, LCK
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2000, 15 (02): : 73 - 76
  • [48] Linear Time Algorithms for Generalizations of the Longest Common Substring Problem
    Michael Arnold
    Enno Ohlebusch
    Algorithmica, 2011, 60 : 806 - 818
  • [49] Hardware-based implementation of the common approximate substring algorithm
    Kent, KB
    Van Schaick, S
    Rice, JE
    Evans, PA
    DSD 2005: 8TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN, PROCEEDINGS, 2005, : 314 - 320
  • [50] The Extended Longest Common Substring Algorithm for Spoken Document Retrieval
    Prozorov, Dmitriy
    Yashina, Alexandra
    2015 9TH INTERNATIONAL CONFERENCE ON APPLICATION OF INFORMATION AND COMMUNICATION TECHNOLOGIES (AICT), 2015, : 88 - 90
12345