Related papers: Simultaneous approximations to p-adic numbers and …
We consider conditions for the convergence of sequences in terms of positive and alternating Perron expansions ($P$-representation and $P^-$-representation). These conditions are crucial to determine the continuity of functions that are…
Local meshless methods obtain higher convergence rates when RBF approximations are augmented with monomials up to a given order. If the order of the approximation method is spatially variable, the numerical solution is said to be p-refined.…
We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…
In this paper, we extend the work of Abbondati et al. (2024) on decoding simultaneous rational function codes by addressing two important scenarios: multiplicities and poles (zeros of denominators). First, we generalize previous results to…
A classical result of Khinchin says that for almost all real numbers $\alpha$, the geometric mean of the first $n$ digits $a_i(\alpha)$ in the continued fraction expansion of $\alpha$ converges to a number $K = 2.6854520\ldots$ (Khinchin's…
Some Caputo q-fractional difference equations are solved. The solutions are expressed by means of a new introduced generalized type of q-Mittag-Leffler functions. The method of successive approximation is used to obtain the solutions. The…
The distribution of $\alpha p$ modulo one, where $p$ runs over the rational primes and $\alpha$ is a fixed irrational real, has received a lot of attention. It is natural to ask for which exponents $\nu>0$ one can establish the infinitude…
We solve the convergence case of the generalized Baker-Schmidt problem for simultaneous approximation on affine subspaces, under natural diophantine type conditions. In one of our theorems, we do not require monotonicity on the…
In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…
Feedforward computation, such as evaluating a neural network or sampling from an autoregressive model, is ubiquitous in machine learning. The sequential nature of feedforward computation, however, requires a strict order of execution and…
Let $\mathbb{Z}_p$ be the ring of $p$-adic integers and $a_n(x)$ be the $n$-th digit of Schneider's $p$-adic continued fraction of $x\in p\mathbb{Z}_p$. We study the growth rate of the digits $\{a_n(x)\}_{n\geq1}$ from the viewpoint of…
Our goal is to show that both the fast and slow versions of the triangle map (a type of multi-dimensional continued fraction algorithm) in dimension $n$ are ergodic, resolving a conjecture of Messaoudi, Noguiera and Schweiger. This…
Considering an arbitrary pair of distinct and non constant polynomials, $a$ and $b$ in $\mathbb{F}_2[t]$, we build a continued fraction in $\mathbb{F}_2((1/t))$ whose partial quotients are only equal to $a$ or $b$. In a previous work of the…
In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of…
Full history recursive multilevel Picard (MLP) approximations have been proved to overcome the curse of dimensionality in the numerical approximation of semilinear heat equations with nonlinearities which are globally Lipschitz continuous…
There is a theory of continued fractions for Laurent series in x^{-1} with coefficients in a field F. This theory bears a close analogy with classical continued fractions for real numbers with Laurent series playing the role of real numbers…
This paper introduces the multiplicative variant of the recently proposed asynchronous additive coarse-space correction method. Definition of an asynchronous extension of multiplicative correction is not straightforward, however, our…
It has been a long standing problem to find good symbolic codings for translations on the $d$-dimensional torus that enjoy the beautiful properties of Sturmian sequences like low factor complexity and good local discrepancy properties.…
Multivariate partial fractioning is a powerful tool for simplifying rational function coefficients in scattering amplitude computations. Since current research problems lead to large sets of complicated rational functions, performance of…
Computational molecular design requires binding arrangements that are not only energetically favorable but also chemically realizable. However, computational methods remain limited in directly recovering fragment pose pairs that can later…