Computer Science and Mathematics

Article
Computer Science and Mathematics
Computational Mathematics

Rudraneel Das

Abstract: Let s(n) be the sum of the decimal digits of n and let f(n) = n+ s(n) for odd n and f(n) = n−s(n) for even n. Our main result concerns the 2-cycles of f, which are most of itsobserved cycles. We prove that an odd a lies on a 2-cycle if and only if s(a) is odd and theaddition a+ s(a) produces exactly s(s(a))/9 carries, and we show that this required number iswithin 1/9 of the mean number of carries produced by adding s(a) to a random odd integer (a“carry balance” identity). Combining this with exchangeability of digits, an anti-concentrationlemma for carries and a local limit argument, we prove that the number of 2-cycles below Nis of exact order N/√log log N. In particular 2-cycles have density zero, so their number doesnot grow linearly in N, although numerically they make up most of the observed cycles. Wealso obtain an asymptotic formula for the 2-cycle density with error O((log D)2/√D) below10D. Combining it with an exact formula for the variance of the carry count and a sharp locallimit theorem, we prove an oscillation law: √log10 DT(D)/10D has no limit, its limit pointsform the interval [K0 726/301, K0√6] with K0 = 1/(12√11π), and the peak-to-trough ratiois √301/11 ≈1.577.Along the way we establish several exact structural facts: on multiples of nine, f is con-jugate to m → m±κ(m) with κ(m) = s(9m)/9 given by a digit formula; a general levelequation describes how the digit sum changes under each step; a conditional time-reversal iden-tity f(f(x) + 9) = x+ 9 holds whenever s(x) is even and s(f(x) + 9) = s(x); and the orbit of H·10L + x depends on H only through s(H) while it stays in one prefix block, which yieldsa cycle-counting algorithm with a rigorous error bound. We prove that an orbit is eventuallyperiodic if and only if its digit sums are bounded, and that every run of the orbit along whichthe digit sum stays constant moves it by at most O(k2), where 9k is that digit sum. Using thisand prefix lifting we give a computer-assisted proof that every orbit starting below 102224 iseventually periodic (and, for the binary analogue, every orbit starting below 23024). Whetherevery orbit is eventually periodic remains open. It would follow from a uniform quantitativestrengthening, a conjectured quadratic bound on climbs of auxiliary maps, for which we givenumerical evidence. Finally we treat every base b. In odd bases every orbit reaches 0. In every even base,including base 2 where the carry mechanism takes a different form, the structural results carryover and the 2-cycles again have density of exact order (log D)−1/2, with resonances at the base-b repunits bj−1.

Article
Computer Science and Mathematics
Computational Mathematics

Shereen Anand

Abstract: Congestion-pricing deployments often use simple, mostly static tolls. Recent work shows that with known demand, the revenue loss from doing so is bounded in canonical traffic models, but these guarantees assume the planner knows demand. In practice, demand is estimated from traffic that the toll itself shapes. We study whether simple tolls retain their guarantees under learned demand in a two-period congestion model with linear demand response and several extensions. The objective loss of any plug-in tolling policy is an exact quadratic form in toll error (Lemma 1), yielding the following results. (i) With known demand, the two-period price of simplicity is tight at \( (1+\sqrt2)/(2\sqrt2)\approx0.854 \), attained at demand ratio \( 1+\sqrt2 \); with H periods no constant guarantee holds, since the worst-case ratio decays like \( 4/H_H \) (Theorems 1 and 2). (ii) Estimation error increases the dynamic plug-in's loss relative to its dynamic oracle by at least as much as it increases the static plug-in's loss relative to its static oracle. The dynamic plug-in outperforms the static plug-in exactly when the true toll differential exceeds the root-mean-square error of the estimated differential (Corollary 3); the loss ordering extends to periods coupled by cross-period substitution (Theorem 4). (iii) This simplicity advantage applies to unshrunk plug-in estimators: certainty equivalence is Bayes-optimal in the interior regime, so a Bayesian dynamic planner weakly dominates a Bayesian static planner (Theorem 5), and a one-parameter shrinkage family interpolates between them with closed-form risk (Theorem 6). (iv) The static-optimal toll is identifiable from aggregate flows under one fixed toll, while the dynamic-optimal toll is not identifiable under any interior toll sequence (Propositions 1-2). (v) Under random-walk demand, batched re-estimation has an interior optimal review period; a continuously updated Kalman filter strictly dominates every batched schedule even with revision costs, and a one-time estimate never recovers from a demand shift (Theorems 7 and 8). We verify closed forms with seeded CPU simulations and report discrepancies.

