minicomplexity
weak landau
definition

Given a unary string, check that its length is a multiple of some nontrivial summand in a partition of $h$ with maximum least common multiple.

details

For every $h\geq 1$, weak landau$h$ (or just wlan$h$) is defined over the unary alphabet $\{\mathtt0\}$. Its instances are all unary strings.

To determine positive and negative instances, we use a multiset $[x_1,x_2,\dots,x_k]$ of positive integers which add up to $h$,

$x_1,x_2,\dots,x_k\geq 1$   and   $x_1+x_2+\cdots+x_k=h$,
and maximize their least common multiple:
lcm$(x_1,x_2,\dots,x_k)$ is maximum possible.
(This is one of the partitions of $h$ which cause the corresponding value of Landau's function. If more than one exist, we pick one arbitrarily.)

Now, an instance is positive if its length $n$ is a multiple of some nontrivial $x_j$:

for some $x_j\neq1$ there exists $\lambda$ such that $n=\lambda x_j$.
Otherwise, the instance is negative.

E.g., the positive instances of wlan$7$ are the unary strings whose length is a multiple of $3$ or $4$ (or both), since the partition of $7$ maximizing the least common multiple is $[x_1,x_2]=[3,4]$.

notes

Introduced by Chrobak 1986, as an example of a problem in 1N/uny\1D. Implicitly present already in Ott 1964, in an example of a unary 1NFA which can avoid cycles for more than quadratically many steps.

The name “weak landau” is suggested by this site. huh?

See landau for the variant where $n$ must be a multiple of every $x_j$.

co-1N
co-1N 1D re-1D co-1D rc-1D rc-1N 1D/uny re-1D/uny co-1D/uny co-1N/uny rc-1D/uny rc-1N/uny
1N/uny
1N/uny 21D e1D r1D f1D 1N 21N e1N r1N f1N 2RD eRD rRD fRD RN 2RN eRN rRN fRN 2SD eSD rSD fSD SN 2SN eSN rSN fSN 22D e2D r2D f2D 2N 22N e2N r2N f2N re-21D re-e1D re-r1D re-f1D re-1N re-21N re-e1N re-r1N re-f1N re-2RD re-eRD re-rRD re-fRD re-RN re-2RN re-eRN re-rRN re-fRN re-2SD re-eSD re-rSD re-fSD re-SN re-2SN re-eSN re-rSN re-fSN re-22D re-e2D re-r2D re-f2D re-2N re-22N re-e2N re-r2N re-f2N co-21D co-e1D co-r1D co-f1D co-21N co-e1N co-r1N co-f1N co-2RD co-eRD co-rRD co-fRD co-2RN co-eRN co-rRN co-fRN co-2SD co-eSD co-rSD co-fSD co-2SN co-eSN co-rSN co-fSN co-22D co-e2D co-r2D co-f2D co-22N co-e2N co-r2N co-f2N rc-21D rc-e1D rc-r1D rc-f1D rc-21N rc-e1N rc-r1N rc-f1N rc-2RD rc-eRD rc-rRD rc-fRD rc-2RN rc-eRN rc-rRN rc-fRN rc-2SD rc-eSD rc-rSD rc-fSD rc-2SN rc-eSN rc-rSN rc-fSN rc-22D rc-e2D rc-r2D rc-f2D rc-22N rc-e2N rc-r2N rc-f2N 21D/uny e1D/uny r1D/uny f1D/uny 21N/uny e1N/uny r1N/uny f1N/uny 2RD/uny eRD/uny rRD/uny fRD/uny RN/uny 2RN/uny eRN/uny rRN/uny fRN/uny 2SD/uny eSD/uny rSD/uny fSD/uny SN/uny 2SN/uny eSN/uny rSN/uny fSN/uny 22D/uny e2D/uny r2D/uny f2D/uny 2N/uny 22N/uny e2N/uny r2N/uny f2N/uny re-21D/uny re-e1D/uny re-r1D/uny re-f1D/uny re-1N/uny re-21N/uny re-e1N/uny re-r1N/uny re-f1N/uny re-2RD/uny re-eRD/uny re-rRD/uny re-fRD/uny re-RN/uny re-2RN/uny re-eRN/uny re-rRN/uny re-fRN/uny re-2SD/uny re-eSD/uny re-rSD/uny re-fSD/uny re-SN/uny re-2SN/uny re-eSN/uny re-rSN/uny re-fSN/uny re-22D/uny re-e2D/uny re-r2D/uny re-f2D/uny re-2N/uny re-22N/uny re-e2N/uny re-r2N/uny re-f2N/uny co-21D/uny co-e1D/uny co-r1D/uny co-f1D/uny co-21N/uny co-e1N/uny co-r1N/uny co-f1N/uny co-2RD/uny co-eRD/uny co-rRD/uny co-fRD/uny co-2RN/uny co-eRN/uny co-rRN/uny co-fRN/uny co-2SD/uny co-eSD/uny co-rSD/uny co-fSD/uny co-2SN/uny co-eSN/uny co-rSN/uny co-fSN/uny co-22D/uny co-e2D/uny co-r2D/uny co-f2D/uny co-22N/uny co-e2N/uny co-r2N/uny co-f2N/uny rc-21D/uny rc-e1D/uny rc-r1D/uny rc-f1D/uny rc-21N/uny rc-e1N/uny rc-r1N/uny rc-f1N/uny rc-2RD/uny rc-eRD/uny rc-rRD/uny rc-fRD/uny rc-2RN/uny rc-eRN/uny rc-rRN/uny rc-fRN/uny rc-2SD/uny rc-eSD/uny rc-rSD/uny rc-fSD/uny rc-2SN/uny rc-eSN/uny rc-rSN/uny rc-fSN/uny rc-22D/uny rc-e2D/uny rc-r2D/uny rc-f2D/uny rc-22N/uny rc-e2N/uny rc-r2N/uny rc-f2N/uny
complete for:
– no record –
also hard for:
– no record –
at least as hard as:
– no record –
wlan$^r$:$\leq_\text{id}$
wlan$^r$:$\leq_\text{id}$ wlan$^r$:$\leq^\text{t}_\text{h}$ wlan$^r$:$\leq_\text{h}$ wlan$^r$:$\leq^\text{lac}_\text{1D}$ wlan$^r$:$\leq_\text{1D}$ wlan$^r$:$\leq^\text{lac}_\text{RD}$ wlan$^r$:$\leq_\text{RD}$ wlan$^r$:$\leq^\text{lac}_\text{2D}$ wlan$^r$:$\leq_\text{2D}$ wlan$^r$:$\leq^\text{lac}_\text{1N}$ wlan$^r$:$\leq_\text{1N}$
owl:$\leq^\text{t}_\text{h}$ owl$^r$:$\leq^\text{t}_\text{h}$ sep:$\leq^\text{t}_\text{h}$ sep$^r$:$\leq^\text{t}_\text{h}$ sp:$\leq^\text{t}_\text{h}$ sp$^r$:$\leq^\text{t}_\text{h}$ twl:$\leq^\text{lac}_\text{1D}$ twl$^r$:$\leq^\text{lac}_\text{1D}$
owl:$\leq^\text{t}_\text{h}$ owl$^r$:$\leq^\text{t}_\text{h}$ sep:$\leq^\text{t}_\text{h}$ sep$^r$:$\leq^\text{t}_\text{h}$ sp:$\leq^\text{t}_\text{h}$ sp$^r$:$\leq^\text{t}_\text{h}$ twl:$\leq^\text{lac}_\text{1D}$ twl$^r$:$\leq^\text{lac}_\text{1D}$ owl:$\leq_\text{h}$ owl:$\leq_\text{1D}$ owl:$\leq_\text{RD}$ owl:$\leq_\text{2D}$ owl:$\leq_\text{1N}$ owl$^r$:$\leq_\text{h}$ owl$^r$:$\leq_\text{1D}$ owl$^r$:$\leq_\text{RD}$ owl$^r$:$\leq_\text{2D}$ owl$^r$:$\leq_\text{1N}$ sep:$\leq_\text{h}$ sep:$\leq_\text{1D}$ sep:$\leq_\text{RD}$ sep:$\leq_\text{2D}$ sep:$\leq_\text{1N}$ sep$^r$:$\leq_\text{h}$ sep$^r$:$\leq_\text{1D}$ sep$^r$:$\leq_\text{RD}$ sep$^r$:$\leq_\text{2D}$ sep$^r$:$\leq_\text{1N}$ sp:$\leq_\text{h}$ sp:$\leq_\text{1D}$ sp:$\leq_\text{RD}$ sp:$\leq_\text{2D}$ sp:$\leq_\text{1N}$ sp$^r$:$\leq_\text{h}$ sp$^r$:$\leq_\text{1D}$ sp$^r$:$\leq_\text{RD}$ sp$^r$:$\leq_\text{2D}$ sp$^r$:$\leq_\text{1N}$ twl:$\leq^\text{t}_\text{h}$ twl:$\leq_\text{h}$ twl:$\leq_\text{1D}$ twl:$\leq^\text{lac}_\text{RD}$ twl:$\leq_\text{RD}$ twl:$\leq^\text{lac}_\text{2D}$ twl:$\leq_\text{2D}$ twl:$\leq^\text{lac}_\text{1N}$ twl:$\leq_\text{1N}$ twl$^r$:$\leq^\text{t}_\text{h}$ twl$^r$:$\leq_\text{h}$ twl$^r$:$\leq_\text{1D}$ twl$^r$:$\leq^\text{lac}_\text{RD}$ twl$^r$:$\leq_\text{RD}$ twl$^r$:$\leq^\text{lac}_\text{2D}$ twl$^r$:$\leq_\text{2D}$ twl$^r$:$\leq^\text{lac}_\text{1N}$ twl$^r$:$\leq_\text{1N}$