Zobrazeno 1 - 10
of 15 132
pro vyhledávání: '"recurrence formula"'
In this paper, we provide a comprehensive solution to the open problem regarding the existence of a recurrence formula for computing fixed points of the Josephus function precisely when the reduction constant is three. Incorporating this formula into
Externí odkaz:
http://arxiv.org/abs/2310.12984
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In [8] (Nakagawa, et.al., IEEE Trans. IT, 2021), we investigated the convergence speed of the Arimoto-Blahut algorithm. In [8], the convergence of the order $O(1/N)$ was analyzed by focusing on the second-order nonlinear recurrence formula consisting
Externí odkaz:
http://arxiv.org/abs/2209.04961
Autor:
Yoritaka Iwata
Publikováno v:
Chaos, Solitons & Fractals: X, Vol 13, Iss , Pp 100119- (2024)
Riccati’s differential equation is formulated as abstract equation in finite or infinite dimensional Banach spaces. Since the Riccati’s differential equation with the Cole–Hopf transform shows a relation between the first order evolution equati
Externí odkaz:
https://doaj.org/article/a37e301dc74b4700bd76b7b3797368e5
Autor:
Iwata, Yoritaka
Publikováno v:
Chaos, Solitons & Fractals: X 13 (2024) 100119
Riccati's differential equation is formulated as abstract equation in finite or infinite dimensional Banach spaces. Since the Riccati's differential equation with the Cole-Hopf transform shows a relation between the first order evolution equations an
Externí odkaz:
http://arxiv.org/abs/2204.00744
We study Newton polytopes of $F$-polynomials in a TSSS cluster algebra $\mathcal A$ and generalize them to a larger set consisting of polytopes $N_h$ for $h\in{\mathbb Z}^n$. The main contribution contains: (i) obtaining a recurrence construction of
Externí odkaz:
http://arxiv.org/abs/2201.01440
Autor:
Nomoto, Keiichiro
Let $p$ be a prime number and $E_{p}$ denote the elliptic curve $y^2=x^3+px$. It is known that for $p$ which is congruent to $1, 9$ modulo $16$, the rank of $E_{p}$ over $\mathbb{Q}$ is equal to $0, 2$. Under the condition that the Birch and Swinnert
Externí odkaz:
http://arxiv.org/abs/2103.08947
In this paper, we investigate the convergence speed of the Arimoto-Blahut algorithm. For many channel matrices the convergence is exponential, but for some channel matrices it is slower than exponential. By analyzing the Taylor expansion of the defin
Externí odkaz:
http://arxiv.org/abs/2009.08780
Autor:
Yanbo Song
Publikováno v:
AIMS Mathematics, Vol 6, Iss 2, Pp 1954-1964 (2021)
The main purpose of this paper is using analytic methods to give a recurrence formula of the number of solutions of an equation over finite field. We use analytic methods to give a recurrence formula for the number of solutions of the above equation.
Externí odkaz:
https://doaj.org/article/93d368b1d9a6487d86456ec612c364c6