The Dedekind-MacNeille completion as a reflector

We introduce a special type of order-preserving maps between quasiordered sets, the so-called cut-stable maps. These form the largest morphism class such that the corresponding category of quasiordered sets contains the category of complete lattices and complete homomorphisms as a full reflective subcategory, the reflector being given by the Dedekind-MacNeille completion (alias normal completion or completion by cuts). Suitable restriction of the object class leads to the category of separated quasiordered sets and its full reflective subcategory of completely distributive lattices. Similar reflections are obtained for continuous lattices, algebraic lattices, etc.     

Productivity change and innovation in Norwegian electricity distribution companies

Regulators of electricity distribution networks have typically applied Data Envelopment Analysis (DEA) to cross-section data for benchmarking purposes. However, the use of panel data to analyse the impact of regulatory policies on productivity change over time is less frequent. The main purpose of this paper is to construct a Malmquist productivity index to examine the recent productivity change experienced by Norwegian distribution companies between 2004 and 2007. The Malmquist index is decomposed in order to explore the sources of productivity change, and to identify the innovator companies that pushed the frontier forward each year. The input and output variables considered are those used by the Norwegian regulator. In order to reflect appropriately the exogenous conditions where the companies operate, the efficiency model used in this paper incorporates geography variables as outputs of the DEA model. Unlike the model used by the regulator, we included virtual weight restrictions in the DEA formulation to correct the biases in the DEA results that may be associated to a judicious choice of weights by some of the companies.     

Shohat-Favard and Chebyshev’s methods in d-orthogonality

This paper is concerned with the Shohat-Favard, Chebyshev and Modified Chebyshev methods for d-orthogonal polynomial sequences d∈ℕ. Shohat-Favard’s method is presented from the concept of dual sequence of a sequence of polynomials. We deduce the recurrence relations for the Chebyshev and the Modified Chebyshev methods for every d∈ℕ. The three methods are implemented in the Mathematica programming language. We show several formal and numerical tests realized with the software developed. This revised version was published online in June 2006 with corrections to the Cover Date.     

Application of the Szili method of interpolation on the roots of the Legendre polynomials

Let $$P_n (x) = \frac{{( - 1)^n }}{{2^n n!}}\frac{{d^n }}{{dx^n }}\left[ {(1 - x^2 )^n } \right]$$ be thenth Legendre polynomial. Letx ₁,x ₂,…,x _n andx*₁,x*₂,…,x* _n?1 denote the roots ofP _n (x) andP′ _n (x), respectively. Putx ₀=x*₀=?1 andx* _n =1. In this paper we prove the following theorem: Ify ₀,y ₁,…,y _n andy′ ₀,y′ ₁, …,y′ _n are two systems of arbitrary real numbers, then there exists a unique polynomialQ _2n+1(x) of degree at most 2n+1 satisfying the conditions $$Q_{2n + 1} (x_k^* ) = y_k and Q_{2n + 1}^\prime (x_k ) = y_k^\prime (k = 0,...,n).$$ .     

On the redox reactions between allyl radicals and NOx

NO_x mitigation is a central focus of combustion technologies with increasingly stringent emission regulations. NO_x can also enhance the autoignition of hydrocarbon fuels and can promote soot oxidation. The reaction between allyl radical (C₃H₅) and NO_x plays an important role in the oxidation kinetics of propene. In this work, we measured the absolute rate coefficients for the redox reaction between C₃H₅ and NO_x over the temperature range of 1000–1252 K and pressure range of 1.5–5.0 bar using a shock tube and UV laser absorption technique. We produced C₃H₅ by shock heating of C₃H₅I behind reflected shock waves. Using a Ti:Sapphire laser system with frequency quadrupling, we monitored the kinetics of C₃H₅ at 220 nm. Unlike low-temperature chemistry, the two target reactions, C₃H₅ + NO → products (R1) and C₃H₅ + NO₂ → products (R2), exhibited a strong positive temperature dependence for this radical-radical type reaction. However, these reactions did not show any pressure dependence over the pressure range of 1.5–5.0 bar, indicating that the measured rate coefficients are close to the high-pressure limit. The measured values of the rate coefficients resulted in the following Arrhenius expressions (in unit of cm³/molecule/s):$k_1\left({\mathrm{C}}_3{\mathrm{H}}_5+\text{NO}\right)=1.49\times {10}^{?10}\exp \left(?6083.6\frac{\mathrm{K}}{T}\right)\left(1017?1252K\right)$$k_2\left({\mathrm{C}}_3{\mathrm{H}}_5+\mathrm{N}{\mathrm{O}}_2\right)=1.71\times {10}^{?10}\exp \left(?3675.7\frac{\mathrm{K}}{T}\right)\left(1062?1250K\right)$To our knowledge, these are the first high-temperature measurements of allyl + NO_x reactions. The reported data will be highly useful in understanding the interaction of NO_x with resonantly stabilized radicals as well as the mutual sensitization effect of NO_x on hydrocarbon fuels.     

On a hierarchical error estimator combined with a stabilized method for the Navier–Stokes equations

This work combines two complementary strategies for solving the steady incompressible Navier–Stokes model with a zeroth‐order term, namely, a stabilized finite element method and a mesh–refinement approach based on an error estimator. First, equal order interpolation spaces are adopted to approximate both the velocity and the pressure while stability is recovered within the stabilization approach. Also designed to handle advection dominated flows under zeroth‐order term influence, the stabilized method incorporates a new parameter with a threefold asymptotic behavior. Mesh adaptivity driven by a new hierarchical error estimator and built on the stabilized method is the second ingredient. The estimator construction process circumvents the saturation assumption by using an enhancing space strategy which is shown to be equivalent to the error. Several numerical tests validate the methodology. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Modified (0, 2)-Interpolation on the Roots of Jacobi Polynomials. I (Explicit Formulae)

Let the set of knots

Disjoint Hamilton cycles in the random geometric graph

We consider the standard random geometric graph process in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of edge‐length. For fixed k?1, weprove that the first edge in the process that creates a k‐connected graph coincides a.a.s. with the first edge that causes the graph to contain k/2 pairwise edge‐disjoint Hamilton cycles (for even k), or (k?1)/2 Hamilton cycles plus one perfect matching, all of them pairwise edge‐disjoint (for odd k). This proves and extends a conjecture of Krivelevich and M ler. In the special case when k = 2, our result says that the first edge that makes the random geometric graph Hamiltonian is a.a.s. exactly the same one that gives 2‐connectivity, which answers a question of Penrose. (This result appeared in three independent preprints, one of which was a precursor to this article.) We prove our results with lengths measured using the ?_p norm for any p>1, and we also extend our result to higher dimensions. © 2011 Wiley Periodicals, Inc. J Graph Theory 68:299‐322, 2011     

Numerical solution of random differential initial value problems: Multistep methods

This paper deals with the construction of numerical methods of random initial value problems. Random linear multistep methods are presented and sufficient conditions for their mean square convergence are established. Main statistical properties of the approximations processes are computed in several illustrative examples. Copyright © 2010 John Wiley & Sons, Ltd.     

The CRT is the scaling limit of unordered binary trees

We prove that a uniform, rooted unordered binary tree (also known as rooted, binary Pólya tree) with n leaves has the Brownian continuum random tree as its scaling limit for the Gromov‐Hausdorff topology. The limit is thus, up to a constant factor, the same as that of uniform plane trees or labeled trees. Our analysis rests on a combinatorial and probabilistic study of appropriate trimming procedures of trees. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 38, 467–501, 2011