Results 41 to 50 of about 44,196 (310)
Approximating a Norm by a Polynomial [PDF]
, 2003 We prove that for any norm |*| in the d-dimensional real vector space V and for any odd n>0 there is a non-negative polynomial p(x), x in V of degree 2n such that p^{1/2n}(x) < |x| < c(n,d) p^{1/2n}(x), where c(n,d)={n+d-1 choose n}^{1/2n}. Corollaries and polynomial approximations of the Minkowski functional of a convex body are discussed.
openaire +2 more sources
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial [PDF]
Algorithmica, 2006 The Jones polynomial, discovered in 1984, is an important knot invariant in topology. Among its many connections to various mathematical and physical areas, it is known (due to Witten) to be intimately connected to Topological Quantum Field Theory (TQFT).
Dorit Aharonov +2 more
openaire +3 more sources
The complexity of combinatorial optimization problems on d‐dimensional boxes [PDF]
, 2007 The Maximum Independent Set problem in d-box graphs, i.e., in intersection graphs of axis-parallel rectangles in R-d, is known to be NP-hard for any fixed d >= 2.
Chlebikova, Janka +5 more
core +1 more source
Structured Low-rank Approximation as a Rational Function Minimization [PDF]
, 2012 Many problems of system identification, model reduction and signal processing can be posed and solved as a structured low-rank approximation problem (SLRA).
Markovsky, Ivan, Usevich, Konstantin
core
FEBS Open Bio, EarlyView.ERα splice variant ERα∆7 lacks the C‐terminus, and its expression may change phenotypes of breast cancers. Our results showed that ERα∆7 is found in the luminal A subtype, and elevated ERα∆7 levels are linked to improved cell survival with lower proliferation and migration.
Long Wai Tsui +10 more
wiley +1 more source
Hardness of submodular cost allocation : lattice matching and a simplex coloring conjecture [PDF]
, 2014 We consider the Minimum Submodular Cost Allocation (MSCA) problem. In this problem, we are given k submodular cost functions f1, ... , fk: 2V -> R+ and the goal is to partition V into k sets A1, ..., Ak so as to minimize the total cost sumi = 1,k fi(Ai).
Vondrák, Jan, Ene, Alina
core +1 more source
Long‐Term Follow‐Up of Chemotherapy‐Associated Biological Aging in Women With Early Breast Cancer
Aging 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
Journal of Kufa for Mathematics and Computer, 2017 For a given nonnegative integer number n, we can find a monotone function f depending on n, defined on the interval I=[-1,1], and an absolute constant c>0, satisfying the following relationship: (2〖E_n (f Ì )〗_p)/(n+1)^3 ≤〖E_(n+1)^1 (f)〗_pâ ...
GHAZI ABDULLAH Madlol
doaj +1 more source
Approximating the Chromatic Polynomial
CoRR, 2016 Chromatic polynomials are important objects in graph theory and statistical physics, but as a result of computational difficulties, their study is limited to graphs that are small, highly structured, or very sparse. We have devised and implemented two algorithms that approximate the coefficients of the chromatic polynomial $P(G,x)$, where $P(G,k)$ is ...
Yvonne Kemper, Isabel Beichl
openaire +2 more sources
Chebyshev multivariate polynomial approximation and point reduction procedure
, 2021 We apply the methods of nonsmooth and convex analysis to extend the study of Chebyshev (uniform) approximation for univariate polynomial functions to the case of general multivariate functions (not just polynomials).
Yost, David +2 more
core +1 more source