arXiv (OAI Expanded)
open access
A lower bound on the density of prefixes with maximal palindromic length
The palindromic length $PL(u)$ of a nonempty finite word $u$ is the least number of nonempty palindromes whose concatenation is $u$. For an infinite word $w$, let $P_w(n)$ be the number of nonempty palindromic prefixes of $w[1,n]$, and let $T_w(n)$ consist of those prefixes $w[1,j]$, $1\leq j\leq n$
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the size of the maximum of incomplete Kloosterman sums#452189
- The distribution of the maximum of partial sums of Kloosterman sums and other trace functions#452196
- Sharp Matrix $\mathcal A_p$ lower bounds for general non-degenerate convolution Calderón--Zygmund operators#1118272
- A sharp norm inequality for entanglement-breaking channels#1064450
- Sharp Gradient Stability for the Sobolev Trace Inequality#785198
Record · ID 1109199
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive