Numerical approximation of the Smagorinsky model by a two-level method

A two-level method for discretizing the Smagorinsky model for the numerical simulation of turbulent flows is proposed. In the two-level algorithm, the solution to the fully nonlinear coarse mesh problem is utilized in a single-step linear fine mesh problem. When modeling parameters are chosen appropriately, the error in the two-level algorithm is comparable to the error in solving the fully nonlinear problem on the fine mesh. We provide an a priori error estimate for the two-level method, which yields appropriate scalings between the coarse and fine mesh-sizes (H and h, respectively), and the radius of the spatial filter used in the Smagorinsky model (δ). In addition, we provide an algorithm in which a coarse mesh correction is performed to further enhance the accuracy. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

The threshold for combs in random graphs

For let denote the tree consisting of an ‐vertex path with disjoint ‐vertex paths beginning at each of its vertices. An old conjecture says that for any the threshold for the random graph to contain is at . Here we verify this for with any fixed . In a companion paper, using very different methods, we treat the complementary range, proving the conjecture for (with ). © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 48, 794–802, 2016     

On using compressibility to detect when slime mould completed computation

Slime mould Physarum polycephalum is a single cell visible by an unaided eye. The slime mould optimizes its network of protoplasmic tubes in gradients of attractants and repellents. This behavior is interpreted as computation. Several prototypes of the slime mould computers were designed to solve problems of computation geometry, graphs, transport networks, and to implement universal computing circuits. Being a living substrate, the slime mould does not halt its behavior when a task is solved but often continues foraging the space thus masking the solution found. We propose to use temporal changes in compressibility of the slime mould patterns as indicators of the halting of the computation. Compressibility of a pattern characterizes the pattern's morphological diversity, that is, a number of different local configurations. At the beginning of computation the slime explores the space, thus generating less compressible patterns. After gradients of attractants and repellents are detected the slime spans data sites with its protoplasmic network and retracts scouting branches, thus generating more compressible patterns. We analyze the feasibility of the approach on results of laboratory experiments and computer modelling. © 2015 Wiley Periodicals, Inc. Complexity 21: 162–175, 2016     

Efficiently Hex-Meshing Things with Topology

A topological quadrilateral mesh \(Q\) of a connected surface in \(\mathbb {R}^3\) can be extended to a topological hexahedral mesh of the interior domain \(\varOmega \) if and only if \(Q\) has an even number of quadrilaterals and no odd cycle in \(Q\) bounds a surface inside \(\varOmega \) . Moreover, if such a mesh exists, the required number of hexahedra is within a constant factor of the minimum number of tetrahedra in a triangulation of \(\varOmega \) that respects \(Q\) . Finally, if \(Q\) is given as a polyhedron in \(\mathbb {R}^3\) with quadrilateral facets, a topological hexahedral mesh of the polyhedron can be constructed in polynomial time if such a mesh exists. All our results extend to domains with disconnected boundaries. Our results naturally generalize results of Thurston, Mitchell, and Eppstein for genus-zero and bipartite meshes, for which the odd-cycle criterion is trivial.     

Entropy, independent sets and antichains: A new approach to Dedekind's problem

For -regular, -vertex bipartite graphs with bipartition , a precise bound is given for the sum over independent sets of the quantity . (In other language, this is bounding the partition function for certain instances of the hard-core model.) This result is then extended to graded partially ordered sets, which in particular provides a simple proof of a well-known bound for Dedekind's Problem given by Kleitman and Markowsky in 1975.

     

Critical Sets of Elliptic Equations

Given a solution u to a linear, homogeneous, second‐order elliptic equation with Lipschitz coefficients, we introduce techniques for giving improved estimates of the critical set ??(u)u {x :|δu|(x) = 0}, as well as the first estimates on the effective critical set ??_r(u), which roughly consists of points x such that the gradient of u is small somewhere on B_r(x) compared to the nonconstancy of u. The results are new even for harmonic functions on ?ⁿ. Given such a u, the standard first‐order stratification {l^k} of u separates points x based on the degrees of symmetry of the leading‐order polynomial of u‐u(x). In this paper we give a quantitative stratification of u, which separates points based on the number of almost symmetries of approximate leading‐order polynomials of u at various scales. We prove effective estimates on the volume of the tubular neighborhood of each , which lead directly to (n‐2 + ?)‐Minkowski type estimates for the critical set of u. With some additional regularity assumptions on the coefficients of the equation, we refine the estimate to give new proofs of the uniform (n‐2)‐Hausdorff measure estimate on the critical set and singular sets of u.© 2014 Wiley Periodicals, Inc.     

A Homological Approach to Two Problems on Finite Sets

We propose a homological approach to two conjectures descended from the Erdös-Ko-Rado Theorem, one due to Chvátal and the other to Frankl and Füredi. We apply the method to reprove, and in one case improve, results of these authors related to their conjectures.     

Towards a new framework for evaluating systemic problem structuring methods

Operational researchers and social scientists often make significant claims for the value of systemic problem structuring and other participative methods. However, when they present evidence to support these claims, it is usually based on single case studies of intervention. There have been very few attempts at evaluating across methods and across interventions undertaken by different people. This is because, in any local intervention, contextual factors, the skills of the researcher and the purposes being pursued by stakeholders affect the perceived success or failure of a method. The use of standard criteria for comparing methods is therefore made problematic by the need to consider what is unique in each intervention. So, is it possible to develop a single evaluation approach that can support both locally meaningful evaluations and longer-term comparisons between methods? This paper outlines a methodological framework for the evaluation of systemic problem structuring methods that seeks to do just this.