Patterns theory and geodesic automatic structure for a class of groups

We introduce a theory of "patterns" in order to study geodesics in a certain class of group presentations. Using patterns we show that there does not exist a geodesic automatic structure for certain group presentations, and that certain group presentations are almost convex.Comment: Appeared in 2003. I am putting all my past papers on arxi

On trivial words in finitely presented groups

We propose a numerical method for studying the cogrowth of finitely presented groups. To validate our numerical results we compare them against the corresponding data from groups whose cogrowth series are known exactly. Further, we add to the set of such groups by finding the cogrowth series for Baumslag-Solitar groups $\mathrm{BS}(N,N) =$ and prove that their cogrowth rates are algebraic numbers.Comment: This article has been rewritten as two separate papers, with improved exposition. The new papers are arXiv:1309.4184 and arXiv:1312.572

On groups and counter automata

We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of rank n; this result, which answers a question of Gilman, is in a very precise sense an abelian analogue of the Muller-Schupp theorem. More generally, if G is a virtually abelian group then every group with word problem recognised by a G-automaton is virtually abelian with growth class bounded above by the growth class of G. We consider also other types of counter automata.Comment: 18 page

Phase Diagram and Commensurate-Incommensurate Transitions in the Phase Field Crystal Model with an External Pinning Potential

We study the phase diagram and the commensurate-incommensurate transitions in a phase field model of a two-dimensional crystal lattice in the presence of an external pinning potential. The model allows for both elastic and plastic deformations and provides a continuum description of lattice systems, such as for adsorbed atomic layers or two-dimensional vortex lattices. Analytically, a mode expansion analysis is used to determine the ground states and the commensurate-incommensurate transitions in the model as a function of the strength of the pinning potential and the lattice mismatch parameter. Numerical minimization of the corresponding free energy shows good agreement with the analytical predictions and provides details on the topological defects in the transition region. We find that for small mismatch the transition is of first-order, and it remains so for the largest values of mismatch studied here. Our results are consistent with results of simulations for atomistic models of adsorbed overlayers

Grain boundary motion in layered phases

We study the motion of a grain boundary that separates two sets of mutually perpendicular rolls in Rayleigh-B\'enard convection above onset. The problem is treated either analytically from the corresponding amplitude equations, or numerically by solving the Swift-Hohenberg equation. We find that if the rolls are curved by a slow transversal modulation, a net translation of the boundary follows. We show analytically that although this motion is a nonlinear effect, it occurs in a time scale much shorter than that of the linear relaxation of the curved rolls. The total distance traveled by the boundary scales as $\epsilon^{-1/2}$, where $\epsilon$ is the reduced Rayleigh number. We obtain analytical expressions for the relaxation rate of the modulation and for the time dependent traveling velocity of the boundary, and especially their dependence on wavenumber. The results agree well with direct numerical solutions of the Swift-Hohenberg equation. We finally discuss the implications of our results on the coarsening rate of an ensemble of differently oriented domains in which grain boundary motion through curved rolls is the dominant coarsening mechanism.Comment: 16 pages, 5 figure

DDFT calibration and investigation of an anisotropic phase-field crystal model

The anisotropic phase-field crystal model recently proposed and used by Prieler et al. [J. Phys.: Condens. Matter 21, 464110 (2009)] is derived from microscopic density functional theory for anisotropic particles with fixed orientation. Further its morphology diagram is explored. In particular we investigated the influence of anisotropy and undercooling on the process of nucleation and microstructure formation from atomic to the microscale. To that end numerical simulations were performed varying those dimensionless parameters which represent anisotropy and undercooling in our anisotropic phase-field crystal (APFC) model. The results from these numerical simulations are summarized in terms of a morphology diagram of the stable state phase. These stable phases are also investigated with respect to their kinetics and characteristic morphological features.Comment: It contain 13 pages and total of 7 figure

Two Approaches to Dislocation Nucleation in the Supported Heteroepitaxial Equilibrium Islanding Phenomenon

We study the dislocation formation in 2D nanoscopic islands with two methods, the Molecular Static method and the Phase Field Crystal method. It is found that both methods indicate the same qualitative stages of the nucleation process. The dislocations nucleate at the film-substrate contact point and the energy decreases monotonously when the dislocations are farther away from the island-wetting film contact points than the distance of the highest energy barrier.Comment: 4 page

Silent Transitions in Automata with Storage

We consider the computational power of silent transitions in one-way automata with storage. Specifically, we ask which storage mechanisms admit a transformation of a given automaton into one that accepts the same language and reads at least one input symbol in each step. We study this question using the model of valence automata. Here, a finite automaton is equipped with a storage mechanism that is given by a monoid. This work presents generalizations of known results on silent transitions. For two classes of monoids, it provides characterizations of those monoids that allow the removal of \lambda-transitions. Both classes are defined by graph products of copies of the bicyclic monoid and the group of integers. The first class contains pushdown storages as well as the blind counters while the second class contains the blind and the partially blind counters.Comment: 32 pages, submitte