Article
Computer Science and Mathematics
Computational Mathematics

Mohsen Soltanifar

Abstract: This study establishes a systematic geometric characterization of modern Iran's boundaries and associated coastlines within the West Asian continental domain. It provides a reproducible framework for quantifying the scale-dependent complexity of the region's political and maritime frontiers using adaptive-scale methods. For Iran's mainland borders, the analysis yields a box-counting dimension of 1.0714 and a divider dimension of 1.0744. The adjoining regional seashores exhibit higher irregularity; the Caspian Sea coastlines produce fractal dimensions of 1.1120 and 1.1577, while the Persian Gulf's fractal dimensions reach 1.1587 and 1.1742, respectively. Interestingly, all three geographical land and maritime objects occupy broadly intermediate positions within their respective distributions: Iran ranks centrally among its 13 West Asian neighbors, while both regional seas occupy a middle-ground position relative to eighteen published global coastline studies. These findings reveal a hierarchy of boundary intricacy, where marine coastlines consistently demonstrate greater spatial occupancy than terrestrial frontiers. By integrating dual-method estimations with automated scaling, this research offers a substantiated geometric perspective on the Iranian Plateau's position within the broader global cartographic context.

Article
Computer Science and Mathematics
Computational Mathematics

Pham Van Khanh

Abstract: We study uniformity in Goldbach representations and the signed correlations arising in a reflected-prime comparison. From classical analytic inputs we derive a common exceptional set for all compatible residue prescriptions modulo sufficiently small fixed powers of the location parameter. We also prove weighted Type I distribution, convex factor regularity, a mixed prime–rough estimate approaching the square-root scale, a balanced rough-pair asymptotic and an uncentered two-prime upper bound. For a sharp bilinear boundary component, we compute the exact unit mean and coefficient moments, remove a repeated-prime contribution with its variance cross terms, and obtain a restricted Möbius product identity. A lower bound for the rowwise absolute character majorant shows why that particular relaxation cannot deliver arbitrary logarithmic savings. Multiplicative prime-factor markers and a rational-target CRT kernel clarify the remaining distribution requirements. Additional results treat almost-all prime-product representations, a conditional implication for real zeros, and finite paired-congruence criteria. All exceptional sets and unproved hypotheses are retained. The results do not establish the required full signed correlation estimate or resolve the binary Goldbach conjecture.

Article
Computer Science and Mathematics
Computational Mathematics

Dmytro Topchyi

Abstract: In this paper, we consider the properties of the following objects: plafal and geo-space (a general overview). As an application of the created theory, the proof of the equality of complexity classes P and NP will be given. The geo-plafal is a kernel (computational template) of the proof; Khomchenko’ scientific school (the constructive theory of serendipity approximations), Stepanets’ scientific school and the Bogolyubov principle of the decay of correlations for an infinite three-dimensional systems is a shell of the proof.

Article
Computer Science and Mathematics
Computational Mathematics

Vivaan Patni

Abstract: We study the smallest nonnegative diagonal subtraction, supported on at most two sites, that makes the shifted discrete Dirichlet Laplacian positive semidefinite and singular. The size of the subtraction is its Euclidean amplitude norm, equivalently its Frobenius matrix norm. A comparison of Green matrices shows that the optimal sites are the central adjacent pair for even path length and either central adjacent pair for odd path length. For a reflection-symmetric pair, write its Green matrix as \(a\bigl(\begin{smallmatrix}1&q\\q&1\end{smallmatrix}\bigr)\). We give all global minimisers: equal amplitudes are optimal for q greater than or equal to 1/2, whereas two unequal reflected minimisers occur for 0 less than q less than 1/2. For a path of length 2m, this gives a unique shift threshold determined by \(\sinh((m+1)\theta)=2\sinh(m\theta)\); the thresholds increase to 1/2. We also give a quartic characterisation for unequal diagonal Green entries, prove strict improvement when an additional perturbation site is allowed, and derive fixed-shift and diffusive scaling limits. For any fixed support, we parametrise the first-contact boundary by a simplex of nonnegative sources. A thin QR factorisation represents the corresponding unit null vectors on a sphere, preserving their angles; three sites give an exact three-dimensional spherical triangle. We also derive the vector-ratio form of the two-site transition and a standard spectral-gap bound on null-vector sensitivity. Numerical calculations illustrate these statements without asserting a global three-site classification.

