Strongly Admissible Triplets

• Strongly admissible triplets are defined by rigorous conditions that guarantee every orbit in Collatz-type maps becomes periodic and that quantum states over CAR algebras satisfy saturation of entropy inequalities.
• Explicit families provide concrete cycle structures and algorithmic criteria, including continued-fraction based bounds to verify cycle length and convergence behaviors.
• Applications span discrete dynamical systems and quantum information theory, generalizing classical problems like the 3n+1 conjecture and modeling quantum Markov processes.

A strongly admissible triplet is a central concept in two distinct mathematical contexts: dynamical systems generalizing the Collatz problem, and quantum information theory on states over the CAR (canonical anticommutation relation) algebra. Despite differences in domain, the unifying theme is the characterization of triplets (either of integers or subalgebras) with robust admissibility and maximal regularity properties—in the first case, global convergence to periodicity of orbits in a non-linear map, and in the second case, saturation of entropy inequalities, implying a strong conditional independence structure.

1. Strongly Admissible Triplets in Collatz-Type Dynamical Systems

Given fixed integer parameters $d\ge 2$, $\kappa_0 = \pm 1$, and coprime integers $\alpha > d$, $\beta$, a Collatz-type map $T:\mathbb{N}\to\mathbb{N}$ is defined by

$$T(n) = \begin{cases} n/d & \text{if } n\equiv 0\pmod d, \ \bigl(\alpha n + \beta[\kappa_0 n]_d\bigr)/d & \text{otherwise,} \end{cases}$$

where $[x]_d$ denotes the remainder of $x$ modulo $d$. The well-definedness and map invariance require the admissibility conditions

$$\alpha + \kappa_0\beta > \frac{\kappa_0 - 1}{2}\beta d, \qquad \alpha + \kappa_0\beta \equiv 0\pmod d.$$

A triplet $\kappa_0 = \pm 1$0 satisfying these is called admissible. Further, it is:

• Weakly admissible if $\kappa_0 = \pm 1$1 admits finitely many distinct cycles,
• Strongly admissible if every orbit under $\kappa_0 = \pm 1$2 is eventually periodic with no divergence, that is, every $\kappa_0 = \pm 1$3 is eventually absorbed in a finite cycle (Bouhamidi, 24 Jan 2026).

This definition encapsulates, and generalizes, the classical Collatz $\kappa_0 = \pm 1$4 problem, now recast as the conjecture that $\kappa_0 = \pm 1$5 is strongly admissible.

2. Illustrative Families, Structure, and Concrete Examples

Infinite families of strongly admissible triplets have been constructed with explicit cycle structure. For instance, given integers $\kappa_0 = \pm 1$6, $\kappa_0 = \pm 1$7, $\kappa_0 = \pm 1$8, $\kappa_0 = \pm 1$9, define

$\alpha > d$0

Then $\alpha > d$1 is admissible and supports explicit "trivial" cycles of lengths $\alpha > d$2 or $\alpha > d$3, with strong admissibility under positivity conditions.

Another family generalizes Jones–Lagarias's $\alpha > d$4 cycles, using

$\alpha > d$5

yielding $\alpha > d$6 distinct cycles each of prescribed length, again with strong admissibility under mild hypotheses.

Representative examples include:

Triplet $\alpha > d$7	Cycle Structure	Strong Admissibility Property
$\alpha > d$8	$\alpha > d$9	Conjectured (the $\beta$0 conjecture)
$\beta$1	$\beta$2	Verified, unique cycle, no divergence
$\beta$3	$\beta$4	Verified, unique cycle, no divergence
$\beta$5	$\beta$6 and $\beta$7, both explicit finite cycles, no divergence	Verified, two cycles

In all strongly admissible cases, $\beta$8 is partitioned into disjoint basins of attraction for each cycle, absorbing all orbits (Bouhamidi, 24 Jan 2026).

3. Partition, Cycle Length Bounds, and Algorithmic Criteria

For a strongly admissible triplet, the positive integers decompose as a disjoint union over the cycle basins $\beta$9: $T:\mathbb{N}\to\mathbb{N}$0 Lower bounds on the length $T:\mathbb{N}\to\mathbb{N}$1 of cycles are given in terms of parameters $T:\mathbb{N}\to\mathbb{N}$2, minimal orbit value $T:\mathbb{N}\to\mathbb{N}$3, and properties of continued fractions. Specifically, for $T:\mathbb{N}\to\mathbb{N}$4, $T:\mathbb{N}\to\mathbb{N}$5, and cycle $T:\mathbb{N}\to\mathbb{N}$6 with length $T:\mathbb{N}\to\mathbb{N}$7 and $T:\mathbb{N}\to\mathbb{N}$8 nontrivial iterates: $T:\mathbb{N}\to\mathbb{N}$9 Hurwitz-type bounds yield $$T(n) = \begin{cases} n/d & \text{if } n\equiv 0\pmod d, \ \bigl(\alpha n + \beta[\kappa_0 n]_d\bigr)/d & \text{otherwise,} \end{cases}$$0, with $$T(n) = \begin{cases} n/d & \text{if } n\equiv 0\pmod d, \ \bigl(\alpha n + \beta[\kappa_0 n]_d\bigr)/d & \text{otherwise,} \end{cases}$$1, and sharper cycle lower bounds are computable via continued-fraction expansions of $$T(n) = \begin{cases} n/d & \text{if } n\equiv 0\pmod d, \ \bigl(\alpha n + \beta[\kappa_0 n]_d\bigr)/d & \text{otherwise,} \end{cases}$$2 (Bouhamidi, 24 Jan 2026).

