3 resultados para Banach Lattice
em Universidade do Minho
Resumo:
The Closest Vector Problem (CVP) and the Shortest Vector Problem (SVP) are prime problems in lattice-based cryptanalysis, since they underpin the security of many lattice-based cryptosystems. Despite the importance of these problems, there are only a few CVP-solvers publicly available, and their scalability was never studied. This paper presents a scalable implementation of an enumeration-based CVP-solver for multi-cores, which can be easily adapted to solve the SVP. In particular, it achieves super-linear speedups in some instances on up to 8 cores and almost linear speedups on 16 cores when solving the CVP on a 50-dimensional lattice. Our results show that enumeration-based CVP-solvers can be parallelized as effectively as enumeration-based solvers for the SVP, based on a comparison with a state of the art SVP-solver. In addition, we show that we can optimize the SVP variant of our solver in such a way that it becomes 35%-60% faster than the fastest enumeration-based SVP-solver to date.
Resumo:
We study the temperature dependent magnetic susceptibility of a strained graphene quantum dot by using the determinant quantum Monte Carlo method. Within the Hubbard model on a honeycomb lattice, our unbiased numerical results show that a relative small interaction $U$ may lead to a edge ferromagnetic like behavior in the strained graphene quantum dot, and a possible room temperature transition is suggested. Around half filling, the ferromagnetic fluctuations at the zigzag edge is strengthened both markedly by the on-site Coulomb interaction and the strain, especially in low temperature region. The resultant strongly enhanced ferromagnetic like behavior may be important for the development of many applications.
Resumo:
The present paper is devoted to the study of linear maps preserving certain relations, such as the sharp partial order and the star partial order in semisimple Banach algebras and C*-algebras.