A subcontinuum C of a dendroid X is a bottleneck if it intersects every arc connecting two nonempty open subsets of X. We prove that every dendroid has a point p contained in arbitrarily small bottlenecks. Moreover, every plane dendroid contains a single point bottleneck. This implies, for instance, that each map from an indecomposable continuum into a plane dendroid must have an uncountable po...

This is a computational study of bottlenecks on algebraic varieties. The smooth variety X ⊆ C n are the lines in which normal to at two distinct points. main result numerical homotopy that can be used approximate all isolated bottlenecks. has optimal number paths under certain genericity assumptions. In process we prove bounds terms Euclidean distance degree. Applications include optimization p...

Phase variation occurs in many pathogenic and commensal bacteria and is a major generator of genetic variability. A putative advantage of phase variation is to counter reductions in variability imposed by nonselective bottlenecks during transmission. Genomes of Campylobacter jejuni, a widespread food-borne pathogen, contain multiple phase-variable loci whose rapid, stochastic variation is gener...

The performance of a processor is limited by the specific bottlenecks that a benchmark exposes while running on that processor. Since the quantification of these bottlenecks can be extremely time-consuming, our prior work proposed using the Plackett and Burman design as a statistically-rigorous, but timeefficient method of determining the processor’s most significant performance bottlenecks. In...