@article{11438,
  abstract     = {Lasers with well-controlled relative frequencies are indispensable for many applications in science and technology. We present a frequency-offset locking method for lasers based on beat-frequency discrimination utilizing hybrid electronic LC filters. The method is specifically designed for decoupling the tightness of the lock from the broadness of its capture range. The presented demonstration locks two free-running diode lasers at 780 nm with a 5.5-GHz offset. It displays an offset frequency instability below 55 Hz for time scales in excess of 1000 s and a minimum of 12 Hz at 10-s averaging. The performance is complemented with a 190-MHz lock-capture range, a tuning range of up to 1 GHz, and a frequency ramp agility of 200kHz/μs.},
  author       = {Li, Vyacheslav and Diorico, Fritz R and Hosten, Onur},
  issn         = {2331-7019},
  journal      = {Physical Review Applied},
  keywords     = {General Physics and Astronomy},
  number       = {5},
  publisher    = {American Physical Society},
  title        = {{Laser frequency-offset locking at 10-Hz-level instability using hybrid electronic filters}},
  doi          = {10.1103/physrevapplied.17.054031},
  volume       = {17},
  year         = {2022},
}

@inproceedings{17087,
  abstract     = {We consider the problem of model compression for deep neural networks (DNNs) in the challenging one-shot/post-training setting, in which we are given an accurate trained model, and must compress it without any retraining, based only on a small amount of calibration input data. This problem has become popular in view of the emerging software and hardware support for executing models compressed via pruning and/or quantization with speedup, and well-performing solutions have been proposed independently for both compression approaches.In this paper, we introduce a new compression framework which covers both weight pruning and quantization in a unified setting, is time- and space-efficient, and considerably improves upon the practical performance of existing post-training methods. At the technical level, our approach is based on an exact and efficient realization of the classical Optimal Brain Surgeon (OBS) framework of [LeCun, Denker, and Solla, 1990] extended to also cover weight quantization at the scale of modern DNNs. From the practical perspective, our experimental results show that it can improve significantly upon the compression-accuracy trade-offs of existing post-training methods, and that it can enable the accurate compound application of both pruning and quantization in a post-training setting.},
  author       = {Frantar, Elias and Singh, Sidak Pal and Alistarh, Dan-Adrian},
  booktitle    = {36th Conference on Neural Information Processing Systems},
  isbn         = {9781713871088},
  location     = {New Orleans, LA, United States},
  publisher    = {ML Research Press},
  title        = {{Optimal brain compression: A framework for accurate post-training quantization and pruning}},
  volume       = {35},
  year         = {2022},
}

