No abstract uploaded!

A simplicial complex Δ is called$flag$if all minimal nonfaces of Δ have at most two elements. The following are proved: First, if Δ is a flag simplicial pseudomanifold of dimension$d$−1, then the graph of Δ (i) is (2$d$−2)-vertex-connected and (ii) has a subgraph which is a subdivision of the graph of the$d$-dimensional cross-polytope. Second, the$h$-vector of a flag simplicial homology sphere Δ of dimension$d$−1 is minimized when Δ is the boundary complex of the$d$-dimensional cross-polytope.

We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green’s function on a graph studied in [8]. We show that this gives rise to a graph invariant, which is closely related to the 2-dimensional Weisfeiler-Lehman algorithm for graph isomorphism testing. We then consider the same theory over the integers, which leads to the consideration of certain quadratic forms over the integers as initiated in [14], associated to the graphs. The quadratic form represented by the combinatorial Laplacian respects a well-behaved wedge sum of graphs, and appears to capture important graph properties reg

Due to the highly degeneracy and singularities of the entropy equation, the physical entropy for viscous and heat conductive polytropic gases behave singularly in the presence of vacuum and it is thus a challenge to study its dynamics. It is shown in this paper that the uniform boundedness of the entropy and the inhomogeneous Sobolev regularities of the velocity and temperature can be propagated for viscous and heat conductive gases in $\mathbb R^3$, provided that the initial vacuum occurs only at far fields with suitably slow decay of the initial density. Precisely, it is proved that for any strong solution to the Cauchy problem of the heat conductive compressible Navier--Stokes equations, the corresponding entropy keeps uniformly bounded and the $L^2$ regularities of the velocity and temperature can be propagated, up to the existing time of the solution, as long as the initial density vanishes only at far fields with a rate no more than $O(\frac{1}{|x|^2})$. The main tools are some singularly weighted energy estimates and an elaborate De Giorgi type iteration technique. The De Giorgi type iterations are carried out to different equations in establishing the lower and upper bounds of the entropy.

This paper analyzes the random fluctuations obtained by a heterogeneous multi-scale first-order finite element method applied to solve elliptic equations with a random potential. Several multiscale numerical algorithms have been shown to correctly capture the homogenized limit of solutions of elliptic equations with coefficients modeled as stationary and ergodic random fields. Because theoretical results are available in the continuum setting for such equations, we consider here the case of a secondorder elliptic equations with random potential in two dimensions of space. We show that the random fluctuations of such solutions are correctly estimated by the heterogeneous multi-scale algorithm when appropriate fine-scale problems are solved on subsets that cover the whole computational domain. However, when the fine-scale problems are solved over patches that do not cover the entire domain, the random fluctuations may or may not be estimated accurately. In the case of random potentials with short-range interactions, the variance of the random fluctuations is amplified as the inverse of the fraction of the medium covered by the patches. In the case of random potentials with long-range interactions, however, such an amplification does not occur and random fluctuations are correctly captured independent of the (macroscopic) size of the patches. These results are consistent with those obtained in [9] for more general equations in the one-dimensional setting and provide indications on the loss in accuracy that results from using coarser, and hence computationally less intensive, algorithms.