Constructing near spanning trees with few local inspections

Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following variant of this problem. Let G be a connected bounded‐degree graph. Given an edge e in G we would like to decide whether e belongs to a connected subgraph consisting of edges (for a prespecified constant ), where the decision for different edges should be consistent with the same subgraph . Can this task be performed by inspecting only a constant number of edges in G ? Our main results are:

• We show that if every t‐vertex subgraph of G has expansion then one can (deterministically) construct a sparse spanning subgraph of G using few inspections. To this end we analyze a “local” version of a famous minimum‐weight spanning tree algorithm.
• We show that the above expansion requirement is sharp even when allowing randomization. To this end we construct a family of 3‐regular graphs of high girth, in which every t‐vertex subgraph has expansion . We prove that for this family of graphs, any local algorithm for the sparse spanning graph problem requires inspecting a number of edges which is proportional to the girth.

© 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 183–200, 2017     

Geometric configurations of singularities for quadratic differential systems with three distinct real simple finite singularities

In this work we classify, with respect to the geometric equivalence relation, the global configurations of singularities, finite and infinite, of quadratic differential systems possessing exactly three distinct finite simple singularities. This relation is finer than the topological equivalence relation which does not distinguish between a focus and a node or between a strong and a weak focus or between foci (or saddles) of different orders. Such distinctions are, however, important in the production of limit cycles close to the foci (or loops) in perturbations of the systems. The notion of geometric equivalence relation of configurations of singularities allows us to incorporate all these important geometric features which can be expressed in purely algebraic terms. The geometric classification of all configurations of singularities, finite and infinite, of quadratic systems was initiated in a work published in 2013 when the classification was done for systems with total multiplicity m _f of finite singularities less than or equal to one. That work was continued in an article which is due to appear in 2014 where the geometric classification of configurations of singularities was done for the case m _f = 2. In this article we go one step further and obtain the geometric classification of singularities, finite and infinite, for the subclass mentioned above. We obtain 147 geometrically distinct configurations of singularities for this family. We give here the global bifurcation diagram of configurations of singularities, both finite and infinite, with respect to the geometric equivalence relation, for this class of systems. The bifurcation set of this diagram is algebraic. The bifurcation diagram is done in the 12-dimensional space of parameters and it is expressed in terms of polynomial invariants, a fact which gives us an algorithm for determining the geometric configuration of singularities for any quadratic system in this particular class.     

On the computation of scaling coefficients of Daubechies' wavelets

In the present paper, Daubechies' wavelets and the computation of their scaling coefficients are briefly reviewed. Then a new method of computation is proposed. This method is based on the work [7] concerning a new orthonormality condition and relations among scaling moments, respectively. For filter lengths up to 16, the arising system can be explicitly solved with algebraic methods like Gröbner bases. Its simple structure allows one to find quickly all possible solutions.     

Tris[2‐(morpholin‐4‐ylmethyl)phenyl‐κ2C1,N]antimony(III)

The title compound, [Sb(C₁₁H₁₄NO)₃], is monomeric with the Sb atom located on a threefold axis. The complex exhibits distorted trigonal–antiprismatic geometry around the Sb atom, owing to the presence of intramolecular N→Sb interactions. H...phenyl intermolecular interactions lead to the formation of dimers stacked along the c axis. The morpholine rings exhibit almost ideal chair conformations. No intermolecular interactions between the morpholine rings of neighbouring molecules were observed.     

Non-Transitive Generalizations of Subdirect Products of Linearly Ordered Rings

Weakly associative lattice rings (wal-rings) are non-transitive generalizations of lattice ordered rings (l-rings). As is known, the class of l-rings which are subdirect products of linearly ordered rings (i.e. the class of f-rings) plays an important role in the theory of l-rings. In the paper, the classes of wal-rings representable as subdirect products of to-rings and ao-rings (both being non-transitive generalizations of the class of f-rings) are characterized and the class of wal-rings having lattice ordered positive cones is described. Moreover, lexicographic products of weakly associative lattice groups are also studied here.     

The effect of periodic boundary conditions on homogeneous nucleation observed in computer simulations

The sudden rapid crystallization observed after a variable induction time in molecular dynamics simulations of the supercooled Lennard-Jones liquid is an artifact of periodic boundary conditions and is not related to formation of a critical nucleus.     

Hydrogen bonding in nylon 66 and model compounds

Fourier-transform infrared spectroscopy was used to study the hydrogen bond-breaking process in nylon 66 and two model compounds. The resulting enthalpy and entropy values indicated that while there is no interaction between adjacent amide groups in the polymer chain, there is, nevertheless, a substantial cooperative effect in the transverse hydrogen bond direction. We have also established that any analysis of hydrogen bond breaking in semicrystalline polymers (i.e., nylon 66) below the melting point should include a crystallinity correction factor. Extrapolation of our data above the melting point of nylon 66 yielded a 26% retention of hydrogen bonding.     

Temporal accuracy analysis of phase change convection simulations using the JFNK‐SIMPLE algorithm

The incompressible Navier–Stokes and energy conservation equations with phase change effects are applied to two benchmark problems: (1) non‐dimensional freezing with convection; and (2) pure gallium melting. Using a Jacobian‐free Newton–Krylov (JFNK) fully implicit solution method preconditioned with the SIMPLE (Numerical Heat Transfer and Fluid Flow. Hemisphere: New York, 1980) algorithm using centred discretization in space and three‐level discretization in time converges with second‐order accuracy for these problems. In the case of non‐dimensional freezing, the temporal accuracy is sensitive to the choice of velocity attenuation parameter. By comparing to solutions with first‐order backward Euler discretization in time, it is shown that the second‐order accuracy in time is required to resolve the fine‐scale convection structure during early gallium melting. Qualitative discrepancies develop over time for both the first‐order temporal discretized simulation using the JFNK‐SIMPLE algorithm that converges the nonlinearities and a SIMPLE‐based algorithm that converges to a more common mass balance condition. The discrepancies in the JFNK‐SIMPLE simulations using only first‐order rather than second‐order accurate temporal discretization for a given time step size appear to be offset in time. Copyright © 2007 John Wiley & Sons, Ltd.     

Least squares methods for Volterra equations and generalizations

In this article least squares approximations to Volterra integral equations are considered, both with exact integration and with quadrature. Optimal error estimates are derived, and it is shown that the same order of convergence is obtained in both cases with only modest requirements on the quadrature rule used in the latter. The most important practical setting for least squares is the case of convolution kernels, and these are also studied in this article. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 679–693, 1998