SearcharxivSearch

arXiv subjects

Patrick Nyadjo Fonga

Publications and source records attributed to Patrick Nyadjo Fonga.

5 recordsLinked to original sources

Second-Order Accuracy from Large Local Errors in Interface Problems: A Discrete Green's Function Analysis

Finite difference methods for interface problems often exhibit large local truncation errors near the interface, particularly when discontinuities in coefficients or solution derivatives are present. Nevertheless, many such schemes achieve second-order accuracy, a phenomenon not fully explained by standard pointwise consistency arguments. In this work, we provide a precise explanation of this behavior through the structure of the discrete Green's function associated with the underlying conservative difference operator. An explicit representation of the Green's function reveals a two-plateau structure in its weighted increments. By expressing the numerical error in terms of this Green kernel, we show that the dominant interface truncation errors, although individually of order \(O(1)\), possess a cancellation structure that reduces their effective contribution to the global error. The exact Green's-function analysis leads to a class of conservative interface flux--balance schemes for which the cancellation mechanism yields second-order accuracy in the maximum norm. The weighted harmonic discretization is included as a particular member, and its cancellation property is established directly. For Cartesian grids with a flat interface parallel to a coordinate direction, the same conservative cancellation mechanism persists along grid lines crossing the interface. Numerical experiments in one and two dimensions directly illustrate the predicted cancellation behavior and the resulting second-order accuracy. These results demonstrate that second-order accuracy in interface problems can arise from the interaction between localized truncation errors and the global structure of the discrete operator, rather than from pointwise consistency alone.

math.NA

An Immersed Interface Method for Parabolic Interface Problems with Nonlinear Jump Conditions

We develop an immersed interface finite difference method for a one-dimensional nonlinear parabolic interface problem with jump condition \[ [u]_α=λu^+u^-. \] The method combines a Crank--Nicolson immersed interface discretization with an \(s\)-parameter reduction of the nonlinear interface condition, thereby reducing the nonlinear coupling to a scalar quadratic equation. We also discuss two different viewpoints for combining Newton iteration with immersed interface discretization, namely the IIM--Newton and Newton--IIM formulations. Numerical experiments are presented to illustrate the behavior and accuracy of the method.

math.NA

The Multiplicative Persistence Conjecture: Resolving the \(2\)-Adic Obstruction for Nonzero Even Targets

The multiplicative persistence problem studies the process of repeatedly replacing a positive integer by the product of its digits until a single digit, called the terminal digit, is reached. The classical conjecture asserts that no decimal integer requires more than \(11\) iterations. Brier, Clavier, Gutsche, and Naccache proved the conjecture for all odd terminal digits. In their approach to nonzero even terminal digits, they were led to infinite families of decimal integers in which the numbers of digits \(2,\ldots,9\) are fixed, while arbitrarily many digits \(1\) may be inserted. They conjectured that, despite the infinitude of such a family, the exponent of \(2\) dividing its elements is uniformly bounded. We prove this conjecture and obtain an explicit bound depending only on the prescribed digit multiplicities. More generally, our argument applies in every base \(b\geq3\) and to every prime \(p\mid b\). In base \(10\), combining our bound with the method of Brier, Clavier, Gutsche, and Naccache yields a finite algorithm for a further analysis of each nonzero even terminal digit.

math.NT

On Groups of Linear Fractional Transformations Stabilizing Finite Sets of Four Elements

Let $E$ be a subset of the projective line over a commutative field $\mathbb{K}$. When $\mathbb{K}$ has infinite cardinality, it is well known that if $E$ contains at most three elements, then the group of linear fractional transformations preserving $E$ is either infinite or isomorphic to the symmetric group on three elements. In this work, we investigate the case where $E$ consists of four elements. We show that the group of projective linear transformations stabilizing $E$ is, depending on the characteristic of the field $\mathbb{K}$, isomorphic to either the Klein four-group $V_4$, the dihedral group $D_4$ of order eight, the alternating group $\mathfrak{A}_4$ of order twelve, or the symmetric group $\mathfrak{S}_4$ of order twenty-four.

math.NT

Extreme values of the Dedekind zeta function on the critical line

By employing the assessment of the asymptotic size of various sums of Gál studied by La Bretèche and Tenenbaum, we provide an improvement on the recent result of A. Bondarenko, P. Darbar, M. V. Hagen, W. Heap, and K. Seip regarding the large values of the Dedekind zeta-function on the critical line. Specifically, let $d\geqslant 3$ be an integer and $A$ be a positive constant. Denoting $K=\mathbb{Q}(ζ_d)$, we establish that, if $T$ is sufficiently large, then uniformly for $d \ll (\log\log T)^A$, \begin{equation*} \max_{ t \in [0,T]}\left|ζ_K \left(\frac{1}{2}+it \right) \right| \gg \exp\left({(1+o(1))φ(d)} \sqrt{\frac{\log T \log \log \log T}{\log \log T}} \right). \end{equation*}

math.NT