Results 51 to 60 of about 2,413 (304)

Structured matrix methods for computations on Bernstein basis polynomials [PDF]

open access: yes, 2013
This thesis considers structure preserving matrix methods for computations on Bernstein polynomials whose coefficients are corrupted by noise. The ill-posed operations of greatest common divisor computations and polynomial division are considered, and it
Yang, Ning
core  

Entanglement classification via operator size

open access: yesSciPost Physics Core, 2023
In this work, multipartite entanglement is classified by polynomials. I show that the operator size is closely related to the entanglement structure. Given a generic quantum state, I define a series of subspaces generated by operators of different sizes ...
Qi-Feng Wu
doaj   +1 more source

Factorization of the Cover Polynomial

open access: yesJournal of Combinatorial Theory, Series B, 1997
The cover polynomial, as introduced by \textit{F. R. K. Chung} and \textit{R. L. Graham} [J. Comb. Theory, Ser. B 65, No. 2, 273-290 (1995; Zbl 0839.05045)], generalizes the factorial rook polynomial to two variables, by also encoding information about the partial permutations which correspond to rook placements.
openaire   +2 more sources

Factorizations of Symmetric Macdonald Polynomials [PDF]

open access: yesSymmetry, 2018
We prove many factorization formulas for highest weight Macdonald polynomials indexed by particular partitions called quasistaircases. Consequently, we prove a conjecture of Bernevig and Haldane stated in the context of the fractional quantum Hall effect theory.
Laura Colmenarejo   +2 more
openaire   +6 more sources

Cell geometry and membrane protein crowding constrain Escherichia coli growth rate, overflow metabolism, respiration, and maintenance energy

open access: yesFEBS Letters, EarlyView.
The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson   +6 more
wiley   +1 more source

Concerning Asymptotic Behavior for Extremal Polynomials Associated to Nondiagonal Sobolev Norms

open access: yesJournal of Function Spaces and Applications, 2013
Let ℙ be the space of polynomials with complex coefficients endowed with a nondiagonal Sobolev norm ∥ · ∥W1,p(Vμ), where the matrix V and the measure μ constitute a p-admissible pair for 1≤p≤∞.
Ana Portilla   +3 more
doaj   +1 more source

A bijective proof of a factorization formula for Macdonald polynomials at roots of unity [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials $\widetilde{H}_{\lambda} (X;q,t)$ when $t$ is specialized at a primitive root of unity.
F. Descouens, H. Morita, Y. Numata
doaj   +1 more source

Long‐Term Follow‐Up of Chemotherapy‐Associated Biological Aging in Women With Early Breast Cancer

open access: yesAging and Cancer, EarlyView.
Women threated with adjuvant chemotherapy for early breast cancer have sustained long‐term increase in p16INK4a,, a robust marker of cell senescence, suggesting a chemotherapy‐associated age acceleration. p16INK4a as well as other biomarkers may identify patients at greatest risk for senescence‐related diseases of aging.
Hyman B. Muss   +12 more
wiley   +1 more source

Approximate Factorization for One Class of Second-Order Matrix Functions [PDF]

open access: yesУчёные записки Казанского университета: Серия Физико-математические науки, 2016
Approximate factorization of Holder matrix function on a simple smooth closed contour has been defined. Components for one class of the 2×2 matrix function have been approximated by polynomials in z and 1/ z.
S.N. Kiyasov
doaj  

On permutation polynomials over finite fields

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1987
A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined by f is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a ...
R. A. Mollin, C. Small
doaj   +1 more source

Home - About - Disclaimer - Privacy