Stabilized Nonconforming Mixed Finite Element Method for Linear Elasticity on Rectangular or Cubic Meshes

Based on the primal mixed variational formulation, a stabilized nonconforming mixed finite element method is proposed for the linear elasticity on rectangular and cubic meshes. Two kinds of penalty terms are introduced in the stabilized mixed formulation, which are the jump penalty term for the displacement and the divergence penalty term for the stress. We use the classical nonconforming rectangular and cubic elements for the displacement and the discontinuous piecewise polynomial space for the stress, where the discrete space for stress are carefully chosen to guarantee the well-posedness of discrete formulation. The stabilized mixed method is locking-free. The optimal convergence order is derived in the $L^2$-norm for stress and in the broken $H^1$-norm and $L^2$-norm for displacement. A numerical test is carried out to verify the optimal convergence of the stabilized method.     

Cubic C8: An Observable Allotrope of Carbon?

Ab initio and DFT calculations are used to investigate the structure, electronic properties, spectra and reactivity of cubic C₈, which is predicted to be aromatic according to Hirsch′s rule. Although highly strained and with a small amount of diradical character, the carbon cube represents a surprisingly deep minimum and should therefore be observable as an isolated molecule. It is, however, predicted to be very reactive, both with itself and triplet oxygen. Calculated IR, Raman, and UV/Vis spectra are provided to aid identification of cubic C₈ should it be synthesized.     

On the Minimum Number of Spanning Trees in k‐Edge‐Connected Graphs

We show that a k‐edge‐connected graph on n vertices has at least spanning trees. This bound is tight if k is even and the extremal graph is the n‐cycle with edge multiplicities . For k odd, however, there is a lower bound , where . Specifically, and . Not surprisingly, c₃ is smaller than the corresponding number for 4‐edge‐connected graphs. Examples show that . However, we have no examples of 5‐edge‐connected graphs with fewer spanning trees than the n‐cycle with all edge multiplicities (except one) equal to 3, which is almost 6‐regular. We have no examples of 5‐regular 5‐edge‐connected graphs with fewer than spanning trees, which is more than the corresponding number for 6‐regular 6‐edge‐connected graphs. The analogous surprising phenomenon occurs for each higher odd edge connectivity and regularity.     

Nowhere‐Zero 5‐Flows On Cubic Graphs with Oddness 4

Tutte's 5‐flow conjecture from 1954 states that every bridgeless graph has a nowhere‐zero 5‐flow. It suffices to prove the conjecture for cyclically 6‐edge‐connected cubic graphs. We prove that every cyclically 6‐edge‐connected cubic graph with oddness at most 4 has a nowhere‐zero 5‐flow. This implies that every minimum counterexample to the 5‐flow conjecture has oddness at least 6.     

Singular Solutions to Conformal Hessian Equations

The authors show that for any e ∈]0,1[,there exists an analytic outside zero solution to a uniformly elliptic conformal Hessian equation in a ball B C R5 which belongs to C1'ε(B) \ C1'ε+(B).     

Petersen Cores and the Oddness of Cubic Graphs

Let G be a bridgeless cubic graph. Consider a list of k 1‐factors of G. Let be the set of edges contained in precisely i members of the k 1‐factors. Let be the smallest over all lists of k 1‐factors of G. We study lists by three 1‐factors, and call with a ‐core of G. If G is not 3‐edge‐colorable, then . In Steffen (J Graph Theory 78 (2015), 195–206) it is shown that if , then is an upper bound for the girth of G. We show that bounds the oddness of G as well. We prove that . If , then every ‐core has a very specific structure. We call these cores Petersen cores. We show that for any given oddness there is a cyclically 4‐edge‐connected cubic graph G with . On the other hand, the difference between and can be arbitrarily big. This is true even if we additionally fix the oddness. Furthermore, for every integer , there exists a bridgeless cubic graph G such that .     

Bounds on partial derivatives of NURBS surfaces

In this paper, we estimate the partial derivative bounds for Non-Uniform Rational B-spline(NURBS) surfaces. Firstly, based on the formula of translating the product into sum of B-spline functions, discrete B-spline theory and Dir function, some derivative bounds on NURBS curves are provided. Then, the derivative bounds on the magnitudes of NURBS surfaces are proposed by regarding a rational surface as the locus of a rational curve. Finally, some numerical examples are provided to elucidate how tight the bounds are.     

IrIII‐based Octahedral Metalloligands Derived Primitive Cubic Frameworks for Enhanced CO2/N2 Separation

We developed a metalloligand strategy to construct porous frameworks, viz. the combined use of Ir^III‐based octahedral metalloligands and the linear unit [Ni(cyclam)] easily afforded two isostructural complexes 1 and 2 with primitive cubic frameworks. Both complexes show good CO₂/N₂ separation property.