Submitted:
16 December 2025
Posted:
24 December 2025
You are already at the latest version
Abstract

Keywords:
1. Introduction
2. Symmetric Reformulation of Goldbach’s Conjecture
3. The Two-Ball Dynamical Model
- Symmetry: The two balls always sum to E.
- Recurrence: Finite regions near E/2 are revisited infinitely often.
- Non-periodicity: Trajectories do not repeat identically.
4. Strategy of the Two-Ball Approach
5. Results
5.1. Symmetric dynamical reformulation of Goldbach’s problem
5.2. Identification of the mean admissible window
5.3. Dynamic collapse of local covariance effects
5.4. Scale separation: dominance of the even scale over prime gaps
5.5. Two-dimensional phase-space representation of the dynamics
5.6. Global synthesis of dynamic resolution mechanisms
5.7. Uniformity across even scales
5.8. Quantitative dominance of scale over covariance
5.9. Dynamic interpretation of Goldbach’s comet
5.10. Equation-based formulation of the two-ball motion
5.11. Conditional ergodic theorem for Goldbach realization
5.12. Identification of the single remaining gap to an unconditional proof
5.13. Structural impossibility of a counterexample
5.14. Summary of results
- Goldbach’s conjecture admits an exact dynamic reformulation.
- A natural mean admissible window emerges analytically.
- Covariance obstructions are dynamically unstable.
- Global scale growth dominates all local irregularities.
- The problem is fundamentally two-dimensional.
- The Goldbach comet is dynamically explained.
- Only one clearly identified step remains for a fully unconditional proof.