Article
Computer Science and Mathematics
Computational Mathematics

Ibar Federico Anderson

Abstract: We study the restricted weighted Goldbach sum \(R_{a,q}(N)\), in which one prime of a representation \(N = p_1 + p_2\) of an even \(N\) is restricted to the residue class \(a\) modulo \(q\). If \(q\) has an odd prime factor \(\ell\), then \(R_{a,q}(N) = O_q(\log N)\) for every even \(N \equiv a \pmod{\ell}\), so the natural main term fails; we give the corrected main term for arbitrary \(q\). For \(q = 2^k\), an exact additive-shift decomposition and a factorisation of the singular-series coefficients, combined with the Siegel–Walfisz theorem and Vaughan's minor-arc bound, give a mean-square estimate with saving \((\log X)^{-A}\) for every fixed \(A > 0\) and an exceptional set of size \(O_{A,q}\big(X(\log X)^{-A}\big)\). A transfer principle yields almost-all theorems along \(p_n + p_{n+1}\), \(p_n + p_{n+d}\) and \(p + h\), with relative accuracy along \(p + h\). For moduli with an odd prime factor the obstruction recurs infinitely often along \(p_n + p_{n+d}\), and for \(q = 3\) we characterise exactly when \(R_{1,3}(p_n + p_{n+1}) = 0\). We also prove a restricted ternary asymptotic with positivity for all large odd \(n\), and, along shifted primes, a limit law for the singular-series amplitude \(\mathfrak{S}_0(p + h)\) given by an explicit random Euler product \(Y_h\), with convergence of all moments, doubly exponentially thin tails and no atoms; for odd \(h\) the normalised restricted Goldbach function has the same limit law. Numerical studies of the digit-repulsion bias between consecutive primes are labelled with their exact range. All theorems are unconditional, except Theorem 3.8, which rests on an imported lemma of Tolev.

Article
Computer Science and Mathematics
Computational Mathematics

Bouchaib Bahboui

Abstract: We introduce a prime-pair segment formalism for the binary Goldbach problem and an algorithmic framework for propagating verified or probable-prime decompositions between consecutive even integers. A segment [p,q] is associated with an even target E=p+q, center m=E/2, half-length d=m−p, and full length L=q−p=2d. A general transition (p,q)↦(p+2k,q+2−2k) preserves the sum E+2, with d↦d+1−2k. The special cases k=1 and k=0 preserve one endpoint and permit computational reuse of an existing primality result when the other endpoint is prime. We describe an auditable implementation with exact enumeration for moderate integers, window-limited searches for larger integers, and explicitly conditional probable-prime results near 10^2000.A supplementary dataset contains 304,259 recorded segment rows for 98 sampled even integers across six base scales. We emphasize that endpoint propagation is an exact identity but not an unconditional primality predictor. We cite twelve separately supplied figures and twelve tables, computational controls, failure modes, and a reproducibility agenda. No claim is made to prove the binary Goldbach conjecture or to exhaustively enumerate representations for enormous targets.

Article
Computer Science and Mathematics
Computational Mathematics

Anwita D Pillai

Abstract: Elementary cellular automata (ECA) are deterministic systems whose global behavior depends on both local update rules and initial states. While local rules are simple, predicting global variability remains a challenge. Here, we quantify this variation across all 256 Wolfram rules using 100 independent random initial states per rule (width 200, 200 updates) and test whether local rule-table descriptors predict the variance. Using mean normalized LZ78 complexity as the trajectory-level outcome, we define the rule-level target as the standard deviation of this score across seeds. Under five-fold cross-validation grouped by symmetry equivalence classes, an enriched ridge model yielded an of 0.0157, demonstrating that local descriptors provide weak predictive performance for global variance. In an exploratory extension, we fit Gaussian mixtures to the LZ scores of ten previously selected rules. Across two lattice widths, held-out trajectories assigned to high- and low-complexity components exhibited repeatable differences in mean density, though a secondary damage-spreading measure showed no significant effects. These results characterize finite-size outcome variability and highlight a repeatable association between LZ-based complexity and density, without establishing distinct dynamical regimes or absolute limits on local prediction.

