Results 61 to 70 of about 3,325,271 (304)

Hilbert’s 17th problem in free skew fields

open access: yesForum of Mathematics, Sigma, 2020
This paper solves the rational noncommutative analogue of Hilbert’s 17th problem: if a noncommutative rational function is positive semidefinite on all tuples of Hermitian matrices in its domain, then it is a sum of Hermitian squares of noncommutative ...
Jurij Volčič
doaj   +1 more source

Design and analysis strategies for robust microbiome ageing research

open access: yesFEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik   +5 more
wiley   +1 more source

Integrate inequalities for the higher derivatives of Blashke product

open access: yesЖурнал Белорусского государственного университета: Математика, информатика, 2018
Upper and lower inequalities for the higher derivatives of Blashke product in the Lebesgue space Lp are obtained in this work. All p ∈ (0; +∞)\ {1/s}, s ∈ N\1, are considered, where s is order of the derivative.
Tatsiana S. Mardvilka
doaj  

Characterizing Polynomial Time Computability of Rational and Real Functions [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2009
Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers.
Walid Gomaa
doaj   +1 more source

Reconstructing enzyme evolution by protein engineering

open access: yesFEBS Letters, EarlyView.
Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler   +2 more
wiley   +1 more source

$D$-resultant for rational functions [PDF]

open access: yesProceedings of the American Mathematical Society, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu, JT, Rubio, R, Gutierrez, J
openaire   +4 more sources

Structure‐forward targeting of claudins with synthetic binders

open access: yesFEBS Letters, EarlyView.
Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley   +1 more source

On the structure of compatible rational functions [PDF]

open access: yesProceedings of the 36th international symposium on Symbolic and algebraic computation, 2011
A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the structure of compatible rational functions.
Shaoshi Chen   +3 more
openaire   +3 more sources

Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation

open access: yesFEBS Letters, EarlyView.
Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang   +2 more
wiley   +1 more source

Interval and $\ell$-interval Rational Parking Functions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
Interval parking functions are a generalization of parking functions in which cars have an interval preference for their parking. We generalize this definition to parking functions with $n$ cars and $m\geq n$ parking spots, which we call interval ...
Tomás Aguilar-Fraga   +14 more
doaj   +1 more source

Home - About - Disclaimer - Privacy