@inproceedings{7990,
abstract = {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).},
author = {Wagner, Uli and Welzl, Emo},
booktitle = {36th International Symposium on Computational Geometry},
isbn = {9783959771436},
issn = {18688969},
location = {Zürich, Switzerland},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips)}},
doi = {10.4230/LIPIcs.SoCG.2020.67},
volume = {164},
year = {2020},
}
@phdthesis{8032,
abstract = {Algorithms in computational 3-manifold topology typically take a triangulation as an input and return topological information about the underlying 3-manifold. However, extracting the desired information from a triangulation (e.g., evaluating an invariant) is often computationally very expensive. In recent years this complexity barrier has been successfully tackled in some cases by importing ideas from the theory of parameterized algorithms into the realm of 3-manifolds. Various computationally hard problems were shown to be efficiently solvable for input triangulations that are sufficiently “tree-like.”
In this thesis we focus on the key combinatorial parameter in the above context: we consider the treewidth of a compact, orientable 3-manifold, i.e., the smallest treewidth of the dual graph of any triangulation thereof. By building on the work of Scharlemann–Thompson and Scharlemann–Schultens–Saito on generalized Heegaard splittings, and on the work of Jaco–Rubinstein on layered triangulations, we establish quantitative relations between the treewidth and classical topological invariants of a 3-manifold. In particular, among other results, we show that the treewidth of a closed, orientable, irreducible, non-Haken 3-manifold is always within a constant factor of its Heegaard genus.},
author = {Huszár, Kristóf},
isbn = {978-3-99078-006-0},
issn = {2663-337X},
pages = {xviii+120},
publisher = {IST Austria},
title = {{Combinatorial width parameters for 3-dimensional manifolds}},
doi = {10.15479/AT:ISTA:8032},
year = {2020},
}
@article{8001,
author = {Vandael, David H and Borges Merjane, Carolina and Zhang, Xiaomin and Jonas, Peter M},
issn = {10974199},
journal = {Neuron},
publisher = {Elsevier},
title = {{Short-term plasticity at hippocampal mossy fiber synapses is induced by natural activity patterns and associated with vesicle pool engram formation}},
doi = {10.1016/j.neuron.2020.05.013},
year = {2020},
}
@article{8099,
abstract = {Sewall Wright developed FST for describing population differentiation and it has since been extended to many novel applications, including the detection of homomorphic sex chromosomes. However, there has been confusion regarding the expected estimate of FST for a fixed difference between the X‐ and Y‐chromosome when comparing males and females. Here, we attempt to resolve this confusion by contrasting two common FST estimators and explain why they yield different estimates when applied to the case of sex chromosomes. We show that this difference is true for many allele frequencies, but the situation characterized by fixed differences between the X‐ and Y‐chromosome is among the most extreme. To avoid additional confusion, we recommend that all authors using FST clearly state which estimator of FST their work uses.},
author = {Gammerdinger, William J and Toups, Melissa A and Vicoso, Beatriz},
issn = {1755-098X},
journal = {Molecular Ecology Resources},
pages = {1--9},
publisher = {Wiley},
title = {{Disagreement in FST estimators: A case study from sex chromosomes}},
doi = {10.1111/1755-0998.13210},
year = {2020},
}
@unpublished{8063,
abstract = {We present a generative model of images that explicitly reasons over the set
of objects they show. Our model learns a structured latent representation that
separates objects from each other and from the background; unlike prior works,
it explicitly represents the 2D position and depth of each object, as well as
an embedding of its segmentation mask and appearance. The model can be trained
from images alone in a purely unsupervised fashion without the need for object
masks or depth information. Moreover, it always generates complete objects,
even though a significant fraction of training images contain occlusions.
Finally, we show that our model can infer decompositions of novel images into
their constituent objects, including accurate prediction of depth ordering and
segmentation of occluded parts.},
author = {Anciukevicius, Titas and Lampert, Christoph and Henderson, Paul M},
booktitle = {ArXiv},
pages = {24},
publisher = {ArXiv},
title = {{Object-centric image generation with factored depths, locations, and appearances}},
year = {2020},
}
@article{7364,
abstract = {We present nsCouette, a highly scalable software tool to solve the Navier–Stokes equations for incompressible fluid flow between differentially heated and independently rotating, concentric cylinders. It is based on a pseudospectral spatial discretization and dynamic time-stepping. It is implemented in modern Fortran with a hybrid MPI-OpenMP parallelization scheme and thus designed to compute turbulent flows at high Reynolds and Rayleigh numbers. An additional GPU implementation (C-CUDA) for intermediate problem sizes and a version for pipe flow (nsPipe) are also provided.},
author = {Lopez Alonso, Jose M and Feldmann, Daniel and Rampp, Markus and Vela-Martín, Alberto and Shi, Liang and Avila, Marc},
issn = {23527110},
journal = {SoftwareX},
publisher = {Elsevier},
title = {{nsCouette – A high-performance code for direct numerical simulations of turbulent Taylor–Couette flow}},
doi = {10.1016/j.softx.2019.100395},
volume = {11},
year = {2020},
}
@article{7369,
abstract = {Neuronal responses to complex stimuli and tasks can encompass a wide range of time scales. Understanding these responses requires measures that characterize how the information on these response patterns are represented across multiple temporal resolutions. In this paper we propose a metric – which we call multiscale relevance (MSR) – to capture the dynamical variability of the activity of single neurons across different time scales. The MSR is a non-parametric, fully featureless indicator in that it uses only the time stamps of the firing activity without resorting to any a priori covariate or invoking any specific structure in the tuning curve for neural activity. When applied to neural data from the mEC and from the ADn and PoS regions of freely-behaving rodents, we found that neurons having low MSR tend to have low mutual information and low firing sparsity across the correlates that are believed to be encoded by the region of the brain where the recordings were made. In addition, neurons with high MSR contain significant information on spatial navigation and allow to decode spatial position or head direction as efficiently as those neurons whose firing activity has high mutual information with the covariate to be decoded and significantly better than the set of neurons with high local variations in their interspike intervals. Given these results, we propose that the MSR can be used as a measure to rank and select neurons for their information content without the need to appeal to any a priori covariate.},
author = {Cubero, Ryan J and Marsili, Matteo and Roudi, Yasser},
issn = {1573-6873},
journal = {Journal of Computational Neuroscience},
keyword = {Time series analysis, Multiple time scale analysis, Spike train data, Information theory, Bayesian decoding},
publisher = {Springer Nature},
title = {{Multiscale relevance and informative encoding in neuronal spike trains}},
doi = {10.1007/s10827-020-00740-x},
year = {2020},
}
@article{7388,
abstract = {We give a Wong-Zakai type characterisation of the solutions of quasilinear heat equations driven by space-time white noise in 1 + 1 dimensions. In order to show that the renormalisation counterterms are local in the solution, a careful arrangement of a few hundred terms is required. The main tool in this computation is a general ‘integration by parts’ formula that provides a number of linear identities for the renormalisation constants.},
author = {Gerencser, Mate},
issn = {0294-1449},
journal = {Annales de l'Institut Henri Poincaré C, Analyse non linéaire},
publisher = {Elsevier},
title = {{Nondivergence form quasilinear heat equations driven by space-time white noise}},
doi = {10.1016/j.anihpc.2020.01.003},
year = {2020},
}
@article{7427,
author = {Tan, Shutang and Abas, Melinda F and Verstraeten, Inge and Glanc, Matous and Molnar, Gergely and Hajny, Jakub and Lasák, Pavel and Petřík, Ivan and Russinova, Eugenia and Petrášek, Jan and Novák, Ondřej and Pospíšil, Jiří and Friml, Jiří},
issn = {09609822},
journal = {Current Biology},
number = {3},
pages = {381--395.e8},
publisher = {Cell Press},
title = {{Salicylic acid targets protein phosphatase 2A to attenuate growth in plants}},
doi = {10.1016/j.cub.2019.11.058},
volume = {30},
year = {2020},
}
@phdthesis{7460,
abstract = {Many methods for the reconstruction of shapes from sets of points produce ordered simplicial complexes, which are collections of vertices, edges, triangles, and their higher-dimensional analogues, called simplices, in which every simplex gets assigned a real value measuring its size. This thesis studies ordered simplicial complexes, with a focus on their topology, which reflects the connectedness of the represented shapes and the presence of holes. We are interested both in understanding better the structure of these complexes, as well as in developing algorithms for applications.
For the Delaunay triangulation, the most popular measure for a simplex is the radius of the smallest empty circumsphere. Based on it, we revisit Alpha and Wrap complexes and experimentally determine their probabilistic properties for random data. Also, we prove the existence of tri-partitions, propose algorithms to open and close holes, and extend the concepts from Euclidean to Bregman geometries.},
author = {Ölsböck, Katharina},
issn = {2663-337X},
keyword = {shape reconstruction, hole manipulation, ordered complexes, Alpha complex, Wrap complex, computational topology, Bregman geometry},
pages = {155},
publisher = {IST Austria},
title = {{The hole system of triangulated shapes}},
doi = {10.15479/AT:ISTA:7460},
year = {2020},
}