On the chromatic polynomial of a graph

Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()^α≤≤ () ^{n −ω}. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour number μ(G) of G: n− (n−ω)() ^{n −ω}≤μ(G)≤n−α() ^α. Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002     

Links in a thickened surface

For a given two-dimensional surface μ, we studi invariants for oriented links in μ×[0,1] which generalize the two-variable HOMFLY polynomials when μ is the 2-disk. These invariants are connected to multiparameter quantum groups whose special properties are discussed. Si studiano gli invarianti dei nodi in spazi del tipo μ×[0,1], dove μ è una superficie. Questi invarianti generalizzano gli invarianti di HOMFLY.

---

(Conferenza tenuta dal Prof. P. Cotta-Ramusino il 16 maggio 1991)     

Euler characteristics of general linear sections and polynomial Chern classes

We obtain a precise relation between the Chern–Schwartz–MacPherson class of a subvariety of projective space and the Euler characteristics of its general linear sections. In the case of a hypersurface, this leads to simple proofs of formulas of Dimca–Papadima and Huh for the degrees of the polar map of a homogeneous polynomial, extending these formula to any algebraically closed field of characteristic \(0\), and proving a conjecture of Dolgachev on ‘homaloidal’ polynomials in the same context. We generalize these formulas to subschemes of higher codimension in projective space. We also describe a simple approach to a theory of ‘polynomial Chern classes’ for varieties endowed with a morphism to projective space, recovering properties analogous to the Deligne–Grothendieck axioms from basic properties of the Euler characteristic. We prove that the polynomial Chern class defines homomorphisms from suitable relative Grothendieck rings of varieties to \(\mathbb{Z }[t]\).     

Evolution in complex systems

What features characterize complex system dynamics? Power laws and scale invariance of fluctuations are often taken as the hallmarks of complexity, drawing on analogies with equilibrium critical phenomena. Here we argue that slow, directed dynamics, during which the system's properties change significantly, is fundamental. The underlying dynamics is related to a slow, decelerating but spasmodic release of an intrinsic strain or tension. Time series of a number of appropriate observables can be analyzed to confirm this effect. The strain arises from local frustration. As the strain is released through “quakes,” some system variable undergoes record statistics with accompanying log‐Poisson statistics for the quake event times. We demonstrate these phenomena via two very different systems: a model of magnetic relaxation in type II superconductors and the Tangled Nature model of evolutionary ecology and show how quantitative indications of aging can be found. © 2004 Wiley Periodicals, Inc. Complexity 10: 49–56, 2004     

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.     

Braids on surfaces and finite type invariants

We prove that there is no functorial universal finite type invariant for braids in Σ×I if the genus of Σ is positive. To cite this article: P. Bellingeri, L. Funar, C. R. Acad. Sci. Paris, Ser. I 338 (2004).     

Group valued measures with the lyapunoff property

Dopo aver dato una definizione di parte convessa di un gruppo topologico, si stabilisce una condizione affinchè il condominio di una misura sia convesso.