Article
Computer Science and Mathematics
Computational Mathematics

Milan Škarić

,

Aleksandar Ivanović

,

Miloš Radenković

,

Sergei Prokhorov

,

Aleksandra Labus

,

Božidar Radenković

Abstract: As AI-enabled software becomes agentic and evolutive, we formulate a structural sufficiency condition and two execution-level requirements for accountable evolution: fixed-regime execution must remain within a standard Borel representation closed under finite/countable products required by local execution and path construction (S0); governing changes must be executable within the same apparatus they govern (R1); and every admitted act must remain deterministically verifiable from the context and governing specification under which it was admitted (R2). We develop a calculus for interacting executable binary relations. Execution uses an asymmetric epistemic–ontological–eschatological (OEE) structure: an append-only context records admitted events; a partial single-valued realization yields at most one candidate per invocation; a Boolean criterion decides admission; and fixed Axiom 0 records admissible realizations. Standard Borel product closure provides the measurable carrier for local execution, while repeated Axiom 0 defines Eschatological Induction; Zermelo–Fraenkel coding separately enforces rank discipline. Under stated assumptions, we discharge S0, establish common admission semantics for governance and operation under OEE closure, and obtain deterministic verification replay. The fixed-regime path space has a countable/perfect dichotomy. Axiom 0 invokes no global choice selector; that problem appears only after projection to the coordinate-free relational reduct. Fixed-point and recursive-descent results require separate monotonicity and well-foundedness assumptions.

Article
Computer Science and Mathematics
Computational Mathematics

Latchezar Tomov

,

Nedelcho Ganchovski

Abstract: The modified Anderson–Björck (modAB) method was first proposed in 2023 by Ganchovski and Traykov for solving nonlinear equations in structural mechanics. It was improved in 2026 with better switching criteria that account for function symmetry and a bisection fallback based on the bracket reduction rate. Although the algorithm performed well in benchmarks, it lacked formal mathematical analysis and proof of convergence. Later analysis by L. Tomov showed some inconsistencies like premature endpoint corrections on the first AB step, and the use of corrected ordinates in the symmetry factor calculation instead of the true residuals. This paper removes the above inconsistencies, provides a proof of global convergence in exact arithmetic, and adds floating-point safeguards for interpolation, method switching and convergence checks, with explicit treatment of infinite and NaN values, underflow, overflow and round-off errors. As a result, the reliability of the algorithm is improved. Performance is also enhanced by an adaptive bisection fallback when AB fails to reduce either the bracket width or the residual, keeping a finite bound on residual reducing steps. Numerical experiments were conducted for an extended set of 100 functions.

Article
Computer Science and Mathematics
Computational Mathematics

Ibar Federico Anderson

