Computation across the curriculum: What skills are needed?

Computation, the use of a computer to solve, simulate, or visualize a physical problem, has revolutionized how physics research is done. Computation is used widely to model systems, to simulate experiments, and to analyze data. Yet, in most undergraduate programs, students have little formal opportunity to engage with computation and, thus, are left to their own to develop their computational expertise. As part of a larger project to study how computation is incorporated in some undergraduate physics programs (and how it might be incorporated further), we convened a mini-conference and conducted a series of interviews with industry professionals, academic faculty, and employed bachelor's graduates who make use of computation in their everyday work. We present preliminary results that speak to how participants developed the requisite skills to do professional computational work and what skills they perceive are necessary to conduct such work.Comment: 4 pages; accepted to 2015 Physics Education Research Conference Proceeding

Neutrino emission, Equation of State and the role of strong gravity

Neutron-star mergers are interesting for several reasons: they are proposed as the progenitors of short gamma-ray bursts, they have been speculated to be a site for the synthesis of heavy elements, and they emit gravitational waves possibly detectable at terrestrial facilities. The understanding of the merger process, from the pre-merger stage to the final compact object-accreting system involves detailed knowledge of numerical relativity and nuclear physics. In particular, key ingredients for the evolution of the merger are neutrino physics and the matter equation of state. We present some aspects of neutrino emission from binary neutron star mergers showing the impact that the equation of state has on neutrinos and discuss some spectral quantities relevant to their detection such as energies and luminosities far from the source.Comment: 7 pages , 3 figures. XI LASNPA conference proceeding

On a function introduced by Erd\"{o}s and Nicolas

Erd\"os and Nicolas [erdos1976methodes] introduced an arithmetical function $F(n)$ related to divisors of $n$ in short intervals $\left] \frac{t}{2}, t\right]$. The aim of this note is to prove that $F(n)$ is the largest coefficient of polynomial $P_n(q)$ introduced by Kassel and Reutenauer [kassel2015counting]. We deduce that $P_n(q)$ has a coefficient larger than $1$ if and only if $2n$ is the perimeter of a Pythagorean triangle. We improve a result due to Vatne [vatne2017sequence] concerning the coefficients of $P_n(q)$