Novel Constructions of Words with Strong Avoidance Properties and their Combinatorial Analysis Article Swipe
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2505.11403
This paper begins with a comprehensive overview of combinatorics on words and symbolic dynamics, covering their historical origins, fundamental concepts, and interconnections. Building upon this foundation, we introduce novel mathematical constructions related to pattern avoidance in infinite words. Specifically, we define Strongly $(k, δ)$-Free Words generated via cyclic shift morphisms and present a theorem establishing specific avoidance properties for these words, along with a detailed proof. Furthermore, we propose a conjecture regarding their factor complexity. These original results contribute to the theoretical understanding of word structures and their combinatorial properties, opening avenues for further research in discrete mathematics.
Related Topics
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2505.11403
- https://arxiv.org/pdf/2505.11403
- OA Status
- green
- OpenAlex ID
- https://openalex.org/W4417094367
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4417094367Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2505.11403Digital Object Identifier
- Title
-
Novel Constructions of Words with Strong Avoidance Properties and their Combinatorial AnalysisWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-05-16Full publication date if available
- Authors
-
Duaa Abdullah, Jasem HamoudList of authors in order
- Landing page
-
https://arxiv.org/abs/2505.11403Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2505.11403Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2505.11403Direct OA link when available
- Cited by
-
0Total citation count in OpenAlex
Full payload
| id | https://openalex.org/W4417094367 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2505.11403 |
| ids.doi | https://doi.org/10.48550/arxiv.2505.11403 |
| ids.openalex | https://openalex.org/W4417094367 |
| fwci | |
| type | preprint |
| title | Novel Constructions of Words with Strong Avoidance Properties and their Combinatorial Analysis |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2505.11403 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2505.11403 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2505.11403 |
| locations[1].id | doi:10.48550/arxiv.2505.11403 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | cc-by |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | https://openalex.org/licenses/cc-by |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2505.11403 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5110257990 |
| authorships[0].author.orcid | https://orcid.org/0009-0008-6855-1729 |
| authorships[0].author.display_name | Duaa Abdullah |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Abdullah, Duaa |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5097398935 |
| authorships[1].author.orcid | https://orcid.org/0009-0002-0192-3627 |
| authorships[1].author.display_name | Jasem Hamoud |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Hamoud, Jasem |
| authorships[1].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2505.11403 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Novel Constructions of Words with Strong Avoidance Properties and their Combinatorial Analysis |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-12-07T16:46:01.989576 |
| primary_topic | |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2505.11403 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2505.11403 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2505.11403 |
| primary_location.id | pmh:oai:arXiv.org:2505.11403 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2505.11403 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2505.11403 |
| publication_date | 2025-05-16 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 4, 52, 63, 69 |
| abstract_inverted_index.in | 35, 95 |
| abstract_inverted_index.of | 7, 83 |
| abstract_inverted_index.on | 9 |
| abstract_inverted_index.to | 32, 79 |
| abstract_inverted_index.we | 26, 39, 67 |
| abstract_inverted_index.and | 11, 20, 50, 86 |
| abstract_inverted_index.for | 58, 92 |
| abstract_inverted_index.the | 80 |
| abstract_inverted_index.via | 46 |
| abstract_inverted_index.$(k, | 42 |
| abstract_inverted_index.This | 0 |
| abstract_inverted_index.this | 24 |
| abstract_inverted_index.upon | 23 |
| abstract_inverted_index.with | 3, 62 |
| abstract_inverted_index.word | 84 |
| abstract_inverted_index.These | 75 |
| abstract_inverted_index.Words | 44 |
| abstract_inverted_index.along | 61 |
| abstract_inverted_index.novel | 28 |
| abstract_inverted_index.paper | 1 |
| abstract_inverted_index.shift | 48 |
| abstract_inverted_index.their | 15, 72, 87 |
| abstract_inverted_index.these | 59 |
| abstract_inverted_index.words | 10 |
| abstract_inverted_index.begins | 2 |
| abstract_inverted_index.cyclic | 47 |
| abstract_inverted_index.define | 40 |
| abstract_inverted_index.factor | 73 |
| abstract_inverted_index.proof. | 65 |
| abstract_inverted_index.words, | 60 |
| abstract_inverted_index.words. | 37 |
| abstract_inverted_index.avenues | 91 |
| abstract_inverted_index.further | 93 |
| abstract_inverted_index.opening | 90 |
| abstract_inverted_index.pattern | 33 |
| abstract_inverted_index.present | 51 |
| abstract_inverted_index.propose | 68 |
| abstract_inverted_index.related | 31 |
| abstract_inverted_index.results | 77 |
| abstract_inverted_index.theorem | 53 |
| abstract_inverted_index.Building | 22 |
| abstract_inverted_index.Strongly | 41 |
| abstract_inverted_index.covering | 14 |
| abstract_inverted_index.detailed | 64 |
| abstract_inverted_index.discrete | 96 |
| abstract_inverted_index.infinite | 36 |
| abstract_inverted_index.original | 76 |
| abstract_inverted_index.origins, | 17 |
| abstract_inverted_index.overview | 6 |
| abstract_inverted_index.research | 94 |
| abstract_inverted_index.specific | 55 |
| abstract_inverted_index.symbolic | 12 |
| abstract_inverted_index.avoidance | 34, 56 |
| abstract_inverted_index.concepts, | 19 |
| abstract_inverted_index.dynamics, | 13 |
| abstract_inverted_index.generated | 45 |
| abstract_inverted_index.introduce | 27 |
| abstract_inverted_index.morphisms | 49 |
| abstract_inverted_index.regarding | 71 |
| abstract_inverted_index.δ)$-Free | 43 |
| abstract_inverted_index.conjecture | 70 |
| abstract_inverted_index.contribute | 78 |
| abstract_inverted_index.historical | 16 |
| abstract_inverted_index.properties | 57 |
| abstract_inverted_index.structures | 85 |
| abstract_inverted_index.complexity. | 74 |
| abstract_inverted_index.foundation, | 25 |
| abstract_inverted_index.fundamental | 18 |
| abstract_inverted_index.properties, | 89 |
| abstract_inverted_index.theoretical | 81 |
| abstract_inverted_index.Furthermore, | 66 |
| abstract_inverted_index.establishing | 54 |
| abstract_inverted_index.mathematical | 29 |
| abstract_inverted_index.mathematics. | 97 |
| abstract_inverted_index.Specifically, | 38 |
| abstract_inverted_index.combinatorial | 88 |
| abstract_inverted_index.combinatorics | 8 |
| abstract_inverted_index.comprehensive | 5 |
| abstract_inverted_index.constructions | 30 |
| abstract_inverted_index.understanding | 82 |
| abstract_inverted_index.interconnections. | 21 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile |