A General Criterion for Liquefaction in Granular Layers with Heterogeneous Pore Pressure

International audienceFluid-saturated granular and porous layers can undergo liquefaction and lose their shear resistance when subjected to shear forcing. In geosystems, such a process can lead to severe natural hazards of soil liquefaction, accelerating slope failure, and large earthquakes. Terzaghi's principle of effective stress predicts that liquefaction occurs when the pore pressure within the layer becomes equal to the applied normal stress on the layer. However, under dynamic loading and when the internal permeability is relatively small the pore pressure is spatially heterogeneous and it is not clear what measurement of pore pressure should be used in Terzaghi's principle. Here, we show theoretically and demonstrate using numerical simulations a general criterion for liquefaction that applies also for the cases in which the pore pressure is spatially heterogeneous. The general criterion demands that the average pore pressure along a continuous surface within the fluid-saturated granular or porous layer is equal to the applied normal stress

Interplay of seismic and aseismic deformations during earthquake swarms: An experimental approach

Observations of earthquake swarms and slow propagating ruptures on related faults suggest a close relation between the two phenomena. Earthquakes are the signature of fast unstable ruptures initiated on localized asperities while slow aseismic deformations are experienced on large stable segments of the fault plane. The spatial proximity and the temporal coincidence of both fault mechanical responses highlight the variability of fault rheology. However, the mechanism relating earthquakes and aseismic processes is still elusive due to the difficulty of imaging these phenomena of large spatiotemporal variability at depth. Here we present laboratory experiments that explore, in great detail, the deformation processes of heterogeneous interfaces in the brittle-creep regime. We track the evolution of an interfacial crack over 7 orders of magnitude in time and 5 orders of magnitude in space using optical and acoustic sensors. We explore the response of the system to slow transient loads and show that slow deformation episodes are systematically accompanied by acoustic emissions due to local fracture energy disorder. Features of acoustic emission activities and deformation rate distributions of our experimental system are similar to those in natural faults. On the basis of an activation energy model, we link our results to the Rate and State friction model and suggest an active role of local creep deformation in driving the seismic activity of earthquake swarms

High density QCD with static quarks

We study lattice QCD in the limit that the quark mass and chemical potential are simultaneously made large, resulting in a controllable density of quarks which do not move. This is similar in spirit to the quenched approximation for zero density QCD. In this approximation we find that the deconfinement transition seen at zero density becomes a smooth crossover at any nonzero density, and that at low enough temperature chiral symmetry remains broken at all densities.Comment: LaTeX, 18 pages, uses epsf.sty, postscript figures include

Chiral nature of magnetic monopoles in artificial spin ice

Micromagnetic properties of monopoles in artificial kagome spin ice systems are investigated using numerical simulations. We show that micromagnetics brings additional complexity into the physics of these monopoles that is, by essence, absent in spin models: besides a fractionalized classical magnetic charge, monopoles in the artificial kagome ice are chiral at remanence. Our simulations predict that the chirality of these monopoles can be controlled without altering their charge state. This chirality breaks the vertex symmetry and triggers a directional motion of the monopole under an applied magnetic field. Our results also show that the choice of the geometrical features of the lattice can be used to turn on and off this chirality, thus allowing the investigation of chiral and achiral monopoles.Comment: 10 pages, 4 figure

Origin of the Universal Roughness Exponent of Brittle Fracture Surfaces: Correlated Percolation in the Damage Zone

We suggest that the observed large-scale universal roughness of brittle fracture surfaces is due to the fracture process being a correlated percolation process in a self-generated quadratic damage gradient. We use the quasi-static two-dimensional fuse model as a paradigm of a fracture model. We measure for this model, that exhibits a correlated percolation process, the correlation length exponent nu approximately equal to 1.35 and conjecture it to be equal to that of uncorrelated percolation, 4/3. We then show that the roughness exponent in the fuse model is zeta = 2 nu/(1+2 nu)= 8/11. This is in accordance with the numerical value zeta=0.75. As for three-dimensional brittle fractures, a mean-field theory gives nu=2, leading to zeta=4/5 in full accordance with the universally observed value zeta =0.80.Comment: 4 pages RevTeX

A Novel Approach for Ellipsoidal Outer-Approximation of the Intersection Region of Ellipses in the Plane

In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection of the ellipses are found in an efficient manner. To do so, the intersection points of the ellipses that fall on the boundary of the intersection region are determined, and a set of points is generated on the elliptic arcs connecting every two neighbouring intersection points. By finding the tangent lines to the ellipses at the extended set of points, a set of half-planes is obtained, whose intersection forms a polygon. To find the polygon more efficiently, the points are given an order and the intersection of the half-planes corresponding to every two neighbouring points is calculated. If the polygon is convex and bounded, these calculated points together with the initially obtained intersection points will form its vertices. If the polygon is non-convex or unbounded, we can detect this situation and then generate additional discrete points only on the elliptical arc segment causing the issue, and restart the algorithm to obtain a bounded and convex polygon. Finally, the smallest area ellipse that contains the vertices of the polygon is obtained by solving a convex optimization problem. Through numerical experiments, it is illustrated that the proposed technique returns a tighter outer-approximation of the intersection of multiple ellipses, compared to conventional techniques, with only slightly higher computational cost

Roughness and multiscaling of planar crack fronts

We consider numerically the roughness of a planar crack front within the long-range elastic string model, with a tunable disorder correlation length $\xi$. The problem is shown to have two important length scales, $\xi$ and the Larkin length $L_c$. Multiscaling of the crack front is observed for scales below $\xi$, provided that the disorder is strong enough. The asymptotic scaling with a roughness exponent $\zeta \approx 0.39$ is recovered for scales larger than both $\xi$ and $L_c$. If $L_c > \xi$, these regimes are separated by a third regime characterized by the Larkin exponent $\zeta_L \approx 0.5$. We discuss the experimental implications of our results.Comment: 8 pages, two figure

Locked and Unlocked Polygonal Chains in 3D

In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the length of each link and the simplicity of the chain are maintained throughout the movement. The analogous concept for closed chains is convexification: reconfiguration to a planar convex polygon. Chains that cannot be straightened or convexified are called locked. While there are open chains in 3D that are locked, we show that if an open chain has a simple orthogonal projection onto some plane, it can be straightened. For closed chains, we show that there are unknotted but locked closed chains, and we provide an algorithm for convexifying a planar simple polygon in 3D with a polynomial number of moves.Comment: To appear in Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, Jan. 199