TY - CONF
AB - We define and study a discrete process that generalizes the convex-layer decomposition of a planar point set. Our process, which we call homotopic curve shortening (HCS), starts with a closed curve (which might self-intersect) in the presence of a set P⊂ ℝ² of point obstacles, and evolves in discrete steps, where each step consists of (1) taking shortcuts around the obstacles, and (2) reducing the curve to its shortest homotopic equivalent. We find experimentally that, if the initial curve is held fixed and P is chosen to be either a very fine regular grid or a uniformly random point set, then HCS behaves at the limit like the affine curve-shortening flow (ACSF). This connection between HCS and ACSF generalizes the link between "grid peeling" and the ACSF observed by Eppstein et al. (2017), which applied only to convex curves, and which was studied only for regular grids. We prove that HCS satisfies some properties analogous to those of ACSF: HCS is invariant under affine transformations, preserves convexity, and does not increase the total absolute curvature. Furthermore, the number of self-intersections of a curve, or intersections between two curves (appropriately defined), does not increase. Finally, if the initial curve is simple, then the number of inflection points (appropriately defined) does not increase.
AU - Avvakumov, Sergey
AU - Nivasch, Gabriel
ID - 7991
SN - 18688969
T2 - 36th International Symposium on Computational Geometry
TI - Homotopic curve shortening and the affine curve-shortening flow
VL - 164
ER -
TY - CONF
AB - Let K be a convex body in ℝⁿ (i.e., a compact convex set with nonempty interior). Given a point p in the interior of K, a hyperplane h passing through p is called barycentric if p is the barycenter of K ∩ h. In 1961, Grünbaum raised the question whether, for every K, there exists an interior point p through which there are at least n+1 distinct barycentric hyperplanes. Two years later, this was seemingly resolved affirmatively by showing that this is the case if p=p₀ is the point of maximal depth in K. However, while working on a related question, we noticed that one of the auxiliary claims in the proof is incorrect. Here, we provide a counterexample; this re-opens Grünbaum’s question. It follows from known results that for n ≥ 2, there are always at least three distinct barycentric cuts through the point p₀ ∈ K of maximal depth. Using tools related to Morse theory we are able to improve this bound: four distinct barycentric cuts through p₀ are guaranteed if n ≥ 3.
AU - Patakova, Zuzana
AU - Tancer, Martin
AU - Wagner, Uli
ID - 7992
SN - 18688969
T2 - 36th International Symposium on Computational Geometry
TI - Barycentric cuts through a convex body
VL - 164
ER -
TY - CONF
AB - In the recent study of crossing numbers, drawings of graphs that can be extended to an arrangement of pseudolines (pseudolinear drawings) have played an important role as they are a natural combinatorial extension of rectilinear (or straight-line) drawings. A characterization of the pseudolinear drawings of K_n was found recently. We extend this characterization to all graphs, by describing the set of minimal forbidden subdrawings for pseudolinear drawings. Our characterization also leads to a polynomial-time algorithm to recognize pseudolinear drawings and construct the pseudolines when it is possible.
AU - Arroyo Guevara, Alan M
AU - Bensmail, Julien
AU - Bruce Richter, R.
ID - 7994
SN - 18688969
T2 - 36th International Symposium on Computational Geometry
TI - Extending drawings of graphs to arrangements of pseudolines
VL - 164
ER -
TY - JOUR
AB - 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].
AU - Yang, Yaping
AU - Zhao, Gufang
ID - 7940
JF - Transformation Groups
SN - 10834362
TI - The PBW theorem for affine Yangians
VL - 25
ER -
TY - CHAP
AB - 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.
AU - Truckenbrodt, Sven M
AU - Rizzoli, Silvio O.
ID - 7941
SN - 0091679X
T2 - Methods in Cell Biology
TI - Simple multi-color super-resolution by X10 microscopy
ER -
TY - JOUR
AB - 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.
AU - Hartstein, Máté
AU - Hsu, Yu Te
AU - Modic, Kimberly A
AU - Porras, Juan
AU - Loew, Toshinao
AU - Tacon, Matthieu Le
AU - Zuo, Huakun
AU - Wang, Jinhua
AU - Zhu, Zengwei
AU - Chan, Mun K.
AU - Mcdonald, Ross D.
AU - Lonzarich, Gilbert G.
AU - Keimer, Bernhard
AU - Sebastian, Suchitra E.
AU - Harrison, Neil
ID - 7942
JF - Nature Physics
SN - 17452473
TI - Hard antinodal gap revealed by quantum oscillations in the pseudogap regime of underdoped high-Tc superconductors
VL - 16
ER -
TY - JOUR
AB - 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.
AU - Maghiaoui, A
AU - Bouguyon, E
AU - Cuesta, Candela
AU - Perrine-Walker, F
AU - Alcon, C
AU - Krouk, G
AU - Benková, Eva
AU - Nacry, P
AU - Gojon, A
AU - Bach, L
ID - 7948
IS - 15
JF - Journal of Experimental Botany
SN - 0022-0957
TI - The Arabidopsis NRT1.1 transceptor coordinately controls auxin biosynthesis and transport to regulate root branching in response to nitrate
VL - 71
ER -
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 - THES
AB - 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.
AU - Masárová, Zuzana
ID - 7944
KW - reconfiguration
KW - reconfiguration graph
KW - triangulations
KW - flip
KW - constrained triangulations
KW - shellability
KW - piecewise-linear balls
KW - token swapping
KW - trees
KW - coloured weighted token swapping
SN - 978-3-99078-005-3
TI - Reconfiguration problems
ER -
TY - JOUR
AB - We design fast deterministic algorithms for distance computation in the Congested Clique model. Our key contributions include:
A (2+ϵ)-approximation for all-pairs shortest paths in O(log2n/ϵ) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model.
A (1+ϵ)-approximation for multi-source shortest paths from O(n−−√) sources in O(log2n/ϵ) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size.
Our main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in O~(n1/6) rounds.
AU - Censor-Hillel, Keren
AU - Dory, Michal
AU - Korhonen, Janne
AU - Leitersdorf, Dean
ID - 7939
JF - Distributed Computing
SN - 01782770
TI - Fast approximate shortest paths in the congested clique
ER -