Some work highlights:

- A Cauchy-Binet formula gives the coefficients of the characteristic polynomial of a product of two arbitrary mxn matrices matrices article (preprint), slides [PDF]).
- A graph theoretical Lefshetz fixed point theorem: the fixed point index sum of a graph automorphism agrees with the cohomologically defined Lefshetz number. article.
- Illustrating mathematics and proofs using 3D printers, with Elizabeth Slavkovsky. In book, Updated preprint, talk.
- Some analytic continuation results for almost periodic Dirichlet series with John Lesieutre. Journal Project Page.
- Some spectral theory in ergodic theory. Example:
weakly mixing, ergodic shift invariant measures are generic for a Z
^{d}shift. PDF. - Weakly mixing is abundant PDF: a Hamiltonian system with a KAM torus can be perturbed to have a weakly mixing measure. Unresolved: is there an open set of Hamiltonian systems in dim >3 without weakly mixing invariant measure? Most probably "No": either chaos (a horse shoe already gives a mixing measure) or then KAM integrability i.e. near a periodic orbit. The paper shows that in the later case a perturbation produces weak mixing measure. Many ergodic theoretical questions are open for flows on tori: in this paper with Bert Hof we showed that for 2-tori the spectral measure are 0-dimensional by linking first in full generality Hausdorff dimension of spectral measures with speed of cyclic approximation in ergodic theory.
- Almost periodic cellular automata: with Bert Hof a cool way to evolve infinite cellular automata using finite data points. Unlike with periodic boundary conditions, with aperiodic boundary conditions, there is no recurrence in general and complexity can grow indefinitely. It can also done for fluids (Vlasov systems) or Riemannian metrics (see with Evan Reed).
- The paper gives I think the first example of a caustic in differential geometry which is nowhere differentiable. No example with non-integer Hausdorff dimension is known yet.
- The paper [PDF] with Bert Hof and Barry Simon got recently some attention.
- An ergodic theoretical approach of sphere packings. In that class, periodic packings maximize the packing density. HTML, PDF, Some code.
- For an aperiodic ergodic sequence of SL(2,R)-valued random variables, the class with positive Lyapunov exponent are dense. PDF. (This 1992 paper was the first density result of this type).

- I currently work on Wu characteristic and related topics. Here is a handout explaining the corresponding cohomology (which is almost as simple as simplicial cohomology) but which allows to distinguish topological spaces like Stiefel-Whitney classes. That things are fresh can be seen that in this handout the cohomology had not been finalized yet (even so it had already worked for the theorems). Here and here (4K downloadable) are some slides explaining the Wu characteristic.
- I'm interested in basic structures of calculus and especially quantum calculus (see also the Video) Here is a writeup, which explains a bit how easy calculus becomes on a graph. In order to work, we have to see calculus structures on finite structures. Some examples of results illustrating how porting results is Gauss-Bonnet, Poincare Hopf, Brouwer-Lefshetz, Jordan-Brouwer, McKean Singer or Lysternik-Schnirelman. A notion of dimension for graphs proposed here was explored here in detail. A notion of continuity and homeomorphism for graphs, Cartesian product for graphs, a definition of sphere (I call now Evako sphere) and level surfaces in graph theory.
- A limit theorem for Barycentric subdivision (see also an earlier approach) is exciting not only because it is a central limit type theorem but because the limits need still to be investigated. This is a follow up on a renomralization story for random Jacobi matrices, where I had searched for higher dimensional versions. It turns out that the Euclidean discrete lattice is too confining but that Barycentric subdivision of an arbitrary graph makes things easy. In the case a graph has no triangle, the limiting operator is almost periodic over the dyadic integers. The underlying translation is the von Neumann Kakutani system and the density of states the equilibrium measure on a Julia set.
- An integrable evolution equation in geometry as well as a generalization to the complex shows that any exterior derivative both in Riemannian geometry or in graph theory allows an isospectral deformation in form of a Lax pair. I had worked on integrable systems as grad student originally by hoping to use it as a tool to prove an entropy estimation problem in Hamiltonian dynamics which eventually crashed after a desperate attempt running against a time deadline. The deformation system is part of the Noether symmetry of any geometry and not only natural, it is also exciting from the mathematical and physics point of view. The deformation always produces an expansion of space with an inflationary start: for small graphs, we can even compute the evolution explicitly. When allowing the deformation to become complex, then we don't have a scattering situation but get asymptotically a wave evolution.
- The limiting structure of the Birkhoff sum of the Cot function is I believe the first example, where one can compute explicitly the Birkhoff sum of an aperiodic dynamical system for arbitrary large sums because we know everything about it. The random walk converges asymptotically to a self similar graph which is given analytically even so highly non-smooth. It looks like the cot function is special, it is quite universal when adding random variables with infinite variance. The Cauchy distribution is the "high risk" version of the Gaussian distribution. This paper especially answers a question worked on with Tangerman. The mathematics is closely related also to the analysis of the Zeta function for circular graphs, where we prove a "Baby Riemann Hypothesis" (no relation with the real Riemann hypothesis, which is the case of the circle, not circular graphs).
- After some summer work with Jenny Nitishinskaya lead to Coloring graphs using topology and Graphs with Eulerian unit spheres (see also curvature). The idea is simple and illustrated here and here: embed a planar graph into a 3 dimensional Eulerian sphere to 4 color it. I currently believe this works. some notes here: to prove the 4 color theorem one has only to be able to 4-color any discrete 2-sphere (this follows from work of Cayley and Whitney). Now write the 2-sphere as the boundary of a three ball. Now make edge refinements with edges in the interior of the ball to render the ball Eulerian in the inside (we essentially construct an Eulerian 3 sphere in which the 2-sphere is embedded. It is a basic idea going back to Fiske that an Eulerian 3 sphere is 4 colorable. Of course, any embedded 2 sphere is then also 4 colorable. To make the 3 ball Eulerian, we have to cut edges in an organized way. There appears currently no difficulty but it still needs to be programmed and tested.
- A fascinating class of networks we call orbital networks were found with Montasser Ghachem. Some write-ups: Part 1, part 2, and part 3. Unfortunately, due to other commitments we both had to move on to other projects. For now, we have just to admire the immense beauty of these graphs.