output
20022005
most citedExciton binding energies in carbon nanotubes from two-photon photoluminescence

514 citations

Showing 2002Show all

7 papers · 1 filter

cs.DS2002

Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems

Sandor P. Fekete, Henk Meijer, Andre Rohe +1

We consider geometric instances of the Maximum Weighted Matching Problem (MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000 vertices. Making use of a geo…

math.CO20021 cited

An Upper Bound for the Number of Planar Lattice Triangulations

Emile E. Anclin

We prove an exponential upper bound for the number of all maximal triangulations of the grid: \[ f(m,n) < 2^{3mn}. \] In particular, this improves a result of…

math.DG2002

Parallel surfaces in affine 4-space

C. Scharlach, L. Vrancken

We study affine immersions as introduced by Nomizu and Pinkall. We classify those affine immersions of a surface in 4-space which are degenerate and have vanishing cubic form (i.e.…

math.MG2002

Beneath-and-Beyond revisited

Michael Joswig

It is shown how the Beneath-and-Beyond algorithm can be used to yield another proof of the equivalence of V- and H-representations of convex polytopes. In this sense this paper ser…

math.MG200238 cited

Face numbers of 4-Polytopes and 3-Spheres

Günter M. Ziegler

In this paper, we discuss f- and flag-vectors of 4-dimensional convex polytopes and cellular 3-spheres. We put forward two crucial parameters of fatness and complexity: Fatness F(P…

nlin.SI2002

Computing Riemann Theta Functions

Bernard Deconinck, Matthias Heil, Alexander Bobenko +2

The Riemann theta function is a complex-valued function of g complex variables. It appears in the construction of many (quasi-) periodic solutions of various equations of mathemati…