Results 81 to 90 of about 7,643 (187)
MathematicsThe determination of the distributions of the eigenvalues associated with matrix-variate gamma and beta random variables of either type proves to be a challenging problem. Several of the approaches utilized so far yield unwieldy representations that, for
A. M. Mathai, Serge B. Provost
doaj +1 more source
Certain Classes of Finite Sums that Involve Generalized Fibonacci and Lucas Numbers
The Fibonacci quarterly, 2004 was the inspiration for [2], in which analogous sums involving cubes of Fibonacci numbers were developed. In turn, [2] was the motivation for [5], [6], and [7].
R. Melham
semanticscholar +1 more source
Известия Иркутского государственного университета: Серия "Математика"The paper proposes a matrix implementation of the collocation method for constructing a solution to Volterra integral equations of the second kind using systems of orthogonal Chebyshev polynomials of the first kind and Legendre polynomials. The integrand
O.V. Germider, V. N. Popov
doaj +1 more source
An effective local-global principle for algebraic varieties and the sum product problem in finite fields [PDF]
, 2020 Bryce Kerr +2 more
openalex +1 more source
Sum-product phenomenon in finite fields not of prime order
Rocky Mountain Journal of Mathematics, 2011 Let \(F=\mathbb F_{p^n}\) be a finite field, and let \(A\) be a subset of \(F\) so that for any \(A'\subset A\) with \(|A'|\geq |A|^{15/16}\) and for any subfield \(G\subset F\) and for any elements \(c,d\in F\) if \[ A'\subset cG+d, \] then \[ |A'|\leq |G|^{1/2}.
openaire +3 more sources
Some Identities on Sums of Finite Products of Chebyshev Polynomials of the Third and Fourth Kinds
, 2023 Jugal Kishore +2 more
openalex +2 more sources
Physical Review ResearchOne of the most promising applications of quantum computers is solving partial differential equations (PDEs). By using the Schrödingerization technique—which converts nonconservative PDEs into Schrödinger equations—the problem can be reduced to ...
Nikita Guseynov, Xiajie Huang, Nana Liu
doaj +1 more source
Asymptotics of Closeness Centralities of Graphs
MathematicsGiven a connected graph G with n vertices, the distance between two vertices is the number of edges in a shortest path connecting them. The sum of the distances in a graph G from a vertex v to all other vertices is denoted by SDG(v).
Santiago Frias +3 more
doaj +1 more source
A sum-product estimate in finite fields, and applications [PDF]
, 2003 Jean Bourgain +2 more
openalex +1 more source
Monochromatic Sums and Products of Polynomials
Discrete AnalysisMonochromatic sums and products of polynomials, Discrete Analysis 2024:5, 7 pp. An early result in Ramsey theory, Schur's theorem, states that if the positive integers are finitely coloured, then there will always be $x$ and $y$ such that $x,y$ and $x ...
Ryan Alweiss
doaj +1 more source