424 citations
- Tel Aviv UniversityIL60 papers
- Universidad Andrés BelloCL26 papers
- European Southern ObservatoryCL16 papers
- Pontificia Universidad Católica de ChileCL14 papers
- University of ConcepciónCL14 papers
- Centre National de la Recherche ScientifiqueFR13 papers
- National Institute for AstrophysicsIT11 papers
- Max Planck Institute for AstrophysicsDE8 papers
- Texas A&M UniversityUS8 papers
- University of PotsdamDE8 papers
- Carnegie Institution for ScienceUS7 papers
- Heidelberg UniversityDE7 papers
12 papers · 1 filter
The Gaia-ESO Survey: Separating disk chemical substructures with cluster models
A. Rojas-Arriagada, A. Recio-Blanco, P. de Laverny +24
(Abridged) Recent spectroscopic surveys have begun to explore the Galactic disk system outside the solar neighborhood on the basis of large data samples. In this way, they provide…
Abundance ratios of red giants in low mass ultra faint dwarf spheroidal galaxies
P. François, L. Monaco, P. Bonifacio +3
Low mass dwarf spheroidal galaxies are key objects for our understanding of the chemical evolution of the pristine Universe and the Local Group of galaxies. Abundance ratios in sta…
Interstellar Extinction Curve Variations Toward the Inner Milky Way: A Challenge to Observational Cosmology
David M. Nataf, Oscar A. Gonzalez, Luca Casagrande +18
We investigate interstellar extinction curve variations toward 4 deg of the inner Milky Way in photometry from the OGLE-III and surveys, with supportin…
On trees with the same restricted U-polynomial and the Prouhet-Tarry-Escott problem
José Aliste-Prieto, Anna de Mier, José Zamora
This paper focuses on the well-known problem due to Stanley of whether two non-isomorphic trees can have the same -polynomial (or, equivalently, the same chromatic symmetric fun…
Waiter-Client and Client-Waiter Hamiltonicity games on random graphs
Dan Hefetz, Michael Krivelevich, Wei En Tan
We study two types of two player, perfect information games with no chance moves, played on the edge set of the binomial random graph . In each round of the $(1…
Packing, Counting and Covering Hamilton cycles in random directed graphs
Asaf Ferber, Gal Kronenberg, Eoin Long
A Hamilton cycle in a digraph is a cycle that passes through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in dire…