Results 301 to 310 of about 3,674,543 (358)
Some of the next articles are maybe not open access.
Constructing five qutrit absolutely maximally entangled state via recurrence relation
Laser physics, 2020Recently, Che et al presented a recurrence relation of multi-qubit states. Regarding this inspiration, we give and extend the recurrence relation of multi-qubit states to the recurrence relation of maximally qutrit entangled states.
X. Zha, Irfan Ahmed, Yanpeng Zhang
semanticscholar +1 more source
Nutrition reviews, 2020
CONTEXT Recent studies have outlined the potential role of dietary factors in patients who have survived cancer. OBJECTIVE The aim of this study was to summarize the evidence of the relation between dietary intake of phytoestrogens and their blood ...
A. Micek +9 more
semanticscholar +1 more source
CONTEXT Recent studies have outlined the potential role of dietary factors in patients who have survived cancer. OBJECTIVE The aim of this study was to summarize the evidence of the relation between dietary intake of phytoestrogens and their blood ...
A. Micek +9 more
semanticscholar +1 more source
2016
In the upcoming chapter we introduce recurrence relations. These are equations that define in recursive fashion, via suitable functions, the terms appearing in a real or complex sequence. The first section deals with some well-known examples that show how these relations may arise in real life, e.g., the Lucas Tower game problem or the death or life ...
Mariconda C., Tonolo A.
openaire +2 more sources
In the upcoming chapter we introduce recurrence relations. These are equations that define in recursive fashion, via suitable functions, the terms appearing in a real or complex sequence. The first section deals with some well-known examples that show how these relations may arise in real life, e.g., the Lucas Tower game problem or the death or life ...
Mariconda C., Tonolo A.
openaire +2 more sources
Journal of Chemical Physics, 2015
An efficient algorithm for the rapid evaluation of electron repulsion integrals is proposed. The present method, denoted by accompanying coordinate expansion and transferred recurrence relation (ACE-TRR), is constructed using a transfer relation scheme ...
Masao Hayami, Junji Seino, H. Nakai
semanticscholar +1 more source
An efficient algorithm for the rapid evaluation of electron repulsion integrals is proposed. The present method, denoted by accompanying coordinate expansion and transferred recurrence relation (ACE-TRR), is constructed using a transfer relation scheme ...
Masao Hayami, Junji Seino, H. Nakai
semanticscholar +1 more source
Proceedings of the Edinburgh Mathematical Society, 1938
It is proposed here to consider the sequence un determined by the relationwhere, in particular,and initially u1 = θ1. The following is the main result to be proved.
openaire +2 more sources
It is proposed here to consider the sequence un determined by the relationwhere, in particular,and initially u1 = θ1. The following is the main result to be proved.
openaire +2 more sources
2016
In the following chapter we address the techniques for the resolution of some celebrated recurrence relations. We will discuss in detail the linear recurrences with constant coefficients. Our emphasis goes to the application of the theory: the proofs, though elementary, are relegated to the end of the chapter.
Mariconda C., Tonolo A.
openaire +2 more sources
In the following chapter we address the techniques for the resolution of some celebrated recurrence relations. We will discuss in detail the linear recurrences with constant coefficients. Our emphasis goes to the application of the theory: the proofs, though elementary, are relegated to the end of the chapter.
Mariconda C., Tonolo A.
openaire +2 more sources
On Certain Recurrence Relations
Mathematische Nachrichten, 1970AbstractIn this paper first we establish six recurrence relations for the H‐function with the help of certain formulae concerning generalized BESSEL function. Later on, we obtain recurrence relations for MEIJER'S G‐function, GAUSS'S hypergeometric function and BESSEL function.
K. C. Gupta, Aruna Srivastava
openaire +2 more sources
Algorithmica, 1996
We examine three quantities related to heaps: the number of heaps withn nodes, the number of permutations generating the same heap, and the average number of exchange operations necessary for generating a heap from a given permutation. We find recurrence relations for these quantities, and are thus able to compute them in timeO(lnn). We also obtain the
openaire +2 more sources
We examine three quantities related to heaps: the number of heaps withn nodes, the number of permutations generating the same heap, and the average number of exchange operations necessary for generating a heap from a given permutation. We find recurrence relations for these quantities, and are thus able to compute them in timeO(lnn). We also obtain the
openaire +2 more sources