Clones with finitely many relative R-classes

For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A iff each one is a substitution instance of the other using operations from C. We study the clones for which there are only finitely many relative R-classes.Comment: 41 pages; proofs improved, examples adde

Random geometric complexes

We study the expected topological properties of Cech and Vietoris-Rips complexes built on i.i.d. random points in R^d. We find higher dimensional analogues of known results for connectivity and component counts for random geometric graphs. However, higher homology H_k is not monotone when k > 0. In particular for every k > 0 we exhibit two thresholds, one where homology passes from vanishing to nonvanishing, and another where it passes back to vanishing. We give asymptotic formulas for the expectation of the Betti numbers in the sparser regimes, and bounds in the denser regimes. The main technical contribution of the article is in the application of discrete Morse theory in geometric probability.Comment: 26 pages, 3 figures, final revisions, to appear in Discrete & Computational Geometr

Tightness of slip-linked polymer chains

We study the interplay between entropy and topological constraints for a polymer chain in which sliding rings (slip-links) enforce pair contacts between monomers. These slip-links divide a closed ring polymer into a number of sub-loops which can exchange length between each other. In the ideal chain limit, we find the joint probability density function for the sizes of segments within such a slip-linked polymer chain (paraknot). A particular segment is tight (small in size) or loose (of the order of the overall size of the paraknot) depending on both the number of slip-links it incorporates and its competition with other segments. When self-avoiding interactions are included, scaling arguments can be used to predict the statistics of segment sizes for certain paraknot configurations.Comment: 10 pages, 6 figures, REVTeX

Abundance of unknots in various models of polymer loops

A veritable zoo of different knots is seen in the ensemble of looped polymer chains, whether created computationally or observed in vitro. At short loop lengths, the spectrum of knots is dominated by the trivial knot (unknot). The fractional abundance of this topological state in the ensemble of all conformations of the loop of $N$ segments follows a decaying exponential form, $\sim \exp (-N/N_0)$, where $N_0$ marks the crossover from a mostly unknotted (ie topologically simple) to a mostly knotted (ie topologically complex) ensemble. In the present work we use computational simulation to look closer into the variation of $N_0$ for a variety of polymer models. Among models examined, $N_0$ is smallest (about 240) for the model with all segments of the same length, it is somewhat larger (305) for Gaussian distributed segments, and can be very large (up to many thousands) when the segment length distribution has a fat power law tail.Comment: 13 pages, 6 color figure

BioDeepTime : a database of biodiversity time series for modern and fossil assemblages

We thank the Paleosynthesis Project and the Volkswagen Stiftung for funding that supported this project (Az 96 796). M.C.R. acknowledges the German Research Foundation (DFG) for funding through the Cluster of Excellence ‘The Ocean Floor – Earth's Uncharted Interface’ (EXC 2077, grant no. 390741603). E.E.S. acknowledges funding from Leverhulme Trust grant RPG-201170, the Leverhulme Prize and the National Science Research Council grant NE/V011405/1. Q.J.L. and L.N. acknowledge support from the Youth Innovation Promotion Association (2019310) and the Chinese Academy of Sciences (CAS-WX2021SF-0205). A.M.P. acknowledges funding from the Leverhulme Trust through research grant RPG-2019-402. M.D. acknowledges funding from Leverhulme Trust through the Leverhulme Centre for Anthropocene Biodiversity (RC-2018-021) and a research grant (RPG-2019-402), and the European Union (ERC coralINT, 101044975). L. H. L. acknowledges funding from the European Research Council (macroevolution.abc ERC grant no. 724324). K.H.P acknowledges funding from the National Science Foundation Graduate Research Fellowship Program (DGE-2139841). H.H.M.H. acknowledges support from Peter Buck Postdoc Fellowship, Smithsonian Institution. A.T. acknowledges funding from the Slovak Research and Development Agency (APVV 22-0523) and the Slovak Scientific Grant Agency (VEGA 02/0106/23).Motivation We have little understanding of how communities respond to varying magnitudes and rates of environmental perturbations across temporal scales. BioDeepTime harmonizes assemblage time series of presence and abundance data to help facilitate investigations of community dynamics across timescales and the response of communities to natural and anthropogenic stressors. BioDeepTime includes time series of terrestrial and aquatic assemblages of varying spatial and temporal grain and extent from the present-day to millions of years ago. Main Types of Variables Included BioDeepTime currently contains 7,437,847 taxon records from 10,062 assemblage time series, each with a minimum of 10 time steps. Age constraints, sampling method, environment and taxonomic scope are provided for each time series. Spatial Location and Grain The database includes 8752 unique sampling locations from freshwater, marine and terrestrial ecosystems. Spatial grain represented by individual samples varies from quadrats on the order of several cm2 to grid cells of ~100 km2. Time Period and Grain BioDeepTime in aggregate currently spans the last 451?million years, with the 10,062 modern and fossil assemblage time series ranging in extent from years to millions of years. The median extent of modern time series is 18.7?years and for fossil series is 54,872?years. Temporal grain, the time encompassed by individual samples, ranges from days to tens of thousands of years. Major Taxa and Level of Measurement The database contains information on 28,777 unique taxa with 4,769,789 records at the species level and another 271,218 records known to the genus level, including time series of benthic and planktonic foraminifera, coccolithophores, diatoms, ostracods, plants (pollen), radiolarians and other invertebrates and vertebrates. There are to date 7012 modern and 3050 fossil time series in BioDeepTime. Software Format SQLite, Comma-separated values.Publisher PDFPeer reviewe

Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks

We present the Balloon password-hashing algorithm. This is the first practical cryptographic hash function that: (i) has proven memory-hardness properties in the random-oracle model, (ii) uses a password-independent access pattern, and (iii) meets or exceeds the performance of the best heuristically secure password-hashing algorithms. Memory-hard functions require a large amount of working space to evaluate efficiently and when used for password hashing, they dramatically increase the cost of offline dictionary attacks. In this work, we leverage a previously unstudied property of a certain class of graphs (“random sandwich graphs”) to analyze the memory-hardness of the Balloon algorithm. The techniques we develop are general: we also use them to give a proof of security of the scrypt and Argon2i password-hashing functions in the random-oracle model. Our security analysis uses a sequential model of computation, which essentially captures attacks that run on single-core machines. Recent work shows how to use massively parallel special-purpose machines (e.g., with hundreds of cores) to attack Balloon and other memory-hard functions. We discuss these important attacks, which are outside of our adversary model, and propose practical defenses against them. To motivate the need for security proofs in the area of password hashing, we demonstrate and implement a practical attack against Argon2i that successfully evaluates the function with less space than was previously claimed possible. Finally, we use experimental results to compare the performance of the Balloon hashing algorithm to other memory-hard functions