Publication

Analysing Friedel averages and differences

Philip Pattison
2012
Journal Articles

Abstract

Various practical applications of the average (A) and difference (D) of Friedel opposites are described. Techniques based on the resonant-scattering contribution to Friedel differences are applied to see whether a crystal is centrosymmetric or not, and to determine the point group of the crystal. For the validation of a structural study, plots of Aobs against Amodel, and Dobs against Dmodel are used extensively. Moreover, it is useful to display both plots on the same graph. Intensity measurements on a crystal of NaClO3 were made at three different speeds, with two different radiations and two different diffractometers, and treated with two different software packages and four different absorption corrections. The evaluation of these numerous data sets reveals underlying deficiencies. For comparison, plots of Aobs against Amodel, and Dobs against Dmodel are presented for two centrosymmetric crystals.

Official source

https://infoscience.epfl.ch/entities/publication/7f3f2c84-1638-4ef9-893e-3851c3f4bab9

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Philip Pattison
2012
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/7f3f2c84-1638-4ef9-893e-3851c3f4bab9

About this result

Related concepts (32)

Point reflection

In geometry, a point reflection (also called a point inversion or central inversion) is an transformation of affine space in which every point is reflected across a specific fixed point. A point reflection is an involution: applying it twice is the identity transformation. It is equivalent to a homothetic transformation with scale factor −1. The point of inversion is also called homothetic center. An object that is invariant under a point reflection is said to possess point symmetry; if it is invariant under point reflection through its center, it is said to possess central symmetry or to be centrally symmetric.

Line graph

In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges of G. L(G) is constructed in the following way: for each edge in G, make a vertex in L(G); for every two edges in G that have a vertex in common, make an edge between their corresponding vertices in L(G). The name line graph comes from a paper by although both and used the construction before this.

Planar graph

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points.

Related publications (30)

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al

Lukas Fritz Felix Vogl

We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...

Elsevier2024

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Colin Peter Sandon

Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...

Ieee-Inst Electrical Electronics Engineers Inc2024

In Medio Stat Virtus: Combining Boolean and Pattern Matching

Giovanni De Micheli, Alessandro Tempia Calvino, Gianluca Radi

Technology mapping transforms a technology-independent representation into a technology-dependent one given a library of cells. This process is performed by means of local replacements that are extracted by matching sections of the subject graph to library ...

IEEE2024