@article{17322, abstract = {Machine learning interatomic potentials are revolutionizing large-scale, accurate atomistic modeling in material science and chemistry. Many potentials use atomic cluster expansion or equivariant message-passing frameworks. Such frameworks typically use spherical harmonics as angular basis functions, followed by Clebsch-Gordan contraction to maintain rotational symmetry. We propose a mathematically equivalent and simple alternative that performs all operations in the Cartesian coordinates. This approach provides a complete set of polynormially independent features of atomic environments while maintaining interaction body orders. Additionally, we integrate low-dimensional embeddings of various chemical elements, trainable radial channel coupling, and inter-atomic message passing. The resulting potential, named Cartesian Atomic Cluster Expansion (CACE), exhibits good accuracy, stability, and generalizability. We validate its performance in diverse systems, including bulk water, small molecules, and 25-element high-entropy alloys.}, author = {Cheng, Bingqing}, issn = {2057-3960}, journal = {npj Computational Materials}, publisher = {Springer Nature}, title = {{Cartesian atomic cluster expansion for machine learning interatomic potentials}}, doi = {10.1038/s41524-024-01332-4}, volume = {10}, year = {2024}, } @article{17323, abstract = {We investigate strong divisibility sequences and produce lower and upper bounds for the density of integers in the sequence that only have (somewhat) large prime factors. We focus on the special cases of Fibonacci numbers and elliptic divisibility sequences, discussing the limitations of our methods. At the end of the paper, there is an appendix by Sandro Bettin on divisor closed sets that we use to study the density of prime terms that appear in strong divisibility sequences.}, author = {Browning, Timothy D and Verzobio, Matteo}, issn = {2041-7942}, journal = {Mathematika}, number = {4}, publisher = {London Mathematical Society}, title = {{Strong divisibility sequences and sieve methods}}, doi = {10.1112/mtk.12269}, volume = {70}, year = {2024}, } @article{17325, abstract = {Bacterial ion fluxes are involved in the generation of energy, transport, and motility. As such, bacterial electrophysiology is fundamentally important for the bacterial life cycle, but it is often neglected and consequently, by and large, not understood. Arguably, the two main reasons for this are the complexity of measuring relevant variables in small cells with a cell envelope that contains the cell wall and the fact that, in a unicellular organism, relevant variables become intertwined in a nontrivial manner. To help give bacterial electrophysiology studies a firm footing, in this review, we go back to basics. We look first at the biophysics of bacterial membrane potential, and then at the approaches and models developed mostly for the study of neurons and eukaryotic mitochondria. We discuss their applicability to bacterial cells. Finally, we connect bacterial membrane potential with other relevant (electro)physiological variables and summarize methods that can be used to both measure and influence bacterial electrophysiology.}, author = {Lo, Wei Chang and Krasnopeeva, Ekaterina and Pilizota, Teuta}, issn = {1936-1238}, journal = {Annual Review of Biophysics}, pages = {487--510}, publisher = {Annual Reviews}, title = {{Bacterial Electrophysiology}}, doi = {10.1146/annurev-biophys-030822-032215}, volume = {53}, year = {2024}, } @article{17326, abstract = {Magnetic fields in the stellar interiors are key candidates to explain observed core rotation rates inside solar-like stars along their evolution. Recently, asteroseismic estimates of radial magnetic field amplitudes near the hydrogen-burning shell (H-shell) inside about 24 red giants (RGs) have been obtained by measuring frequency splittings from their power spectra. Using general Lorentz-stress (magnetic) kernels, we investigated the potential for detectability of near-surface magnetism in a 1.3 M⊙ star of supersolar metallicity as it evolves from a mid subgiant to a late subgiant into an RG. Based on these sensitivity kernels, we decompose an RG into three zones—deep core, H-shell, and near-surface. The subgiants instead required decomposition into an inner core, an outer core, and a near-surface layer. Additionally, we find that for a low-frequency g-dominated dipolar mode in the presence of a typical stable magnetic field, ∼25% of the frequency shift comes from the H-shell and the remaining from deeper layers. The ratio of the subsurface tangential field to the radial field in the H-burning shell decides if subsurface fields may be potentially detectable. For p-dominated dipole modes close to vmax, this ratio is around two orders of magnitude smaller in subgiant phases than the corresponding RG. Further, with the availability of magnetic kernels, we propose lower limits of field strengths in crucial layers in our stellar model during its evolutionary phases. The theoretical prescription outlined here provides the first formal way to devise inverse problems for stellar magnetism and can be seamlessly employed for slow rotators.}, author = {Bhattacharya, Shatanik and Das, Srijan B and Bugnet, Lisa Annabelle and Panda, Subrata and Hanasoge, Shravan M.}, issn = {1538-4357}, journal = {Astrophysical Journal}, number = {1}, publisher = {IOP Publishing}, title = {{Detectability of axisymmetric magnetic fields from the core to the surface of oscillating post-main-sequence stars}}, doi = {10.3847/1538-4357/ad4708}, volume = {970}, year = {2024}, } @inproceedings{17327, abstract = {Sequential decision-making in probabilistic environments is a fundamental problem with many applications in AI and economics. In this paper, we present an algorithm for synthesizing sequential decision-making agents that optimize statistical properties such as maximum and average response times. In the general setting of sequential decision-making, the environment is modeled as a random process that generates inputs. The agent responds to each input, aiming to maximize rewards and minimize costs within a specified time horizon. The corresponding synthesis problem is known to be PSPACE-hard. We consider the special case where the input distribution, reward, and cost depend on input-output statistics specified by counter automata. For such problems, this paper presents the first PTIME synthesis algorithms. We introduce the notion of statistical abstraction, which clusters statistically indistinguishable input-output sequences into equivalence classes. This abstraction allows for a dynamic programming algorithm whose complexity grows polynomially with the considered horizon, making the statistical case exponentially more efficient than the general case. We evaluate our algorithm on three different application scenarios of a client-server protocol, where multiple clients compete via bidding to gain access to the service offered by the server. The synthesized policies optimize profit while guaranteeing that none of the server’s clients is disproportionately starved of the service.}, author = {Cano, Filip and Henzinger, Thomas A and Könighofer, Bettina and Kueffner, Konstantin and Mallik, Kaushik}, booktitle = {9th International Conference on Formal Structures for Computation and Deduction}, isbn = {9783959773232}, issn = {1868-8969}, location = {Tallinn, Estonia}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Abstraction-based decision making for statistical properties}}, doi = {10.4230/LIPIcs.FSCD.2024.2}, volume = {299}, year = {2024}, } @inproceedings{17328, abstract = {We study selfish mining attacks in longest-chain blockchains like Bitcoin, but where the proof of work is replaced with efficient proof systems - like proofs of stake or proofs of space - and consider the problem of computing an optimal selfish mining attack which maximizes expected relative revenue of the adversary, thus minimizing the chain quality. To this end, we propose a novel selfish mining attack that aims to maximize this objective and formally model the attack as a Markov decision process (MDP). We then present a formal analysis procedure which computes an ϵ-tight lower bound on the optimal expected relative revenue in the MDP and a strategy that achieves this ϵ-tight lower bound, where ϵ > 0 may be any specified precision. Our analysis is fully automated and provides formal guarantees on the correctness. We evaluate our selfish mining attack and observe that it achieves superior expected relative revenue compared to two considered baselines. In concurrent work [Sarenche FC'24] does an automated analysis on selfish mining in predictable longest-chain blockchains based on efficient proof systems. Predictable means the randomness for the challenges is fixed for many blocks (as used e.g., in Ouroboros), while we consider unpredictable (Bitcoin-like) chains where the challenge is derived from the previous block.}, author = {Chatterjee, Krishnendu and Ebrahimzadeh, Amirali and Karrabi, Mehrdad and Pietrzak, Krzysztof Z and Yeo, Michelle X and Zikelic, Dorde}, booktitle = { Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing}, isbn = {9798400706684}, location = {Nantes, France}, pages = {268--278}, publisher = {Association for Computing Machinery}, title = {{Fully automated selfish mining analysis in efficient proof systems blockchains}}, doi = {10.1145/3662158.3662769}, year = {2024}, } @inproceedings{17329, abstract = {We initiate the study of game dynamics in the population protocol model: n agents each maintain a current local strategy and interact in pairs uniformly at random. Upon each interaction, the agents play a two-person game and receive a payoff from an underlying utility function, and they can subsequently update their strategies according to a fixed local algorithm. In this setting, we ask how the distribution over agent strategies evolves over a sequence of interactions, and we introduce a new distributional equilibrium concept to quantify the quality of such distributions. As an initial example, we study a class of repeated prisoner's dilemma games, and we consider a family of simple local update algorithms that yield non-trivial dynamics over the distribution of agent strategies. We show that these dynamics are related to a new class of high-dimensional Ehrenfest random walks, and we derive exact characterizations of their stationary distributions, bounds on their mixing times, and prove their convergence to approximate distributional equilibria. Our results highlight trade-offs between the local state space of each agent, and the convergence rate and approximation factor of the underlying dynamics. Our approach opens the door towards the further characterization of equilibrium computation for other classes of games and dynamics in the population setting.}, author = {Alistarh, Dan-Adrian and Chatterjee, Krishnendu and Karrabi, Mehrdad and Lazarsfeld, John M}, booktitle = {Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing}, isbn = {9798400706684}, location = {Nantes, France}, pages = {40--49}, publisher = {Association for Computing Machinery}, title = {{Game dynamics and equilibrium computation in the population protocol model}}, doi = {10.1145/3662158.3662768}, year = {2024}, } @article{17330, abstract = {In this work we consider the list-decodability and list-recoverability of arbitrary q -ary codes, for all integer values of q ⩾ 2. A code is called ( p , L ) q -list-decodable if every radius pn Hamming ball contains less than L codewords; ( p , ℓ, L ) q -recoverability is a generalization where we place radius pn Hamming balls on every point of a combinatorial rectangle with side length ℓ and again stipulate that there be less than L codewords. Our main contribution is to precisely calculate the maximum value of p for which there exist infinite families of positive rate ( p , ℓ, L ) q -list-recoverable codes, the quantity we call the zero-rate threshold . Denoting this value by p *, we in fact show that codes correcting a p * + ε fraction of errors must have size O ε (1), i.e., independent of n . Such a result is typically referred to as a “Plotkin bound.” To complement this, a standard random code with expurgation construction shows that there exist positive rate codes correcting a p * − ε fraction of errors. We also follow a classical proof template (typically attributed to Elias and Bassalygo) to derive from the zero-rate threshold other tradeoffs between rate and decoding radius for list-decoding and list-recovery. Technically, proving the Plotkin bound boils down to demon-strating the Schur convexity of a certain function defined on the q -simplex as well as the convexity of a univariate function derived from it. We remark that an earlier argument claimed similar results for q -ary list-decoding; however, we point out that this earlier proof is flawed.}, author = {Resch, Nicolas and Yuan, Chen and Zhang, Yihan}, issn = {1557-9654}, journal = {IEEE Transactions on Information Theory}, number = {9}, pages = {6211--6238}, publisher = {IEEE}, title = {{Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery}}, doi = {10.1109/TIT.2024.3430842}, volume = {70}, year = {2024}, } @article{17331, abstract = {Amyloidosis are a group of diseases in which soluble proteins aggregate and deposit in fibrillar conformation extracellularly in tissues. The effectiveness of therapeutic strategies depends on the specific protein involved, being crucial to accurately determine its nature. Moreover, following the diagnosis, the search for the mutation within relatives allows the clinical advice. Here we report the precise diagnosis and explored the possible reasons of the structural pathogenicity for a renal amyloidosis related to a fibrinogen Aα-chain variant. Whole-exome sequencing and GATK calling pipeline were leveraged to characterize the protein variant present in a patient with kidney failure. Bioinformatics strategies were applied to suggest potential explanations of the variants aggregation. Our pipeline allowed the identification of a single-point variant of fibrinogen Aα-chain, which opened the possibility of curative transplantation. In silico structural analysis suggested that the pathogenicity of the variant may be attributed to a heightened susceptibility to yield a peptide prone to deposit as an oligomer with a β-sheet structure. Exploiting the comprehensive coverage of whole-genome sequencing, we managed to fill a vacant stage in the diagnosis of hereditary amyloidosis and to stimulate the advancement in biomedicine.}, author = {Cattaneo, Elizabeth R and Gisonno, Romina A and Abba, Martín C and Santana, Marianela and Rosú, Silvana A and Nucifora, Elsa and Aguirre, María A and Giordani, María C and Tricerri, M. Alejandra and Ramella, Nahuel A}, issn = {1097-0134}, journal = {Proteins: Structure, Function and Bioinformatics}, number = {12}, pages = {1366--1374}, publisher = {Wiley}, title = {{Hereditary amyloidosis: Insights into a fibrinogen A variant protein}}, doi = {10.1002/prot.26732}, volume = {92}, year = {2024}, } @inproceedings{17332, abstract = {Tree data structures, such as red-black trees, quad trees, treaps, or tries, are fundamental tools in computer science. A classical problem in concurrency is to obtain expressive, efficient, and scalable versions of practical tree data structures. We are interested in concurrent trees supporting range queries, i.e., queries that involve multiple consecutive data items. Existing implementations with this capability can list keys in a specific range, but do not support aggregate range queries: for instance, if we want to calculate the number of keys in a range, the only choice is to retrieve a whole list and return its size. This is suboptimal: in the sequential setting, one can augment a balanced search tree with counters and, consequently, perform these aggregate requests in logarithmic rather than linear time.In this paper, we propose a generic approach to implement a broad class of range queries on concurrent trees in a way that is wait-free, asymptotically efficient, and practically scalable. The key idea is a new mechanism for maintaining metadata concurrently at tree nodes, which can be seen as a wait-free variant of hand-over-hand locking (which we call hand-over-hand helping). We did a preliminary implementation of the wait-free binary search tree and preliminary experiments have indicated the soundness of our approach.}, author = {Kokorin, Ilya and Yudov, Victor and Aksenov, Vitaly and Alistarh, Dan-Adrian}, booktitle = {2024 IEEE International Parallel and Distributed Processing Symposium}, isbn = {9798350337662}, issn = {1530-2075}, location = {San Francisco, CA, United States}, pages = {169--179}, publisher = {IEEE}, title = {{Wait-free trees with asymptotically-efficient range queries}}, doi = {10.1109/IPDPS57955.2024.00023}, year = {2024}, } @article{17333, abstract = {Aqueous zinc-ion batteries are attractive due to their low cost, environmental friendliness, and exceptional performance, but the latter remains poorly understood. Now, a fast catalytic step involved in oxygen redox catalysis is shown to contribute to capacity at a high rate.}, author = {Mondal, Soumyadip and Freunberger, Stefan Alexander}, issn = {2520-1158}, journal = {Nature Catalysis}, number = {7}, pages = {759--760}, publisher = {Springer Nature}, title = {{Catalysing rate and capacity}}, doi = {10.1038/s41929-024-01184-7}, volume = {7}, year = {2024}, } @misc{17344, abstract = {This file contains the Mathematica notebook associated with the paper Effect of assortative mating and sexual selection on polygenic barriers to gene flow. It contains the numerical approximations, analyses, and simulations used in the study. }, author = {Surendranadh, Parvathy and Sachdeva, Himani}, publisher = {Institute of Science and Technology Austria}, title = {{Mathematica notebook for 'Effect of assortative mating and sexual selection on polygenic barriers to gene flow'}}, doi = {10.15479/AT:ISTA:17344}, year = {2024}, } @article{17372, abstract = {In this paper, we investigate the global well-posedness of reaction-diffusion systems with transport noise on the d-dimensional torus. We show new global well-posedness results for a large class of scalar equations (e.g. the Allen-Cahn equation), and dissipative systems (e.g. equations in coagulation dynamics). Moreover, we prove global well-posedness for two weakly dissipative systems: Lotka-Volterra equations for d∈{1,2,3,4} and the Brusselator for d∈{1,2,3}. Many of the results are also new without transport noise. The proofs are based on maximal regularity techniques, positivity results, and sharp blow-up criteria developed in our recent works, combined with energy estimates based on Itô's formula and stochastic Gronwall inequalities. Key novelties include the introduction of new Lζ -coercivity/dissipativity conditions and the development of an Lp(Lq) -framework for systems of reaction-diffusion equations, which are needed when treating dimensions d∈{2,3} in the case of cubic or higher order nonlinearities.}, author = {Agresti, Antonio and Veraar, Mark}, issn = {1095-7154}, journal = {SIAM Journal on Mathematical Analysis}, number = {4}, pages = {4870--4927}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Reaction-diffusion equations with transport noise and critical superlinear diffusion: Global well-posedness of weakly dissipative systems}}, doi = {10.1137/23M1562482}, volume = {56}, year = {2024}, } @article{17373, abstract = {Scanning Kelvin probe microscopy (SKPM) is a powerful technique for investigating the electrostatic properties of material surfaces, enabling the imaging of variations in work function, topology, surface charge density, or combinations thereof. Regardless of the underlying signal source, SKPM results in a voltage image, which is spatially distorted due to the finite size of the probe, long-range electrostatic interactions, mechanical and electrical noise, and the finite response time of the electronics. In order to recover the underlying signal, it is necessary to deconvolve the measurement with an appropriate point spread function (PSF) that accounts the aforementioned distortions, but determining this PSF is difficult. Here, we describe how such PSFs can be determined experimentally and show how they can be used to recover the underlying information of interest. We first consider the physical principles that enable SKPM and discuss how these affect the system PSF. We then show how one can experimentally measure PSFs by looking at well-defined features, and that these compare well to simulated PSFs, provided scans are performed extremely slowly and carefully. Next, we work at realistic scan speeds and show that the idealized PSFs fail to capture temporal distortions in the scan direction. While simulating PSFs for these situations would be quite challenging, we show that measuring PSFs with similar scan conditions works well. Our approach clarifies the basic principles and inherent challenges to SKPM measurements and gives practical methods to improve results.}, author = {Lenton, Isaac C and Pertl, Felix and Shafeek, Lubuna B and Waitukaitis, Scott R}, issn = {1089-7550}, journal = {Journal of Applied Physics}, number = {4}, publisher = {AIP Publishing}, title = {{Beyond the blur: Using experimentally determined point spread functions to improve scanning Kelvin probe imaging}}, doi = {10.1063/5.0215151}, volume = {136}, year = {2024}, } @inproceedings{17374, abstract = {Achieving photorealistic 3D view synthesis and relighting of human portraits is pivotal for advancing AR/VR applications. Existing methodologies in portrait relighting demonstrate substantial limitations in terms of generalization and 3D consistency, coupled with inaccuracies in physically realistic lighting and identity preservation. Furthermore, personalization from a single view is difficult to achieve and often requires multiview images during the testing phase or involves slow optimization processes. This paper introduces Lite2Relight , a novel technique that can predict 3D consistent head poses of portraits while performing physically plausible light editing at interactive speed. Our method uniquely extends the generative capabilities and efficient volumetric representation of EG3D, leveraging a lightstage dataset to implicitly disentangle face reflectance and perform relighting under target HDRI environment maps. By utilizing a pre-trained geometry-aware encoder and a feature alignment module, we map input images into a relightable 3D space, enhancing them with a strong face geometry and reflectance prior. Through extensive quantitative and qualitative evaluations, we show that our method outperforms the state-of-the-art methods in terms of efficacy, photorealism, and practical application. This includes producing 3D-consistent results of the full head, including hair, eyes, and expressions. Lite2Relight paves the way for large-scale adoption of photorealistic portrait editing in various domains, offering a robust, interactive solution to a previously constrained problem.}, author = {Rao, Pramod and Fox, Gereon and Meka, Abhimitra and Mallikarjun, B. R. and Zhan, Fangneng and Weyrich, Tim and Bickel, Bernd and Pfister, Hanspeter and Matusik, Wojciech and Elgharib, Mohamed and Theobalt, Christian}, booktitle = {Proceedings - SIGGRAPH 2024 Conference Papers}, isbn = {9798400705250}, location = {Denver, CO, United States}, publisher = {Association for Computing Machinery}, title = {{Lite2Relight: 3D-aware single image portrait relighting}}, doi = {10.1145/3641519.3657470}, year = {2024}, } @article{17375, abstract = {We consider the spectral radius of a large random matrix X with independent, identically distributed entries. We show that its typical size is given by a precise three-term asymptotics with an optimal error term beyond the radius of the celebrated circular law. The coefficients in this asymptotics are universal but they differ from a similar asymptotics recently proved for the rightmost eigenvalue of X in Cipolloni et al., Ann. Probab. 51(6), 2192–2242 (2023). To access the more complicated spectral radius, we need to establish a new decorrelation mechanism for the low-lying singular values of X − z for different complex shift parameters z using the Dyson Brownian Motion.}, author = {Cipolloni, Giorgio and Erdös, László and Xu, Yuanyuan}, issn = {0022-2488}, journal = {Journal of Mathematical Physics}, number = {6}, publisher = {AIP Publishing}, title = {{Precise asymptotics for the spectral radius of a large random matrix}}, doi = {10.1063/5.0209705}, volume = {65}, year = {2024}, } @article{17376, abstract = {The inertia bound and ratio bound (also known as the Cvetković bound and Hoffman bound) are two fundamental inequalities in spectral graph theory, giving upper bounds on the independence number α(G) of a graph G in terms of spectral information about a weighted adjacency matrix of G. For both inequalities, given a graph G, one needs to make a judicious choice of weighted adjacency matrix to obtain as strong a bound as possible. While there is a well-established theory surrounding the ratio bound, the inertia bound is much more mysterious, and its limits are rather unclear. In fact, only recently did Sinkovic find the first example of a graph for which the inertia bound is not tight (for any weighted adjacency matrix), answering a longstanding question of Godsil. We show that the inertia bound can be extremely far from tight, and in fact can significantly underperform the ratio bound: for example, one of our results is that for infinitely many n, there is an n-vertex graph for which even the unweighted ratio bound can prove α(G)≤4n3/4, but the inertia bound is always at least n/4. In particular, these results address questions of Rooney, Sinkovic, and Wocjan--Elphick--Abiad.}, author = {Kwan, Matthew Alan and Wigderson, Yuval}, issn = {1469-2120}, journal = {Bulletin of the London Mathematical Society}, number = {10}, pages = {3196--3208}, publisher = {London Mathematical Society}, title = {{The inertia bound is far from tight}}, doi = {10.1112/blms.13127}, volume = {56}, year = {2024}, } @article{17377, abstract = {Lateral root (LR) formation, that is vital for plant development, is one of many auxin-modulated processes, but the underlying regulatory mechanism is not yet fully known. Recently, González-García et al. discovered the BiAux compound and showed that it is involved in LR development via regulating specific auxin coreceptors.}, author = {Wójcikowska, Barbara and Friml, Jiří and Mazur, Ewa}, issn = {1360-1385}, journal = {Trends in Plant Science}, number = {12}, pages = {1279--1281}, publisher = {Elsevier}, title = {{BiAux, a newly discovered compound triggering auxin signaling}}, doi = {10.1016/j.tplants.2024.07.008}, volume = {29}, year = {2024}, } @article{17389, abstract = {The potential of Si and SiGe-based devices for the scaling of quantum circuits is tainted by device variability. Each device needs to be tuned to operation conditions and each device realisation requires a different tuning protocol. We demonstrate that it is possible to automate the tuning of a 4-gate Si FinFET, a 5-gate GeSi nanowire and a 7-gate Ge/SiGe heterostructure double quantum dot device from scratch with the same algorithm. We achieve tuning times of 30, 10, and 92 min, respectively. The algorithm also provides insight into the parameter space landscape for each of these devices, allowing for the characterization of the regions where double quantum dot regimes are found. These results show that overarching solutions for the tuning of quantum devices are enabled by machine learning.}, author = {Severin, B. and Lennon, D. T. and Camenzind, L. C. and Vigneau, F. and Fedele, F. and Jirovec, Daniel and Ballabio, A. and Chrastina, D. and Isella, G. and de Kruijf, M. and Carballido, M. J. and Svab, S. and Kuhlmann, A. V. and Geyer, S. and Froning, F. N. M. and Moon, H. and Osborne, M. A. and Sejdinovic, D. and Katsaros, Georgios and Zumbühl, D. M. and Briggs, G. A. D. and Ares, N.}, issn = {2045-2322}, journal = {Scientific Reports}, publisher = {Springer Nature}, title = {{Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning}}, doi = {10.1038/s41598-024-67787-z}, volume = {14}, year = {2024}, } @article{17396, abstract = {Wildfire intensity and severity have been increasing in the Iberian Peninsula in recent years, particularly in the Galicia region, due to rising temperatures and accumulating drier combustible vegetation in unmanaged lands. This leads to substantial emissions of air pollutants, notably fine particles (PM2.5), posing a risk to public health. This study aims to assess the impact of local and regional wildfires on PM2.5 levels in Galicia's main cities and their implications for air quality and public health. Over a decade (2013–2022), PM2.5 data during wildfire seasons were analyzed using statistical methods and Lagrangian tracking to monitor smoke plume evolution. The results reveal a notable increase in PM2.5 concentration during the wildfire season (June–November) in Galicia, surpassing health guidelines during extreme events and posing a significant health risk to the population. Regional wildfire analyses indicate that smoke plumes from Northern Portugal contribute to pollution in Galician cities, influencing the seasonality of heightened PM2.5 levels. During extensive wildfires, elevated PM2.5 concentration values persisted for several days, potentially exacerbating health concerns in Galicia. These findings underscore the urgency of implementing air pollution prevention and management measures in the region, including developing effective alerts for large-scale events and improved wildfire management strategies to mitigate their impact on air quality in Galician cities.}, author = {Quishpe-Vásquez, César and Oliva, Patricia and López-Barrera, Ellie Anne and Casallas Garcia, Alejandro}, issn = {0301-4797}, journal = {Journal of Environmental Management}, publisher = {Elsevier}, title = {{Wildfires impact on PM2.5 concentration in galicia Spain}}, doi = {10.1016/j.jenvman.2024.122093}, volume = {367}, year = {2024}, }