Topics (15) View all

Skills (4)

Education

  • Sep 1990–
    Jun 1994
    Michigan State University
    Mathematics · PhD
    USA · East Lansing

Other

  • Languages
    Romanian. English, French, Russian

Questions and Answers (5) View all

Publications (61) View all

  • Article: Complexity of random smooth functions on compact manifolds.II
    Liviu I. Nicolaescu
    [show abstract] [hide abstract]
    ABSTRACT: To each even, nonnegative Schwartz function $w(t)$ on the real axis we associate a gaussian random function on a compact Riemann manifold $(M,g)$ of dimension $m$. We investigate the expected distribution of critical values of such a random function and the behavior of this distribution as we rescale $w(t)$ to $w(\varepsilon t)$ and then let $\varepsilon\to 0$. We prove a central limit theorem describing what happens to the expected distribution of critical values when the dimension of the manifold is very large. Finally, we explain how to use the $\varepsilon\to 0$ behavior of the random function to recover the Riemannian geometry of $(M,g)$.
    09/2012;
  • Source
    Article: Combinatorial Morse flows are hard to find
    Liviu I. Nicolaescu
    [show abstract] [hide abstract]
    ABSTRACT: We investigate the probability of detecting combinatorial Morse flows on a simplicial complex via a random search. We prove that it is really small, in a quantifiable way.
    02/2012;
  • Source
    Article: Complexity of random smooth functions on compact manifolds. I
    Liviu I. Nicolaescu
    [show abstract] [hide abstract]
    ABSTRACT: We relate the distribution of eigenvalues of a random symmetric matrix in the Gaussian Orthogonal Ensemble to the distribution of critical values of a random linear combination of eigenfunctions of the Laplacian on a compact Riemann manifold. We then prove a central limit theorem describing what happens when the dimension of the manifold is very large.
    01/2012;
  • Source
    Article: Pixelations of planar semialgebraic sets and shape recognition
    Liviu I. Nicolaescu, Brandon Rowekamp
    [show abstract] [hide abstract]
    ABSTRACT: We describe an algorithm that associates to each positive real number $r$ and each finite collection $C_r$ of planar pixels of size $r$ a planar piecewise linear set $S_r$ with the following additional property: if $C_r$ is the collection of pixels of size $r$ that touch a given compact semialgebraic set $S$, then the normal cycle of $S_r$ converges to the normal cycle of $S$ in the sense of currents. In particular, in the limit we can recover the homotopy type of $S$ and its geometric invariants such as area, perimeter and curvature measures. At its core, this algorithm is a discretization of stratified Morse theory.
    09/2011;
  • Source
    Dataset: FLAT CURRENTS AND THEIR SLICES
    Liviu I Nicolaescu
    [show abstract] [hide abstract]
    ABSTRACT: I hope this description of flat chains and their slices is less intimidating than Federer's [3], though I follow his very closely.

Following (57) See all

Followers (44) See all