Numerical exploration on snap buckling of a pre-stressed hemispherical gridshell

Motivated by the observations of snap-through phenomena in pre-stressed strips and curved shells, we numerically investigate the snapping of a pre-buckled hemispherical gridshell under apex load indentation. Our experimentally validated numerical framework on elastic gridshell simulation combines two components: (i) Discrete Elastic Rods method, for the geometrically nonlinear description of one dimensional rods; and (ii) a naive penalty-based energy functional, to perform the non-deviation condition between two rods at joint. An initially planar grid of slender rods can be actuated into a three dimensional hemispherical shape by loading its extremities through a prescribed path, known as buckling induced assembly; next, this pre-buckled structure can suddenly change its bending direction at some threshold points when compressing its apex to the other side. We find that the hemispherical gridshell can undergo snap-through buckling through two different paths based on two different apex loading conditions. The first critical snap-through point slightly increases as the number of rods in gridshell structure becomes denser, which emphasizes the mechanically nonlocal property in hollow grids, in contrast to the local response of continuum shells. The findings may bridge the gap among rods, grids, knits, and shells, for a fundamental understanding of a group of thin elastic structures, and inspire the design of novel micro-electro-mechanical systems and functional metamaterials.

k-Zumkeller labeling of super subdivision of some graphs

A simple graph $$G=(V,E)$$ G = ( V , E ) is said to be k-Zumkeller graph if there is an injective function f from the vertices of G to the natural numbers N such that when each edge $$xy\in E$$ x y ∈ E is assigned the label f(x)f(y), the resulting edge labels are k distinct Zumkeller numbers. In this paper, we show that the super subdivision of path, cycle, comb, ladder, crown, circular ladder, planar grid and prism are k-Zumkeller graphs.

Numerical Method for Direct Solution to Form-Finding Problem in Convex Gridshell

Elastic gridshell is a class of net-like structure formed by an ensemble of elastically deforming rods coupled through joints, such that the structure can cover large areas with low self-weight and allow for a variety of aesthetic configurations. Gridshells, also known as X-shells or Cosserat Nets, are a planar grid of elastic rods in its undeformed configuration. The end points of the rods are constrained and positioned on a closed curve—the final boundary—to actuate the structure into a 3D shape. Here, we report a discrete differential geometry-based numerical framework to study the geometrically nonlinear deformation of gridshell structures, accounting for non-trivial bending-twisting coupling at the joints. The form-finding problem of obtaining the undeformed planar configuration given the target convex 3D topology is then investigated. For the forward (2D to 3D) physically based simulation, we decompose the gridshell structure into multiple one-dimensional elastic rods and simulate their deformation by the well-established discrete elastic rods (DER) algorithm. A simple penalty energy between rods and linkages is used to simulate the coupling between two rods at the joints. For the inverse problem associated with form-finding (3D to 2D), we introduce a contact-based algorithm between the elastic gridshell and a rigid 3D surface, where the rigid surface describes the target shape of the gridshell upon actuation. This technique removes the need of several forward simulations associated with conventional optimization algorithms and provides a direct solution to the inverse problem. Several examples—hemispherical cap, paraboloid, and hemi-ellipsoid—are used to show the effectiveness of the inverse design process.

Optimization of the surface code design for Majorana-based qubits

The surface code is a prominent topological error-correcting code exhibiting high fault-tolerance accuracy thresholds. Conventional schemes for error correction with the surface code place qubits on a planar grid and assume native CNOT gates between the data qubits with nearest-neighbor ancilla qubits.Here, we present surface code error-correction schemes using only Pauli measurements on single qubits and on pairs of nearest-neighbor qubits. In particular, we provide several qubit layouts that offer favorable trade-offs between qubit overhead, circuit depth and connectivity degree. We also develop minimized measurement sequences for syndrome extraction, enabling reduced logical error rates and improved fault-tolerance thresholds.Our work applies to topologically protected qubits realized with Majorana zero modes and to similar systems in which multi-qubit Pauli measurements rather than CNOT gates are the native operations.