Efficient algorithms for computing such lower bounds are established, exploiting the continued-fraction structure—Algorithm 1 maximizing over the index of convergents, Algorithm 2 using sign-alternation of sequence $$T(n) = \begin{cases} n/d & \text{if } n\equiv 0\pmod d, \ \bigl(\alpha n + \beta[\kappa_0 n]_d\bigr)/d & \text{otherwise,} \end{cases}$$3—with both running in time logarithmic in $$T(n) = \begin{cases} n/d & \text{if } n\equiv 0\pmod d, \ \bigl(\alpha n + \beta[\kappa_0 n]_d\bigr)/d & \text{otherwise,} \end{cases}$$4.

4. Strongly Admissible Triplets in Quantum Information: CAR Algebra and Strong Subadditivity

Consider the CAR algebra $$T(n) = \begin{cases} n/d & \text{if } n\equiv 0\pmod d, \ \bigl(\alpha n + \beta[\kappa_0 n]_d\bigr)/d & \text{otherwise,} \end{cases}$$5 generated by $$T(n) = \begin{cases} n/d & \text{if } n\equiv 0\pmod d, \ \bigl(\alpha n + \beta[\kappa_0 n]_d\bigr)/d & \text{otherwise,} \end{cases}$$6 with canonical anticommutation relations, and triplets of subalgebras $$T(n) = \begin{cases} n/d & \text{if } n\equiv 0\pmod d, \ \bigl(\alpha n + \beta[\kappa_0 n]_d\bigr)/d & \text{otherwise,} \end{cases}$$7 associated to disjoint finite sets $$T(n) = \begin{cases} n/d & \text{if } n\equiv 0\pmod d, \ \bigl(\alpha n + \beta[\kappa_0 n]_d\bigr)/d & \text{otherwise,} \end{cases}$$8. The von Neumann entropy of a faithful state $$T(n) = \begin{cases} n/d & \text{if } n\equiv 0\pmod d, \ \bigl(\alpha n + \beta[\kappa_0 n]_d\bigr)/d & \text{otherwise,} \end{cases}$$9 on $[x]_d$0 with density $[x]_d$1 is

$[x]_d$2

The strong subadditivity (SSA) inequality is

$[x]_d$3

or, equivalently, $[x]_d$4.

A state $[x]_d$5 is strongly additive (sometimes termed strongly admissible) on the triplet $[x]_d$6 if equality holds: $[x]_d$7 (Jencova, 2010).

5. Characterization Theorems and Quantum Markov Triplets

The paper establishes that, for a faithful state $[x]_d$8 on $[x]_d$9, the following conditions are equivalent:

• $x$0 (strong additivity/strong admissibility),
• The inclusion $x$1 is sufficient for $x$2, with $x$3 the trace-preserving conditional expectation onto $x$4,
• The density matrix factorizes as $x$5, with $x$6, $x$7.

Furthermore, a state $x$8 on $x$9 is a Markov triplet if and only if there exists a unital completely positive (CP) map $d$0 satisfying module, invariance, and image conditions. For even states (with respect to parity automorphism), Markov property and strong additivity are equivalent (Jencova, 2010).

6. Structure, Parity, and Explicit Decompositions

For even strongly admissible (Markov) states, the density $d$1 admits a canonical block-diagonal form along minimal central projections in $d$2, with each block a tensor of positive elements $d$3, both even. This mirrors the classical Petz–Hayden–Jozsa–Winter decomposition,

$d$4

In physical terms, this algebraic equality embodies strong conditional independence: the fermionic analogue of a quantum Markov chain, with $d$5 and $d$6 conditionally independent given $d$7 (Jencova, 2010).

7. General Conjectures and Experimental Evidence

The framework of strongly admissible triplets enables generalizations of the Collatz conjecture. The conjecture that $d$8 is strongly admissible recasts the $d$9 problem; analogous conjectures are posed for further families, e.g., $$\alpha + \kappa_0\beta > \frac{\kappa_0 - 1}{2}\beta d, \qquad \alpha + \kappa_0\beta \equiv 0\pmod d.$$0, or $$\alpha + \kappa_0\beta > \frac{\kappa_0 - 1}{2}\beta d, \qquad \alpha + \kappa_0\beta \equiv 0\pmod d.$$1. Empirical computations, including large-scale enumerations and cycle-length tabulations, confirm strong admissibility for many cases up to high values of parameters and initial data. Cycle-length lower bounds derived from the established algorithms have, for instance, forced any putative nontrivial $$\alpha + \kappa_0\beta > \frac{\kappa_0 - 1}{2}\beta d, \qquad \alpha + \kappa_0\beta \equiv 0\pmod d.$$2 cycle to be extraordinarily large if it exists (Bouhamidi, 24 Jan 2026).

A plausible implication is that the concept of strong admissibility provides a robust paradigm for both understanding dynamical phenomena in nonlinear integer maps and for characterizing exact conditional independence structures in quantum states, thus serving as a key notion in both discrete dynamics and quantum statistical inference.