Quantum curves and q-deformed Painlevé equations

Letters in Mathematical Physics - We propose that the grand canonical topological string partition functions satisfy finite-difference equations in the closed string moduli. In the case of genus...     

Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.     

Two-dimensional vortex sheets for the nonisentropic Euler equations: Nonlinear stability

We show the short-time existence and nonlinear stability of vortex sheets for the nonisentropic compressible Euler equations in two spatial dimensions, based on the weakly linear stability result of Morando and Trebeschi (2008) [20]. The missing normal derivatives are compensated through the equations of the linearized vorticity and entropy when deriving higher-order energy estimates. The proof of the resolution for this nonlinear problem follows from certain a priori tame estimates on the effective linear problem in the usual Sobolev spaces and a suitable Nash–Moser iteration scheme.     

Spectroscopic characterization of core and shell regions in monolayer protected gold nanoparticles

We report studies on the structure of the metallic core and the alkyl cap layer in monolayer protected gold nanoparticles having sizes down to 1.6 nm. These particles are obtained by laser ablating gold targets in alkane-thiol solutions at different concentrations. The electronic structure of gold core and the vibrational properties of the capping hydrocarbon chains reveal effects connected with the nanosized nature of the particles.     

On computation of the greatest common divisor of several polynomials over a finite field

We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field.     

Competing kinetic pathways in the bromine addition to allylic ethers in 1,2‐dichloroethane: Opposite temperature effects

The kinetics of the electrophilic bromination of three allylic ethers in a nonprotic solvent, 1,2‐dichloroethane, has been investigated. Two of them followed a prevalent second‐order pathway, while the third one exhibited a classical, clean third order. The second‐order pathway in the first two olefins is attributed to electrophilic assistance of the ethereal oxygen to the attacking bromine molecule. In the molecular bromination of 2,4‐cis‐dimethyl‐8‐oxabicyclo[3.2.1]‐6‐octen‐3‐cis‐ol, opposite temperature dependences were found for the two different kinetic pathways. An exoergonic process for the second‐order reaction was explained by the lesser stability of the bromiranium–bromide ionic intermediate, compared to the bromiranium–tribromide in the third‐order profile. © 2007 Wiley Periodicals, Inc. 39: 197–203, 2007     

Exact Max-SAT solvers for over-constrained problems

We present a new generic problem solving approach for over-constrained problems based on Max-SAT. We first define a Boolean clausal form formalism, called soft CNF formulas, that deals with blocks of clauses instead of individual clauses, and that allows one to declare each block either as hard (i.e., must be satisfied by any solution) or soft (i.e., can be violated by some solution). We then present two Max-SAT solvers that find a truth assignment that satisfies all the hard blocks of clauses and the maximum number of soft blocks of clauses. Our solvers are branch and bound algorithms equipped with original lazy data structures, powerful inference techniques, good quality lower bounds, and original variable selection heuristics. Finally, we report an experimental investigation on a representative sample of instances (random 2-SAT, Max-CSP, graph coloring, pigeon hole and quasigroup completion) which provides experimental evidence that our approach is very competitive compared with the state-of-the-art approaches developed in the CSP and SAT communities. Research partially supported by projects TIN2004-07933-C03-03 and TIC2003-00950 funded by the Ministerio de Educación y Ciencia. The second author is supported by a grant Ramón y Cajal.