Publication
Locality of the anomalous Hall conductivity
Abstract
The geometrical intrinsic contribution to the anomalous Hall conductivity (AHC) of a metal is commonly expressed as a reciprocal-space integral: as such, it only addresses unbounded and macroscopically homogeneous samples. Here we show that the geometrical AHC has an equivalent expression as a local property. We define a "geometrical marker" which actually probes the AHC in inhomogeneous systems (e.g., heterojunctions), as well as in bounded samples. The marker may even include extrinsic contributions of geometrical nature.
Official source
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.
Related concepts (20)
Geometry
Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest branches of mathematics. A mathematician who works in the field of geometry is called a geometer. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point, line, plane, distance, angle, surface, and curve, as fundamental concepts.
Random-access machine
In computer science, random-access machine (RAM) is an abstract machine in the general class of register machines. The RAM is very similar to the counter machine but with the added capability of 'indirect addressing' of its registers. Like the counter machine, The RAM has its instructions in the finite-state portion of the machine (the so-called Harvard architecture). The RAM's equivalent of the universal Turing machine with its program in the registers as well as its data is called the random-access stored-program machine or RASP.
Register machine
In mathematical logic and theoretical computer science, a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All the models are Turing equivalent. The register machine gets its name from its use of one or more "registers". In contrast to the tape and head used by a Turing machine, the model uses multiple, uniquely addressed registers, each of which holds a single positive integer.
Related publications (11)
Zippy LL(1) Parsing with Derivatives
Viktor Kuncak, Jad Hamza, Romain Edelmann
In this paper, we present an efficient, functional, and formally verified parsing algorithm for LL(1) context-free expressions based on the concept of derivatives of formal languages. Parsing with derivatives is an elegant parsing technique, which, in the ...
ASSOC COMPUTING MACHINERY2020Lightning Location Systems and Interstroke Intervals: Effects of Imperfect Detection Efficiency
Marcos Rubinstein, Mohammad Azadifar, Mirjana Stojilovic
Lightning location systems (LLSs) are often used to obtain parameters of lightning flashes. However, the imperfect detection efficiency (DE) of these systems affects the accuracy of the results. In this paper, we focus on the effects of the imperfect DE on ...
Ieee2016From wrinkling to global buckling of a ring on a curved substrate
Pedro Miguel Nunes Pereira de Almeida Reis
We present a combined analytical approach and numerical study on the stability of a ring bound to an annular elastic substrate, which contains a circular cavity. The system is loaded by depressurizing the inner cavity. The ring is modeled as an Euler-Berno ...
Elsevier2016