◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Holub

23 papers hereh-index 10308 citations68 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author7
  • first author7
  • middle author4
  • last author4

Across the 22 of 23 papers where every author was matched, so the position is known.

fields
  • cs.FL20
  • cs.DM1
  • cs.IT1
  • cs.LO1

identity via Semantic Scholar / OpenAlex

activity
20112026
most citedBinary equality sets are generated by two words

22 citations · 75 across the 21 of their papers we have counts for

collaborators
Showing 2015Show all

4 papers · 1 filter

cs.FL2015★ 3 cited

Periods and borders of random words

Štěpán Holub, Jeffrey Shallit

We investigate the behavior of the periods and border lengths of random words over a fixed alphabet. We show that the asymptotic probability that a random word has a given maximal…

cs.FL2015★ 3 cited

Fully bordered words

Štěpán Holub, Mike Müller

We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes.

cs.FL2015★ 11 cited

Beyond the Runs Theorem

Johannes Fischer, Štěpán Holub, Tomohiro I +1

Recently, a short and elegant proof was presented showing that a binary word of length n contains at most n−3 runs. Here we show, using the same technique and a computer search…

cs.FL2015★ 1 cited

Equation xiyjxk=uivjuk in words

Jana Hadravová, Štěpán Holub

We will prove that the word aibjak is periodicity forcing if j≥3 and i+k≥3, where i and k are positive integers. Also we will give examples showing that both…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.