An FPTAS for optimizing a class of low-rank functions over a polytope

We present a fully polynomial time approximation scheme (FPTAS) for optimizing a very general class of non-linear functions of low rank over a polytope. Our approximation scheme relies on constructing an approximate Pareto-optimal front of the linear functions which constitute the given low-rank function. In contrast to existing results in the literature, our approximation scheme does not require the assumption of quasi-concavity on the objective function. For the special case of quasi-concave function minimization, we give an alternative FPTAS, which always returns a solution which is an extreme point of the polytope. Our technique can also be used to obtain an FPTAS for combinatorial optimization problems with non-linear objective functions, for example when the objective is a product of a fixed number of linear functions. We also show that it is not possible to approximate the minimum of a general concave function over the unit hypercube to within any factor, unless P = NP. We prove this by showing a similar hardness of approximation result for supermodular function minimization, a result that may be of independent interest.     

Spectral discretization of a model for organic pollution in waters

We are interested in a mixed reaction diffusion system describing the organic pollution in stream‐waters. In this work, we propose a mixed‐variational formulation and recall its well‐posedness. Next, we consider a spectral discretization of this problem and establish nearly optimal error estimates. Numerical experiments confirm the interest of this approach. Copyright © 2016 John Wiley & Sons, Ltd.     

Continuous dependence results for non-linear Neumann type boundary value problems

We obtain estimates on the continuous dependence on the coefficient for second-order non-linear degenerate Neumann type boundary value problems. Our results extend previous work of Cockburn et al., Jakobsen and Karlsen, and Gripenberg to problems with more general boundary conditions and domains. A new feature here is that we account for the dependence on the boundary conditions. As one application of our continuous dependence results, we derive for the first time the rate of convergence for the vanishing viscosity method for such problems. We also derive new explicit continuous dependence on the coefficients results for problems involving Bellman-Isaacs equations and certain quasilinear equation.     

Separating Characters by Blocks

We investigate the problem of finding a set of prime divisorsof the order of a finite group, such that no two irreduciblecharacters are in the same p-block for all primes p in the set.Our main focus is on the simple and quasi-simple groups. Forresults on the alternating and symmetric groups and their doublecovers, some combinatorial results on the cores of partitionsare proved, which may be of independent interest. We also studythe problem for groups of Lie type. The sporadic groups (andtheir relatives) are checked using GAP.     

Multilevel Monte Carlo in approximate Bayesian computation

In the following article, we consider approximate Bayesian computation (ABC) inference. We introduce a method for numerically approximating ABC posteriors using the multilevel Monte Carlo (MLMC). A sequential Monte Carlo version of the approach is developed and it is shown under some assumptions that for a given level of mean square error, this method for ABC has a lower cost than i.i.d. sampling from the most accurate ABC approximation. Several numerical examples are given.     

Spontaneous crosslinking of poly(1,5‐dioxepan‐2‐one) originating from ether bond fragmentation

The spontaneous reaction of unsaturated double bonds induced by the fragmentation of ether bonds is presented as a method to obtain a crosslinked polymer material. Poly(1,5‐dioxepan‐2‐one) (PDXO) was synthesized using three different polymerization techniques to investigate the influence of the synthesis conditions on the ether bond fragmentation. It was found that thermal fragmentation of the ether bonds in the polymer main chain occurred when the synthesis temperature was 140 °C or higher. The double bonds produced reacted spontaneously to form crosslinks between the polymer chains. The formation of a network structure was confirmed by Fourier transform infrared spectrometry and differential scanning calorimetry. In addition, the low molar mass species released during hydrolysis of the DXO polymers were monitored by ESI‐MS and MALDI‐TOF‐MS. Ether bond fragmentation also occurred during the ionization in the electrospray instrument, but predominantly in the lower mass region. No fragmentation took place during MALDI ionization, but it was possible to detect water‐soluble DXO oligomers with a molar mass up to approximately 5000 g/mol. The results show that ether bond fragmentation can be used to form a network structure of PDXO. © 2008 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 46: 7258–7267, 2008     

Modeling and simulations of interface properties with first‐principles electronic structure computations

We report extensive first‐principles electronic structure modeling and calculations for the SiC–SiO₂ interface, a solid–solid interface formed during oxidation of silicon carbide (SiC). The interface modeling provides atomic‐scale understanding about the nature of the interface defects as well as passivation effects due to the modification of the interface bonding. In particular, simulation results show that incorporation of hydrogen and fluorine decreases the defect density, thus enhancing the performance of SiC‐based electronic devices. Copyright © 2013 John Wiley & Sons, Ltd.     

Small Grid Embeddings of 3-Polytopes

We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(2^7.55n )=O(188 ⁿ ). If the graph contains a triangle we can bound the integer coordinates by O(2^4.82n ). If the graph contains a quadrilateral we can bound the integer coordinates by O(2^5.46n ). The crucial part of the algorithm is to find a convex plane embedding whose edges can be weighted such that the sum of the weighted edges, seen as vectors, cancel at every point. It is well known that this can be guaranteed for the interior vertices by applying a technique of Tutte. We show how to extend Tutte’s ideas to construct a plane embedding where the weighted vector sums cancel also on the vertices of the boundary face.