Select Page

A project by Alexandre Hyafil, principal investigator and Ramón y Cajal researcher at the Computational Neuroscience Research Group at CRM, has been selected as one of the recipients of the grants awarded in the 2022 call by the Leonardo program of the Foundation BBVA. The project that will receive funding, under the title Computational models of daily fluctuations of psychological states, is one of the five chosen by the mathematics evaluation commission chaired by Juan José Romo Urroz, professor of Statistics and rector of the Universidad Carlos III de Madrid.

The Leonardo grants have been awarded by the BBVA Foundation since 2014, with the objective of supporting personal projects of researchers and cultural creators in intermediate stages of their career, between 30 and 45 years old, which are characterized by a significant scientific, technological, or cultural production. The specific purpose of the grant, each endowed with up to 40,000 euros, admits great flexibility, adapting to the specific needs of each project, and can be carried out over a period of between 12 and 18 months.

In this 2022 call, a total of 884 applications have been received, resulting in 60 researchers from fields such as Basic sciences, Math; Biology and Biomedicine; Environmental and Earth Sciences; Engineering and Information Technology; Economics, Social and Legal Sciences; Humanities; Music and Opera; Literary Creation and Performing Arts.

In addition to Alexandre Hyafil’s project, four other mathematicians have received grants to develop their projects in the 2022 call; Jezabel Curbelo, from the Universitat Politècnica de Catalunya, María López, from the University of Málaga, Carlos Shabazi, from the UNED, and Pedro Tradacete Pérez, from the Instituto de Ciencias Matemáticas-CSIC. 

CRM Comm Team

CRM Comm Team

Anna Drou | Pau Varela

CRMComm@crm.cat

Subscribe for more CRM News

Subscribe to our mailing list to get the lastest information about CRM activities.

Almost every automaton can be reset with a short word

Almost every automaton can be reset with a short word

Guillaume Chapuy (Université Paris Cité, CNRS) and Guillem Perarnau (UPC, CRM) have shown that a random finite automaton with n states can, with high probability, be reset by a word of length of order √n log n. The result, published in ACM Transactions on Algorithms, pins the exponent at 1/2, the lower end of a decade of numerical estimates, and addresses the random version of the synchronization problem behind a conjecture Ján Černý posed in 1964 and which still remains open.

ADA: Decoding Brain Signals Misaligned in Time

ADA: Decoding Brain Signals Misaligned in Time

The study addresses a key limitation of current brain decoding techniques: the difficulty of interpreting internal mental processes whose temporal dynamics vary from trial to trial.Decoding what is happening in a person’s mind from their brain activity is one of the...