SearcharxivSearch

arXiv subjects

Tomasz Tarkowski

Publications and source records attributed to Tomasz Tarkowski.

3 recordsLinked to original sources

Boron nanotube structure explored by evolutionary computations

In this work, we explore the structure of single-wall boron nanotubes with large diameters (about 21~Å) and a broad range of surface densities of atoms. The computations are done using an evolutionary approach combined with a nearest neighbors model Hamiltonian. For the most stable nanotubes, the number of 5-coordinated boron atoms is about $63\%$ of the total number of atoms forming the nanotubes, whereas about $11\%$ are boron vacancies. For hole densities smaller than about 0.22, the boron nanotubes exhibit randomly distributed hexagonal holes and are more stable than a flat stripe structure and a quasi-flat B$_{36}$ cluster. For larger hole densities ($> 0.22$) the boron nanotubes resemble porous tubular structures with hole sizes that depend on the surface densities of boron atoms.

cond-mat.mes-hall

The structure of thin boron nanowires predicted using evolutionary computations

This work describes the implementation of a genetic algorithm-based strategy combined with first-principles computations for identifying the structure of the most stable boron 1D structures. We focus our attention on the structure of ultrathin 1D boron structures given the lack of previous experimental and theoretical work on this topic. Our methodology yields reasonable structural candidates for further optimizations at the DFT level with tighter convergence criteria. The simulations involved 1D structures with up to 8 atoms per unit cell. We have identified four main groups of structures: flat nanowires (monatomic-height stripes) with triangular or triangular and "square" motifs, stripes with larger holes, nanowires with an open tubular shape, and regular nanowires. The diameter-dependent structural changes are discussed.

cond-mat.mtrl-sci

Genetic algorithm formulation and tuning with use of test functions

This work discusses single-objective constrained genetic algorithm with floating-point, integer, binary and permutation representation. Floating-point genetic algorithm tuning with use of test functions is done and leads to a parameterization with comparatively outstanding performance.

cs.NE