## 5.230. no_peak

 DESCRIPTION LINKS AUTOMATON
Origin

Derived from $\mathrm{𝚙𝚎𝚊𝚔}$.

Constraint

$\mathrm{𝚗𝚘}_\mathrm{𝚙𝚎𝚊𝚔}\left(\mathrm{𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂}\right)$

Argument
 $\mathrm{𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂}$ $\mathrm{𝚌𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗}\left(\mathrm{𝚟𝚊𝚛}-\mathrm{𝚍𝚟𝚊𝚛}\right)$
Restrictions
 $|\mathrm{𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂}|>0$ $\mathrm{𝚛𝚎𝚚𝚞𝚒𝚛𝚎𝚍}$$\left(\mathrm{𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂},\mathrm{𝚟𝚊𝚛}\right)$
Purpose

A variable ${V}_{k}$ $\left(1 of the sequence of variables $\mathrm{𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂}={V}_{1},...,{V}_{m}$ is a peak if and only if there exists an $i$ $\left(1 such that ${V}_{i-1}<{V}_{i}$ and ${V}_{i}={V}_{i+1}=...={V}_{k}$ and ${V}_{k}>{V}_{k+1}$. The total number of peaks of the sequence of variables $\mathrm{𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂}$ is equal to 0.

Example
$\left(〈1,1,4,8,8〉\right)$

The $\mathrm{𝚗𝚘}_\mathrm{𝚙𝚎𝚊𝚔}$ constraint holds since the sequence $11488$ does not contain any peak.

##### Figure 5.230.1. A sequence without any peak Symmetries
• Items of $\mathrm{𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂}$ can be reversed.

• One and the same constant can be added to the $\mathrm{𝚟𝚊𝚛}$ attribute of all items of $\mathrm{𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂}$.

See also

generalisation: $\mathrm{𝚙𝚎𝚊𝚔}$ (introduce a $\mathrm{𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎}$ counting the number of peaks).

Keywords
Automaton

Figure 5.230.2 depicts the automaton associated with the $\mathrm{𝚗𝚘}_\mathrm{𝚙𝚎𝚊𝚔}$ constraint. To each pair of consecutive variables $\left({\mathrm{𝚅𝙰𝚁}}_{i},{\mathrm{𝚅𝙰𝚁}}_{i+1}\right)$ of the collection $\mathrm{𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂}$ corresponds a signature variable ${𝚂}_{i}$. The following signature constraint links ${\mathrm{𝚅𝙰𝚁}}_{i}$, ${\mathrm{𝚅𝙰𝚁}}_{i+1}$ and ${𝚂}_{i}$: $\left({\mathrm{𝚅𝙰𝚁}}_{i}<{\mathrm{𝚅𝙰𝚁}}_{i+1}⇔{𝚂}_{i}=0\right)\wedge \left({\mathrm{𝚅𝙰𝚁}}_{i}={\mathrm{𝚅𝙰𝚁}}_{i+1}⇔{𝚂}_{i}=1\right)\wedge \left({\mathrm{𝚅𝙰𝚁}}_{i}>{\mathrm{𝚅𝙰𝚁}}_{i+1}⇔{𝚂}_{i}=2\right)$.

##### Figure 5.230.2. Automaton of the $\mathrm{𝚗𝚘}_\mathrm{𝚙𝚎𝚊𝚔}$ constraint ##### Figure 5.230.3. Hypergraph of the reformulation corresponding to the automaton of the $\mathrm{𝚗𝚘}_\mathrm{𝚙𝚎𝚊𝚔}$ constraint 