Do you want to publish a course? Click here

Similarity versus Coincidence Rotations of Lattices

123   0   0.0 ( 0 )
 Added by Svenja Glied
 Publication date 2008
  fields
and research's language is English




Ask ChatGPT about the research

The groups of similarity and coincidence rotations of an arbitrary lattice L in d-dimensional Euclidean space are considered. It is shown that the group of similarity rotations contains the coincidence rotations as a normal subgroup. Furthermore, the structure of the corresponding factor group is examined. If the dimension d is a prime number, this factor group is an elementary Abelian d-group. Moreover, if L is a rational lattice, the factor group is trivial (d odd) or an elementary Abelian 2-group (d even).



rate research

Read More

74 - Peter Zeiner 2006
We consider the symmetries of coincidence site lattices of 3-dimensional cubic lattices. This includes the discussion of the symmetry groups and the Bravais classes of the CSLs. We derive various criteria and necessary conditions for symmetry operations of CSLs. They are used to obtain a complete list of the symmetry groups and the Bravais classes of those CSLs that are generated by a rotation through the angle $pi$.
257 - Peter Zeiner 2012
Coincidence Site Lattices (CSLs) are a well established tool in the theory of grain boundaries. For several lattices up to dimension $d=4$, the CSLs are known explicitly as well as their indices and multiplicity functions. Many of them share a particular property: their multiplicity functions are multiplicative. We show how multiplicativity is connected to certain decompositions of CSLs and the corresponding coincidence rotations and present some criteria for multiplicativity. In general, however, multiplicativity is violated, while supermultiplicativity still holds.
298 - A. Barreira , P.P. Avelino 2011
In this paper we investigate possible solutions to the coincidence problem in flat phantom dark energy models with a constant dark energy equation of state and quintessence models with a linear scalar field potential. These models are representative of a broader class of cosmological scenarios in which the universe has a finite lifetime. We show that, in the absence of anthropic constraints, including a prior probability for the models inversely proportional to the total lifetime of the universe excludes models very close to the $Lambda {rm CDM}$ model. This relates a cosmological solution to the coincidence problem with a dynamical dark energy component having an equation of state parameter not too close to -1 at the present time. We further show, that anthropic constraints, if they are sufficiently stringent, may solve the coincidence problem without the need for dynamical dark energy.
Popularity is attractive -- this is the formula underlying preferential attachment, a popular explanation for the emergence of scaling in growing networks. If new connections are made preferentially to more popular nodes, then the resulting distribution of the number of connections that nodes have follows power laws observed in many real networks. Preferential attachment has been directly validated for some real networks, including the Internet. Preferential attachment can also be a consequence of different underlying processes based on node fitness, ranking, optimization, random walks, or duplication. Here we show that popularity is just one dimension of attractiveness. Another dimension is similarity. We develop a framework where new connections, instead of preferring popular nodes, optimize certain trade-offs between popularity and similarity. The framework admits a geometric interpretation, in which popularity preference emerges from local optimization. As opposed to preferential attachment, the optimization framework accurately describes large-scale evolution of technological (Internet), social (web of trust), and biological (E.coli metabolic) networks, predicting the probability of new links in them with a remarkable precision. The developed framework can thus be used for predicting new links in evolving networks, and provides a different perspective on preferential attachment as an emergent phenomenon.
194 - Thomas Haettel 2014
We show that symmetric spaces and thick affine buildings which are not of spherical type $A_1^r$ have no coarse median in the sense of Bowditch. As a consequence, they are not quasi-isometric to a CAT(0) cube complex, answering a question of Haglund. Another consequence is that any lattice in a simple higher rank group over a local field is not coarse median.
comments
Fetching comments Fetching comments
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا