476 citations
- New York UniversityUS42 papers
- Courant Institute of Mathematical SciencesUS13 papers
- Centre National de la Recherche ScientifiqueFR12 papers
- Fraunhofer Institute for Integrated CircuitsDE12 papers
- University of KonstanzDE12 papers
- University of StuttgartDE12 papers
- Technische Universität BerlinDE10 papers
- Universität HamburgDE10 papers
- Humboldt-Universität zu BerlinDE9 papers
- Occidental CollegeUS9 papers
- Chemnitz University of TechnologyDE8 papers
- Freie Universität BerlinDE8 papers
22 papers · 1 filter
Thoughts on Barnette's Conjecture
Helmut Alt, Michael S. Payne, Jens M. Schmidt +1
We prove a new sufficient condition for a cubic 3-connected planar graph to be Hamiltonian. This condition is most easily described as a property of the dual graph. Let be a pl…
Resolving the fine-scale structure in turbulent Rayleigh-Benard convection
Janet D. Scheel, Mohammad S. Emran, Joerg Schumacher
We present high-resolution direct numerical simulation studies of turbulent Rayleigh-Benard convection in a closed cylindrical cell with an aspect ratio of one. The focus of our an…
On Probability Estimation via Relative Frequencies and Discount
Christopher Mattern
Probability estimation is an elementary building block of every statistical data compression algorithm. In practice probability estimation is often based on relative letter frequen…
Screening of electron-phonon coupling in graphene on Ir(111)
M. Endlich, A. Molina-Sánchez, L. Wirtz +1
The phonon dispersion of graphene on Ir(111) has been determined by means of angle-resolved inelastic electron scattering and density functional calculations. Kohn anomalies of the…
On the theory of Double Quantum NMR in polymer systems: the second cumulant approximation for many spin I=1/2 systems
N. Fatkullin, C. Mattea, S. Stapf
General analytical expressions for Double Quantum Nuclear Magnetic Resonance (NMR) kinetic curves of many-spin I=1/2 systems are derived with an accuracy of the second cumulant app…
Total Thue colourings of graphs
Jens Schreyer, Erika Škrabuľáková
A total colouring of a graph is a colouring of its vertices and edges such that no two adjacent vertices or edges have the same colour and moreover, no edge coloured has its en…