@article{11471, abstract = {Variational quantum algorithms are promising algorithms for achieving quantum advantage on nearterm devices. The quantum hardware is used to implement a variational wave function and measure observables, whereas the classical computer is used to store and update the variational parameters. The optimization landscape of expressive variational ansätze is however dominated by large regions in parameter space, known as barren plateaus, with vanishing gradients, which prevents efficient optimization. In this work we propose a general algorithm to avoid barren plateaus in the initialization and throughout the optimization. To this end we define a notion of weak barren plateaus (WBPs) based on the entropies of local reduced density matrices. The presence of WBPs can be efficiently quantified using recently introduced shadow tomography of the quantum state with a classical computer. We demonstrate that avoidance of WBPs suffices to ensure sizable gradients in the initialization. In addition, we demonstrate that decreasing the gradient step size, guided by the entropies allows WBPs to be avoided during the optimization process. This paves the way for efficient barren plateau-free optimization on near-term devices. }, author = {Sack, Stefan and Medina Ramos, Raimel A and Michailidis, Alexios and Kueng, Richard and Serbyn, Maksym}, issn = {2691-3399}, journal = {PRX Quantum}, keywords = {General Medicine}, number = {2}, publisher = {American Physical Society}, title = {{Avoiding barren plateaus using classical shadows}}, doi = {10.1103/prxquantum.3.020365}, volume = {3}, year = {2022}, } @article{12272, abstract = {Reading, interpreting and crawling along gradients of chemotactic cues is one of the most complex questions in cell biology. In this issue, Georgantzoglou et al. (2022. J. Cell. Biol.https://doi.org/10.1083/jcb.202103207) use in vivo models to map the temporal sequence of how neutrophils respond to an acutely arising gradient of chemoattractant.}, author = {Stopp, Julian A and Sixt, Michael K}, issn = {1540-8140}, journal = {Journal of Cell Biology}, keywords = {Cell Biology}, number = {8}, publisher = {Rockefeller University Press}, title = {{Plan your trip before you leave: The neutrophils’ search-and-run journey}}, doi = {10.1083/jcb.202206127}, volume = {221}, year = {2022}, } @article{10924, abstract = {Solid-state microwave systems offer strong interactions for fast quantum logic and sensing but photons at telecom wavelength are the ideal choice for high-density low-loss quantum interconnects. A general-purpose interface that can make use of single photon effects requires < 1 input noise quanta, which has remained elusive due to either low efficiency or pump induced heating. Here we demonstrate coherent electro-optic modulation on nanosecond-timescales with only 0.16+0.02−0.01 microwave input noise photons with a total bidirectional transduction efficiency of 8.7% (or up to 15% with 0.41+0.02−0.02), as required for near-term heralded quantum network protocols. The use of short and high-power optical pump pulses also enables near-unity cooperativity of the electro-optic interaction leading to an internal pure conversion efficiency of up to 99.5%. Together with the low mode occupancy this provides evidence for electro-optic laser cooling and vacuum amplification as predicted a decade ago.}, author = {Sahu, Rishabh and Hease, William J and Rueda Sanchez, Alfredo R and Arnold, Georg M and Qiu, Liu and Fink, Johannes M}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Quantum-enabled operation of a microwave-optical interface}}, doi = {10.1038/s41467-022-28924-2}, volume = {13}, year = {2022}, } @article{12248, abstract = {Eurasian brine shrimp (genus Artemia) have closely related sexual and asexual lineages of parthenogenetic females, which produce rare males at low frequencies. Although they are known to have ZW chromosomes, these are not well characterized, and it is unclear whether they are shared across the clade. Furthermore, the underlying genetic architecture of the transmission of asexuality, which can occur when rare males mate with closely related sexual females, is not well understood. We produced a chromosome-level assembly for the sexual Eurasian species Artemia sinica and characterized in detail the pair of sex chromosomes of this species. We combined this new assembly with short-read genomic data for the sexual species Artemia sp. Kazakhstan and several asexual lineages of Artemia parthenogenetica, allowing us to perform an in-depth characterization of sex-chromosome evolution across the genus. We identified a small differentiated region of the ZW pair that is shared by all sexual and asexual lineages, supporting the shared ancestry of the sex chromosomes. We also inferred that recombination suppression has spread to larger sections of the chromosome independently in the American and Eurasian lineages. Finally, we took advantage of a rare male, which we backcrossed to sexual females, to explore the genetic basis of asexuality. Our results suggest that parthenogenesis is likely partly controlled by a locus on the Z chromosome, highlighting the interplay between sex determination and asexuality.}, author = {Elkrewi, Marwan N and Khauratovich, Uladzislava and Toups, Melissa A and Bett, Vincent K and Mrnjavac, Andrea and Macon, Ariana and Fraisse, Christelle and Sax, Luca and Huylmans, Ann K and Hontoria, Francisco and Vicoso, Beatriz}, issn = {1943-2631}, journal = {Genetics}, keywords = {Genetics}, number = {2}, publisher = {Oxford University Press}, title = {{ZW sex-chromosome evolution and contagious parthenogenesis in Artemia brine shrimp}}, doi = {10.1093/genetics/iyac123}, volume = {222}, year = {2022}, } @article{10767, abstract = {The t-haplotype of mice is a classical model for autosomal transmission distortion. A largely non-recombining variant of the proximal region of chromosome 17, it is transmitted to more than 90% of the progeny of heterozygous males through the disabling of sperm carrying a standard chromosome. While extensive genetic and functional work has shed light on individual genes involved in drive, much less is known about the evolution and function of the rest of its hundreds of genes. Here, we characterize the sequence and expression of dozens of t-specific transcripts and of their chromosome 17 homologues. Many genes showed reduced expression of the t-allele, but an equal number of genes showed increased expression of their t-copy, consistent with increased activity or a newly evolved function. Genes on the t-haplotype had a significantly higher non-synonymous substitution rate than their homologues on the standard chromosome, with several genes harbouring dN/dS ratios above 1. Finally, the t-haplotype has acquired at least two genes from other chromosomes, which show high and tissue-specific expression. These results provide a first overview of the gene content of this selfish element, and support a more dynamic evolutionary scenario than expected of a large genomic region with almost no recombination.}, author = {Kelemen, Réka K and Elkrewi, Marwan N and Lindholm, Anna K. and Vicoso, Beatriz}, issn = {1471-2954}, journal = {Proceedings of the Royal Society B: Biological Sciences}, number = {1968}, pages = {20211985}, publisher = {The Royal Society}, title = {{Novel patterns of expression and recruitment of new genes on the t-haplotype, a mouse selfish chromosome}}, doi = {10.1098/rspb.2021.1985}, volume = {289}, year = {2022}, } @phdthesis{10727, abstract = {Social insects are a common model to study disease dynamics in social animals. Even though pathogens should thrive in social insect colonies as the hosts engage in frequent social interactions, are closely related and live in a pathogen-rich environment, disease outbreaks are rare. This is because social insects have evolved mechanisms to keep pathogens at bay – and fight disease as a collective. Social insect colonies are often viewed as “superorganisms” with division of labor between reproductive “germ-like” queens and males and “somatic” workers, which together form an interdependent reproductive unit that parallels a multicellular body. Superorganisms possess a “social immune system” that comprises of collective disease defenses performed by the workers - summarized as “social immunity”. In social groups immunization (reduced susceptibility to a parasite upon secondary exposure to the same parasite) can e.g. be triggered by social interactions (“social immunization”). Social immunization can be caused by (i) asymptomatic low-level infections that are acquired during caregiving to a contagious individual that can give an immune boost, which can induce protection upon later encounter with the same pathogen (active immunization) or (ii) by transfer of immune effectors between individuals (passive immunization). In the second chapter, I built up on a study that I co-authored that found that low-level infections can not only be protective, but also be costly and make the host more susceptible to detrimental superinfections after contact to a very dissimilar pathogen. I here now tested different degrees of phylogenetically-distant fungal strains of M. brunneum and M. robertsii in L. neglectus and can describe the occurrence of cross-protection of social immunization if the first and second pathogen are from the same level. Interestingly, low-level infections only provided protection when the first strain was less virulent than the second strain and elicited higher immune gene expression. In the third and fourth chapters, I expanded on the role of social immunity in sexual selection, a so far unstudied field. I used the fungus Metarhizium robertsii and the ant Cardiocondyla obscurior as a model, as in this species mating occurs in the presence of workers and can be studied under laboratory conditions. Before males mate with virgin queens in the nest they engage in fierce combat over the access to their mating partners. First, I focused on male-male competition in the third chapter and found that fighting with a contagious male is costly as it can lead to contamination of the rival, but that workers can decrease the risk of disease contraction by performing sanitary care. In the fourth chapter, I studied the effect of fungal infection on survival and mating success of sexuals (freshly emerged queens and males) and found that worker-performed sanitary care can buffer the negative effect that a pathogenic contagion would have on sexuals by spore removal from the exposed individuals. When social immunity was prevented and queens could contract spores from their mating partner, very low dosages led to negative consequences: their lifespan was reduced and they produced fewer offspring with poor immunocompetence compared to healthy queens. Interestingly, cohabitation with a late-stage infected male where no spore transfer was possible had a positive effect on offspring immunity – male offspring of mothers that apparently perceived an infected partner in their vicinity reacted more sensitively to fungal challenge than male offspring without paternal pathogen history.}, author = {Metzler, Sina}, issn = {2663-337X}, publisher = {Institute of Science and Technology Austria}, title = {{Pathogen-mediated sexual selection and immunization in ant colonies}}, doi = {10.15479/AT:ISTA:10727}, year = {2022}, } @article{10208, abstract = {It is practical to collect a huge amount of movement data and environmental context information along with the health signals of individuals because there is the emergence of new generations of positioning and tracking technologies and rapid advancements of health sensors. The study of the relations between these datasets and their sequence similarity analysis is of interest to many applications such as health monitoring and recommender systems. However, entering all movement parameters and health signals can lead to the complexity of the problem and an increase in its computational load. In this situation, dimension reduction techniques can be used to avoid consideration of simultaneous dependent parameters in the process of similarity measurement of the trajectories. The present study provides a framework, named CaDRAW, to use spatial–temporal data and movement parameters along with independent context information in the process of measuring the similarity of trajectories. In this regard, the omission of dependent movement characteristic signals is conducted by using an unsupervised feature selection dimension reduction technique. To evaluate the effectiveness of the proposed framework, it was applied to a real contextualized movement and related health signal datasets of individuals. The results indicated the capability of the proposed framework in measuring the similarity and in decreasing the characteristic signals in such a way that the similarity results -before and after reduction of dependent characteristic signals- have small differences. The mean differences between the obtained results before and after reducing the dimension were 0.029 and 0.023 for the round path, respectively.}, author = {Goudarzi, Samira and Sharif, Mohammad and Karimipour, Farid}, issn = {1868-5145}, journal = {Journal of Ambient Intelligence and Humanized Computing}, keywords = {general computer science}, pages = {2621–2635}, publisher = {Springer Nature}, title = {{A context-aware dimension reduction framework for trajectory and health signal analyses}}, doi = {10.1007/s12652-021-03569-z}, volume = {13}, year = {2022}, } @article{11420, abstract = {Understanding the properties of neural networks trained via stochastic gradient descent (SGD) is at the heart of the theory of deep learning. In this work, we take a mean-field view, and consider a two-layer ReLU network trained via noisy-SGD for a univariate regularized regression problem. Our main result is that SGD with vanishingly small noise injected in the gradients is biased towards a simple solution: at convergence, the ReLU network implements a piecewise linear map of the inputs, and the number of “knot” points -- i.e., points where the tangent of the ReLU network estimator changes -- between two consecutive training inputs is at most three. In particular, as the number of neurons of the network grows, the SGD dynamics is captured by the solution of a gradient flow and, at convergence, the distribution of the weights approaches the unique minimizer of a related free energy, which has a Gibbs form. Our key technical contribution consists in the analysis of the estimator resulting from this minimizer: we show that its second derivative vanishes everywhere, except at some specific locations which represent the “knot” points. We also provide empirical evidence that knots at locations distinct from the data points might occur, as predicted by our theory.}, author = {Shevchenko, Aleksandr and Kungurtsev, Vyacheslav and Mondelli, Marco}, issn = {1533-7928}, journal = {Journal of Machine Learning Research}, number = {130}, pages = {1--55}, publisher = {Journal of Machine Learning Research}, title = {{Mean-field analysis of piecewise linear solutions for wide ReLU networks}}, volume = {23}, year = {2022}, } @article{7577, abstract = {Weak convergence of inertial iterative method for solving variational inequalities is the focus of this paper. The cost function is assumed to be non-Lipschitz and monotone. We propose a projection-type method with inertial terms and give weak convergence analysis under appropriate conditions. Some test results are performed and compared with relevant methods in the literature to show the efficiency and advantages given by our proposed methods.}, author = {Shehu, Yekini and Iyiola, Olaniyi S.}, issn = {1563-504X}, journal = {Applicable Analysis}, number = {1}, pages = {192--216}, publisher = {Taylor & Francis}, title = {{Weak convergence for variational inequalities with inertial-type method}}, doi = {10.1080/00036811.2020.1736287}, volume = {101}, year = {2022}, } @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}, } @article{10860, abstract = {A tight frame is the orthogonal projection of some orthonormal basis of Rn onto Rk. We show that a set of vectors is a tight frame if and only if the set of all cross products of these vectors is a tight frame. We reformulate a range of problems on the volume of projections (or sections) of regular polytopes in terms of tight frames and write a first-order necessary condition for local extrema of these problems. As applications, we prove new results for the problem of maximization of the volume of zonotopes.}, author = {Ivanov, Grigory}, issn = {1496-4287}, journal = {Canadian Mathematical Bulletin}, keywords = {General Mathematics, Tight frame, Grassmannian, zonotope}, number = {4}, pages = {942--963}, publisher = {Canadian Mathematical Society}, title = {{Tight frames and related geometric problems}}, doi = {10.4153/s000843952000096x}, volume = {64}, year = {2021}, }