A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected

A graphic sequence π =(d₁, d₂,..., d_n) is said to be forcibly k-edge-connected if every realization of π is k-edge-connected. In this paper, we obtain a new sufficient degree condition for π to be forcibly k-edgeconnected. We also show that this new sufficient degree condition implies a strongest monotone degree condition for π to be forcibly 2-edge-connected and a conjecture about a strongest monotone degree condition for π to be forcibly 3-edge-connected due to...     

A note on statistical analysis of factor models of high dimension

Science China Mathematics - Linear factor models are familiar tools used in many fields. Several pioneering literatures established foundational theoretical results of the quasi-maximum likelihood...     

Integral Representations of the Large and Little Schröder Numbers

In the paper, the authors establish several integral representations for the generating functions of the large and little Schröder numbers and for the large and little Schröder numbers.     

Particle-depletion dynamics in axisymmetric thermocapillary flows

The European Physical Journal Special Topics - The removal of suspended particles from the interior of a thermocapillary liquid bridge via a finite-particle-size effect restricting the particle...     

An approach of dynamic mesh adaptation for simulating 3‐dimensional unsteady moving‐immersed‐boundary flows

In this paper, we present an approach of dynamic mesh adaptation for simulating complex 3‐dimensional incompressible moving‐boundary flows by immersed boundary methods. Tetrahedral meshes are adapted by a hierarchical refining/coarsening algorithm. Regular refinement is accomplished by dividing 1 tetrahedron into 8 subcells, and irregular refinement is only for eliminating the hanging points. Merging the 8 subcells obtained by regular refinement, the mesh is coarsened. With hierarchical refining/coarsening, mesh adaptivity can be achieved by adjusting the mesh only 1 time for each adaptation period. The level difference between 2 neighboring cells never exceeds 1, and the geometrical quality of mesh does not degrade as the level of adaptive mesh increases. A predictor‐corrector scheme is introduced to eliminate the phase lag between adapted mesh and unsteady solution. The error caused by each solution transferring from the old mesh to the new adapted one is small because most of the nodes on the 2 meshes are coincident. An immersed boundary method named local domain‐free discretization is employed to solve the flow equations. Several numerical experiments have been conducted for 3‐dimensional incompressible moving‐boundary flows. By using the present approach, the number of mesh nodes is reduced greatly while the accuracy of solution can be preserved.