Lower bounds on the number of realizations of rigid graphs

Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the fastest available method, although its complexity is still exponential. Combining computational results with the theory of constructing new rigid graphs by gluing, we give a new lower bound on the maximal possible number of (complex) realizations for graphs with a given number of vertices. We extend these ideas to rigid graphs in three dimensions and we derive similar lower bounds, by exploiting data from extensive Gr\"obner basis computations

Irreducible representations of nilpotent groups generate classifiable C*-algebras

We show that C*-algebras generated by irreducible representations of finitely generated nilpotent groups satisfy the universal coefficient theorem of Rosenberg and Schochet. This result combines with previous work to show that these algebras are classifiable by their Elliott invariants within the class of unital, simple, separable, nuclear C*-algebras with finite nuclear dimension that satisfy the universal coefficient theorem. We also show that these C*-algebras are central cutdowns of twisted group C*-algebras with homotopically trivial cocycles.Comment: This version to appear in the M\"unster Journal of Mathematic

Why Delannoy numbers?

This article is not a research paper, but a little note on the history of combinatorics: We present here a tentative short biography of Henri Delannoy, and a survey of his most notable works. This answers to the question raised in the title, as these works are related to lattice paths enumeration, to the so-called Delannoy numbers, and were the first general way to solve Ballot-like problems. These numbers appear in probabilistic game theory, alignments of DNA sequences, tiling problems, temporal representation models, analysis of algorithms and combinatorial structures.Comment: Presented to the conference "Lattice Paths Combinatorics and Discrete Distributions" (Athens, June 5-7, 2002) and to appear in the Journal of Statistical Planning and Inference

Low lying spectrum of weak-disorder quantum waveguides

We study the low-lying spectrum of the Dirichlet Laplace operator on a randomly wiggled strip. More precisely, our results are formulated in terms of the eigenvalues of finite segment approximations of the infinite waveguide. Under appropriate weak-disorder assumptions we obtain deterministic and probabilistic bounds on the position of the lowest eigenvalue. A Combes-Thomas argument allows us to obtain so-called 'initial length scale decay estimates' at they are used in the proof of spectral localization using the multiscale analysis.Comment: Accepted for publication in Journal of Statistical Physics http://www.springerlink.com/content/0022-471