The Bernstein problem for intrinsic graphs in Heisenberg groups and calibrations
β Scribed by Vittorio Barone Adesi; Francesco Serra Cassano; Davide Vittone
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 511 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0944-2669
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
There are two natural commuting self-adjoint operators in the enveloping algebra of the Heisenberg group: the Heisenberg sublaplacian 2 H and the central element T=&i Γ t. The joint spectral theory of these operators is investigated by means of the Laguerre calculus. Explicit convolution kernels are
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum-weighted subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe a tabu search algorithm for the Steiner problem in graphs, based o