6. Equations: From Two-Ball Motion to a Conditional Theorem on Goldbach
6.1. The two-ball kinematics: states, offsets, and symmetry
6.2. The event we want: the Goldbach success indicator
- S(E) = { t ≥ 0 : x₁(t) and x₂(t) are both prime }
- S(E) = { t ≥ 0 : (E/2 − t) is prime and (E/2 + t) is prime }
- I(E, t) = 1 if t ∈ S(E), and I(E, t) = 0 otherwise.
- There exists t such that I(E, t) = 1.
- Does the sequence t₁, t₂, t₃, … ever land in S(E)?
6.3. The motion rule: a deterministic recurrence with reversals
- tₙ = offset at time n
- vₙ = signed step (velocity) at time n
- tₙ₊₁ = tₙ + vₙ
- If tₙ is an inflection point, then vₙ₊₁ = −vₙ + σₙ
- Otherwise, vₙ₊₁ = vₙ
- “inflection points” form an infinite set I(E) of offsets where the direction changes.
- σₙ is a bounded integer correction that is not identically zero and not constant in n.
6.4. The three motion properties we need (and why they are weak)
- The sequence tₙ is not eventually periodic.
- For every finite admissible window W of offsets, the set of times n with tₙ in W is infinite.
- For every modulus m ≥ 2, tₙ mod m is not constant, and the motion is not trapped in any single residue class mod m.
6.5. The non-avoidance lemma (core mechanism)
- If a set S of offsets has positive density in long intervals, and if the motion is recurrent and not congruence-trapped, then the motion cannot avoid S forever.
- dens_T(S) = |S ∩ [0, T]| / T
- lim inf as T → infinity of dens_T(S) is a strictly positive number.
- There exists some n such that tₙ is in S.
6.6. Why Goldbach reduces to showing S(E) is “dense enough” in the window
- S(E) = { t : E/2 − t and E/2 + t are both prime }.
- In any large enough window around 0 ≤ t ≤ T, the expected number of successes is approximately T divided by log(E) squared.
- expected count of S(E) in [0, T] is about T / (log(E))².
- T = C × (log(E))²
6.7. Definition of the mean window by a single equation
- expected number of successes in [0, T(E)] equals 1.
- T(E) / (log(E))² = 1
- T(E) ≈ (log(E))²
6.8. Converting density + motion into a conditional Goldbach theorem
- Motion: the offsets tₙ are generated by the two-ball recurrence with infinitely many inflections, and satisfy D2 (local recurrence) and D3 (congruence dispersion).
- Density: the Goldbach success set S(E) has positive lower density in sufficiently large windows, consistent with the prime density scale.
- the two-ball motion must hit S(E); i.e., there exists n such that I(E, tₙ) = 1.
- E can be written as the sum of two primes.
- equations of motion → recurrence and dispersion → non-avoidance
- positive density of S(E) → cannot be avoided → Goldbach success
6.9. What “conditional” means here (precise and minimal)
- proving unconditionally that the two-ball recurrence always satisfies D2 and D3 for every E (or for all E beyond some threshold), in a fully arithmetic sense.
- symmetry is exact (Figure 1),
- the mean window scale is explicit (Figure 2 and Figure 3),
- covariance cannot persist across nonrepeating excursions (Figure 4, Figure 5 and Figure 6),
- scale separation dominates local irregularities (Figure 5, Figure 8 and Figure 9),
- the comet becomes cumulative dynamic output (Figure 10),
- counterexamples require invariance incompatible with the motion (Figure 14).
6.10. Results distilled into one “equation-to-theorem” pipeline
- x₁ + x₂ = E with x₁ = E/2 − t, x₂ = E/2 + t
- tₙ₊₁ = tₙ + vₙ
- v reverses at inflections with nonconstant correction
- S(E) = { t : both symmetric positions prime }
- T(E) ≈ (log(E))²
- recurrent + dispersed motion cannot avoid a positive-density set
- the motion hits S(E) → E is sum of two primes
7. Demonstration
7.1. Reformulation of Goldbach as a dynamical target
- Left ball: L(t) = E/2 − t
- Right ball: R(t) = E/2 + t
- L(t) + R(t) = E
- L(t) is prime
- R(t) is prime
- S(E) = { t ≥ 0 : L(t) and R(t) are both prime }
- S(E) is nonempty.
7.2. The equations of motion (two balls)
- t_n : offset at time n
- v_n : signed step (velocity) at time n, nonzero integer
- 1.
- Offset update
- ∙
- t_(n+1) = t_n + v_n
- 2.
- Velocity update (with inflection points)
- ∙
- If t_n belongs to an inflection set I(E), then v_(n+1) = −v_n + s_n
- ∙
- Otherwise, v_(n+1) = v_n
- I(E) is an infinite set of admissible offsets (inflection points),
- s_n is a bounded integer correction, not constant in n.
7.3. Three dynamical consequences of the equations
7.4. The analytic size of the target set
- The density of primes is about 1 / log(E).
- The density of pairs where both L(t) and R(t) are prime is about 1 / (log(E))².
- In a window 0 ≤ t ≤ T, the expected number of elements of S(E) is about T / (log(E))².
- W(E) / (log(E))² = 1
- W(E) is of order (log(E))².
7.5. The non-avoidance principle (core of the demonstration)
- local recurrence (D2), and
- congruence dispersion (D3),
- t_n belongs to S.
7.6. Application of non-avoidance to the two balls
- The set S(E) has positive density on windows of size comparable to (log(E))².
- The two-ball motion generates a sequence t_n satisfying D2 and D3.
- There exists an index n such that t_n belongs to S(E).
- L(t_n) is prime, and
- R(t_n) is prime.
- E = L(t_n) + R(t_n) is a sum of two primes.
7.7. Statement of the conditional theorem
- E can be written as the sum of two prime numbers.
7.8. Why this constitutes a genuine demonstration
- The equations define a concrete deterministic system.
- The target set is explicitly defined.
- The mean window is derived analytically.
- The obstruction analysis is structural, not probabilistic.
7.9. Logical closure of the argument
- Symmetry converts Goldbach into a motion problem.
- Motion equations enforce recurrence and dispersion.
- Prime density gives a positive-density target.
- Non-avoidance forces intersection.
- Intersection yields a Goldbach representation.
8. Relation to Known Theorems and Classical Results
8.1. Prime density and the Prime Number Theorem
8.2. Hardy–Littlewood heuristics and Goldbach’s problem
8.3. Vinogradov-type results and weak Goldbach
8.4. Sieve theory and the parity barrier
8.5. Correlations of primes and covariance phenomena
8.6. Ergodic theory and non-avoidance principles
8.7. Goldbach’s comet and empirical phenomena
8.8. Summary of relations
- Uses prime density exactly as provided by the Prime Number Theorem [Hadamard 1896; de la Vallée Poussin 1896].
- Aligns with Hardy–Littlewood heuristics without relying on the full circle method [Hardy and Littlewood 1923].
- Plays a role analogous to additional variables in Vinogradov-type results [Vinogradov 1937; Helfgott 2013].
- Bypasses sieve-theoretic parity barriers [Selberg 1947].
- Addresses covariance in a way complementary to modern correlation results [Green and Tao 2008; Maynard 2015; Tao 2014; Granville and Soundararajan 2007].
- Fits naturally within the broader ergodic philosophy of additive number theory [Furstenberg 1977].
9. No Counterexample Is Possible Within the Two-Ball Framework
9.1. What a counterexample would have to mean in the two-ball setting
- For every offset t ≥ 0, at least one of the two numbersE/2 − t and E/2 + t is not prime.
- S(E) = { t : E/2 − t and E/2 + t are both prime } is empty.
- t₁, t₂, t₃, …
9.2. Why permanent avoidance would require an invariant obstruction set
- F(E) = { t : not( E/2 − t is prime and E/2 + t is prime ) }
- For all n, tₙ is in F(E).
- The trajectory is contained in F(E) for all time.
- the motion reverses direction infinitely often (inflections),
- the motion changes local residue configurations over time,
- the motion repeatedly revisits finite windows near E/2 (recurrence),
- the motion does not stay confined in one residue class (dispersion).
9.3. The “invariance requirement” is incompatible with arithmetic dispersion
9.4. Density of the target set and the impossibility of avoiding it
- S(E) = { t : E/2 − t and E/2 + t are both prime }.
9.5. Structural conclusion: no counterexample can persist under the two-ball motion
- A counterexample would require an invariant avoidance mechanism.
- The two-ball motion destroys invariance by repeated reversals, residue changes, and repeated revisits.
- Therefore, a counterexample cannot persist within the model.
- If the two-ball motion satisfies local recurrence and congruence dispersion, then a counterexample cannot exist.
9.6. Final Conditional Theorem (announced clearly)
- E/2 − tₙ and E/2 + tₙ
- Local recurrence: every finite admissible offset window is visited infinitely often.
- Congruence dispersion: the offsets do not remain confined in any single residue class modulo any m ≥ 2.
- There exists an offset t such that E/2 − t and E/2 + t are both prime,
- hence E is the sum of two primes.
9.7. The single tiny open step before an absolute proof
- local recurrence, and
- congruence dispersion,
- Show that no pathological deterministic trajectory exists that remains trapped in a thin exceptional set and avoids the dense target set forever.
9.8. Summary of Section 9
- A counterexample in this framework would require an invariant obstruction set.
- The two-ball motion breaks invariance by reversals and residue changes.
- Therefore permanent avoidance is structurally impossible once recurrence and dispersion hold (Figure 4 and Figure 14).
- The final conditional theorem follows (Figure 12).
- The only remaining open step is proving universal recurrence and congruence dispersion for the two-ball offsets (Figure 13).
10.1. What has been achieved in this work
10.2. The two-ball framework as a unifying structure
- exact symmetry around E/2,
- infinite back-and-forth exploration,
- non-identical trajectories,
- and deterministic evolution.
- Prime density near E/2 [Hadamard 1896; de la Vallée Poussin 1896].
- Growth of Goldbach representations (the Goldbach comet) [Deshouillers et al. 1997].
- Failure of static obstruction arguments, including parity barriers in sieve theory [Selberg 1947].
- Instability of covariance effects under repeated perturbation, consistent with modern work on prime correlations [Granville and Soundararajan 2007; Tao 2014].
10.3. Why the two-ball motion dissolves covariance
10.4. The meaning of the conditional theorem
10.5. Why a counterexample is structurally implausible
- avoid all symmetric prime configurations,
- remain stable under infinitely many reversals,
- survive changing residue classes,
- and persist under repeated revisits of finite windows.
10.6. Conceptual implications for additive number theory
10.7. Toward an unconditional proof: the remaining step
- Direct dynamical analysis of the recurrence equations, showing that inflections and corrections force dispersion.
- Combinatorial arguments excluding invariant thin sets under repeated symmetric shifts.
- Hybrid ergodic–arithmetic methods, inspired by recurrence results in additive combinatorics [Green and Tao 2008].
10.8. Relation to empirical evidence
- The rapid growth of the admissible window compared to prime gaps,
- The observed abundance of Goldbach representations,
- The stability of the Goldbach comet across large ranges of E.
10.9. Broader philosophical perspective
10.10. Final summary
- Introduced a deterministic two-ball model encoding symmetry and motion.
- Converted Goldbach’s conjecture into a non-avoidance problem.
- Demonstrated the instability of covariance and obstruction under repeated exploration.
- Derived a clear conditional theorem linking dynamics to Goldbach.
- Isolated a single, well-defined remaining step before an unconditional proof.
10.11. Outlook
Appendix A (Expanded)
A.1. Why introducing dynamics is mathematically legitimate
A.2. Why Newtonian intuition is appropriate
- Constraint: the sum of the two numbers must equal E.
- Symmetry: the natural center is E divided by 2.
- Evolution: offsets can be explored progressively.
A.3. The offset variable as a generalized coordinate
A.4. Time as iteration, not physical duration
A.5. Why differential-equation intuition still applies
- Direction matters (sign of velocity).
- Reversals occur at identifiable conditions.
- The system exhibits inflection-like behavior.
- Long-term behavior dominates short-term fluctuations.
A.6. Velocity as a structural—not physical—quantity
A.7. Inflection points as arithmetic forces
- direction reversal,
- trajectory deformation,
- desynchronization of repeated passes.
A.8. Why reversals are essential
A.9. Bounded corrections and structural stability
- the system remains controlled,
- exploration is gradual,
- recurrence is guaranteed.
A.10. Absence of conserved quantities (and why this helps)
A.11. Phase-space interpretation
- deterministic,
- non-periodic,
- recurrent,
- dispersed.
A.12. Why the Newtonian analogy is not cosmetic
- the choice of variables,
- the structure of the recurrence,
- the identification of what must be proved,
- the interpretation of obstruction.
A.13. Implications for Goldbach’s conjecture
- Goldbach’s conjecture becomes a statement about non-avoidance under symmetric dynamics.
- Counterexamples would correspond to invariant forbidden regions.
- The equations of motion actively destroy invariance.
A.14. Summary of Appendix A
Appendix A establishes the following foundational principles:
- Introducing time and motion is mathematically legitimate.
- The two-ball system is a constrained deterministic dynamical system.
- Newtonian intuition provides the correct structural lens.
- Inflections replace forces; dispersion replaces randomness.
- Invariance is structurally unstable under the equations.
Appendix B (Expanded)
B.1. Why chaos is relevant to Goldbach’s conjecture
B.2. Discrete dynamical systems and arithmetic motion
- time advances in integer steps,
- states evolve by deterministic recurrence,
- no randomness is introduced.
B.3. Periodicity as the fundamental danger
- infinitely many reversals,
- non-identical reversals,
- bounded but nonconstant corrections,
- interaction with arithmetic residue structure.
B.4. Non-periodicity generated by inflection corrections
- direction reverses,
- a bounded correction modifies future evolution,
- the return trajectory is shifted.
B.5. Sensitivity to initial conditions in arithmetic form
- a small change in early corrections leads to a different sequence of offsets,
- future reversals occur at different positions,
- congruence patterns diverge.
B.6. Chaos versus randomness: an essential distinction
- deterministic,
- rule-based,
- but non-repeating and desynchronizing.
B.7. Why desynchronization dissolves covariance
- each pass through the admissible window occurs with different residue interactions,
- reversals change which congruence constraints apply,
- offsets are revisited under altered arithmetic conditions.
B.8. The impossibility of phase locking
B.9. Relation to classical chaotic systems
- billiards with reflective boundaries [Sinai 1976],
- perturbed rotations on the circle,
- non-integrable Hamiltonian systems [Arnold 1989].
B.10. Chaos as a constructive tool, not an obstacle
B.11. Finite windows, infinite motion
- finite admissible windows (where primes are dense),
- infinite time evolution.
B.12. Why chaos does not weaken rigor
- non-periodicity,
- recurrence,
- dispersion.
B.13. Implications for the demonstration of Goldbach
- no finite set of offsets can block motion,
- no congruence pattern can trap the system,
- no symmetric obstruction can persist.
B.14. Summary of Appendix B
Appendix B establishes the following key points:
- Periodicity is the only serious threat to the two-ball argument.
- The equations deliberately destroy periodicity.
- Deterministic chaos ensures desynchronization of obstructions.
- Covariance cannot survive repeated non-identical passes.
- Chaos is the engine of non-avoidance, not a weakness.
Appendix C (Expanded)
C.1. Why ergodicity enters an arithmetic problem
C.2. What ergodicity means here (and what it does not)
- measure-preserving transformations,
- probability spaces,
- random initial conditions,
- or classical ergodic theorems.
- Local recurrence
- Congruence dispersion
C.3. Local recurrence: infinite return to admissible windows
- Goldbach-relevant primes lie near E/2,
- prime density decreases away from the center,
- a one-pass scan is insufficient.
C.4. Why reversals guarantee recurrence
C.5. Congruence dispersion: the second ergodic pillar
- the offsets do not remain in a single residue class modulo any integer m,
- residue patterns vary across passes,
- arithmetic constraints change over time.
C.6. Why dispersion matters more than randomness
C.8. Positive density as the critical threshold
C.9. Why thin sets can be avoided, but dense sets cannot
C.10. The impossibility of an invariant failure set
- recurrence forces re-entry into central windows,
- dispersion breaks modular stability,
- non-identical passes break alignment.
C.11. Comparison with classical ergodic results
- the success set is large enough to be unavoidable,
- the failure set is unstable and fragmented.
C.12. Why this is not circular reasoning
- prime density near E/2,
- deterministic motion with recurrence and dispersion.
C.13. The role of scale: why log-squared appears
- expected Goldbach representations become positive,
- non-avoidance becomes effective,
- recurrence has room to act.
C.14. Ergodicity without probability
C.15. Implications for Goldbach’s conjecture
- Goldbach’s conjecture is not a lucky coincidence,
- nor a rare arithmetic miracle,
- but the inevitable outcome of symmetric recurrence.
C.16. Summary of Appendix C
Appendix C establishes that:
- Local recurrence ensures infinite exploration of relevant regions.
- Congruence dispersion prevents arithmetic trapping.
- Positive density guarantees non-avoidance.
- Counterexamples require invariant sets that cannot exist.
- Goldbach follows conditionally from weak arithmetic ergodicity.
-
Time is intrinsic, not auxiliaryTime is not used to approximate or randomize primes. It is used to force inevitability. The question becomes whether a structured motion can avoid all prime–prime states forever.
-
Failure requires invariance, not scarcityIn the two-ball framework, Goldbach fails only if failure is invariant under infinite symmetric motion. This reframes the conjecture as a problem in obstruction theory rather than prime detection.
-
Symmetry is dynamic, not staticClassical symmetry arguments consider only the static midpoint. Here, symmetry is preserved at every step of motion, enforcing continual bilateral testing under changing arithmetic conditions.
- symmetry,
- recurrence,
- and congruence dispersion.
- why central regions are revisited infinitely often,
- why residue classes change from pass to pass,
- and why trajectories do not repeat.
- it isolates assumptions,
- shows how each assumption is used,
- and reduces the conjecture to a single remaining structural condition.
- local obstructions exist everywhere,
- but global obstruction is impossible.
- Goldbach’s comet emerges as cumulative success over repeated symmetric passes.
- Prime gaps become irrelevant because the admissible window grows faster than local obstructions.
- Covariance collapses because synchronization cannot persist across non-identical trajectories.
References
- Arnold; Arnold, V. I. Mathematical Methods of Classical Mechanics; Springer-Verlag, 1989. [Google Scholar]
- Birkhoff; Birkhoff, G. D. Proof of the Ergodic Theorem. Proceedings of the National Academy of Sciences 1931, 17, 656–660. [Google Scholar] [CrossRef] [PubMed]
- Bombieri; Bombieri, E. On the Large Sieve. Mathematika 1965, 12, 201–225. [Google Scholar] [CrossRef]
- de la Vallée Poussin, C.-J. Recherches analytiques sur la théorie des nombres premiers. Annales de la Société Scientifique de Bruxelles 1896, 20, 183–256. [Google Scholar]
- Deshouillers; Deshouillers, J.-M.; Effinger, G.; te Riele, H.; Zinoviev, D.; et al. A complete verification of the Goldbach conjecture up to 4 × 10^14. Mathematics of Computation 1997, 68, 793–815. [Google Scholar]
- Devaney; Devaney, R. L. An Introduction to Chaotic Dynamical Systems; Westview Press, 1989. [Google Scholar]
- Furstenberg; Furstenberg, H. Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions. Journal d’Analyse Mathématique 1977, 31, 204–256. [Google Scholar] [CrossRef]
- Granville and Soundararajan; Granville, A.; Soundararajan, K. Large character sums: Pretentious characters and the Pólya–Vinogradov theorem. Journal of the American Mathematical Society 2007, 20, 357–384. [Google Scholar] [CrossRef]
- Green and Tao; Green, B.; Tao, T. The primes contain arbitrarily long arithmetic progressions. Annals of Mathematics 2008, 167, 481–547. [Google Scholar] [CrossRef]
- Hadamard 1896; Hadamard, J. Sur la distribution des zéros de la fonction ζ(s) et ses conséquences arithmétiques. Bulletin de la Société Mathématique de France 1896, 24, 199–220. [Google Scholar] [CrossRef]
- Hardy, G. H.; Littlewood, J. E. Some problems of ‘Partitio Numerorum’; III: On the expression of a number as a sum of primes. Acta Mathematica 1923, 44, 1–70. [Google Scholar] [CrossRef]
- Hardy; Wright; Hardy, G. H.; Wright, E. M. An Introduction to the Theory of Numbers, 5th ed.; Oxford University Press, 1979. [Google Scholar]
- Helfgott; Helfgott, H. A. The ternary Goldbach conjecture is true. Annals of Mathematics 2013, 177, 413–468. [Google Scholar]
- Katok; Hasselblatt; Katok, A.; Hasselblatt, B. Introduction to the Modern Theory of Dynamical Systems; Cambridge University Press, 1995. [Google Scholar]
- Landau; Landau, E. Handbuch der Lehre von der Verteilung der Primzahlen; Teubner, 1909. [Google Scholar]
- Maynard; Maynard, J. Small gaps between primes. Annals of Mathematics 2015, 181, 383–413. [Google Scholar] [CrossRef]
- Montgomery; Montgomery, H. L. The pair correlation of zeros of the zeta function. Proceedings of Symposia in Pure Mathematics 1973, 24, 181–193. [Google Scholar]
- Poincaré; Poincaré, H. Sur le problème des trois corps et les équations de la dynamique. Acta Mathematica 1890, 13, 1–270. [Google Scholar]
- Selberg; Selberg, A. Sieve methods. In Proceedings of the 12th Scandinavian Mathematical Congress, 1947; pp. 65–78. [Google Scholar]
- Sinai; Sinai, Y. G. Introduction to Ergodic Theory; Princeton University Press, 1976. [Google Scholar]
- Tao; Tao, T. The logarithmically averaged Chowla and Elliott conjectures for two-point correlations. Forum of Mathematics, Sigma 2014, 2, e8. [Google Scholar] [CrossRef]
- Tao; Vu; Tao, T.; Vu, V. Additive Combinatorics; Cambridge University Press, 2006. [Google Scholar]
- Tenenbaum; Tenenbaum, G. Introduction to Analytic and Probabilistic Number Theory; Cambridge University Press, 1995. [Google Scholar]
- Vinogradov; Vinogradov, I. M. Representation of an odd number as a sum of three primes. Comptes Rendus de l’Académie des Sciences de l’URSS 1937, 15, 291–294. [Google Scholar]
- Zhang; Zhang, Y. Bounded gaps between primes. Annals of Mathematics 2014, 179, 1121–1174. [Google Scholar] [CrossRef]
- Bahbouhi, B. The Unified Prime Equation and the Z Constant: A Constructive Path Toward the Riemann Hypothesis. Comp Intel CS & Math 2025, 1(1), 01–33. [Google Scholar] [CrossRef]
- Bahbouhi, B. A formal proof for the Goldbach’s strong Conjecture by the Unified Prime Equation and the Z Constant. Comp Intel CS & Math 2025, 1(1), 01–25. [Google Scholar]
- Bouchaib, B. Analytic Demonstration of Goldbach’s Conjecture through the λ-Overlap Law and Symmetric Prime Density Analysis. In Journal of Artificial Intelligence Research and Innovation; 2025; pp. 059–074. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).