Related papers: Ergodicity in the linked twist map with oppositely…
We propose a dimensionless bendability parameter, $\epsilon^{-1} = [\left(h/W\right)^2 T^{-1}]^{-1}$ for wrinkling of thin, twisted ribbons with thickness $h$, width $W$, and tensional strain $T$. Bendability permits efficient collapse of…
We study a longest-edge based refinement scheme for triangulations, termed the longest-edge altitude bisection (LEAB), in which each triangle is subdivided by dropping the altitude from the vertex opposite to its longest edge. Using the…
Shear thickening, an increase of viscosity with shear rate, is a ubiquitous phenomena in suspended materials that has implications for broad technological applications. Controlling this thickening behavior remains a major challenge and has…
For a class of piecewise hyperbolic maps in two dimensions, we propose a combinatorial definition of topological entropy by counting the maximal, open, connected components of the phase space on which iterates of the map are smooth. We…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
In this article it is shown that the equilateral triangle maximizes the Cheeger constant and minimizes the torsional rigidity among shapes having a fixed minimal width. The proof techniques use direct comparisons with simpler shapes,…
An asymptotic interface equation for directional solidification near the absolute stabiliy limit is extended by a nonlocal term describing a shear flow parallel to the interface. In the long-wave limit considered, the flow acts…
We formulate a criterion for the existence and uniqueness of an invariant measure for a Markov process taking values in a Polish phase space. In addition, weak-$^*$ ergodicity, that is, the weak convergence of the ergodic averages of the…
A classical two-stranded rope can be made by twisting two identical strands together under strain. Despite being conceptually simple, the contact-equations for helically twisted identical strands have only been solved within the last 20…
Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…
We identify incompressible planar linear flows that are generalizations of the well known one-parameter family characterized by the ratio of in-plane extension to (out-of-plane) vorticity. The latter `canonical' family is classified into…
The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections. To prove the existence of the algorithm, we…
The roughness of crack interfaces is reported in quasistatic fracture, using an elastic network of beams with random breaking thresholds. For strong disorders we obtain 0.86(3) for the roughness exponent, a result which is very different…
We study localization occurring during high speed shear deformations of metals leading to the formation of shear bands. The localization instability results from the competition among Hadamard instability (caused by softening response) and…
From a dynamical viewpoint, basic phase transitions of statistical mechanics can be regarded as a breaking of ergodicity. While many random models exhibiting such transitions at the thermodynamics limit exist, finite-dimensional examples…
We study two-dimensional, two-piece, piecewise-linear maps having two saddle fixed points. Such maps reduce to a four-parameter family and are well known to have a chaotic attractor throughout open regions of parameter space. The purpose of…
Motivated by proving the loss of ergodicity in expanding systems of piecewise affine coupled maps with arbitrary number of units, all-to-all coupling and inversion symmetry, we provide ad-hoc substitutes - namely inversion-symmetric maps of…
Cutwidth is one of the classic layout parameters for graphs. It measures how well one can order the vertices of a graph in a linear manner, so that the maximum number of edges between any prefix and its complement suffix is minimized. As…
We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…
Decompositional parameters such as treewidth are commonly used to obtain fixed-parameter algorithms for NP-hard graph problems. For problems that are W[1]-hard parameterized by treewidth, a natural alternative would be to use a suitable…