@article{7940,
abstract = {We prove that the Yangian associated to an untwisted symmetric affine Kac–Moody Lie algebra is isomorphic to the Drinfeld double of a shuffle algebra. The latter is constructed in [YZ14] as an algebraic formalism of cohomological Hall algebras. As a consequence, we obtain the Poincare–Birkhoff–Witt (PBW) theorem for this class of affine Yangians. Another independent proof of the PBW theorem is given recently by Guay, Regelskis, and Wendlandt [GRW18].},
author = {Yang, Yaping and Zhao, Gufang},
issn = {1531586X},
journal = {Transformation Groups},
publisher = {Springer Nature},
title = {{The PBW theorem for affine Yangians}},
doi = {10.1007/s00031-020-09572-6},
year = {2020},
}
@inbook{7941,
abstract = {Expansion microscopy is a recently developed super-resolution imaging technique, which provides an alternative to optics-based methods such as deterministic approaches (e.g. STED) or stochastic approaches (e.g. PALM/STORM). The idea behind expansion microscopy is to embed the biological sample in a swellable gel, and then to expand it isotropically, thereby increasing the distance between the fluorophores. This approach breaks the diffraction barrier by simply separating the emission point-spread-functions of the fluorophores. The resolution attainable in expansion microscopy is thus directly dependent on the separation that can be achieved, i.e. on the expansion factor. The original implementation of the technique achieved an expansion factor of fourfold, for a resolution of 70–80 nm. The subsequently developed X10 method achieves an expansion factor of 10-fold, for a resolution of 25–30 nm. This technique can be implemented with minimal technical requirements on any standard fluorescence microscope, and is more easily applied for multi-color imaging than either deterministic or stochastic super-resolution approaches. This renders X10 expansion microscopy a highly promising tool for new biological discoveries, as discussed here, and as demonstrated by several recent applications.},
author = {Truckenbrodt, Sven M and Rizzoli, Silvio O.},
booktitle = {Methods in Cell Biology},
issn = {0091679X},
publisher = {Elsevier},
title = {{Simple multi-color super-resolution by X10 microscopy}},
doi = {10.1016/bs.mcb.2020.04.016},
year = {2020},
}
@article{7942,
abstract = {An understanding of the missing antinodal electronic excitations in the pseudogap state is essential for uncovering the physics of the underdoped cuprate high-temperature superconductors1,2,3,4,5,6. The majority of high-temperature experiments performed thus far, however, have been unable to discern whether the antinodal states are rendered unobservable due to their damping or whether they vanish due to their gapping7,8,9,10,11,12,13,14,15,16,17,18. Here, we distinguish between these two scenarios by using quantum oscillations to examine whether the small Fermi surface pocket, found to occupy only 2% of the Brillouin zone in the underdoped cuprates19,20,21,22,23,24, exists in isolation against a majority of completely gapped density of states spanning the antinodes, or whether it is thermodynamically coupled to a background of ungapped antinodal states. We find that quantum oscillations associated with the small Fermi surface pocket exhibit a signature sawtooth waveform characteristic of an isolated two-dimensional Fermi surface pocket25,26,27,28,29,30,31,32. This finding reveals that the antinodal states are destroyed by a hard gap that extends over the majority of the Brillouin zone, placing strong constraints on a drastic underlying origin of quasiparticle disappearance over almost the entire Brillouin zone in the pseudogap regime7,8,9,10,11,12,13,14,15,16,17,18.},
author = {Hartstein, Máté and Hsu, Yu Te and Modic, Kimberly A and Porras, Juan and Loew, Toshinao and Tacon, Matthieu Le and Zuo, Huakun and Wang, Jinhua and Zhu, Zengwei and Chan, Mun K. and Mcdonald, Ross D. and Lonzarich, Gilbert G. and Keimer, Bernhard and Sebastian, Suchitra E. and Harrison, Neil},
issn = {17452481},
journal = {Nature Physics},
publisher = {Springer Nature},
title = {{Hard antinodal gap revealed by quantum oscillations in the pseudogap regime of underdoped high-Tc superconductors}},
doi = {10.1038/s41567-020-0910-0},
year = {2020},
}
@phdthesis{7944,
abstract = {This thesis considers two examples of reconfiguration problems: flipping edges in edge-labelled triangulations of planar point sets and swapping labelled tokens placed on vertices of a graph. In both cases the studied structures – all the triangulations of a given point set or all token placements on a given graph – can be thought of as vertices of the so-called reconfiguration graph, in which two vertices are adjacent if the corresponding structures differ by a single elementary operation – by a flip of a diagonal in a triangulation or by a swap of tokens on adjacent vertices, respectively. We study the reconfiguration of one instance of a structure into another via (shortest) paths in the reconfiguration graph.
For triangulations of point sets in which each edge has a unique label and a flip transfers the label from the removed edge to the new edge, we prove a polynomial-time testable condition, called the Orbit Theorem, that characterizes when two triangulations of the same point set lie in the same connected component of the reconfiguration graph. The condition was first conjectured by Bose, Lubiw, Pathak and Verdonschot. We additionally provide a polynomial time algorithm that computes a reconfiguring flip sequence, if it exists. Our proof of the Orbit Theorem uses topological properties of a certain high-dimensional cell complex that has the usual reconfiguration graph as its 1-skeleton.
In the context of token swapping on a tree graph, we make partial progress on the problem of finding shortest reconfiguration sequences. We disprove the so-called Happy Leaf Conjecture and demonstrate the importance of swapping tokens that are already placed at the correct vertices. We also prove that a generalization of the problem to weighted coloured token swapping is NP-hard on trees but solvable in polynomial time on paths and stars.},
author = {Masárová, Zuzana},
isbn = {978-3-99078-005-3},
issn = {2663-337X},
keywords = {reconfiguration, reconfiguration graph, triangulations, flip, constrained triangulations, shellability, piecewise-linear balls, token swapping, trees, coloured weighted token swapping},
pages = {160},
publisher = {IST Austria},
title = {{Reconfiguration problems}},
doi = {10.15479/AT:ISTA:7944},
year = {2020},
}
@article{7948,
abstract = {In agricultural systems, nitrate is the main source of nitrogen available for plants. Besides its role as a nutrient, nitrate has been shown to act as a signal molecule for plant growth, development and stress responses. In Arabidopsis, the NRT1.1 nitrate transceptor represses lateral root (LR) development at low nitrate availability by promoting auxin basipetal transport out of the LR primordia (LRPs). In addition, our present study shows that NRT1.1 acts as a negative regulator of the TAR2 auxin biosynthetic gene expression in the root stele. This is expected to repress local auxin biosynthesis and thus to reduce acropetal auxin supply to the LRPs. Moreover, NRT1.1 also negatively affects expression of the LAX3 auxin influx carrier, thus preventing cell wall remodeling required for overlying tissues separation during LRP emergence. Both NRT1.1-mediated repression of TAR2 and LAX3 are suppressed at high nitrate availability, resulting in the nitrate induction of TAR2 and LAX3 expression that is required for optimal stimulation of LR development by nitrate. Altogether, our results indicate that the NRT1.1 transceptor coordinately controls several crucial auxin-associated processes required for LRP development, and as a consequence that NRT1.1 plays a much more integrated role than previously anticipated in regulating the nitrate response of root system architecture.},
author = {Maghiaoui, A and Bouguyon, E and Cuesta, Candela and Perrine-Walker, F and Alcon, C and Krouk, G and Benková, Eva and Nacry, P and Gojon, A and Bach, L},
issn = {0022-0957},
journal = {Journal of Experimental Botany},
publisher = {Oxford University Press},
title = {{The Arabidopsis NRT1.1 transceptor coordinately controls auxin biosynthesis and transport to regulate root branching in response to nitrate}},
doi = {10.1093/jxb/eraa242},
year = {2020},
}
@article{7949,
abstract = {Peptides derived from non-functional precursors play important roles in various developmental processes, but also in (a)biotic stress signaling. Our (phospho)proteome-wide analyses of C-terminally encoded peptide 5 (CEP5)-mediated changes revealed an impact on abiotic stress-related processes. Drought has a dramatic impact on plant growth, development and reproduction, and the plant hormone auxin plays a role in drought responses. Our genetic, physiological, biochemical and pharmacological results demonstrated that CEP5-mediated signaling is relevant for osmotic and drought stress tolerance in Arabidopsis, and that CEP5 specifically counteracts auxin effects. Specifically, we found that CEP5 signaling stabilizes AUX/IAA transcriptional repressors, suggesting the existence of a novel peptide-dependent control mechanism that tunes auxin signaling. These observations align with the recently described role of AUX/IAAs in stress tolerance and provide a novel role for CEP5 in osmotic and drought stress tolerance.},
author = {Smith, S and Zhu, S and Joos, L and Roberts, I and Nikonorova, N and Vu, LD and Stes, E and Cho, H and Larrieu, A and Xuan, W and Goodall, B and van de Cotte, B and Waite, JM and Rigal, A and R Harborough, SR and Persiau, G and Vanneste, S and Kirschner, GK and Vandermarliere, E and Martens, L and Stahl, Y and Audenaert, D and Friml, Jiří and Felix, G and Simon, R and Bennett, M and Bishopp, A and De Jaeger, G and Ljung, K and Kepinski, S and Robert, S and Nemhauser, J and Hwang, I and Gevaert, K and Beeckman, T and De Smet, I},
issn = {1535-9476},
journal = {Molecular & Cellular Proteomics},
number = {8},
pages = {1248--1262},
publisher = {American Society for Biochemistry and Molecular Biology},
title = {{The CEP5 peptide promotes abiotic stress tolerance, as revealed by quantitative proteomics, and attenuates the AUX/IAA equilibrium in Arabidopsis}},
doi = {10.1074/mcp.ra119.001826},
volume = {19},
year = {2020},
}
@inproceedings{7952,
abstract = {Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued smooth function f: ℝ^d → ℝ^(d-n). A natural (and efficient) way to approximate an isomanifold is to consider its Piecewise-Linear (PL) approximation based on a triangulation 𝒯 of the ambient space ℝ^d. In this paper, we give conditions under which the PL-approximation of an isomanifold is topologically equivalent to the isomanifold. The conditions are easy to satisfy in the sense that they can always be met by taking a sufficiently fine triangulation 𝒯. This contrasts with previous results on the triangulation of manifolds where, in arbitrary dimensions, delicate perturbations are needed to guarantee topological correctness, which leads to strong limitations in practice. We further give a bound on the Fréchet distance between the original isomanifold and its PL-approximation. Finally we show analogous results for the PL-approximation of an isomanifold with boundary. },
author = {Boissonnat, Jean-Daniel and Wintraecken, Mathijs},
booktitle = {36th International Symposium on Computational Geometry},
isbn = {978-3-95977-143-6},
issn = {1868-8969},
location = {Zürich, Switzerland},
pages = {20:1--20:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{The topological correctness of PL-approximations of isomanifolds}},
doi = {10.4230/LIPIcs.SoCG.2020.20},
volume = {164},
year = {2020},
}
@inproceedings{7955,
abstract = {Simple stochastic games are turn-based 2½-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a given probability. A natural extension is games with a conjunction of such conditions as objective. Despite a plethora of recent results on the analysis of systems with multiple objectives, the decidability of this basic problem remains open. In this paper, we present an algorithm approximating the Pareto frontier of the achievable values to a given precision. Moreover, it is an anytime algorithm, meaning it can be stopped at any time returning the current approximation and its error bound.},
author = {Ashok, Pranav and Chatterjee, Krishnendu and Kretinsky, Jan and Weininger, Maximilian and Winkler, Tobias},
booktitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science },
isbn = {9781450371049},
location = {Saarbrücken, Germany},
pages = {102--115},
publisher = {Association for Computing Machinery},
title = {{Approximating values of generalized-reachability stochastic games}},
doi = {10.1145/3373718.3394761},
year = {2020},
}
@article{6184,
abstract = {We prove edge universality for a general class of correlated real symmetric or complex Hermitian Wigner matrices with arbitrary expectation. Our theorem also applies to internal edges of the self-consistent density of states. In particular, we establish a strong form of band rigidity which excludes mismatches between location and label of eigenvalues close to internal edges in these general models.},
author = {Alt, Johannes and Erdös, László and Krüger, Torben H and Schröder, Dominik J},
journal = {Annals of Probability},
number = {2},
pages = {963--1001},
publisher = {Project Euclid},
title = {{Correlated random matrices: Band rigidity and edge universality}},
volume = {48},
year = {2020},
}
@article{6185,
abstract = {For complex Wigner-type matrices, i.e. Hermitian random matrices with independent, not necessarily identically distributed entries above the diagonal, we show that at any cusp singularity of the limiting eigenvalue distribution the local eigenvalue statistics are universal and form a Pearcey process. Since the density of states typically exhibits only square root or cubic root cusp singularities, our work complements previous results on the bulk and edge universality and it thus completes the resolution of the Wigner–Dyson–Mehta universality conjecture for the last remaining universality type in the complex Hermitian class. Our analysis holds not only for exact cusps, but approximate cusps as well, where an extended Pearcey process emerges. As a main technical ingredient we prove an optimal local law at the cusp for both symmetry classes. This result is also the key input in the companion paper (Cipolloni et al. in Pure Appl Anal, 2018. arXiv:1811.04055) where the cusp universality for real symmetric Wigner-type matrices is proven. The novel cusp fluctuation mechanism is also essential for the recent results on the spectral radius of non-Hermitian random matrices (Alt et al. in Spectral radius of random matrices with independent entries, 2019. arXiv:1907.13631), and the non-Hermitian edge universality (Cipolloni et al. in Edge universality for non-Hermitian random matrices, 2019. arXiv:1908.00969).},
author = {Erdös, László and Krüger, Torben H and Schröder, Dominik J},
issn = {1432-0916},
journal = {Communications in Mathematical Physics},
pages = {50},
publisher = {Springer Nature},
title = {{Cusp universality for random matrices I: Local law and the complex hermitian case}},
doi = {10.1007/s00220-019-03657-4},
year = {2020},
}
@article{6358,
abstract = {We study dynamical optimal transport metrics between density matricesassociated to symmetric Dirichlet forms on finite-dimensional C∗-algebras. Our settingcovers arbitrary skew-derivations and it provides a unified framework that simultaneously generalizes recently constructed transport metrics for Markov chains, Lindblad equations, and the Fermi Ornstein–Uhlenbeck semigroup. We develop a non-nommutative differential calculus that allows us to obtain non-commutative Ricci curvature bounds, logarithmic Sobolev inequalities, transport-entropy inequalities, andspectral gap estimates.},
author = {Carlen, Eric A. and Maas, Jan},
issn = {15729613},
journal = {Journal of Statistical Physics},
number = {2},
pages = {319--378},
publisher = {Springer Nature},
title = {{Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems}},
doi = {10.1007/s10955-019-02434-w},
volume = {178},
year = {2020},
}
@article{6563,
abstract = {This paper presents two algorithms. The first decides the existence of a pointed homotopy between given simplicial maps 𝑓,𝑔:𝑋→𝑌, and the second computes the group [𝛴𝑋,𝑌]∗ of pointed homotopy classes of maps from a suspension; in both cases, the target Y is assumed simply connected. More generally, these algorithms work relative to 𝐴⊆𝑋.},
author = {Filakovský, Marek and Vokřínek, Lukas},
issn = {16153383},
journal = {Foundations of Computational Mathematics},
pages = {311--330},
publisher = {Springer Nature},
title = {{Are two given maps homotopic? An algorithmic viewpoint}},
doi = {10.1007/s10208-019-09419-x},
volume = {20},
year = {2020},
}
@article{6593,
abstract = {We consider the monotone variational inequality problem in a Hilbert space and describe a projection-type method with inertial terms under the following properties: (a) The method generates a strongly convergent iteration sequence; (b) The method requires, at each iteration, only one projection onto the feasible set and two evaluations of the operator; (c) The method is designed for variational inequality for which the underline operator is monotone and uniformly continuous; (d) The method includes an inertial term. The latter is also shown to speed up the convergence in our numerical results. A comparison with some related methods is given and indicates that the new method is promising.},
author = {Shehu, Yekini and Li, Xiao-Huan and Dong, Qiao-Li},
issn = {1017-1398},
journal = {Numerical Algorithms},
pages = {365--388},
publisher = {Springer Nature},
title = {{An efficient projection-type method for monotone variational inequalities in Hilbert spaces}},
doi = {10.1007/s11075-019-00758-y},
volume = {84},
year = {2020},
}
@article{6649,
abstract = {While Hartree–Fock theory is well established as a fundamental approximation for interacting fermions, it has been unclear how to describe corrections to it due to many-body correlations. In this paper we start from the Hartree–Fock state given by plane waves and introduce collective particle–hole pair excitations. These pairs can be approximately described by a bosonic quadratic Hamiltonian. We use Bogoliubov theory to construct a trial state yielding a rigorous Gell-Mann–Brueckner–type upper bound to the ground state energy. Our result justifies the random-phase approximation in the mean-field scaling regime, for repulsive, regular interaction potentials.
},
author = {Benedikter, Niels P and Nam, Phan Thành and Porta, Marcello and Schlein, Benjamin and Seiringer, Robert},
issn = {1432-0916},
journal = {Communications in Mathematical Physics},
pages = {2097–2150},
publisher = {Springer Nature},
title = {{Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime}},
doi = {10.1007/s00220-019-03505-5},
volume = {374},
year = {2020},
}
@article{6761,
abstract = {In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability.},
author = {Avni, Guy and Henzinger, Thomas A and Kupferman, Orna},
issn = {03043975},
journal = {Theoretical Computer Science},
pages = {42--55},
publisher = {Elsevier},
title = {{Dynamic resource allocation games}},
doi = {10.1016/j.tcs.2019.06.031},
volume = {807},
year = {2020},
}
@article{6796,
abstract = {Nearby grid cells have been observed to express a remarkable degree of long-rangeorder, which is often idealized as extending potentially to infinity. Yet their strict peri-odic firing and ensemble coherence are theoretically possible only in flat environments, much unlike the burrows which rodents usually live in. Are the symmetrical, coherent grid maps inferred in the lab relevant to chart their way in their natural habitat? We consider spheres as simple models of curved environments and waiting for the appropriate experiments to be performed, we use our adaptation model to predict what grid maps would emerge in a network with the same type of recurrent connections, which on the plane produce coherence among the units. We find that on the sphere such connections distort the maps that single grid units would express on their own, and aggregate them into clusters. When remapping to a different spherical environment, units in each cluster maintain only partial coherence, similar to what is observed in disordered materials, such as spin glasses.},
author = {Stella, Federico and Urdapilleta, Eugenio and Luo, Yifan and Treves, Alessandro},
issn = {10981063},
journal = {Hippocampus},
number = {4},
pages = {302--313},
publisher = {Wiley},
title = {{Partial coherence and frustration in self-organizing spherical grids}},
doi = {10.1002/hipo.23144},
volume = {30},
year = {2020},
}
@article{6808,
abstract = {Super-resolution fluorescence microscopy has become an important catalyst for discovery in the life sciences. In STimulated Emission Depletion (STED) microscopy, a pattern of light drives fluorophores from a signal-emitting on-state to a non-signalling off-state. Only emitters residing in a sub-diffraction volume around an intensity minimum are allowed to fluoresce, rendering them distinguishable from the nearby, but dark fluorophores. STED routinely achieves resolution in the few tens of nanometers range in biological samples and is suitable for live imaging. Here, we review the working principle of STED and provide general guidelines for successful STED imaging. The strive for ever higher resolution comes at the cost of increased light burden. We discuss techniques to reduce light exposure and mitigate its detrimental effects on the specimen. These include specialized illumination strategies as well as protecting fluorophores from photobleaching mediated by high-intensity STED light. This opens up the prospect of volumetric imaging in living cells and tissues with diffraction-unlimited resolution in all three spatial dimensions.},
author = {Jahr, Wiebke and Velicky, Philipp and Danzl, Johann G},
issn = {1046-2023},
journal = {Methods},
number = {3},
pages = {27--41},
publisher = {Elsevier},
title = {{Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens}},
doi = {10.1016/j.ymeth.2019.07.019},
volume = {174},
year = {2020},
}
@article{6918,
abstract = {We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge of the network is operable with its associated probability and the problem is to determine the probability of having at least one source-to-target path that is entirely composed of operable edges. This problem is known to be NP-hard.
We provide a novel scalable algorithm to solve the Network Reliability problem when the treewidth of the underlying network is small. We also show our algorithm’s applicability for real-world transit networks that have small treewidth, including the metro networks of major cities, such as London and Tokyo. Our algorithm leverages tree decompositions to shrink the original graph into much smaller graphs, for which reliability can be efficiently and exactly computed using a brute force method. To the best of our knowledge, this is the first exact algorithm for Network Reliability that can scale to handle real-world instances of the problem.},
author = {Goharshady, Amir Kafshdar and Mohammadi, Fatemeh},
issn = {09518320},
journal = {Reliability Engineering and System Safety},
publisher = {Elsevier},
title = {{An efficient algorithm for computing network reliability in small treewidth}},
doi = {10.1016/j.ress.2019.106665},
volume = {193},
year = {2020},
}
@article{6976,
abstract = {Origami is rapidly transforming the design of robots1,2, deployable structures3,4,5,6 and metamaterials7,8,9,10,11,12,13,14. However, as foldability requires a large number of complex compatibility conditions that are difficult to satisfy, the design of crease patterns is limited to heuristics and computer optimization. Here we introduce a systematic strategy that enables intuitive and effective design of complex crease patterns that are guaranteed to fold. First, we exploit symmetries to construct 140 distinct foldable motifs, and represent these as jigsaw puzzle pieces. We then show that when these pieces are fitted together they encode foldable crease patterns. This maps origami design to solving combinatorial problems, which allows us to systematically create, count and classify a vast number of crease patterns. We show that all of these crease patterns are pluripotent—capable of folding into multiple shapes—and solve exactly for the number of possible shapes for each pattern. Finally, we employ our framework to rationally design a crease pattern that folds into two independently defined target shapes, and fabricate such pluripotent origami. Our results provide physicists, mathematicians and engineers with a powerful new design strategy.},
author = {Dieleman, Peter and Vasmel, Niek and Waitukaitis, Scott R and van Hecke, Martin},
issn = {1745-2481},
journal = {Nature Physics},
number = {1},
pages = {63–68},
publisher = {Springer Nature},
title = {{Jigsaw puzzle design of pluripotent origami}},
doi = {10.1038/s41567-019-0677-3},
volume = {16},
year = {2020},
}
@article{6997,
author = {Zhang, Yuzhou and Friml, Jiří},
issn = {1469-8137},
journal = {New Phytologist},
number = {3},
pages = {1049--1052},
publisher = {Wiley},
title = {{Auxin guides roots to avoid obstacles during gravitropic growth}},
doi = {10.1111/nph.16203},
volume = {225},
year = {2020},
}