Collisional Triggering of Fast Flavor Conversions of Supernova Neutrinos

Francesco Capozzi1, Basudeb Dasgupta2, Alessandro Mirizzi3,4

  • 1Max Planck Institut für Physik (Werner-Heisenberg-Institut), Föhringer Ring 6, 80805 München, Germany.

Related Concept Videos

Gene Conversion02:08

Gene Conversion

Other than maintaining genome stability via DNA repair, homologous recombination plays an important role in diversifying the genome. In fact, the recombination of sequences forms the molecular basis of genomic evolution. Random and non-random permutations of genomic sequences create a library of new amalgamated sequences. These newly formed genomes can determine the fitness and survival of cells. In bacteria, homologous and non-homologous types of recombination lead to the evolution of new...
10.6K
Gene Conversion02:08

Gene Conversion

3.0K
Conversion of Units01:36

Conversion of Units

Sometimes, there is a need to convert from one unit to another one. For instance, reading a cookbook in which quantities are expressed in units of liters or ounces may require conversion of quantities to cups. Or, when looking up directions on how to get to a location, we may be interested to know how many miles we are going to walk. In this case, we would have to convert units of feet or meters to miles.
The first step in the unit conversion is to list the given units and the units required...
35.6K
Conversion of Alcohols to Alkyl Halides02:48

Conversion of Alcohols to Alkyl Halides

This lesson delves into the conversion of alcohols to corresponding alkyl halides and the mechanism of action for different reagents. Typically, the hydroxyl group is first protonated to convert it to a stable leaving group. Consequently, based on the starting alcohol, the mechanism undergoes either of the nucleophilic substitution routes, SN1 or SN2. Tertiary alkyl halides are made using the two-step SN1 mechanism that occurs via a carbocation intermediate, which is stabilized by...
8.3K
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
931
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
8.1K