Packing Non-Zero A-Paths In Group-Labelled Graphs

Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.     

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.     

Vassiliev invariants for braids on surfaces

We show that Vassiliev invariants separate braids on a closed oriented surface, and we exhibit a universal Vassiliev invariant for these braids in terms of chord diagrams labeled by elements of the fundamental group of the surface.

     

High energy physics in the atmosphere: phenomenology of cosmic ray air showers

The properties of cosmic rays with energies above 10⁶ GeV have to be deduced from the spacetime structure and particle content of the air showers which they initiate. In this review we summarize the phenomenology of these giant air showers. We describe the hadronic interaction models used to extrapolate results from collider data to ultra high energies, and discuss the prospects for insights into forward physics at the LHC. We also describe the main electromagnetic processes that govern the longitudinal shower evolution, as well as the lateral spread of particles. Armed with these two principal shower ingredients and motivation from the underlying physics, we provide an overview of some of the different methods proposed to distinguish primary species. The properties of neutrino interactions and the potential of forthcoming experiments to isolate deeply penetrating showers from baryonic cascades are also discussed. We finally venture into a terra incognita endowed with TeV-scale gravity and explore anomalous neutrino-induced showers.     

Submanifolds associated with graphs

In this paper we present an interesting relationship between graph theory and differential geometry by defining submanifolds of almost Hermitian manifolds associated with certain kinds of graphs. We show some results about the possibility of a graph being associated with a submanifold and we use them to characterize CR-submanifolds by means of trees. Finally, we characterize submanifolds associated with graphs in a four-dimensional almost Hermitian manifold.

     

X-ray diffraction study of some mesogenic copper, nickel and vanadyl complexes

We present a comparative study of various metallomesogenic complexes, using X-ray diffraction methods. For a given ligand linked to different metal atoms (Cu, Ni, VO), the nature of this central atom influences mainly the magnetic susceptibilities of the mesophases. With different ligands, which keep the close neighbourhood of the metal atom unchanged, the apparent length of the mesogenic unit is longer for short ligands than for longer ones. This unexpected behaviour is qualitatively well explained by taking into account the global shape of the different complexes.