TY - JOUR
AB - 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.
AU - Smith, S
AU - Zhu, S
AU - Joos, L
AU - Roberts, I
AU - Nikonorova, N
AU - Vu, LD
AU - Stes, E
AU - Cho, H
AU - Larrieu, A
AU - Xuan, W
AU - Goodall, B
AU - van de Cotte, B
AU - Waite, JM
AU - Rigal, A
AU - R Harborough, SR
AU - Persiau, G
AU - Vanneste, S
AU - Kirschner, GK
AU - Vandermarliere, E
AU - Martens, L
AU - Stahl, Y
AU - Audenaert, D
AU - Friml, Jiří
AU - Felix, G
AU - Simon, R
AU - Bennett, M
AU - Bishopp, A
AU - De Jaeger, G
AU - Ljung, K
AU - Kepinski, S
AU - Robert, S
AU - Nemhauser, J
AU - Hwang, I
AU - Gevaert, K
AU - Beeckman, T
AU - De Smet, I
ID - 7949
IS - 8
JF - Molecular & Cellular Proteomics
SN - 1535-9476
TI - The CEP5 peptide promotes abiotic stress tolerance, as revealed by quantitative proteomics, and attenuates the AUX/IAA equilibrium in Arabidopsis
VL - 19
ER -
TY - JOUR
AB - 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.
AU - Alt, Johannes
AU - Erdös, László
AU - Krüger, Torben H
AU - Schröder, Dominik J
ID - 6184
IS - 2
JF - Annals of Probability
TI - Correlated random matrices: Band rigidity and edge universality
VL - 48
ER -
TY - JOUR
AB - 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 𝐴⊆𝑋.
AU - Filakovský, Marek
AU - Vokřínek, Lukas
ID - 6563
JF - Foundations of Computational Mathematics
SN - 16153375
TI - Are two given maps homotopic? An algorithmic viewpoint
VL - 20
ER -
TY - JOUR
AB - 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.
AU - Shehu, Yekini
AU - Li, Xiao-Huan
AU - Dong, Qiao-Li
ID - 6593
JF - Numerical Algorithms
SN - 1017-1398
TI - An efficient projection-type method for monotone variational inequalities in Hilbert spaces
VL - 84
ER -
TY - JOUR
AB - 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.
AU - Benedikter, Niels P
AU - Nam, Phan Thành
AU - Porta, Marcello
AU - Schlein, Benjamin
AU - Seiringer, Robert
ID - 6649
JF - Communications in Mathematical Physics
SN - 0010-3616
TI - Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime
VL - 374
ER -
TY - JOUR
AB - 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.
AU - Stella, Federico
AU - Urdapilleta, Eugenio
AU - Luo, Yifan
AU - Treves, Alessandro
ID - 6796
IS - 4
JF - Hippocampus
SN - 10509631
TI - Partial coherence and frustration in self-organizing spherical grids
VL - 30
ER -
TY - JOUR
AB - 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.
AU - Jahr, Wiebke
AU - Velicky, Philipp
AU - Danzl, Johann G
ID - 6808
IS - 3
JF - Methods
SN - 1046-2023
TI - Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens
VL - 174
ER -
TY - JOUR
AB - 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.
AU - Dieleman, Peter
AU - Vasmel, Niek
AU - Waitukaitis, Scott R
AU - van Hecke, Martin
ID - 6976
IS - 1
JF - Nature Physics
SN - 1745-2473
TI - Jigsaw puzzle design of pluripotent origami
VL - 16
ER -
TY - JOUR
AB - When short-range attractions are combined with long-range repulsions in colloidal particle systems, complex microphases can emerge. Here, we study a system of isotropic particles, which can form lamellar structures or a disordered fluid phase when temperature is varied. We show that, at equilibrium, the lamellar structure crystallizes, while out of equilibrium, the system forms a variety of structures at different shear rates and temperatures above melting. The shear-induced ordering is analyzed by means of principal component analysis and artificial neural networks, which are applied to data of reduced dimensionality. Our results reveal the possibility of inducing ordering by shear, potentially providing a feasible route to the fabrication of ordered lamellar structures from isotropic particles.
AU - Pȩkalski, J.
AU - Rzadkowski, Wojciech
AU - Panagiotopoulos, A. Z.
ID - 7956
IS - 20
JF - The Journal of chemical physics
TI - Shear-induced ordering in systems with competing interactions: A machine learning study
VL - 152
ER -
TY - JOUR
AB - A string graph is the intersection graph of a family of continuous arcs in the plane. The intersection graph of a family of plane convex sets is a string graph, but not all string graphs can be obtained in this way. We prove the following structure theorem conjectured by Janson and Uzzell: The vertex set of almost all string graphs on n vertices can be partitioned into five cliques such that some pair of them is not connected by any edge (n→∞). We also show that every graph with the above property is an intersection graph of plane convex sets. As a corollary, we obtain that almost all string graphs on n vertices are intersection graphs of plane convex sets.
AU - Pach, János
AU - Reed, Bruce
AU - Yuditsky, Yelena
ID - 7962
IS - 4
JF - Discrete and Computational Geometry
SN - 01795376
TI - Almost all string graphs are intersection graphs of plane convex sets
VL - 63
ER -