New stem cell therapy shows 'promising' results for treating hair loss in preclinical trials
Print Close
By Angelica Stabile
Published June 25, 2025
Researchers at the San Carlos Clinical Hospital in Madrid may have targeted a potential solution for hair loss.
A recent study analyzed the effect of injecting mice's skin with stem cells from human fat — "adipose-derived stem cells (ASCs)" — as a means of treating androgenetic alopecia (AGA), more commonly known as male- or female-pattern hair loss.
The team found that male mice achieved the best hair regrowth after three weeks when they received low-dose ASCs, combined with an energy-boosting molecule called adenosine triphosphate (ATP).
HAIRSTYLISTS AND MEDICAL EXPERT CONFIRM TEMPORARY HAIR LOSS AFFECTING OZEMPIC USERS
Low-dose and high-dose ASC treatments along with ATP led to no hair regrowth improvement in females, but medium-dose ASC plus ATP led to greater regrowth.
The researchers concluded that hair regrowth was improved in "all experimental groups" where male mice received stem cell solutions supplemented with ATP.
The findings were published in the journal Stem Cell Research & Therapy.
Lead study author Dr. Eduardo López Bran — dermatologist and professor at The Complutense University of Madrid — shared his expectations for the study in an interview with Fox News Digital.
THIS DAILY BEAUTY ROUTINE COULD BE RUINING YOUR HAIR, EXPERTS WARN
"We expected good results, but not such a high level of success," he said. "We're talking about a very high degree of hair regrowth in both male and female mice."
With appropriate doses, the researchers achieved "very high percentages" of hair regrowth, noting that 100% of the male mice and up to 90% of the female mice regrew hair.
"These results demonstrate that advanced therapies may represent a new therapeutic approach for many diseases for which no effective treatments are currently available," Bran went on.
"Achieving such promising results in the preclinical phase with a completely novel approach to androgenetic alopecia — one that avoids chronic treatment and is also safe — is a significant scientific milestone."
"We're talking about a very high degree of hair regrowth in both male and female mice."
The main limitation of the study was the thinness of mouse skin, Bran noted, which "posed a challenge in administering the therapy."
CLICK HERE TO GET THE FOX NEWS APP
"This required the development of protocols to minimize experimental variability, and will be a key factor when studies in humans begin," he said.
These new findings should be "interpreted with caution and scientific rigor," Bran cautioned.
"Although the results in mice represent significant progress, it is also true that it is essential to wait for clinical benefits in humans to be confirmed."
CLICK HERE TO SIGN UP FOR OUR HEALTH NEWSLETTER
The researcher encouraged those with androgenetic alopecia to continue consulting with their dermatologists and to follow prescribed treatments as research develops.
"It is important to remain hopeful. Research advances are pointing toward possible solutions that, in the future, may offer long-lasting results without the need for continuous treatment to maintain benefits," Bran added.
"This study is small, and more research is needed on this method as a potential treatment option."
Looking ahead to human clinical trials, researchers are "actively working" on confirming safety for men and women between 18 and 50 years old with moderate androgenetic alopecia, the researcher noted.
"If everything progresses as expected, the most optimistic timeline points to the treatment becoming available in approximately five years," he said.
In a separate interview with Fox News Digital, Dr. Brendan Camp, M.D., a New York-based dermatologist who was not involved in the study, commented on the potential for this method.
"While not commercially available, this study suggests that injection of stem cells supplemented with ATP into scalp skin could potentially encourage hair regrowth in individuals with androgenetic alopecia," he reiterated.
For more Health articles, visit www.foxnews.com/health.
"This study is small, and more research is needed on this method as a potential treatment option for androgenetic alopecia."
Until then, Camp encourages people to focus on currently available and "well-studied" treatments to address hair loss, and to visit a board-certified dermatologist for evaluation. Print Close
URL
https://www.foxnews.com/health/new-stem-cell-therapy-shows-remarkable-success-treating-hair-loss-preclinical-trials
Hashtags
Try Our AI Features
Explore what Daily8 AI can do for you:
Comments
No comments yet...
Related Articles
Washington Post
an hour ago
- Washington Post
Can France, land of smoking and joie de vivre, end its cigarette habit?
VAUCLUSE, France — In a country where the cigarette holds an iconic status on par with the croissant or glass of red wine, a ban from Sunday on smoking in all parks, beaches and bus stops has ignited a fiery debate, pitting laissez-faire libertines against those worried by the serious health implications of France's stubbornly high smoking rates.
Yahoo
an hour ago
- Yahoo
Johnson & Johnson's (JNJ) IMAAVY Demonstrates Superior gMG Control
Johnson & Johnson (NYSE:JNJ) is one of the 12 stocks that will make you rich in 10 years. On June 23, J&J announced new data from an indirect treatment comparison (ITC) study. The data show that the company's drug, IMAAVY (nipocalimab-aahu), demonstrated consistent and sustained disease control in patients with generalized myasthenia gravis (gMG) compared to other approved FcRn blockers. The findings were presented at the European Academy of Neurology (EAN) 2025 Congress in Helsinki, Finland. Gil C/ According to the findings, IMAAVY showed a comparable onset of symptom relief at Week 1. The drug demonstrated consistent and sustained disease control over multiple timepoints up to 24 weeks. More importantly, IMAAVY showed greater or statistically significant improvement in Myasthenia Gravis Activities of Daily Living (MG-ADL) scores compared to the published Phase 3 data of other FcRn blockers. The drug received FDA approval on April 30, 2025, for adults and pediatric patients aged 12 and older with anti-AChR or anti-MuSK antibody-positive gMG. This makes IMAAVY the first and only FcRn blocker approved for both antibody types, covering ≥90% of antibody-positive gMG patients. Johnson & Johnson (NYSE:JNJ) is a global healthcare company. It develops, manufactures, and sells pharmaceuticals and medical devices through two main segments: Innovative Medicine and MedTech. Its key pharmaceutical products include Darzalex, Stelara, Tremfya, and Carvykti, while its MedTech offerings span surgical technologies, orthopedics, and vision care. While we acknowledge the potential of JNJ as an investment, we believe certain AI stocks offer greater upside potential and carry less downside risk. If you're looking for an extremely undervalued AI stock that also stands to benefit significantly from Trump-era tariffs and the onshoring trend, see our free report on the best short-term AI stock. READ NEXT: and . Disclosure: None. Error in retrieving data Sign in to access your portfolio Error in retrieving data Error in retrieving data Error in retrieving data Error in retrieving data
WIRED
an hour ago
- WIRED
Student Solves a Long-Standing Problem About the Limits of Addition
Jun 29, 2025 7:00 AM A new proof illuminates the hidden patterns that emerge when addition becomes impossible. Illustration: Nash Weerasekera for Quanta Magazine The original version of this story appeared in Quanta Magazine. The simplest ideas in mathematics can also be the most perplexing. Take addition. It's a straightforward operation: One of the first mathematical truths we learn is that 1 plus 1 equals 2. But mathematicians still have many unanswered questions about the kinds of patterns that addition can give rise to. 'This is one of the most basic things you can do,' said Benjamin Bedert, a graduate student at the University of Oxford. 'Somehow, it's still very mysterious in a lot of ways.' In probing this mystery, mathematicians also hope to understand the limits of addition's power. Since the early 20th century, they've been studying the nature of 'sum-free' sets—sets of numbers in which no two numbers in the set will add to a third. For instance, add any two odd numbers and you'll get an even number. The set of odd numbers is therefore sum-free. In a 1965 paper, the prolific mathematician Paul Erdős asked a simple question about how common sum-free sets are. But for decades, progress on the problem was negligible. 'It's a very basic-sounding thing that we had shockingly little understanding of,' said Julian Sahasrabudhe, a mathematician at the University of Cambridge. Until this February. Sixty years after Erdős posed his problem, Bedert solved it. He showed that in any set composed of integers—the positive and negative counting numbers—there's a large subset of numbers that must be sum-free. His proof reaches into the depths of mathematics, honing techniques from disparate fields to uncover hidden structure not just in sum-free sets, but in all sorts of other settings. 'It's a fantastic achievement,' Sahasrabudhe said. Stuck in the Middle Erdős knew that any set of integers must contain a smaller, sum-free subset. Consider the set {1, 2, 3}, which is not sum-free. It contains five different sum-free subsets, such as {1} and {2, 3}. Erdős wanted to know just how far this phenomenon extends. If you have a set with a million integers, how big is its biggest sum-free subset? In many cases, it's huge. If you choose a million integers at random, around half of them will be odd, giving you a sum-free subset with about 500,000 elements. Paul Erdős was famous for his ability to come up with deep conjectures that continue to guide mathematics research today. Photograph: George Csicsery In his 1965 paper, Erdős showed—in a proof that was just a few lines long, and hailed as brilliant by other mathematicians—that any set of N integers has a sum-free subset of at least N /3 elements. Still, he wasn't satisfied. His proof dealt with averages: He found a collection of sum-free subsets and calculated that their average size was N /3. But in such a collection, the biggest subsets are typically thought to be much larger than the average. Erdős wanted to measure the size of those extra-large sum-free subsets. Mathematicians soon hypothesized that as your set gets bigger, the biggest sum-free subsets will get much larger than N /3. In fact, the deviation will grow infinitely large. This prediction—that the size of the biggest sum-free subset is N /3 plus some deviation that grows to infinity with N —is now known as the sum-free sets conjecture. 'It is surprising that this simple question seems to present considerable difficulties,' Erdős wrote in his original paper, 'but perhaps we overlook the obvious.' For decades, nothing obvious revealed itself. No one could improve on Erdős' proof. 'The longer it went without people being able to improve on that simple bound, the more cachet this problem acquired,' said Ben Green, Bedert's doctoral adviser at Oxford. And, he added, this was precisely the kind of problem where 'it's very, very hard to do any better at all.' Confronting the Norm After 25 years without improving on Erdős' original result, mathematicians finally began inching forward. In 1990, two researchers proved that any set of N integers has a sum-free subset with at least N /3 + 1/3 elements, more commonly written as ( N + 1)/3. But since the size of a set is always a whole number, an increase of 1/3 is often inconsequential. For example, if you know that a sum-free subset has to have at least 5/3 elements, that means its size is guaranteed to be 2 or more. If you add 1/3 to 5/3, your answer is still 2. 'It's funny, it means that it doesn't actually always improve it,' said David Conlon of the California Institute of Technology. 'It's only when N is divisible by 3 that it improves it.' In 1997, the mathematical legend Jean Bourgain nudged the bound up to ( N + 2)/3. The result might have seemed hardly worth mentioning, but buried in Bourgain's paper was a startling breakthrough. He described an idea for how to prove that the biggest sum-free subsets would be arbitrarily bigger than that. He just couldn't pin down the details to turn it into a full proof. 'The paper's almost like, here's how I tried to solve the problem and why it didn't work,' Sahasrabudhe said. Jean Bourgain devised a creative strategy for proving the sum-free sets conjecture. Photograph: George M. Bergman, Berkeley Bourgain relied on a quantity called the Littlewood norm, which measures a given set's structure. This quantity, which comes from a field of mathematics called Fourier analysis, tends to be large if a set is more random, and small if the set exhibits more structure. Bourgain showed that if a set with N elements has a large Littlewood norm, then it must also have a sum-free set that's much larger than N /3. But he couldn't make progress in the case where the set has a small Littlewood norm. 'Bourgain is famously competent,' said Sean Eberhard of the University of Warwick. 'It's a very striking marker of how difficult this problem is.' Bourgain ultimately had to use a different argument to get his bound of ( N + 2)/3. But mathematicians read between the lines: They might be able to use the Littlewood norm to completely settle the conjecture. They just had to figure out how to deal with sets with a small Littlewood norm. Illustration: Nash Weerasekera for Quanta Magazine There was reason to be optimistic: Mathematicians already knew of sets with a small Littlewood norm that have massive sum-free subsets. These sets, called arithmetic progressions, consist of evenly spaced numbers, such as {5, 10, 15, 20}. Mathematicians suspected that any set with a small Littlewood norm has a very specific structure—that it's more or less a collection of many different arithmetic progressions (with a few tweaks). They hoped that if they could show this, they'd be able to use that property to prove that any set with a small Littlewood norm has a large sum-free subset. But this task wasn't easy. 'I certainly tried to prove the sum-free conjecture using [Bourgain's] ideas,' Green said, but 'we still don't understand much about the structure of sets with small Littlewood norm. Everything to do with Littlewood is difficult.' And so, though mathematicians continued to have faith in Bourgain's Littlewood-based strategy, nothing happened. More than two decades passed. Then, in the fall of 2021, Benjamin Bedert started graduate school. Notorious Problems With Green as his doctoral adviser, it was inevitable that Bedert would come across the sum-free sets conjecture. Green's website lists 100 open problems; this one appears first. Bedert perused the list shortly after he began his graduate studies. At first, he shied away from the sum-free sets problem. 'I was like, this is super difficult, I'm not going to think about this,' he recalled. 'I'll leave this for the future.' The future arrived soon enough. In summer 2024, Bedert decided he was ready for a riskier project. 'I'd proved some reasonably good results in my PhD so far, and kind of put a thesis together already,' he said. 'I started thinking about these more, I guess, notorious problems.' Benjamin Bedert, a graduate student at the University of Oxford, has resolved a decades-old problem that tests the role of addition in sets. Photograph: Romana Meereis He read Bourgain's 1997 paper and began to muse about how to implement the Littlewood blueprint. Almost immediately, he had an idea for how he might approach the problem of sets with a small Littlewood norm. So far, it had been too difficult to show that sets with a small Littlewood norm always resemble collections of arithmetic progressions. But Bedert thought it might be useful to prove something more attainable: that even if these sets aren't literally built from arithmetic progressions, they share certain key, progression-like properties. In a recent project, Bedert had come across what he saw as a good candidate for a property to focus on. In arithmetic progressions, there are many groups of numbers that have the same sum. For instance, in the set of even numbers (which is an arithmetic progression), 4 + 8 has the same sum as both 2 + 10 and 2 + 4 + 6. Bedert thought it might be enough to show that sets with a small Littlewood norm always obey this property. Within a couple of weeks, he'd succeeded in proving that the property was true. But would the result give him the level of similarity to arithmetic progressions that he needed to prove the sum-free sets conjecture? 'I was definitely excited,' he said. 'Then I realized there was still so much more work to do.' Waves of Progress First, Bedert showed that any set with a small Littlewood norm could be 'mapped' to a second set that bore an even closer resemblance to arithmetic progressions. He suspected that it was in these new sets that he would find large sum-free subsets. Illustration: Nash Weerasekera for Quanta Magazine The final task was to actually show what the size of such a sum-free subset would be. 'Over the Christmas break, I was obsessively thinking about this problem,' Bedert said. 'By New Year's, I still hadn't found the final piece of the puzzle.' Then, a few days after he returned to Oxford in January, it came to him. 'I'm not sure where it came from,' he said. 'Maybe these ideas stir in your mind for a while, and then [you] finally get something out that works.' He represented the structure of his sets using a tool called the Fourier transform, and then modified a 1981 proof to show that some of the individual components of that representation must have a large Littlewood norm. Since Bourgain had already shown how to handle sets with large Littlewood norms, that completed the proof. In the end, Bedert showed that any set of N integers has a sum-free subset with at least N /3 + log(log N ) elements. For many values of N , this gives you a sum-free subset that's only slightly bigger than Erdős' average size of N /3. Even if N is as large as 10100, for example, log(log N ) is only around 5. But as N inches toward infinity, so does the difference in Bedert's and Erdős' bounds—thus settling the conjecture. 'It's a really amazing result,' said Yifan Jing of Ohio State University. Jing, who was also mentored by Green, credits the achievement to Bedert's intense focus. 'Benjamin really went in depth to modify Bourgain's proof and make it work,' he said. 'He spends much more time than other people on the same problem.' There's still more to understand about sum-free subsets—and therefore about the extent to which addition influences the structure of the integers. For instance, Bedert's result resolves the question of whether the largest sum-free subset gets infinitely bigger than N /3. But mathematicians don't know precisely how fast that deviation can grow. Thanks to a 2014 paper by Green and two colleagues, they know that the deviation is slower-growing than N . But, Green said, 'there remains a massive gap' between that upper bound of N and Bedert's lower bound of log(log N ). The work also provides new insight into sets that have a small Littlewood norm. Such sets are fundamental objects in the field of analysis but are very difficult to study. Bedert's result has helped mathematicians better understand their structure, which Green and others now hope to continue to explore. 'It's beautiful, it's interesting, it feels natural,' Eberhard said. 'You want to solve a mystery, don't you?' For Sahasrabudhe, the takeaway is simple. 'Old and difficult problem solved by brilliant kid,' he said. 'The stuff he's building on, it's subtle and hard to work with. It's a really pretty result.' Original story reprinted with permission from Quanta Magazine, an editorially independent publication of the Simons Foundation whose mission is to enhance public understanding of science by covering research developments and trends in mathematics and the physical and life sciences.
