TY - CONF
AB - Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation on P is a full triangulation of some subset P' of P containing all extreme points in P. A bistellar flip on a partial triangulation either flips an edge, removes a non-extreme point of degree 3, or adds a point in P ⧵ P' as vertex of degree 3. The bistellar flip graph has all partial triangulations as vertices, and a pair of partial triangulations is adjacent if they can be obtained from one another by a bistellar flip. The goal of this paper is to investigate the structure of this graph, with emphasis on its connectivity. For sets P of n points in general position, we show that the bistellar flip graph is (n-3)-connected, thereby answering, for sets in general position, an open questions raised in a book (by De Loera, Rambau, and Santos) and a survey (by Lee and Santos) on triangulations. This matches the situation for the subfamily of regular triangulations (i.e., partial triangulations obtained by lifting the points and projecting the lower convex hull), where (n-3)-connectivity has been known since the late 1980s through the secondary polytope (Gelfand, Kapranov, Zelevinsky) and Balinski’s Theorem. Our methods also yield the following results (see the full version [Wagner and Welzl, 2020]): (i) The bistellar flip graph can be covered by graphs of polytopes of dimension n-3 (products of secondary polytopes). (ii) A partial triangulation is regular, if it has distance n-3 in the Hasse diagram of the partial order of partial subdivisions from the trivial subdivision. (iii) All partial triangulations are regular iff the trivial subdivision has height n-3 in the partial order of partial subdivisions. (iv) There are arbitrarily large sets P with non-regular partial triangulations, while every proper subset has only regular triangulations, i.e., there are no small certificates for the existence of non-regular partial triangulations (answering a question by F. Santos in the unexpected direction).
AU - Wagner, Uli
AU - Welzl, Emo
ID - 7990
SN - 18688969
T2 - 36th International Symposium on Computational Geometry
TI - Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips)
VL - 164
ER -
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 - When divergent populations are connected by gene flow, the establishment of complete reproductive isolation usually requires the joint action of multiple barrier effects. One example where multiple barrier effects are coupled consists of a single trait that is under divergent natural selection and also mediates assortative mating. Such multiple‐effect traits can strongly reduce gene flow. However, there are few cases where patterns of assortative mating have been described quantitatively and their impact on gene flow has been determined. Two ecotypes of the coastal marine snail, Littorina saxatilis , occur in North Atlantic rocky‐shore habitats dominated by either crab predation or wave action. There is evidence for divergent natural selection acting on size, and size‐assortative mating has previously been documented. Here, we analyze the mating pattern in L. saxatilis with respect to size in intensively sampled transects across boundaries between the habitats. We show that the mating pattern is mostly conserved between ecotypes and that it generates both assortment and directional sexual selection for small male size. Using simulations, we show that the mating pattern can contribute to reproductive isolation between ecotypes but the barrier to gene flow is likely strengthened more by sexual selection than by assortment.
AU - Perini, Samuel
AU - Rafajlović, Marina
AU - Westram, Anja M
AU - Johannesson, Kerstin
AU - Butlin, Roger K.
ID - 7995
IS - 7
JF - Evolution
SN - 00143820
TI - Assortative mating, sexual selection, and their consequences for gene flow in Littorina
VL - 74
ER -
TY - THES
AB - Quantum computation enables the execution of algorithms that have exponential complexity. This might open the path towards the synthesis of new materials or medical drugs, optimization of transport or financial strategies etc., intractable on even the fastest classical computers. A quantum computer consists of interconnected two level quantum systems, called qubits, that satisfy DiVincezo’s criteria. Worldwide, there are ongoing efforts to find the qubit architecture which will unite quantum error correction compatible single and two qubit fidelities, long distance qubit to qubit coupling and
calability. Superconducting qubits have gone the furthest in this race, demonstrating an algorithm running on 53 coupled qubits, but still the fidelities are not even close to those required for realizing a single logical qubit. emiconductor qubits offer extremely good characteristics, but they are currently investigated across different platforms. Uniting those good characteristics into a single platform might be a big step towards the quantum computer realization.
Here we describe the implementation of a hole spin qubit hosted in a Ge hut wire double quantum dot. The high and tunable spin-orbit coupling together with a heavy hole state character is expected to allow fast spin manipulation and long coherence times. Furthermore large lever arms, for hut wire devices, should allow good coupling to superconducting resonators enabling efficient long distance spin to spin coupling and a sensitive gate reflectometry spin readout. The developed cryogenic setup (printed circuit board sample holders, filtering, high-frequency wiring) enabled us to perform low temperature spin dynamics experiments. Indeed, we measured the fastest single spin qubit Rabi frequencies reported so far, reaching 140 MHz, while the dephasing times of 130 ns oppose the long decoherence predictions. In order to further investigate this, a double quantum dot gate was connected directly to a lumped element
resonator which enabled gate reflectometry readout. The vanishing inter-dot transition signal, for increasing external magnetic field, revealed the spin nature of the measured quantity.
AU - Kukucka, Josip
ID - 7996
TI - Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing
ER -
TY - JOUR
AB - Linking epigenetic marks to clinical outcomes improves insight into molecular processes, disease prediction, and therapeutic target identification. Here, a statistical approach is presented to infer the epigenetic architecture of complex disease, determine the variation captured by epigenetic effects, and estimate phenotype-epigenetic probe associations jointly. Implicitly adjusting for probe correlations, data structure (cell-count or relatedness), and single-nucleotide polymorphism (SNP) marker effects, improves association estimates and in 9,448 individuals, 75.7% (95% CI 71.70–79.3) of body mass index (BMI) variation and 45.6% (95% CI 37.3–51.9) of cigarette consumption variation was captured by whole blood methylation array data. Pathway-linked probes of blood cholesterol, lipid transport and sterol metabolism for BMI, and xenobiotic stimuli response for smoking, showed >1.5 times larger associations with >95% posterior inclusion probability. Prediction accuracy improved by 28.7% for BMI and 10.2% for smoking over a LASSO model, with age-, and tissue-specificity, implying associations are a phenotypic consequence rather than causal.
AU - Trejo Banos, D
AU - McCartney, DL
AU - Patxot, M
AU - Anchieri, L
AU - Battram, T
AU - Christiansen, C
AU - Costeira, R
AU - Walker, RM
AU - Morris, SW
AU - Campbell, A
AU - Zhang, Q
AU - Porteous, DJ
AU - McRae, AF
AU - Wray, NR
AU - Visscher, PM
AU - Haley, CS
AU - Evans, KL
AU - Deary, IJ
AU - McIntosh, AM
AU - Hemani, G
AU - Bell, JT
AU - Marioni, RE
AU - Robinson, Matthew Richard
ID - 7999
JF - Nature Communications
SN - 2041-1723
TI - Bayesian reassessment of the epigenetic architecture of complex traits
VL - 11
ER -
TY - JOUR
AB - Post-tetanic potentiation (PTP) is an attractive candidate mechanism for hippocampus-dependent short-term memory. Although PTP has a uniquely large magnitude at hippocampal mossy fiber-CA3 pyramidal neuron synapses, it is unclear whether it can be induced by natural activity and whether its lifetime is sufficient to support short-term memory. We combined in vivo recordings from granule cells (GCs), in vitro paired recordings from mossy fiber terminals and postsynaptic CA3 neurons, and “flash and freeze” electron microscopy. PTP was induced at single synapses and showed a low induction threshold adapted to sparse GC activity in vivo. PTP was mainly generated by enlargement of the readily releasable pool of synaptic vesicles, allowing multiplicative interaction with other plasticity forms. PTP was associated with an increase in the docked vesicle pool, suggesting formation of structural “pool engrams.” Absence of presynaptic activity extended the lifetime of the potentiation, enabling prolonged information storage in the hippocampal network.
AU - Vandael, David H
AU - Borges Merjane, Carolina
AU - Zhang, Xiaomin
AU - Jonas, Peter M
ID - 8001
IS - 3
JF - Neuron
SN - 0896-6273
TI - Short-term plasticity at hippocampal mossy fiber synapses is induced by natural activity patterns and associated with vesicle pool engram formation
VL - 107
ER -
TY - JOUR
AB - Relaxation to a thermal state is the inevitable fate of nonequilibrium interacting quantum systems without special conservation laws. While thermalization in one-dimensional systems can often be suppressed by integrability mechanisms, in two spatial dimensions thermalization is expected to be far more effective due to the increased phase space. In this work we propose a general framework for escaping or delaying the emergence of the thermal state in two-dimensional arrays of Rydberg atoms via the mechanism of quantum scars, i.e., initial states that fail to thermalize. The suppression of thermalization is achieved in two complementary ways: by adding local perturbations or by adjusting the driving Rabi frequency according to the local connectivity of the lattice. We demonstrate that these mechanisms allow us to realize robust quantum scars in various two-dimensional lattices, including decorated lattices with nonconstant connectivity. In particular, we show that a small decrease of the Rabi frequency at the corners of the lattice is crucial for mitigating the strong boundary effects in two-dimensional systems. Our results identify synchronization as an important tool for future experiments on two-dimensional quantum scars.
AU - Michailidis, Alexios
AU - Turner, C. J.
AU - Papić, Z.
AU - Abanin, D. A.
AU - Serbyn, Maksym
ID - 8011
IS - 2
JF - Physical Review Research
SN - 2643-1564
TI - Stabilizing two-dimensional quantum scars by deformation and synchronization
VL - 2
ER -
TY - CONF
AB - Asynchronous programs are notoriously difficult to reason about because they spawn computation tasks which take effect asynchronously in a nondeterministic way. Devising inductive invariants for such programs requires understanding and stating complex relationships between an unbounded number of computation tasks in arbitrarily long executions. In this paper, we introduce inductive sequentialization, a new proof rule that sidesteps this complexity via a sequential reduction, a sequential program that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed. We have implemented and integrated our proof rule in the CIVL verifier, allowing us to provably derive fine-grained implementations of asynchronous programs. We have successfully applied our proof rule to a diverse set of message-passing protocols, including leader election protocols, two-phase commit, and Paxos.
AU - Kragl, Bernhard
AU - Enea, Constantin
AU - Henzinger, Thomas A
AU - Mutluergil, Suha Orhun
AU - Qadeer, Shaz
ID - 8012
SN - 9781450376136
T2 - Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation
TI - Inductive sequentialization of asynchronous programs
ER -