@unpublished{18293,
  abstract     = {Given a non-singular diagonal cubic hypersurface X⊂Pn−1 over Fq(t) with char(Fq)≠3, we show that the number of rational points of height at most |P| is O(|P|3+ε) for n=6 and O(|P|2+ε) for n=4. In fact, if n=4 and char(Fq)>3 we prove that the number of rational points away from any rational line contained in X is bounded by O(|P|3/2+ε). From the result in 6 variables we deduce weak approximation for diagonal cubic hypersurfaces for n≥7 over Fq(t) when char(Fq)>3 and handle Waring's problem for cubes in 7 variables over Fq(t) when char(Fq)≠3. Our results answer a question of Davenport regarding the number of solutions of bounded height to x31+x32+x33=x34+x35+x36 with xi∈Fq[t].},
  author       = {Glas, Jakob and Hochfilzer, Leonhard},
  booktitle    = {arXiv},
  title        = {{On a question of Davenport and diagonal cubic forms over Fq(t)}},
  doi          = {10.48550/arXiv.2208.05422},
  year         = {2022},
}

@inbook{11440,
  abstract     = {To compute the persistent homology of a grayscale digital image one needs to build a simplicial or cubical complex from it. For cubical complexes, the two commonly used constructions (corresponding to direct and indirect digital adjacencies) can give different results for the same image. The two constructions are almost dual to each other, and we use this relationship to extend and modify the cubical complexes to become dual filtered cell complexes. We derive a general relationship between the persistent homology of two dual filtered cell complexes, and also establish how various modifications to a filtered complex change the persistence diagram. Applying these results to images, we derive a method to transform the persistence diagram computed using one type of cubical complex into a persistence diagram for the other construction. This means software for computing persistent homology from images can now be easily adapted to produce results for either of the two cubical complex constructions without additional low-level code implementation.},
  author       = {Bleile, Bea and Garin, Adélie and Heiss, Teresa and Maggs, Kelly and Robins, Vanessa},
  booktitle    = {Research in Computational Topology 2},
  editor       = {Gasparovic, Ellen and Robins, Vanessa and Turner, Katharine},
  isbn         = {9783030955182},
  pages        = {1--26},
  publisher    = {Springer Nature},
  title        = {{The persistent homology of dual digital image constructions}},
  doi          = {10.1007/978-3-030-95519-9_1},
  volume       = {30},
  year         = {2022},
}

@inproceedings{10828,
  abstract     = {Digital images enable quantitative analysis of material properties at micro and macro length scales, but choosing an appropriate resolution when acquiring the image is challenging. A high resolution means longer image acquisition and larger data requirements for a given sample, but if the resolution is too low, significant information may be lost. This paper studies the impact of changes in resolution on persistent homology, a tool from topological data analysis that provides a signature of structure in an image across all length scales. Given prior information about a function, the geometry of an object, or its density distribution at a given resolution, we provide methods to select the coarsest resolution yielding results within an acceptable tolerance. We present numerical case studies for an illustrative synthetic example and samples from porous materials where the theoretical bounds are unknown.},
  author       = {Heiss, Teresa and Tymochko, Sarah and Story, Brittany and Garin, Adélie and Bui, Hoa and Bleile, Bea and Robins, Vanessa},
  booktitle    = {2021 IEEE International Conference on Big Data},
  isbn         = {9781665439022},
  location     = {Orlando, FL, United States; Virtuell},
  pages        = {3824--3834},
  publisher    = {IEEE},
  title        = {{The impact of changes in resolution on the persistent homology of images}},
  doi          = {10.1109/BigData52589.2021.9671483},
  year         = {2022},
}

@article{10787,
  abstract     = {A species distributed across diverse environments may adapt to local conditions. We ask how quickly such a species changes its range in response to changed conditions. Szép et al. (Szép E, Sachdeva H, Barton NH. 2021 Polygenic local adaptation in metapopulations: a stochastic eco-evolutionary model. Evolution75, 1030–1045 (doi:10.1111/evo.14210)) used the infinite island model to find the stationary distribution of allele frequencies and deme sizes. We extend this to find how a metapopulation responds to changes in carrying capacity, selection strength, or migration rate when deme sizes are fixed. We further develop a ‘fixed-state’ approximation. Under this approximation, polymorphism is only possible for a narrow range of habitat proportions when selection is weak compared to drift, but for a much wider range otherwise. When rates of selection or migration relative to drift change in a single deme of the metapopulation, the population takes a time of order m−1 to reach the new equilibrium. However, even with many loci, there can be substantial fluctuations in net adaptation, because at each locus, alleles randomly get lost or fixed. Thus, in a finite metapopulation, variation may gradually be lost by chance, even if it would persist in an infinite metapopulation. When conditions change across the whole metapopulation, there can be rapid change, which is predicted well by the fixed-state approximation. This work helps towards an understanding of how metapopulations extend their range across diverse environments.
This article is part of the theme issue ‘Species’ ranges in the face of changing environments (Part II)’.},
  author       = {Barton, Nicholas H and Olusanya, Oluwafunmilola O},
  issn         = {1471-2970},
  journal      = {Philosophical Transactions of the Royal Society B: Biological Sciences},
  keywords     = {General Agricultural and Biological Sciences, General Biochemistry, Genetics and Molecular Biology},
  number       = {1848},
  publisher    = {The Royal Society},
  title        = {{The response of a metapopulation to a changing environment}},
  doi          = {10.1098/rstb.2021.0009},
  volume       = {377},
  year         = {2022},
}

@article{10658,
  abstract     = {We analyse how migration from a large mainland influences genetic load and population numbers on an island, in a scenario where fitness-affecting variants are unconditionally deleterious, and where numbers decline with increasing load. Our analysis shows that migration can have qualitatively different effects, depending on the total mutation target and fitness effects of deleterious variants. In particular, we find that populations exhibit a genetic Allee effect across a wide range of parameter combinations, when variants are partially recessive, cycling between low-load (large-population) and high-load (sink) states. Increased migration reduces load in the sink state (by increasing heterozygosity) but further inflates load in the large-population state (by hindering purging). We identify various critical parameter thresholds at which one or other stable state collapses, and discuss how these thresholds are influenced by the genetic versus demographic effects of migration. Our analysis is based on a ‘semi-deterministic’ analysis, which accounts for genetic drift but neglects demographic stochasticity. We also compare against simulations which account for both demographic stochasticity and drift. Our results clarify the importance of gene flow as a key determinant of extinction risk in peripheral populations, even in the absence of ecological gradients. This article is part of the theme issue ‘Species’ ranges in the face of changing environments (part I)’.},
  author       = {Sachdeva, Himani and Olusanya, Oluwafunmilola O and Barton, Nicholas H},
  issn         = {1471-2970},
  journal      = {Philosophical Transactions of the Royal Society B},
  number       = {1846},
  publisher    = {The Royal Society},
  title        = {{Genetic load and extinction in peripheral populations: The roles of migration, drift and demographic stochasticity}},
  doi          = {10.1098/rstb.2021.0010},
  volume       = {377},
  year         = {2022},
}

@unpublished{17157,
  abstract     = {An action of a complex reductive group G on a smooth projective variety X is regular when all regular unipotent elements in G act with finitely many fixed points. Then the complex G-equivariant cohomology ring of X is isomorphic to the coordinate ring of a certain regular fixed point scheme. Examples include partial flag varieties, smooth Schubert varieties and Bott-Samelson varieties. We also show that a more general version of the fixed point scheme allows a generalisation to GKM spaces, such as toric varieties.},
  author       = {Hausel, Tamás and Rychlewicz, Kamil P},
  booktitle    = {arXiv},
  title        = {{Spectrum of equivariant cohomology as a fixed point scheme}},
  doi          = {10.48550/arXiv.2212.11836},
  year         = {2022},
}

@article{11660,
  abstract     = {We characterize critical points of 1-dimensional maps paired in persistent homology geometrically and this way get elementary proofs of theorems about the symmetry of persistence diagrams and the variation of such maps. In particular, we identify branching points and endpoints of networks as the sole source of asymmetry and relate the cycle basis in persistent homology with a version of the stable marriage problem. Our analysis provides the foundations of fast algorithms for maintaining collections of interrelated sorted lists together with their persistence diagrams. },
  author       = {Biswas, Ranita and Cultrera di Montesano, Sebastiano and Edelsbrunner, Herbert and Saghafian, Morteza},
  journal      = {LIPIcs},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{A window to the persistence of 1D maps. I: Geometric characterization of critical point pairs}},
  year         = {2022},
}

