S. Amghibech

Teaching activities:

Research activities: during the last five year, we have used discrete potential theory in the analysis of algorithms. We have investigated the eigenvalues of the p-Laplacian for graphs which constitute an improvement over the classical average case or worst case analysis. Many applications have already been covered.

Recent cooperations:

Recent publications and technical reports :

  1. On the Discrete Version of the Picone�s Identity, Discrete Applied Mathematics, Volume 156, Issue 1, 1 January 2008, Pages 1-10
  2. On Sums Involving Binomial Coefficients, Journal of Integer Sequences, Vol. 10 (2007)Article 07.2.1.
  3. Bounds for the Largest p-Laplacian Eigenvalues for Graphs, Discrete Mathematics, Volume 306, Issue 21, 6 November 2006, Pages 2762-2771.
  4. On the Borel-Cantelli Lemma and Moments, Comment. Math. Univ. Carolin. 47,4 (2006) 669-679.
  5. Eigenvalues of the Discrete p-Laplacian for Graphs, (2003) Ars Combinatoria, Volume (67) 283--302.
  6. Discrete $p$-Laplacian and Regular Graphs(preprint 2006).
  7. Nonlinear Wiener Criterion for Trees (preprint 2000).
  8. A Note on Recurrence Sequences (preprint 2004).
  9. Criteria of Regularity at the End of a Tree XXXII, Lecture Notes in Math. 1686, Springer (1998) 128--136.
  10. Inegalites isoperimetriques pour les graphes. Potential Analysis 355-367, June 1997.

    Other :

    (With C. Dellacherie) Une version non-lineaire, d'apres G. J. Olsder, du theoreme d'existence et d'unicite d'une mesure invariante pour une transition sur un espace fini. Seminaire de Probabilites de Rouen, 1994.

    Problems solved in 2005

    11. Problems solved in 2006

    Problems solved in 2007

    Hosted by www.Geocities.ws

    1