@article{10674, abstract = {In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets.}, author = {Aghajohari, Milad and Avni, Guy and Henzinger, Thomas A}, issn = {1860-5974}, journal = {Logical Methods in Computer Science}, keywords = {computer science, computer science and game theory, logic in computer science}, number = {1}, pages = {10:1--10:23}, publisher = {International Federation for Computational Logic}, title = {{Determinacy in discrete-bidding infinite-duration games}}, doi = {10.23638/LMCS-17(1:10)2021}, volume = {17}, year = {2021}, } @inproceedings{10688, abstract = {Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement, which views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the supporting invariants. This paper presents the design and implementation of the Civl verifier.}, author = {Kragl, Bernhard and Qadeer, Shaz}, booktitle = {Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design}, editor = {Ruzica, Piskac and Whalen, Michael W.}, isbn = {978-3-85448-046-4}, location = {Virtual}, pages = {143–152}, publisher = {TU Wien Academic Press}, title = {{The Civl verifier}}, doi = {10.34727/2021/isbn.978-3-85448-046-4_23}, volume = {2}, year = {2021}, } @inproceedings{10692, abstract = {We experimentally investigate narrow and topologically nontrivial moiré minibands hosted by van der Waals heterostructures consisting of a graphene monolayer rotationally faulted with respect to a Bernal-stacked bilayer. At fillings ν= 1 and 3 electrons per moiré unit cell within these bands, we observe quantized anomalous Hall effects with Rxy≈h/2e2, indicative of spontaneous polarization of the system into a single valley-projected band with Chern number C= 2. Remarkably, we also observe the evidence of symmetry broken Chern insulator states at ν= 1.5 and 3.5. At ν= 3 we find that the sign of the quantum anomalous Hall effect can be reversed via field-effect control of the chemical potential. This curious effect arises from the magnetization contribution due to topological edge states, which drive a reversal of the total magnetization and thus a switch of the favored magnetic state. Remarkably, we find that this switch is hysteretic, which we use to demonstrate non-volatile electric-field-induced reversal of the magnetic state. Voltage control of magnetic states can be used to electrically pattern nonvolatile magnetic domain structures hosting chiral edge states, with applications ranging from reconfigurable microwave circuit elements to ultra-low-power magnetic memory.}, author = {Polshyn, Hryhoriy and Zhu, Jihang and Kumar, Manish and Zhang, Yuxuan and Yang, Fangyuan and Tschirhart, Charles and Serlin, Marec and Watanabe, Kenji and Tanaguchi, Takashi and MacDonald, Allan and Young, Andrea}, booktitle = {APS March Meeting 2021}, issn = {0003-0503}, location = {Virtual}, number = {1}, publisher = {American Physical Society}, title = {{Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order}}, volume = {66}, year = {2021}, } @inproceedings{10694, abstract = {In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding.}, author = {Avni, Guy and Jecker, Ismael R and Zikelic, Dorde}, booktitle = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms}, editor = {Marx, Dániel}, isbn = {978-1-61197-646-5}, location = {Virtual}, pages = {617--636}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Infinite-duration all-pay bidding games}}, doi = {10.1137/1.9781611976465.38}, year = {2021}, } @article{10711, abstract = {In this paper, we investigate the distribution of the maximum of partial sums of families of m -periodic complex-valued functions satisfying certain conditions. We obtain precise uniform estimates for the distribution function of this maximum in a near-optimal range. Our results apply to partial sums of Kloosterman sums and other families of ℓ -adic trace functions, and are as strong as those obtained by Bober, Goldmakher, Granville and Koukoulopoulos for character sums. In particular, we improve on the recent work of the third author for Birch sums. However, unlike character sums, we are able to construct families of m -periodic complex-valued functions which satisfy our conditions, but for which the Pólya–Vinogradov inequality is sharp.}, author = {Autissier, Pascal and Bonolis, Dante and Lamzouri, Youness}, issn = {1570-5846}, journal = {Compositio Mathematica}, keywords = {Algebra and Number Theory}, number = {7}, pages = {1610--1651}, publisher = {Cambridge University Press}, title = {{The distribution of the maximum of partial sums of Kloosterman sums and other trace functions}}, doi = {10.1112/s0010437x21007351}, volume = {157}, year = {2021}, } @article{10738, abstract = {We prove an adiabatic theorem for the Landau–Pekar equations. This allows us to derive new results on the accuracy of their use as effective equations for the time evolution generated by the Fröhlich Hamiltonian with large coupling constant α. In particular, we show that the time evolution of Pekar product states with coherent phonon field and the electron being trapped by the phonons is well approximated by the Landau–Pekar equations until times short compared to α2.}, author = {Leopold, Nikolai K and Rademacher, Simone Anna Elvira and Schlein, Benjamin and Seiringer, Robert}, issn = {1948-206X}, journal = {Analysis and PDE}, number = {7}, pages = {2079--2100}, publisher = {Mathematical Sciences Publishers}, title = {{ The Landau–Pekar equations: Adiabatic theorem and accuracy}}, doi = {10.2140/APDE.2021.14.2079}, volume = {14}, year = {2021}, } @unpublished{10762, abstract = {Methods inspired from machine learning have recently attracted great interest in the computational study of quantum many-particle systems. So far, however, it has proven challenging to deal with microscopic models in which the total number of particles is not conserved. To address this issue, we propose a new variant of neural network states, which we term neural coherent states. Taking the Fröhlich impurity model as a case study, we show that neural coherent states can learn the ground state of non-additive systems very well. In particular, we observe substantial improvement over the standard coherent state estimates in the most challenging intermediate coupling regime. Our approach is generic and does not assume specific details of the system, suggesting wide applications.}, author = {Rzadkowski, Wojciech and Lemeshko, Mikhail and Mentink, Johan H.}, booktitle = {arXiv}, pages = {2105.15193}, title = {{Artificial neural network states for non-additive systems}}, doi = {10.48550/arXiv.2105.15193}, year = {2021}, } @unpublished{10803, abstract = {Given the abundance of applications of ranking in recent years, addressing fairness concerns around automated ranking systems becomes necessary for increasing the trust among end-users. Previous work on fair ranking has mostly focused on application-specific fairness notions, often tailored to online advertising, and it rarely considers learning as part of the process. In this work, we show how to transfer numerous fairness notions from binary classification to a learning to rank setting. Our formalism allows us to design methods for incorporating fairness objectives with provable generalization guarantees. An extensive experimental evaluation shows that our method can improve ranking fairness substantially with no or only little loss of model quality.}, author = {Konstantinov, Nikola H and Lampert, Christoph}, booktitle = {arXiv}, title = {{Fairness through regularization for learning to rank}}, doi = {10.48550/arXiv.2102.05996}, year = {2021}, } @article{10806, abstract = {Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’ chemical reactivity and electronic structure. Surface chemistry is thus crucial to understand nanocrystal properties and functionality. Here, we investigate the synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals are capped exclusively with a fatty acid instead of oleylamine. Analysis of the reaction mixtures with nuclear magnetic resonance spectroscopy revealed several reaction byproducts and intermediates that are common to the decomposition of Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive surface chemistry.}, author = {Calcabrini, Mariano and Van den Eynden, Dietger and Sanchez Ribot, Sergi and Pokratath, Rohan and Llorca, Jordi and De Roo, Jonathan and Ibáñez, Maria}, issn = {2691-3704}, journal = {JACS Au}, keywords = {general medicine}, number = {11}, pages = {1898--1903}, publisher = {American Chemical Society}, title = {{Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate}}, doi = {10.1021/jacsau.1c00349}, volume = {1}, year = {2021}, } @article{10816, abstract = {Pattern separation is a fundamental brain computation that converts small differences in input patterns into large differences in output patterns. Several synaptic mechanisms of pattern separation have been proposed, including code expansion, inhibition and plasticity; however, which of these mechanisms play a role in the entorhinal cortex (EC)–dentate gyrus (DG)–CA3 circuit, a classical pattern separation circuit, remains unclear. Here we show that a biologically realistic, full-scale EC–DG–CA3 circuit model, including granule cells (GCs) and parvalbumin-positive inhibitory interneurons (PV+-INs) in the DG, is an efficient pattern separator. Both external gamma-modulated inhibition and internal lateral inhibition mediated by PV+-INs substantially contributed to pattern separation. Both local connectivity and fast signaling at GC–PV+-IN synapses were important for maximum effectiveness. Similarly, mossy fiber synapses with conditional detonator properties contributed to pattern separation. By contrast, perforant path synapses with Hebbian synaptic plasticity and direct EC–CA3 connection shifted the network towards pattern completion. Our results demonstrate that the specific properties of cells and synapses optimize higher-order computations in biological networks and might be useful to improve the deep learning capabilities of technical networks.}, author = {Guzmán, José and Schlögl, Alois and Espinoza Martinez, Claudia and Zhang, Xiaomin and Suter, Benjamin and Jonas, Peter M}, issn = {2662-8457}, journal = {Nature Computational Science}, keywords = {general medicine}, number = {12}, pages = {830--842}, publisher = {Springer Nature}, title = {{How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network}}, doi = {10.1038/s43588-021-00157-1}, volume = {1}, year = {2021}, } @article{10834, abstract = {Hematopoietic-specific protein 1 (Hem1) is an essential subunit of the WAVE regulatory complex (WRC) in immune cells. WRC is crucial for Arp2/3 complex activation and the protrusion of branched actin filament networks. Moreover, Hem1 loss of function in immune cells causes autoimmune diseases in humans. Here, we show that genetic removal of Hem1 in macrophages diminishes frequency and efficacy of phagocytosis as well as phagocytic cup formation in addition to defects in lamellipodial protrusion and migration. Moreover, Hem1-null macrophages displayed strong defects in cell adhesion despite unaltered podosome formation and concomitant extracellular matrix degradation. Specifically, dynamics of both adhesion and de-adhesion as well as concomitant phosphorylation of paxillin and focal adhesion kinase (FAK) were significantly compromised. Accordingly, disruption of WRC function in non-hematopoietic cells coincided with both defects in adhesion turnover and altered FAK and paxillin phosphorylation. Consistently, platelets exhibited reduced adhesion and diminished integrin αIIbβ3 activation upon WRC removal. Interestingly, adhesion phenotypes, but not lamellipodia formation, were partially rescued by small molecule activation of FAK. A full rescue of the phenotype, including lamellipodia formation, required not only the presence of WRCs but also their binding to and activation by Rac. Collectively, our results uncover that WRC impacts on integrin-dependent processes in a FAK-dependent manner, controlling formation and dismantling of adhesions, relevant for properly grabbing onto extracellular surfaces and particles during cell edge expansion, like in migration or phagocytosis.}, author = {Stahnke, Stephanie and Döring, Hermann and Kusch, Charly and de Gorter, David J.J. and Dütting, Sebastian and Guledani, Aleks and Pleines, Irina and Schnoor, Michael and Sixt, Michael K and Geffers, Robert and Rohde, Manfred and Müsken, Mathias and Kage, Frieda and Steffen, Anika and Faix, Jan and Nieswandt, Bernhard and Rottner, Klemens and Stradal, Theresia E.B.}, issn = {0960-9822}, journal = {Current Biology}, keywords = {General Agricultural and Biological Sciences, General Biochemistry, Genetics and Molecular Biology}, number = {10}, pages = {2051--2064.e8}, publisher = {Elsevier}, title = {{Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion}}, doi = {10.1016/j.cub.2021.02.043}, volume = {31}, year = {2021}, } @article{10836, author = {Pranger, Christina L. and Fazekas-Singer, Judit and Köhler, Verena K. and Pali‐Schöll, Isabella and Fiocchi, Alessandro and Karagiannis, Sophia N. and Zenarruzabeitia, Olatz and Borrego, Francisco and Jensen‐Jarolim, Erika}, issn = {1398-9995}, journal = {Allergy}, keywords = {Immunology, Immunology and Allergy}, number = {5}, pages = {1553--1556}, publisher = {Wiley}, title = {{PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow's milk allergy and tolerance}}, doi = {10.1111/all.14604}, volume = {76}, year = {2021}, } @article{10838, abstract = {Combining hybrid zone analysis with genomic data is a promising approach to understanding the genomic basis of adaptive divergence. It allows for the identification of genomic regions underlying barriers to gene flow. It also provides insights into spatial patterns of allele frequency change, informing about the interplay between environmental factors, dispersal and selection. However, when only a single hybrid zone is analysed, it is difficult to separate patterns generated by selection from those resulting from chance. Therefore, it is beneficial to look for repeatable patterns across replicate hybrid zones in the same system. We applied this approach to the marine snail Littorina saxatilis, which contains two ecotypes, adapted to wave-exposed rocks vs. high-predation boulder fields. The existence of numerous hybrid zones between ecotypes offered the opportunity to test for the repeatability of genomic architectures and spatial patterns of divergence. We sampled and phenotyped snails from seven replicate hybrid zones on the Swedish west coast and genotyped them for thousands of single nucleotide polymorphisms. Shell shape and size showed parallel clines across all zones. Many genomic regions showing steep clines and/or high differentiation were shared among hybrid zones, consistent with a common evolutionary history and extensive gene flow between zones, and supporting the importance of these regions for divergence. In particular, we found that several large putative inversions contribute to divergence in all locations. Additionally, we found evidence for consistent displacement of clines from the boulder–rock transition. Our results demonstrate patterns of spatial variation that would not be accessible without continuous spatial sampling, a large genomic data set and replicate hybrid zones.}, author = {Westram, Anja M and Faria, Rui and Johannesson, Kerstin and Butlin, Roger}, issn = {1365-294X}, journal = {Molecular Ecology}, keywords = {Genetics, Ecology, Evolution, Behavior and Systematics}, number = {15}, pages = {3797--3814}, publisher = {Wiley}, title = {{Using replicate hybrid zones to understand the genomic basis of adaptive divergence}}, doi = {10.1111/mec.15861}, volume = {30}, year = {2021}, } @inproceedings{10847, abstract = {We study the two-player zero-sum extension of the partially observable stochastic shortest-path problem where one agent has only partial information about the environment. We formulate this problem as a partially observable stochastic game (POSG): given a set of target states and negative rewards for each transition, the player with imperfect information maximizes the expected undiscounted total reward until a target state is reached. The second player with the perfect information aims for the opposite. We base our formalism on POSGs with one-sided observability (OS-POSGs) and give the following contributions: (1) we introduce a novel heuristic search value iteration algorithm that iteratively solves depth-limited variants of the game, (2) we derive the bound on the depth guaranteeing an arbitrary precision, (3) we propose a novel upper-bound estimation that allows early terminations, and (4) we experimentally evaluate the algorithm on a pursuit-evasion game.}, author = {Tomášek, Petr and Horák, Karel and Aradhye, Aditya and Bošanský, Branislav and Chatterjee, Krishnendu}, booktitle = {30th International Joint Conference on Artificial Intelligence}, isbn = {9780999241196}, issn = {1045-0823}, location = {Virtual, Online}, pages = {4182--4189}, publisher = {International Joint Conferences on Artificial Intelligence}, title = {{Solving partially observable stochastic shortest-path games}}, doi = {10.24963/ijcai.2021/575}, year = {2021}, } @article{10852, abstract = { We review old and new results on the Fröhlich polaron model. The discussion includes the validity of the (classical) Pekar approximation in the strong coupling limit, quantum corrections to this limit, as well as the divergence of the effective polaron mass.}, author = {Seiringer, Robert}, issn = {1793-6659}, journal = {Reviews in Mathematical Physics}, keywords = {Mathematical Physics, Statistical and Nonlinear Physics}, number = {01}, publisher = {World Scientific Publishing}, title = {{The polaron at strong coupling}}, doi = {10.1142/s0129055x20600120}, volume = {33}, year = {2021}, } @inproceedings{10853, abstract = {Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applications to social and communication networks and used as a building block in various other algorithms, such as the bi-connectivity and the dynamic minimal spanning tree problems. In brief, we wish to maintain the connected components of the graph under dynamic edge insertions and deletions. In the sequential case, the problem has been well-studied from both theoretical and practical perspectives. However, much less is known about efficient concurrent solutions to this problem. This is the gap we address in this paper. We start from one of the classic data structures used to solve this problem, the Euler Tour Tree. Our first contribution is a non-blocking single-writer implementation of it. We leverage this data structure to obtain the first truly concurrent generalization of dynamic connectivity, which preserves the time complexity of its sequential counterpart, but is also scalable in practice. To achieve this, we rely on three main techniques. The first is to ensure that connectivity queries, which usually dominate real-world workloads, are non-blocking. The second non-trivial technique expands the above idea by making all queries that do not change the connectivity structure non-blocking. The third ingredient is applying fine-grained locking for updating the connected components, which allows operations on disjoint components to occur in parallel. We evaluate the resulting algorithm on various workloads, executing on both real and synthetic graphs. The results show the efficiency of each of the proposed optimizations; the most efficient variant improves the performance of a coarse-grained based implementation on realistic scenarios up to 6x on average and up to 30x when connectivity queries dominate.}, author = {Fedorov, Alexander and Koval, Nikita and Alistarh, Dan-Adrian}, booktitle = {Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures}, isbn = {9781450380706}, location = {Virtual, Online}, pages = {208--220}, publisher = {Association for Computing Machinery}, title = {{A scalable concurrent algorithm for dynamic connectivity}}, doi = {10.1145/3409964.3461810}, year = {2021}, } @inproceedings{10854, abstract = {Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic CONGEST model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labelled graph under batch changes. We investigate, when a batch of alpha edge label changes arrive, - how much time as a function of alpha we need to update an existing solution, and - how much information the nodes have to keep in local memory between batches in order to update the solution quickly. Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. The diverse time complexity of our model spans from constant time, through time polynomial in alpha, and to alpha time, which we show to be enough for any task.}, author = {Foerster, Klaus-Tycho and Korhonen, Janne and Paz, Ami and Rybicki, Joel and Schmid, Stefan}, booktitle = {Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems}, isbn = {9781450380720}, location = {Virtual, Online}, pages = {71--72}, publisher = {Association for Computing Machinery}, title = {{Input-dynamic distributed algorithms for communication networks}}, doi = {10.1145/3410220.3453923}, year = {2021}, } @article{10855, abstract = {Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \beginitemize \item how much time as a function of α we need to update an existing solution, and \item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques.}, author = {Foerster, Klaus-Tycho and Korhonen, Janne and Paz, Ami and Rybicki, Joel and Schmid, Stefan}, issn = {2476-1249}, journal = {Proceedings of the ACM on Measurement and Analysis of Computing Systems}, keywords = {Computer Networks and Communications, Hardware and Architecture, Safety, Risk, Reliability and Quality, Computer Science (miscellaneous)}, number = {1}, pages = {1--33}, publisher = {Association for Computing Machinery}, title = {{Input-dynamic distributed algorithms for communication networks}}, doi = {10.1145/3447384}, volume = {5}, year = {2021}, } @article{10856, abstract = {We study the properties of the maximal volume k-dimensional sections of the n-dimensional cube [−1, 1]n. We obtain a first order necessary condition for a k-dimensional subspace to be a local maximizer of the volume of such sections, which we formulate in a geometric way. We estimate the length of the projection of a vector of the standard basis of Rn onto a k-dimensional subspace that maximizes the volume of the intersection. We nd the optimal upper bound on the volume of a planar section of the cube [−1, 1]n , n ≥ 2.}, author = {Ivanov, Grigory and Tsiutsiurupa, Igor}, issn = {2299-3274}, journal = {Analysis and Geometry in Metric Spaces}, keywords = {Applied Mathematics, Geometry and Topology, Analysis}, number = {1}, pages = {1--18}, publisher = {De Gruyter}, title = {{On the volume of sections of the cube}}, doi = {10.1515/agms-2020-0103}, volume = {9}, year = {2021}, } @article{10858, abstract = {The cost-effective conversion of low-grade heat into electricity using thermoelectric devices requires developing alternative materials and material processing technologies able to reduce the currently high device manufacturing costs. In this direction, thermoelectric materials that do not rely on rare or toxic elements such as tellurium or lead need to be produced using high-throughput technologies not involving high temperatures and long processes. Bi2Se3 is an obvious possible Te-free alternative to Bi2Te3 for ambient temperature thermoelectric applications, but its performance is still low for practical applications, and additional efforts toward finding proper dopants are required. Here, we report a scalable method to produce Bi2Se3 nanosheets at low synthesis temperatures. We studied the influence of different dopants on the thermoelectric properties of this material. Among the elements tested, we demonstrated that Sn doping resulted in the best performance. Sn incorporation resulted in a significant improvement to the Bi2Se3 Seebeck coefficient and a reduction in the thermal conductivity in the direction of the hot-press axis, resulting in an overall 60% improvement in the thermoelectric figure of merit of Bi2Se3.}, author = {Li, Mengyao and Zhang, Yu and Zhang, Ting and Zuo, Yong and Xiao, Ke and Arbiol, Jordi and Llorca, Jordi and Liu, Yu and Cabot, Andreu}, issn = {2079-4991}, journal = {Nanomaterials}, keywords = {General Materials Science, General Chemical Engineering}, number = {7}, publisher = {MDPI}, title = {{Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping}}, doi = {10.3390/nano11071827}, volume = {11}, year = {2021}, }