@article{11658,
  abstract     = {The depth of a cell in an arrangement of n (non-vertical) great-spheres in Sd is the number of great-spheres that pass above the cell. We prove Euler-type relations, which imply extensions of the classic Dehn–Sommerville relations for convex polytopes to sublevel sets of the depth function, and we use the relations to extend the expressions for the number of faces of neighborly polytopes to the number of cells of levels in neighborly arrangements.},
  author       = {Biswas, Ranita and Cultrera di Montesano, Sebastiano and Edelsbrunner, Herbert and Saghafian, Morteza},
  journal      = {Leibniz International Proceedings on Mathematics},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Depth in arrangements: Dehn–Sommerville–Euler relations with applications}},
  year         = {2022},
}

@unpublished{15090,
  abstract     = {Given a locally finite set A⊆Rd and a coloring χ:A→{0,1,…,s}, we introduce the chromatic Delaunay mosaic of χ, which is a Delaunay mosaic in Rs+d that represents how points of different colors mingle. Our main results are bounds on the size of the chromatic Delaunay mosaic, in which we assume that d and s are constants. For example, if A is finite with n=#A, and the coloring is random, then the chromatic Delaunay mosaic has O(n⌈d/2⌉) cells in expectation. In contrast, for Delone sets and Poisson point processes in Rd, the expected number of cells within a closed ball is only a constant times the number of points in this ball. Furthermore, in R2 all colorings of a dense set of n points have chromatic Delaunay mosaics of size O(n). This encourages the use of chromatic Delaunay mosaics in applications.},
  author       = {Biswas, Ranita and Cultrera di Montesano, Sebastiano and Draganov, Ondrej and Edelsbrunner, Herbert and Saghafian, Morteza},
  booktitle    = {arXiv},
  title        = {{On the size of chromatic Delaunay mosaics}},
  year         = {2022},
}

@article{12081,
  abstract     = {Selection accumulates information in the genome—it guides stochastically evolving populations toward states (genotype frequencies) that would be unlikely under neutrality. This can be quantified as the Kullback–Leibler (KL) divergence between the actual distribution of genotype frequencies and the corresponding neutral distribution. First, we show that this population-level information sets an upper bound on the information at the level of genotype and phenotype, limiting how precisely they can be specified by selection. Next, we study how the accumulation and maintenance of information is limited by the cost of selection, measured as the genetic load or the relative fitness variance, both of which we connect to the control-theoretic KL cost of control. The information accumulation rate is upper bounded by the population size times the cost of selection. This bound is very general, and applies across models (Wright–Fisher, Moran, diffusion) and to arbitrary forms of selection, mutation, and recombination. Finally, the cost of maintaining information depends on how it is encoded: Specifying a single allele out of two is expensive, but one bit encoded among many weakly specified loci (as in a polygenic trait) is cheap.},
  author       = {Hledik, Michal and Barton, Nicholas H and Tkačik, Gašper},
  issn         = {1091-6490},
  journal      = {Proceedings of the National Academy of Sciences of the United States of America},
  number       = {36},
  publisher    = {National Academy of Sciences},
  title        = {{Accumulation and maintenance of information in evolution}},
  doi          = {10.1073/pnas.2123152119},
  volume       = {119},
  year         = {2022},
}

@inproceedings{11476,
  abstract     = {Messaging platforms like Signal are widely deployed and provide strong security in an asynchronous setting. It is a challenging problem to construct a protocol with similar security guarantees that can efficiently scale to large groups. A major bottleneck are the frequent key rotations users need to perform to achieve post compromise forward security.

In current proposals – most notably in TreeKEM (which is part of the IETF’s Messaging Layer Security (MLS) protocol draft) – for users in a group of size n to rotate their keys, they must each craft a message of size log(n) to be broadcast to the group using an (untrusted) delivery server.

In larger groups, having users sequentially rotate their keys requires too much bandwidth (or takes too long), so variants allowing any T≤n users to simultaneously rotate their keys in just 2 communication rounds have been suggested (e.g. “Propose and Commit” by MLS). Unfortunately, 2-round concurrent updates are either damaging or expensive (or both); i.e. they either result in future operations being more costly (e.g. via “blanking” or “tainting”) or are costly themselves requiring Ω(T) communication for each user [Bienstock et al., TCC’20].

In this paper we propose CoCoA; a new scheme that allows for T concurrent updates that are neither damaging nor costly. That is, they add no cost to future operations yet they only require Ω(log2(n)) communication per user. To circumvent the [Bienstock et al.] lower bound, CoCoA increases the number of rounds needed to complete all updates from 2 up to (at most) log(n); though typically fewer rounds are needed.

The key insight of our protocol is the following: in the (non-concurrent version of) TreeKEM, a delivery server which gets T concurrent update requests will approve one and reject the remaining T−1. In contrast, our server attempts to apply all of them. If more than one user requests to rotate the same key during a round, the server arbitrarily picks a winner. Surprisingly, we prove that regardless of how the server chooses the winners, all previously compromised users will recover after at most log(n) such update rounds.

To keep the communication complexity low, CoCoA is a server-aided CGKA. That is, the delivery server no longer blindly forwards packets, but instead actively computes individualized packets tailored to each user. As the server is untrusted, this change requires us to develop new mechanisms ensuring robustness of the protocol.},
  author       = {Alwen, Joël and Auerbach, Benedikt and Cueto Noval, Miguel and Klein, Karen and Pascual Perez, Guillermo and Pietrzak, Krzysztof Z and Walter, Michael},
  booktitle    = {Advances in Cryptology – EUROCRYPT 2022},
  isbn         = {9783031070846},
  issn         = {1611-3349},
  location     = {Trondheim, Norway},
  pages        = {815–844},
  publisher    = {Springer Nature},
  title        = {{CoCoA: Concurrent continuous group key agreement}},
  doi          = {10.1007/978-3-031-07085-3_28},
  volume       = {13276},
  year         = {2022},
}

@inproceedings{12780,
  abstract     = {The ability to scale out training workloads has been one of the key performance enablers of deep learning. The main scaling approach is data-parallel GPU-based training, which has been boosted by hardware and software support for highly efficient point-to-point communication, and in particular via hardware bandwidth over-provisioning. Overprovisioning comes at a cost: there is an order of magnitude price difference between "cloud-grade" servers with such support, relative to their popular "consumer-grade" counterparts, although single server-grade and consumer-grade GPUs can have similar computational envelopes.

In this paper, we show that the costly hardware overprovisioning approach can be supplanted via algorithmic and system design, and propose a framework called CGX, which provides efficient software support for compressed communication in ML applications, for both multi-GPU single-node training, as well as larger-scale multi-node training. CGX is based on two technical advances: At the system level, it relies on a re-developed communication stack for ML frameworks, which provides flexible, highly-efficient support for compressed communication. At the application level, it provides seamless, parameter-free integration with popular frameworks, so that end-users do not have to modify training recipes, nor significant training code. This is complemented by a layer-wise adaptive compression technique which dynamically balances compression gains with accuracy preservation. CGX integrates with popular ML frameworks, providing up to 3X speedups for multi-GPU nodes based on commodity hardware, and order-of-magnitude improvements in the multi-node setting, with negligible impact on accuracy.},
  author       = {Markov, Ilia and Ramezanikebrya, Hamidreza and Alistarh, Dan-Adrian},
  booktitle    = {Proceedings of the 23rd ACM/IFIP International Middleware Conference},
  isbn         = {9781450393409},
  location     = {Quebec, QC, Canada},
  pages        = {241--254},
  publisher    = {Association for Computing Machinery},
  title        = {{CGX: Adaptive system support for communication-efficient deep learning}},
  doi          = {10.1145/3528535.3565248},
  year         = {2022},
}

@article{11732,
  abstract     = {We study the BCS energy gap Ξ in the high–density limit and derive an asymptotic formula, which strongly depends on the strength of the interaction potential V on the Fermi surface. In combination with the recent result by one of us (Math. Phys. Anal. Geom. 25, 3, 2022) on the critical temperature Tc at high densities, we prove the universality of the ratio of the energy gap and the critical temperature.},
  author       = {Henheik, Sven Joscha and Lauritsen, Asbjørn Bækgaard},
  issn         = {1572-9613},
  journal      = {Journal of Statistical Physics},
  keywords     = {Mathematical Physics, Statistical and Nonlinear Physics},
  publisher    = {Springer Nature},
  title        = {{The BCS energy gap at high density}},
  doi          = {10.1007/s10955-022-02965-9},
  volume       = {189},
  year         = {2022},
}

@article{11135,
  abstract     = {We consider a correlated NxN Hermitian random matrix with a polynomially decaying metric correlation structure. By calculating the trace of the moments of the matrix and using the summable decay of the cumulants, we show that its operator norm is stochastically dominated by one.},
  author       = {Reker, Jana},
  issn         = {2010-3271},
  journal      = {Random Matrices: Theory and Applications},
  keywords     = {Discrete Mathematics and Combinatorics, Statistics, Probability and Uncertainty, Statistics and Probability, Algebra and Number Theory},
  number       = {4},
  publisher    = {World Scientific Publishing},
  title        = {{On the operator norm of a Hermitian random matrix with correlated entries}},
  doi          = {10.1142/s2010326322500368},
  volume       = {11},
  year         = {2022},
}

@article{11448,
  abstract     = {Studies of protein fitness landscapes reveal biophysical constraints guiding protein evolution and empower prediction of functional proteins. However, generalisation of these findings is limited due to scarceness of systematic data on fitness landscapes of proteins with a defined evolutionary relationship. We characterized the fitness peaks of four orthologous fluorescent proteins with a broad range of sequence divergence. While two of the four studied fitness peaks were sharp, the other two were considerably flatter, being almost entirely free of epistatic interactions. Mutationally robust proteins, characterized by a flat fitness peak, were not optimal templates for machine-learning-driven protein design – instead, predictions were more accurate for fragile proteins with epistatic landscapes. Our work paves insights for practical application of fitness landscape heterogeneity in protein engineering.},
  author       = {Gonzalez Somermeyer, Louisa and Fleiss, Aubin and Mishin, Alexander S and Bozhanova, Nina G and Igolkina, Anna A and Meiler, Jens and Alaball Pujol, Maria-Elisenda and Putintseva, Ekaterina V and Sarkisyan, Karen S and Kondrashov, Fyodor},
  issn         = {2050-084X},
  journal      = {eLife},
  keywords     = {General Immunology and Microbiology, General Biochemistry, Genetics and Molecular Biology, General Medicine, General Neuroscience},
  publisher    = {eLife Sciences Publications},
  title        = {{Heterogeneity of the GFP fitness landscape and data-driven protein design}},
  doi          = {10.7554/elife.75842},
  volume       = {11},
  year         = {2022},
}

@article{10851,
  abstract     = {Superconductor-semiconductor hybrid devices are at the heart of several proposed approaches to quantum information processing, but their basic properties remain to be understood. We embed a twodimensional Al-InAs hybrid system in a resonant microwave circuit, probing the breakdown of superconductivity due to an applied magnetic field. We find a fingerprint from the two-component nature of the hybrid system, and quantitatively compare with a theory that includes the contribution of intraband p±ip pairing in the InAs, as well as the emergence of Bogoliubov-Fermi surfaces due to magnetic field. Separately resolving the Al and InAs contributions allows us to determine the carrier density and mobility in the InAs.},
  author       = {Phan, Duc T and Senior, Jorden L and Ghazaryan, Areg and Hatefipour, M. and Strickland, W. M. and Shabani, J. and Serbyn, Maksym and Higginbotham, Andrew P},
  issn         = {1079-7114},
  journal      = {Physical Review Letters},
  keywords     = {General Physics and Astronomy},
  number       = {10},
  publisher    = {American Physical Society},
  title        = {{Detecting induced p±ip pairing at the Al-InAs interface with a quantum microwave circuit}},
  doi          = {10.1103/physrevlett.128.107701},
  volume       = {128},
  year         = {2022},
}

@article{10042,
  abstract     = {SnSe has emerged as one of the most promising materials for thermoelectric energy conversion due to its extraordinary performance in its single-crystal form and its low-cost constituent elements. However, to achieve an economic impact, the polycrystalline counterpart needs to replicate the performance of the single crystal. Herein, we optimize the thermoelectric performance of polycrystalline SnSe produced by consolidating solution-processed and surface-engineered SnSe particles. In particular, the SnSe particles are coated with CdSe molecular complexes that crystallize during the sintering process, forming CdSe nanoparticles. The presence of CdSe nanoparticles inhibits SnSe grain growth during the consolidation step due to Zener pinning, yielding a material with a high density of grain boundaries. Moreover, the resulting SnSe–CdSe nanocomposites present a large number of defects at different length scales, which significantly reduce the thermal conductivity. The produced SnSe–CdSe nanocomposites exhibit thermoelectric figures of merit up to 2.2 at 786 K, which is among the highest reported for solution-processed SnSe.},
  author       = {Liu, Yu and Calcabrini, Mariano and Yu, Yuan and Lee, Seungho and Chang, Cheng and David, Jérémy and Ghosh, Tanmoy and Spadaro, Maria Chiara and Xie, Chenyang and Cojocaru-Mirédin, Oana and Arbiol, Jordi and Ibáñez, Maria},
  issn         = {1936-086X},
  journal      = {ACS Nano},
  keywords     = {tin selenide, nanocomposite, grain growth, Zener pinning, thermoelectricity, annealing, solution processing},
  number       = {1},
  pages        = {78--88},
  publisher    = {American Chemical Society },
  title        = {{Defect engineering in solution-processed polycrystalline SnSe leads to high thermoelectric performance}},
  doi          = {10.1021/acsnano.1c06720},
  volume       = {16},
  year         = {2022},
}

@article{12237,
  abstract     = {Thermoelectric technology requires synthesizing complex materials where not only the crystal structure but also other structural features such as defects, grain size and orientation, and interfaces must be controlled. To date, conventional solid-state techniques are unable to provide this level of control. Herein, we present a synthetic approach in which dense inorganic thermoelectric materials are produced by the consolidation of well-defined nanoparticle powders. The idea is that controlling the characteristics of the powder allows the chemical transformations that take place during consolidation to be guided, ultimately yielding inorganic solids with targeted features. Different from conventional methods, syntheses in solution can produce particles with unprecedented control over their size, shape, crystal structure, composition, and surface chemistry. However, to date, most works have focused only on the low-cost benefits of this strategy. In this perspective, we first cover the opportunities that solution processing of the powder offers, emphasizing the potential structural features that can be controlled by precisely engineering the inorganic core of the particle, the surface, and the organization of the particles before consolidation. We then discuss the challenges of this synthetic approach and more practical matters related to solution processing. Finally, we suggest some good practices for adequate knowledge transfer and improving reproducibility among different laboratories.},
  author       = {Fiedler, Christine and Kleinhanns, Tobias and Garcia, Maria and Lee, Seungho and Calcabrini, Mariano and Ibáñez, Maria},
  issn         = {1520-5002},
  journal      = {Chemistry of Materials},
  keywords     = {Materials Chemistry, General Chemical Engineering, General Chemistry},
  number       = {19},
  pages        = {8471--8489},
  publisher    = {American Chemical Society},
  title        = {{Solution-processed inorganic thermoelectric materials: Opportunities and challenges ∇}},
  doi          = {10.1021/acs.chemmater.2c01967},
  volume       = {34},
  year         = {2022},
}