Results 21 to 30 of about 104,121,840 (292)
Recurrence-free survival (RFS), time to first recurrence in any site, and recurrence detection rate.
, 2023 RFS in all patients with high-risk non-muscle-invasive bladder cancer (NMIBC) was evaluated using the Kaplan–Meier method (A). RFS between the highest-risk and high-risk without highest-risk groups was compared using the log-rank test (B).
Yasuhiro Hashimoto (645885) +11 more
core +1 more source
Sigma-function solution to the general Somos-6 recurrence via hyperelliptic Prym varieties [PDF]
, 2016 We construct the explicit solution of the initial value problem for sequences generated by the general Somos-6 recurrence relation, in terms of the Kleinian sigma-function of genus two. For each sequence there is an associated genus two curve \(X\), such
Fedorov, Yuri +3 more
core +1 more source
Towards the Centenary of Sheffer Polynomial Sequences: Old and Recent Results
Mathematics, 2022 Sheffer’s work is about to turn 100 years after its publication. In reporting this important event, we recall some interesting old and recent results, aware of the incompleteness of the wide existing literature. Particularly, we recall Sheffer’s approach,
Francesco Aldo Costabile +2 more
doaj +1 more source
Recurrence relations connecting mock theta functions and restricted partition functions [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 In this paper, we provide some recurrence relations connecting restricted partition functions and mock theta functions. Elementary manipulations are used including Jacobi triple product identity, Euler's pentagonal number theorem, and Ramanujan's theta ...
M. Rana, H. Kaur, K. Garg
doaj +1 more source
On fourth-order jacobsthal quaternions
Journal of Mathematical Sciences and Modelling, 2018 In this paper, we present for the first time a sequence of quaternions of order 4 that we will call the fourth-order Jacobsthal and the fourth-order Jacobsthal-Lucas quaternions. In particular, we are interested in the generating function, Binet formula,
Gamaliel Cerda-morales
doaj +1 more source
Probabilistic recurrence relations revisited
Theoretical Computer Science, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chaudhuri, S., Dubhashi, D.
openaire +4 more sources
Number of spanning trees of some families of graphs generated by a triangle
Journal of Taibah University for Science, 2019 In mathematics, one always tries to get new structures from given ones. This also applies to the realm of graphs, where one can generate many new graphs from a given set of graphs.
S. N. Daoud
doaj +1 more source
Some Determinantal Expressions and Recurrence Relations of the Bernoulli Polynomials
Mathematics, 2016 In the paper, the authors recall some known determinantal expressions in terms of the Hessenberg determinants for the Bernoulli numbers and polynomials, find alternative determinantal expressions in terms of the Hessenberg determinants for the Bernoulli ...
Feng Qi, Bai-Ni Guo
doaj +1 more source
Fibonacci and Lucas Polynomials in n-gon
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 In this paper, we bring into light, study the polygonal structure of Fibonacci polynomials that are placed clockwise on these by a number corresponding to each vertex. Also, we find the relation between the numbers with such vertices.
Kuloğlu Bahar +2 more
doaj +1 more source
Complexity of Some Duplicating Networks
IEEE Access, 2021 There are plentiful ways to duplicate a graph (network), such as splitting, shadow, mirror, and total graph. In this paper, we derive an evident formula of the complexity, a number of spanning trees, of the closed helm graph, the mirror graph of the path
Mohamed R. Zeen El Deen +1 more
doaj +1 more source