COMPUTATIONAL ENUMERATION OF POINT DEFECT CLUSTERS IN DOUBLE- LATTICE CRYSTALS
Authors: not saved
Abstract:
The cluster representation matrices have already been successfully used to enumerate close-packed vacancy clusters in all single-lattice crystals [I, 2]. Point defect clusters in double-lattice crystals may have identical geometry but are distinct due to unique atomic postions enclosing them. The method of representation matrices is extended to make it applicable to represent and enumerate the point defect clusters in multi-lattice crystals as well. A computational procedure based on family representation matrices is developed and applied to the hexagonal close-packed structure.
similar resources
computational enumeration of point defect clusters in double- lattice crystals
the cluster representation matrices have already been successfully used to enumerate close-packed vacancy clusters in all single-lattice crystals [i, 2]. point defect clusters in double-lattice crystals may have identical geometry but are distinct due to unique atomic postions enclosing them. the method of representation matrices is extended to make it applicable to represent and enumerate the ...
full textLattice Point Enumeration on Block Reduced Bases
When analyzing lattice-based cryptosystems, we often need to solve the Shortest Vector Problem (SVP) in some lattice associated to the system under scrutiny. The go-to algorithms in practice to solve SVP are enumeration algorithms, which usually consist of a preprocessing step, followed by an exhaustive search. Obviously, the two steps offer a trade-off and should be balanced in their running t...
full textFrobenius Numbers by Lattice Point Enumeration
The Frobenius number g(A) of a set A = (a1, a2, . . . , an) of positive integers is the largest integer not representable as a nonnegative linear combination of the ai. We interpret the Frobenius number in terms of a discrete tiling of the integer lattice of dimension n−1 and obtain a fast algorithm for computing it. The algorithm appears to run in average time that is softly quadratic and we p...
full textFast Lattice Point Enumeration with Minimal Overhead
Enumeration algorithms are the best currently known methods to solve lattice problems, both in theory (within the class of polynomial space algorithms), and in practice (where they are routinely used to evaluate the concrete security of lattice cryptography). However, there is an uncomfortable gap between our theoretical understanding and practical performance of lattice point enumeration algor...
full textDefect-suppressed atomic crystals in an optical lattice.
We present a coherent filtering scheme which dramatically reduces the site occupation number defects for atoms in an optical lattice by transferring a chosen number of atoms to a different internal state via adiabatic passage. With the addition of superlattices it is possible to engineer states with a specific number of atoms per site (atomic crystals), which are required for quantum computatio...
full textInvestigating the Properties of an Optical Waveguide Based on Photonic Crystal with Point Defect and Lattice Constant Perturbation
In this paper, a photonic crystal waveguide with point defects and lattice constant perturbations of +5%, -5% are being investigated. Firstly waveguide structures with constant and specific parameters are being studied and photonic band gap diagrams for TE/TM modes are depicted; then pulse propagation in the frequencies available in the band gap are shown. After that, effects of parameters like...
full textMy Resources
Journal title
volume 2 issue 2
pages -
publication date 1991-12-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023