Results 51 to 60 of about 1,734,778 (295)

Groups whose proper subgroups of infinite rank have polycyclic-by-finite conjugacy classes [PDF]

open access: yesInternational Journal of Group Theory, 2016
A group G is said to be a (PF)C-group or to have polycyclic-by-finite conjugacy classes, if G/C_{G}(x^{G}) is a polycyclic-by-finite group for all xin G. This is a generalization of the familiar property of being an FC-group.
Mounia Bouchelaghem, Nadir Trabelsi
doaj  

Upper Bounds for the Isolation Number of a Matrix over Semirings

open access: yesMathematics, 2019
Let S be an antinegative semiring. The rank of an m × n matrix B over S is the minimal integer r such that B is a product of an m × r matrix and an r × n matrix.
LeRoy B. Beasley, Seok-Zun Song
doaj   +1 more source

A novel modified RANKL variant can prevent osteoporosis by acting as a vaccine and an inhibitor

open access: yesClinical and Translational Medicine, 2021
Background The discovery of receptor activator of nuclear factor‐ĸB ligand (RANKL) as the final effector in the pathogenesis of osteoporosis has led to a better understanding of bone remodeling.
Young Jong Ko   +10 more
doaj   +1 more source

Retrospective Analysis of Donor Lymphocyte Infusions in Pediatric Patients With Mixed Chimerism After Hematopoietic Stem Cell Transplantation

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Allogeneic hematopoietic stem cell transplantation (alloHSCT) is an essential therapy for several malignant and nonmalignant diseases, but relapse and graft loss remain the principal threats to its success. Routine monitoring of chimerism and minimal residual disease (MRD) enables early detection of imminent recurrence and guides ...
Carmen Junk   +10 more
wiley   +1 more source

On Redei matrices with minimal rank [PDF]

open access: yes, 2001
The 4-rank of the narrow ideal class groups of quadratic number fields can be computed from the rank of certain f0, 1g-matrices defined by Redei. A lower bound of the rank of Redei's matrices was also given by Redei.
Sueyoshi, Yutaka
core  

The Number of Sides of a Parallelogram [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 1999
We define parallelograms of base a and b in a group. They appear as minimal relators in a presentation of a subgroup with generators a and b. In a Lie group they are realized as closed polygonal lines, with sides being orbits of left-invariant vector ...
Elisha Falbel, Pierre-Vincent Koseleff
doaj   +3 more sources

An interesting family of curves of genus 1

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2000
We study the family of elliptic curves y2=x3−t2x+1, both over ℚ(t) and over ℚ. In the former case, all integral solutions are determined; in the latter case, computation in the range 1≤t≤999 shows large ranks are common, giving a particularly simple ...
Andrew Bremner
doaj   +1 more source

Pediatric Idiopathic Multicentric Castleman Disease Is Often Severe But Responsive to Siltuximab

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Idiopathic multicentric Castleman disease (iMCD) is a potentially fatal immunologic disorder marked by widespread lymphadenopathy and inflammation. Siltuximab, an interleukin‐6 (IL‐6) inhibitor, is the only FDA‐approved treatment for adult patients with iMCD.
Bridget Austin   +17 more
wiley   +1 more source

On minimal decompositions of low rank symmetric tensors [PDF]

open access: yes, 2020
International audienceWe use an algebraic approach to construct minimal decompositions of symmetric tensors with low rank. This is done by using Apolarity Theory and by studying minimal sets of reduced points apolar to a given symmetric tensor, namely ...
Mourrain, Bernard, Oneto, Alessandro
core   +1 more source

Rank minimization via online learning [PDF]

open access: yesProceedings of the 25th international conference on Machine learning - ICML '08, 2008
Minimum rank problems arise frequently in machine learning applications and are notoriously difficult to solve due to the non-convex nature of the rank objective. In this paper, we present the first online learning approach for the problem of rank minimization of matrices over polyhedral sets.
Raghu Meka   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy