Results 331 to 340 of about 248,011 (369)
Computer-assisted construction of <i>SU</i>(2)-invariant negative Einstein metrics. [PDF]
Ann Glob Anal Geom (Dordr)Wang QS.
europepmc +1 more source
A novel projection data domain material decomposition method for dual-energy CT and its impact on the accuracy of attenuation values. [PDF]
Phys Med BiolHaase V +4 more
europepmc +1 more source
Some polynomials related to the ultraspherical polynomials
Collectanea Mathematica, 1961 openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
H-POLYNOMIALS AND ROOK POLYNOMIALS
International Journal of Algebra and Computation, 2008The purpose of this paper is twofold. First we describe a useful procedure for computing the H-polynomials of reductive monoids. Second we use this procedure to compute the H-polynomial of the monoid of n × n matrices in terms of the q-analogues of the rook polynomials of Garsia and Remmel.
Mahir Bilen Can, Lex E. Renner
openaire +2 more sources
SSRN Electronic Journal, 2022
We approximate the utility function by polynomial series and solve the related dynamic portfolio optimization problems. We study the quality of the Taylor and Bernstein series approximation in response to the points and degrees of the expansions and generalize from earlier expansions applied to portfolio optimization.
ALEXANDER S. LOLLIKE, MOGENS STEFFENSEN
openaire +4 more sources
We approximate the utility function by polynomial series and solve the related dynamic portfolio optimization problems. We study the quality of the Taylor and Bernstein series approximation in response to the points and degrees of the expansions and generalize from earlier expansions applied to portfolio optimization.
ALEXANDER S. LOLLIKE, MOGENS STEFFENSEN
openaire +4 more sources
On Multiplication of Polynomials Modulo a Polynomial
SIAM Journal on Computing, 1980The multiplicative complexity of the direct product of algebras $A_p $ of polynomials modulo a polynomial P is studied. In particular, we show that if P and Q are irreducible polynomials then the multiplicative complexity of $A_{\text{P}} \times A_{\text{Q}} $ is $2\deg ({\text{P}})\deg ({\text{Q}}) - {\text{k}}$, where k is the number of factors of P ...
openaire +2 more sources
Polynomial Decompositions in Polynomial Time
2014Fix a prime p. Given a positive integer k, a vector of positive integers Δ = (Δ1, Δ2, …, Δ k ) and a function \(\Gamma: \mathbb{F}_p^k \to \mathbb{F}_p\), we say that a function \(P: \mathbb{F}_p^n \to \mathbb{F}_p\) is (k,Δ,Γ)-structured if there exist polynomials \(P_1, P_2, \dots, P_k:\mathbb{F}_p^n \to \mathbb{F}_p\) with each deg(P i ) ≤ Δ i such ...
openaire +2 more sources
Journal of Chemical Information and Computer Sciences, 2000
This study identifies properties and uses of the permanental polynomial of adjacency matrixes of unweighted chemical graphs. Coefficients and zeroes of the polynomial for several representative structures are provided, and their properties are discussed.
openaire +2 more sources
This study identifies properties and uses of the permanental polynomial of adjacency matrixes of unweighted chemical graphs. Coefficients and zeroes of the polynomial for several representative structures are provided, and their properties are discussed.
openaire +2 more sources