Automorphisms of real Lie algebras of dimension five or less

The Lie algebra version of the Krull-Schmidt Theorem is formulated and proved. This leads to a method for constructing the automorphisms of a direct sum of Lie algebras from the automorphisms of its indecomposable components. For finite-dimensional Lie algebras, there is a well-known algorithm for finding such components, so the theorem considerably simplifies the problem of classifying the automorphism groups. We illustrate this by classifying the automorphisms of all indecomposable real Lie algebras of dimension five or less. Our results are presented very concisely, in tabular form

Is Accurate Understanding of Global Warming Necessary to Promote Willingness to Sacrifice?

Although not definitive, the authors\u27 study suggests potential benefits from having a general public better informed about global climate change. They find, e.g., that accurate information appears to increase willingness to accept personal sacrifice

Heuristic Spike Sorting Tuner (HSST), a framework to determine optimal parameter selection for a generic spike sorting algorithm

Extracellular microelectrodes frequently record neural activity from more than one neuron in the vicinity of the electrode. The process of labeling each recorded spike waveform with the identity of its source neuron is called spike sorting and is often approached from an abstracted statistical perspective. However, these approaches do not consider neurophysiological realities and may ignore important features that could improve the accuracy of these methods. Further, standard algorithms typically require selection of at least one free parameter, which can have significant effects on the quality of the output. We describe a Heuristic Spike Sorting Tuner (HSST) that determines the optimal choice of the free parameters for a given spike sorting algorithm based on the neurophysiological qualification of unit isolation and signal discrimination. A set of heuristic metrics are used to score the output of a spike sorting algorithm over a range of free parameters resulting in optimal sorting quality. We demonstrate that these metrics can be used to tune parameters in several spike sorting algorithms. The HSST algorithm shows robustness to variations in signal to noise ratio, number and relative size of units per channel. Moreover, the HSST algorithm is computationally efficient, operates unsupervised, and is parallelizable for batch processing

Exact factorization of correlation functions in 2-D critical percolation

By use of conformal field theory, we discover several exact factorizations of higher-order density correlation functions in critical two-dimensional percolation. Our formulas are valid in the upper half-plane, or any conformally equivalent region. We find excellent agreement of our results with high-precision computer simulations. There are indications that our formulas hold more generally.Comment: 6 pages, 3 figures. Oral presentation given at STATPHYS 23. V2: Minor additions and corrections, figures improve