Math-15669 · mathematics · Combinatorics

Math-15669

Sharp Bounds for Alternating Involution Periods

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Let $A$ be an alphabet and let $A^*$ denote the set of finite words over $A$, including the empty word $\varepsilon$. The source does not specify whether $A$ is finite. A morphic involution is a map $\theta:A^*\to A^*$ satisfying \[ \theta(\varepsilon)=\varepsilon,\qquad \theta(uv)=\theta(u)\theta(v),\qquad \theta(\theta(u))=u \quad (u,v\in A^*). \] For a word $w$, its length is denoted by $|w|$, and a contiguous factor is a word $u$ for which $w=xuy$ for some $x,y\in A^*$.

The supplied record describes $\tau_\theta(w)$ as the maximum length of a $\theta$-unbordered factor of $w$, and $\pi_\theta^{\mathrm{alt}}(w)$ as the shortest alternating $\theta$-period of $w$. However, it supplies neither a definition of a $\theta$-border nor a definition of an alternating $\theta$-period. Consequently these descriptions do not determine the two quantities precisely. In particular, the admissible factors and period lengths, the treatment of partial terminal blocks, and the conventions for empty words or empty sets of candidates remain unspecified.

Source problem, with unresolved terminology retained. Determine the sharp relation between $\tau_\theta(w)$ and $\pi_\theta^{\mathrm{alt}}(w)$ for a morphic involution $\theta$ on $A^*$, analogous to the ordinary relation between the maximum length of an unbordered factor and the shortest period. The source does not identify the ordinary relation intended as the analogy, state a proposed inequality or equality, or specify whether additional parameters such as $|w|$ are permitted. The intended universal scope over alphabets, involutions, and words also requires clarification. This is therefore a statement of the supplied research question with explicit gaps, rather than a fully specified conjecture.

Short English statement

The problem asks for a sharp comparison between the longest $\theta$-unbordered factor and the shortest alternating $\theta$-period of a finite word. The supplied record omits the definitions needed to make that comparison precise, including boundary conventions and the intended ordinary-period analogy.

Sources

  • Local UnsolvedMath registry: supplied complete record, permanent ID $30001553$, source problem code catalogue entry, title Sharp Bounds for Alternating Involution Periods, in the Oberwolfach Reports Open Problems collection. No individual proposer is supplied; the proposed year is recorded as 2010.
  • Supplied source citation: Mini-Workshop: Combinatorics on Words (2011), Oberwolfach Reports, pp. 2195--2244, DOI 10.4171/owr/2010/37. Original workshop report: https://doi.org/10.4171/owr/2010/37. The record describes Oberwolfach Reports as documenting mathematical workshops and their open-problem discussions. The citation's 2011 label and the record's 2010 proposed year are retained without reconciliation.
  • Supplied literature source: Kari and Kulkarni, https://doi.org/10.1007/s00236-016-0258-1. No title or specific theorem supporting this formulation is supplied.
  • Supplied literature assessment, checked on 2026-08-21: the record labels the problem open and reports that later work establishes special properties of pseudo-bordered words, while its search found no general resolution of the relation between unbordered and $\theta$-bordered factors. This is supplied dated curation derived from the OWR material, not independently verified here; its status and cited claims require independent verification.
  • The record labels the statement corrected_verified, but its accompanying verification note reports only enclosing TeX notation in mathematical delimiters without changing mathematical content. This does not establish the missing definitions or mathematical correctness.

Catalogue entry

Statement licence: CC-BY-SA-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.