MathSciDoc: An Archive for Mathematician ∫

The Prime Density Triangle offers a novel combinatorial framework for exploring properties of prime numbers. From the algebraic relations embedded within this triangle, specifically the coupled expressions X^p1± p1and X^p0± p0, we derive two closed-form sequences.First, the multiplication of these expressions yields the sequence Sn(m) = (mn+ n2)1/(n+2), which converges to m. Second, by a deliberate construction—replacing the additive denominator n + 2 with the multiplicative denominator 2n—we obtain the Exponential-Polynomial Root Mean (EPRM) defined by Rn(m) = (mn+ n2)1/(2n) for m > 0 and n ∈ N. This construction provides a closed-form, non-iterative method for approximating √m for sufficiently large n. In this paper, we present a complete derivation of both sequences from the Prime Den- sity Triangle’s algebraic frameworks, rigorous convergence proofs including asymptotic error analysis, detailed worked examples for m = 2, 3, 5 with explicit computations, numerical summary tables, explicit iterations for classical methods (Babylonian and Newton-Raphson), and a comprehensive comparison. The approach is elementary and highlights the dominance of exponential terms over polynomial corrections.

This is a security testing abstract for MathSciDoc archive vulnerability assessment.

This paper investigates the sum of all non-Fibonacci integers that lie strictly between consecutive Fibonacci numbers. Starting from the operation a(n) = Mn− Fn, where Mn is that sum and Fn the preceding Fibonacci number, we obtain a sequence whose first three terms are themselves Fibonacci numbers: 1, 8, 34. We extend the exploration to seven other arithmetic operations (subtracting the next Fibonacci, adding either, multiplying either, and dividing either), and we systematically search for Fibonacci numbers that appear in each resulting sequence. We term such Fibonacci entries “lucky Fibonacci numbers”. Among all variants, only the addition and subtraction operations yield any lucky Fibonacci numbers: 1, 8, 34 (subtract previous), 5 (subtract next, ignoring the negative initial term), 21, 55 (add next), and none for add previous, nor for multiplication or division. We then apply the same gap-summing idea to other recurrent sequences: Lucas, Pell, and Tribonacci. For each, we find a small set of lucky Fibonacci numbers. All conjectures are verified computationally up to n = 200 (and up to Fibonacci F400), with no further hits found. The growth rates are exponential, making further coincidences increasingly improbable.

We introduce a triangular array of integers defined by a(n, k) = k(k + 1)n−k for n ≥ 1 and 1 ≤ k ≤ n, which we call the researcher’s triangle. The construction is multiplicative and differs from classical additive triangles such as Pascal’s. We give combinatorial interpretations using a leaders-followers model and a rooted hierarchical structure model. We identify several diagonal sequences as classical figurate numbers, including powers of two (A000079), natural numbers (A000027), and oblong numbers (A002378), and establish connections to triangular and tetrahedral numbers. We derive a bivariate generating function and a recurrence relation, and we discuss the row sums.

We introduce the prime density triangle, a multiplicative array constructed by a modified rule of indices. Two display formats are given: a right-angle triangle with converted and unconverted entries, and an equilateral triangle obtained by mirroring the right-angle triangle about the central term xn. We derive the row-sum generat- ing function and provide worked examples using both direct computation and the generating function. Using a four-rule division scheme applied to the unconverted rows we obtain the sequence whose integer parts sum to the magic numbers for two spin orientations. Replacing the repeated end integers by 1,1 yields integer parts that give the standard harmonic oscillator (HO) magic numbers and, in conjunction with the two-spin-orientation nucleon magic numbers, gives precisely the standard nuclear magic numbers 2, 8, 20, 28, 50, 82, 126, 184. Furthermore, digital-root reduc- tion of the converted triangle reveals a distinct “4,9,9” pattern whose diagonals concatenate into large primes, establishing a direct arithmetic link between prime distribution and the symmetry conditions of nuclear shell closures. Subshell filling up to x9, deductions, and evidence from nuclear physics are included. A recurrence M = m ± [(n1n2) + 2] is presented for generating further magic numbers.The sequences appear as OEIS A005897, OEIS A018226 and OEIS A007290.

In a former paper we proposed a model for the quantization of gravity by working in a bundle $E$ where we realized the Hamilton constraint as the Wheeler-DeWitt equation. However, the corresponding operator only acts in the fibers and not in the base space. Therefore, we now discard the Wheeler-DeWitt equation and express the Hamilton constraint differently, either with the help of the Hamilton equations or by employing a geometric evolution equation. There are two possible modifications possible which both are equivalent to the Hamilton constraint and which lead to two new models. In the first model we obtain a hyperbolic operator that acts in the fibers as well as in the base space and we can construct a symplectic vector space and a Weyl system. In the second model the resulting equation is a wave equation in $\so \times (0,\infty)$ valid in points $(x,t,\xi)$ in $E$ and we look for solutions for each fixed $\xi$. This set of equations contains as a special case the equation of a quantized cosmological Friedman universe without matter but with a cosmological constant, when we look for solutions which only depend on $t$. Moreover, in case $\so$ is compact we prove a spectral resolution of the equation.

No abstract uploaded!

No abstract uploaded!

This research provides insights for the separation of cryptocurrencies from other assets. Using dimensionality reduction techniques, we show that most of the variation among cryptocurrencies, stocks, exchange rates, commodities, bonds, and real estate indexes can be explained by the tail, memory and moment factors of their log-returns. By applying various classification methods, cryptocurrencies are categorized as a separate asset class, mainly due to the tail factor. The main result is the complete separation of cryptocurrencies from the other asset types, using the Maximum Variance Components Split method. Additionally, we show that cryptocurrencies tend to exhibit similar characteristics over time and become more distinguished from other asset classes (synchronic evolution).

We show that the pre-order defined on the category of contact manifolds by arbitrary symplectic cobordisms is considerably less rigid than its counterparts for exact or Stein cobordisms: in particular, we exhibit large new classes of contact 3-manifolds which are symplectically cobordant to something overtwisted, or to the tight 3-sphere, or which admit symplectic caps containing symplectically embedded spheres with vanishing self-intersection. These constructions imply new and simplified proofs of several recent results involving fillability, planarity, and non-separating contact type embeddings. The cobordisms are built from symplectic handles of the form Σ × D and Σ × [−1, 1] × S1, which have symplectic cores and can be attached to contact 3-manifolds along sufficiently large neighborhoods of transverse links and preLagrangian tori. We also sketch a construction of J-holomorphic foliations in these cobordisms and formulate a conjecture regarding maps induced on Embedded Contact Homology with twisted coefficients.