Precise bounds and asymptotics for the first Dirichlet eigenvalue of triangles and rhombi

We study the asymptotic expansion of the first Dirichlet eigenvalue of certain families of triangles and of rhombi as a singular limit is approached. In certain cases, which include isosceles and right triangles, we obtain the exact value of all the coefficients of the unbounded terms in the asymptotic expansion as the angle opening approaches zero, plus the constant term and estimates on the remainder. For rhombi and other triangle families such as isosceles triangles where now the angle opening approaches π, we have the first two terms plus bounds on the remainder. These results are based on new upper and lower bounds for these domains whose asymptotic expansions coincide up to the orders mentioned. Apart from being accurate near the singular limits considered, our lower bounds for the rhombus improve upon the bound by Hooker and Protter for angles up to approximately 22° and in the range (31°,54°). These results also show that the asymptotic expansion around the degenerate case of the isosceles triangle with vanishing angle opening depends on the path used to approach it.     

Integrated Groups and Smooth Distribution Groups

In this paper, we prove directly that α-times integrated groups define algebra homomorphisms. We also give a theorem of equivalence between smooth distribution groups and α-times integrated groups.     

Heuristics and look-ahead integration to solve constraint satisfaction problems efficiently

Logic programming languages, such asProlog, allow a declarative specification of Constraint Satisfaction Problems (CSPs), freeing the user from specifying more or less complex control directives. However, the price to pay for such flexibility is a loss of efficiency, which makes Logic Programming inadequate to solve CSPs of even moderate size and complexity. To extend the range of applicability of logic programming, several improvements have been proposed. The use of heuristics is one such improvement. Although this usually forces the user to specify some form of control (thus abandoning the pure declarative nature of a logic program), these specifications can be made declarative by making use of some appropriate meta-predicates. Another extension to logic programming that improves its efficiency, is the active use of constraints, as done in the various formulations of constraint logic programming languages. In particular, the use of finite domains is quite adequate to implement look-ahead schemes to efficiently solve several types of CSPs. In this paper, we discuss the complementary nature of heuristics and look-ahead schemes and present a constraint logic programming framework that integrates both these techniques. Results obtained with a time-tabling problem executed on a prototype that implements such a framework are presented, and show that significant efficiency improvements can be achieved when compared with the separate use of the two techniques.     

Local solution for the Kadomtsev-Petviashvili equation with periodic conditions

In this article we prove a local existence and uniqueness theorem for the Kadomtsev-Petviashvili Equation (u _t +u _xxx +uu _x ) _x −u _yy =0) in the Sobolev spaces of orders≥3, with initial values in the same spaces, and periodic boundary conditions. This theorem improves previous results based upon the application of singular perturbation techniques.     

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {s_i,t_i} of G, find a minimum set of edges of G whose removal disconnects each s_i from the corresponding t_i. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut.     

Voltammetric determination of methyl parathion, ortho, meta and para nitrophenol with a carbon paste electrode modified with C18

Summary The determination of methyl-parathion (MPT), ortho (ONP), meta (MNP) and para nitrophenol (PNP) has been studied by differential pulse voltammetry with a carbon-paste electrode modified with 50% (w/w) of C₁₈. A study of the influence of the pH in the preconcentration cell and the measurement cell was carried out for an electrode with 50% modifier and an accumulation time of 5 min. The voltammograms were recorded with a sweep rate of 40 mV s^–1 and a pulse amplitude of 50 mV. With the optimum conditions of pH for both of the steps, various other variables were studied. The variables for each compound were optimized and the possibility of application to the determination of a mixture of the four compounds was investigated. The determination limits found for all the compounds are: 2 ng ml^–1 for ONP, 5 ng ml^–1 for MNP, 4.3 ng ml^–1 for PNP and 7.9 ng ml^–1 for MPT. The method was applied to samples of a small lake which gathers rain water and water filtered from land on which cereals are grown.     

Weak singularities may help periodic solutions to exist

In a periodically forced semilinear differential equation with a singular nonlinearity, a weak force condition enables the achievement of new existence criteria through a basic application of Schauder's fixed point theorem. The originality of the arguments relies in that, contrary to the customary situation in the available references, a weak singularity facilitates the arguments of the proofs.     

Synthesis of poly(vinyl chloride)‐b‐poly(n‐butyl acrylate)‐b‐poly(vinyl chloride) by the competitive single‐electron‐transfer/degenerative‐chain‐transfer‐mediated living radical polymerization in water

The synthesis of a block copolymer poly(vinyl chloride)‐b‐poly(n‐butyl acrylate)‐b‐poly(vinyl chloride) is reported. This new material was synthesized by single‐electron‐transfer/degenerative‐chain‐transfer‐mediated living radical polymerization (SET‐DTLRP) in two steps. First, a bifunctional macroinitiator of α,ω‐di(iodo)poly (butyl acrylate) [α,ω‐di(iodo)PBA] was synthesized by SET‐DTLRP in water at 25 °C. The macroinitiator was further reinitiated by SET‐DTLRP, leading to the formation of the desired product. This ABA block copolymer was synthesized with high initiator efficiency. The kinetics of the copolymerization reaction was studied for two PBA macroinitiators with number–average molecular weight of 10 k and 20 k. The relationship between the conversion and the number–average molecular weight was found to be linear. The dynamic mechanical thermal analysis suggests just one phase, indicating that copolymer behaves as a single material with no phase separation. This methodology provides the access to several block copolymers and other complex architectures that result from combinations of thermoplastics (PVC) and elastomers (PBA). From industrial standpoint, this process is attractive, because of easy experimental setup and the environmental friendly reaction medium. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 3001–3008, 2006     

Single electron transfer–degenerative chain transfer living radical polymerization of N‐butyl acrylate catalyzed by Na2S2O4 in water media

Living radical polymerization of n‐butyl acrylate was achieved by single electron transfer/degenerative‐chain transfer mediated living radical polymerization in water catalyzed by sodium dithionate. The plots of number–average molecular weight versus conversion and ln[M]₀/[M] versus time are linear, indicating a controlled polymerization. This methodology leads to the preparation of α,ω‐di(iodo) poly (butyl acrylate) (α,ω‐di(iodo)PBA) macroinitiators. The influence of polymerization degree ([monomer]/[initiator]), amount of catalyst, concentration of suspending agents and temperature were studied. The molecular weight distributions were determined using a combination of three detectors (TriSEC): right‐angle light scattering (RALLS), a differential viscometer (DV), and refractive index (RI). The methodology studied in this work represents a possible route to prepare well‐tailored macromolecules made of butyl acrylate in an environmental friendly reaction medium. Moreover, such materials can be subsequently functionalized leading to the formation of different block copolymers of composition ABA. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 2809–2825, 2006