Abstract: For \(q = 2^k\) and \(\gcd(a,q)=1\) let \(R_{a,q}(N)=\sum_{p_1+p_2=N,\ p_1\equiv a\ (q)} (\log p_1)(\log p_2)\) be the restricted weighted Goldbach sum, with candidate main term \(M_{a,q}(N)=\frac{2C_2}{\varphi(q)}\,\mathfrak{S}(N)\,N\) and exceptional set \(\mathcal{E}_{a,q}(X)=\{N\le X \text{ even}: R_{a,q}(N)=0\}\). We first prove, by the circle method with the additive-shift decomposition of the sum over a progression modulo \(2^k\), an exact evaluation of the singular series of the progression and the mean-square bound \(\sum_{N\le X}\left|R_{a,q}(N)-M_{a,q}(N)\right|^{2}\ll_{A,q} X^{3}(\log X)^{-A}\) for every \(A>0\), hence \(\#\mathcal{E}_{a,q}(X)\ll_{A,q} X(\log X)^{-A}\). Writing \(p_n\) for the \(n\)-th prime, \(g_n=p_{n+1}-p_n\) and \(N_n=p_n+p_{n+1}\), we then prove an elementary transfer principle: if \(f\) maps a set of indices injectively (or with bounded multiplicity) into the even integers with at most linear growth, the number of indices $n\le X$ with \(R_{a,q}(f(n))=0\) is at most a bounded multiple of \(\#\mathcal{E}_{a,q}(\kappa X+\lambda)\). The consequences are uniform in the residue class ("ray") of \(p_n\) modulo \(q\) and cover \(N_n=p_n+p_{n+1}\), \(p_n+p_{n+k}\) and the shifted primes \(p+h\) with \(h\) odd; each of these sets of even integers has a restricted Goldbach representation for almost all primes in every ray, with a saving of every power of \(\log X\). We record which of the representations are trivial (a summand equal to \(p_n\) or \(p_{n+1}\)). For a modulus \(q\) with an odd prime factor \(\ell\) we prove that \(N_n\equiv a\ (\ell)\) is a condition on the pair of rays of \(p_n\) and \(p_{n+1}\), that \(R_{a,q}(N_n)=O(\log N_n)\) on that set, and, by a theorem of Shiu, that this set is infinite; for \(q=3\) we verify that \(R_{a,q}(N_n)=0\) if and only if \(N_n\equiv 1\ (3)\) and \(N_n-3\) is composite. The digit-repulsion bias of Lemke Oliver and Soundararajan is documented on 5,761,451 consecutive pairs below \(10^8\), together with the dependence of the mean gap on the ray of origin, a fit of the cumulative admissibility function with closed-form constants, and a comparison of the mod-3 joint frequencies with the Lemke Oliver–Soundararajan prediction at four scales up to \(10^9\). Next, the relative second moment of \(R_{a,q}(N)-M_{a,q}(N)\) depends on \(N\) modulo \(q\) through the symmetry \(p_1\leftrightarrow p_2\): for $N\equiv 2a\ (q)$ the variance ratio is 2.0 to 2.1 for \(q=16,32\) and within two standard errors of 2 for every class tested at \(q=8,16,32\). Along \(N_n\) this class effect, together with the residues of \(N_n\) modulo 3 and 5, predicts the second moment by ray of \(p_n\) to within 3% overall, and a recipe fixed in advance at \(q=16\) predicts the level, the spread among the eight rays, and the pattern across rays with correlation 0.96. In a temporal split of the primes below \(10^8\) the last ray predicts the next ray with accuracy 0.311 against 0.25, while the rays of the past explain at most 0.19% of the variance of the normalised gap. Finally, the amplitude \(\mathfrak{S}(p+h)\) of the main term along shifted primes has a limit law given by an explicit random Euler product \(Y_h\), with convergence of all moments, an entire moment generating function, a doubly exponentially thin upper tail, and no atoms. Every statement carries an explicit status label. This paper continues [18]: it restates its local-obstruction theorem and strengthens its second-moment estimate to a saving of every power of \(\log X\); Section 1.5 records the precise relation.

Concept Paper
Computer Science and Mathematics
Computational Mathematics

Angad Basandrai

Abstract: We study safe opponent exploitation in discrete Colonel Blotto games with heterogeneous battlefield values. We investigate the characterization of gifts: pure opponent allocations which are not the best response to at least one equilibrium strategy and hence can be exploited without losing the equilibrium safety guarantee. First, for an even number of equal-value battlefields, we consider the weaker divisibility condition \( n\mid 2B \), rather than \( n\mid B \), under which a paired equilibrium with uniform marginals is known to exist, and we establish the corresponding gift boundary \( \max_j\;X_j>2B/n \). We then show that the natural extension of this boundary to heterogeneous battlefields is not universally valid by giving exact counterexamples in both directions. We also provide a condition on equilibrium marginals and their coupling under which the boundary is recovered, and show on small instances that the validity of the boundary depends on the budget as well as on the battlefield values. Finally using best response oracles and constraint generation over the equilibrium polytope, we apply our equilibrium and safe exploitation framework to five public Riddler Blotto populations, quantifying the tradeoff between unconstrained exploitation and exploitation subject to the equilibrium safety guarantee.

Article
Computer Science and Mathematics
Computational Mathematics

Xing-Yu Hu

Abstract: Let G be a finite simple graph, let \( m = (m_v)_{v∈V(G)} \) with \( m_v ≥ 1 \), and form \( G^m \) by attaching \( m_v \) pendant vertices at each \( v \). For the weighted adjacency matrix \( A_φ(G^m) \) induced by a real symmetric degree-dependent edge weight φ, a generalized Fiedler-type decomposition gives M − n forced zero eigenvalues and \( χ_{A_φ(G^m)}(λ) = λ^{M−n} det(λ²I_n − λB_φ − R_φ) \).Here \( n = |V(G)| \), \( M = ∑_v m_v, B_φ \) is the core block formed from the core-vertex degrees in the thorny graph, and \( R_φ \) is diagonal with squared pendant-fiber couplings. The decomposition gives an arbitrary-core nullity bound, exact nullity and inertia for nonzero pendant couplings, Cauchy interlacing with \( B_φ \), and a 2n-dimensional compression independent of M. For fixed r ≥ 1, m, and φ, the nonzero weighted spectrum of a uniform attachment to an r-regular core determines the core adjacency spectrum whenever the induced core-edge weight is nonzero. On connected walk-regular cores, let exceptional vertices receive m + q rather than m pendant vertices. For independent exceptional sets S, T with |S| = |T| ≥ 2, all moments below twice the smaller minimum separation agree for every real symmetric φ. If the separations differ, then at the first possible mixed order the moment of the smaller-separation placement minus that of the larger-separation placement is an explicit nonnegative multiple of a sum of squared geodesic counts. If the ordinary–ordinary core-edge weight is nonzero and its square differs from that of the exceptional–ordinary core-edge weight, the spectrum determines the minimum separation. On distance-regular cores, it also determines the closest-pair count. Both the ordinary Sombor and Randić weights satisfy this condition.

Article
Computer Science and Mathematics
Computational Mathematics

Xing-Yu Hu

Abstract: We prove that every neighborhood assignment on a charming space \( X \) has a countable kernel whose closure in \( X \) is Lindelöf \( \Sigma \). For a neighborhood assignment \( P \) on \( X \) and a set \( A\subseteq X \), write \( P[A]=\bigcup_{a\in A}P(a) \). Consequently, for any two neighborhood assignments \( M \) and \( N \) on \( X \), there is a closed discrete set \( D\subseteq X \) such that \( M[N[D]]=X \). The \( D \)-property also admits an exact one-step reduction to covering a fixed Lindelöf \( \Sigma \) kernel by assigned neighborhoods centered at an ambient closed discrete set. The condition that every neighborhood assignment \( \varphi \) on \( X \) admit a pointwise square refinement, meaning a neighborhood assignment \( V \) on X\( X \) with \( V[V(x)]\subseteq\varphi(x) \) for every \( x\in X \), is exactly the classical \( z \)-space condition formulated in terms of normal neighbornets. For a continuous closed surjection \( p:Z\to X \), a fixed neighborhood assignment \( \varphi \) on \( X \) has a pointwise square refinement on \( X \) if and only if there is a neighborhood assignment \( V \) on \( Z \) such that \( p(V[V(z)])\subseteq\varphi(p(z)) \) for every \( z\in Z \). Every uncountable weakly hereditarily finally covering (\( \mathrm{HFC}_{\mathrm w} \)) subspace of \( [\omega_1]^{\leq\omega} \) has a closed countable kernel for every neighborhood assignment but is not charming. For each Lindelöf \( \Sigma \) kernel \( Y \) of X\( X \), put \( B=\overline Y^{\,X} \) and \( H=\overline{B\setminus Y}^{\,B} \). The Hu--Yin boundary obstruction is then \( B\setminus Y \). The space \( X \) has a closed Lindelöf \( \Sigma \) kernel exactly when there is a Lindelöf \( \Sigma \) kernel \( Y \) such that, with \( B=\overline Y^{\,X} \) and \( H=\overline{B\setminus Y}^{\,B} \), the set \( H\cap Y \) is \( G_\delta \) in \( H \). For any fixed Lindelöf \( \Sigma \) kernel \( Y \), the closed-core reduction can be iterated. At every stage, the current iterate is a \( D \)-space if and only if \( X \) is a \( D \)-space. The iteration reaches the largest closed subspace in which the kernel trace and its complement are both dense, and it stabilizes before the successor of the hereditary Lindelöf number of \( Y \). This bound is sharp. For each infinite cardinal \( \kappa \), every \( \gamma<\kappa^+ \) occurs as the first stabilization stage for a compact space with a dense \( \sigma \)-compact Lindelöf \( \Sigma \) kernel whose cardinality and hereditary Lindelöf number are both \( \kappa \). The general charming-space \( D \)-problem remains open.

Article
Computer Science and Mathematics
Computational Mathematics

Jolly K. John

Abstract: The Bakshali formula for square root extraction is an amazing achievement of ancient Indian mathematics. Understanding the logic behind the Bakshali formula as a cycle of approximation, error determination, correction, and new approximation, a Bakshali algorithm for square root extraction in two variables (the approximation Xn and its correction Yn ) is presented. The recursive algorithm extendable to any depth n leads to Bakshali-type formulas of high orders of convergence that goes as 2n, where n=1,2,3, …. . The Bakshali algorithm is streamlined by recasting it into a transformed form with three variables (yn, tn, zn). The transformed Bakshali algorithm runs by generating integer sequences with no division in the stages and a single division at the end. It obeys the exact invariant zn2 − N tn2 = yn2, which places every iterate on a Pell conic and gives closed forms for the iterate and its error, and the order of convergence 2n. The iterates coincide with those of Newton’s method in rational form, but the route does not. The correction term of Bakshali algorihm is such the new residual is exactly the square of the correction. This exact error transfer builds stages that no longer involve N and save at least half a squaring each. For an integer radicand and an integer seed every stage is exact. Three consequences follow: the number of correct digits after each stage is known in advance; the integers never exceed the accuracy they deliver by more than one digit, so no precision schedule is needed; and a rigorous enclosure of the error follows from the algorithm’s own variables alone, at no extra cost. Nested versions with 8-fold and 16-fold convergence are demonstrated. In five 16-fold iterations, square root of a 5 digit number is obtained to more than 2.8 million correct digits, and in seven 8-fold iterations 5.6 million correct digits are obtained.

Article
Computer Science and Mathematics
Computational Mathematics

Samiksha B. C.

,

Mohammad I. Merhi

,

Eric Raymond

,

Tika Puri

Abstract: Can simple spectral properties of a quantum gate, computed classically from its eigenvalues, predict how well quantum phase estimation (QPE) performs on that gate? We study three spectral features, a normalised Spectral Coherence Metric (SCM), the spectral gap, and a circular phase spread, using ideal Qiskit Aer simulations of 1,756 two-qubit gates (1,000 Haar-random unitaries plus three controlled spectral classes) for m = 3, 4, 5 ancilla qubits and three independent random seeds. All prediction targets are measured from simulated QPE circuits. When QPE is run on single eigenstates, the spectral features have no predictive power for the estimation error (cross-validated R2 ≤ 0), because that error is fixed by the position of each eigenphase on the 2m-point measurement grid. When the target register is prepared in an equal superposition of eigenvectors, the spectral features do predict eigenvalue resolvability, the fraction of eigenphases that appear as separate peaks: for Haar-random gates with m = 4, a random forest reaches R2 = 0.633 ± 0.020, and the spectral gap dominates the feature importance (0.88). However, a parameter-light physical baseline that counts gaps larger than a multiple of the grid spacing 2π/2m matches the learned models in accuracy and exceeds them in balanced accuracy (0.78 versus at most 0.63). We conclude that spectral structure, through the spectral gap, governs resolvability in superposition-input QPE in the way expected from the standard resolution limit, and that machine learning adds little beyond this physical rule.

Article
Computer Science and Mathematics
Computational Mathematics

Diego Restrepo-Leal

,

Maryam Carrillo-Reales

,

Adalberto Ospino-Castro

,

Carlos Robles-Algarín

,

Miguel E. Iglesias-Martínez

,

Pedro Fernández-de-Córdoba

Abstract: Reconstructing missing values in meteorological time series is essential for reliable renewable-energy assessment, but on-device imputation must respect the power, memory and latency budget of edge hardware. We benchmark 46 PyPOTS imputation models—four naïve baselines, TRMF and 41 neural networks—on two tropical coastal stations (UCC and CUC, Colombian Caribbean) resampled to 15 min and subjected to a PyGrinder missingness scenario, running each model on an NVIDIA Jetson Orin Nano (25 W) and measuring MAE, RMSE, power, memory and time. A hybrid Entropy–CRITIC weighting scheme with TOPSIS and MARCOS ranked the alternatives. The best neural networks cut the mean-imputer error by 40–45% (MAE) and 28–40% (RMSE), yet resource usage spanned two orders of magnitude, uncorrelated with accuracy (|ρ|≤0.15). Because both methods placed 64–76% of the weight on resource criteria, naïve baselines and TRMF topped the station-averaged and UCC rankings, TiDE was the most rank-stable neural network, and SCINet led at CUC under the untuned configuration. TOPSIS and SPOTIS agreed closely (ρ≥0.98); MARCOS agreed moderately with both (ρ≈0.68–0.93). Station-to-station agreement was low for TOPSIS (ρ=0.52)—a confound rather than a station effect: the same masking configuration produced an asymmetric gap structure at the shorter, previously incomplete UCC record and a uniform one at the longer, complete CUC record, so station-level conclusions are not directly comparable. An automated per-model hyperparameter-search protocol, which reorders the CUC top, is provided in an appendix. These results offer a reproducible, hardware-validated framework for edge-constrained imputation model selection.

Article
Computer Science and Mathematics
Computational Mathematics

Riccardo Sacco

Abstract: In this article we solve the diffusion-advection-reaction model problem with Robin boundary conditions in an open bounded domain Ω∈Rn, with n=1,2,3. For the discretization, we use the mixed-hybrid finite element method of lowest order on a simplicial partition of Ω¯. To prevent the occurrence of spurious unphysical oscillations we numerically evaluate the local bilinear form with a quadrature that is equivalent to introducing an optimal amount of artificial diffusion on each edge of the simplex. The resulting scheme is monotone and flux-conservative and is able to compute accurate solutions even with a corse mesh. The robustness and accuracy of the method is demonstrated on examples in Rn, n=1,2,3, characterized by the presence of steep boundary and internal layers.

Article
Computer Science and Mathematics
Computational Mathematics

Okaile Rodney Marumo

,

Mavuna Sebapalo

,

Tshepo Gobonamang

,

Kabo Nkabiti

Abstract: A fixed-time stabilizer for underactuated Euler–Lagrange systems was established in Part 1 of this study , which certified fixed-time reaching on the actuated manifold and supplied a separate certificate for the internal dynamics. This paper asks what that certificate costs and what it buys. We decompose the total settling time into the reaching time governed by the certificate and an internal transient governed by the plant, and show that the two obey different constraints: the settling bound depends on the reaching gains alone and tightens exactly in inverse proportion to their scale, whereas the unactuated coordinate obeys a rate limit fixed by the coupling authority and is untouched by those gains. We prove that this forces a strictly positive floor on total settling time as the gains grow without bound, and we measure that floor to be far more binding in practice than the proof alone guarantees. On the translational oscillator with rotational actuator, scaling the reaching gains over a range of 13.3 tightens the analytical bound by a factor of 13.3 while the full-state settling time improves by 6.0% and the control energy rises by 53%. The floor is not an artifact of actuator saturation: with the actuation limit raised a hundredfold the same gain range still moves settling by only 11.4%. It is not an artifact of the plant either, since the cart-pole shows the separation more sharply, nor of the reaching-law gain family specifically, since settling varies by only 7.0% across a 49-design two-dimensional sweep over which the bound varies by a factor of 53.3. The floor is likewise unchanged at 1% and 5% settling tolerances, across a sixteenfold range of parametric mismatch including its sign, and under bounded disturbances, which the certified channel absorbs completely while the internal channel does not. A search over all eight controller parameters, a sampled-data implementation with measurement noise and torque quantization, three further cost metrics, and a fourfold finer sweep leave the result and the parity finding intact, and show that the designs that buy a tight certificate are also the ones that chatter and amplify noise. The bound itself is valid throughout, honoured by every design with margins between 62% and 95% once the event it governs is identified correctly. A matched-performance protocol puts the fixed-time law and its linear counterpart at energy parity, with ratios between 0.934 and 1.128. By contrast, increasing the coupling authority eightfold makes the response 7.4 times faster while reducing the energy integral by a factor of 14.6. The resulting design rule is to select gains against the guarantee that must be certified and to treat achievable response speed as a question about coupling authority rather than about feedback gain.

of 23