Bounds for rectilinear crossing numbers

A rectilinear drawing of a graph is one where each edge is drawn as a straight-line segment, and the rectilinear crossing number of a graph is the minimum number of crossings over all rectilinear drawings. We describe, for every integer k ≥ 4, a class of graphs of crossing number k, but unbounded rectilinear crossing number. This is best possible since the rectilinear crossing number is equal to the crossing number whenever the latter is at most 3. Further, if we consider drawings where each edge is drawn as a polygonal line segment with at most one break point, then the resulting crossing number is at most quadratic in the regular crossing number. © 1993 John Wiley & Sons, Inc.     

Influence of the sulfonate countercation on the thermal stability of nafion perfluorosulfonate membranes

We report a strong dependence of the thermal stability of Nafion® perfluorosulfonate ionomer on the nature of the counterion associated with the fixed sulfonate site. These results were obtained using thermal gravimetric analysis on a series of alkali metal and alkyl ammonium cation-exchanged Nafion films. We have found that the temperature of decomposition of Nafion is inversely dependent on the size of the exchanged cation; i.e., Nafion films show improved thermal stability as the size of the counter cation decreases. We attribute this inverse relationship of thermal stability with counterion size to an initial decomposition reaction which is strongly influenced by the strength of the sulfonate-coun-terion interaction. © 1993 John Wiley & Sons, Inc.     

A detailed study of the generation of optically detectable watermarks using the logistic map

A digital watermark is a visible, or preferably invisible, identification code that is permanently embedded in digital media, to prove owner authentication and provide protection for documents. Given the interest in watermark generation using chaotic functions a detailed study of one chaotic function for this purpose is performed. In this paper, we present an approach for the generation of watermarks using the logistic map. Using this function, in conjunction with seed management, it is possible to generate chaotic sequences that may be used to create highpass or lowpass digital watermarks. In this paper we provide a detailed study on the generation of optically detectable watermarks and we provide some guidelines on successful chaotic watermark generation using the logistic map, and show using a recently published scheme, how care must be taken in the selection of the function seed.     

Extended Rees algebras and mixed multiplicities

Partially supported by the general research fund at the University of Kansas     

Initial-boundary value problems for incomplete singular perturbations of hyperbolic systems

The general problem studied has as a prototype the full non-linear Navier-Stokes equations for a slightly viscous compressible fluid including the heat transfer. The boundaries are of inflow-outflow type, i.e. non-characteristic, and the boundary conditions are the most general ones with any order of derivatives. It is assumed that the uniform Lopatinsky condition is satisfied. The goal is to prove uniform existence and boundedness of solution as the viscosity tends to zero and to justify the boundary layer asymptotics. The paper consists of two parts. In Part I the linear problem is studied. Here, uniform lower and higher order tangential estimates are derived and the existence of a solution is proved. The higher order estimates depend on the smoothness of coefficients; however this smoothness does not exceed the smoothness of the solution. In Part II the quasilinear problem is studied. It is assumed that for zero viscosity the overall initial-boundary value problem has a smooth solutionu ₀ in a time interval 0≦t≦T ₀. As a result the boundary laye, is weak and is uniformlyC ¹ bounded. This makes the linear theory applicable. an iteration scheme is set and proved to converge to the viscous solution. The convergence takes place for small viscosity and over the original time interval 0≦t≦T ₀.     

Segregation in the Falicov--Kimball Model

The Falicov–Kimball model is a simple quantum lattice model that describes light and heavy electrons interacting with an on-site repulsion; alternatively, it is a model of itinerant electrons and fixed nuclei. It can be seen as a simplification of the Hubbard model; by neglecting the kinetic (hopping) energy of the spin up particles, one gets the Falicov–Kimball model. We show that away from half-filling, i.e. if the sum of the densities of both kinds of particles differs from 1, the particles segregate at zero temperature and for large enough repulsion. In the language of the Hubbard model, this means creating two regions with a positive and a negative magnetization. Our key mathematical results are lower and upper bounds for the sum of the lowest eigenvalues of the discrete Laplace operator in an arbitrary domain, with Dirichlet boundary conditions. The lower bound consists of a bulk term, independent of the shape of the domain, and of a term proportional to the boundary. Therefore, one lowers the kinetic energy of the itinerant particles by choosing a domain with a small boundary. For the Falicov- Kimball model, this corresponds to having a single “compact” domain that has no heavy particles. Received: 21 June 2001 / Accepted: 4 January 2002     

On the non existence of monotone linear schema for some linear parabolic equations

In this Note, we present a result concerning the non existence of linear monotone schema with fixed stencil on regular meshes for some linear parabolic equation in two dimensions. The parabolic equations of interest arise from non isotropic diffusion modelling. A corollary is that no linear monotone 9 points-schemes can be designed for the one-dimensional heat equation emerged in the plane with an arbitrary direction of diffusion. Some applications of this result are provided: for the Fokker–Planck–Lorentz model for electrons in the context of plasma physics; all linear monotone scheme for the one-dimensional hyperbolic heat equation treated as a two-dimensional problem are not consistent in the diffusion limit for an arbitrary direction of propagation. We also examine the case of the Landau equation. To cite this article: C. Buet, S. Cordier, C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

Extensions of Modules over Schur Algebras, Symmetric Groups and Hecke Algebras

We study the relation between the cohomology of general linear and symmetric groups and their respective quantizations, using Schur algebras and standard homological techniques to build appropriate spectral sequences. As our methods fit inside a much more general context within the theory of finite-dimensional algebras, we develop our results first in that general setting, and then specialize to the above situations. From this we obtain new proofs of several known results in modular representation theory of symmetric groups. Moreover, we reduce certain questions about computing extensions for symmetric groups and Hecke algebras to questions about extensions for general linear groups and their quantizations.     

Optimal mappings with minimum number of connected components in tree-to-tree comparison problems

In this paper we consider the problem of finding a minimum cost mapping between two unordered trees which induces a graph with a minimum number of connected components. The proposed algorithm is based on the generalization of an algorithm for computing an edit distance between trees, and it solves the stated problem in sequential time precisely in O(|T₁|×|T₂|×(degT₁+degT₂)×log₂(degT₁+degT₂)).