ATLAS detector 2effective field theory 2stress-energy tensor 2atomic mixtures 1black holes 1bose-einstein condensation 1boundary conditions 1bound states 1Cherenkov Telescope Array 1conical spacetime 1critical temperature shift 1cross-section measurement 1
From the 7 of 220 papers with an AI index.
47 citations
- Université Paris-SaclayFR63 papers
- The University of TokyoJP58 papers
- Université Paris CitéFR57 papers
- University of ChicagoUS57 papers
- Heidelberg UniversityDE56 papers
- Centre National de la Recherche ScientifiqueFR55 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di NapoliIT54 papers
- Lawrence Berkeley National LaboratoryUS53 papers
- University of the WitwatersrandZA53 papers
- FZU ‒ Institute of Physics of the Academy of Sciences of the Czech RepublicCZ52 papers
- Horia Hulubei National Institute for R and D in Physics and Nuclear EngineeringRO52 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di BolognaIT52 papers
Showing math.COShow all
3 papers · 1 filter
math.CO2026
The complexity of minimum-density locating-dominating set in infinite periodic graphs
Arthur C. Gomes, Yoshiko Wakabayashi
A dominating set of a graph is a locating-dominating set (LDS) if, for each pair of distinct vertices not in~, their neighbourhoods in are distinct. Finding a minimu…
math.CO2026
Optimal and quasi-optimal locating-dominating densities in the infinite hexagonal grid with a finite number of rows
Arthur C. Gomes, Yoshiko Wakabayashi
A set of vertices of a graph is locating-dominating if is dominating and, for each pair of distinct vertices not in , their neighborhoods in are distinct. We pre…
math.CO2026★ 4 cited
Finding any given 2-factor in sparse pseudorandom graphs efficiently
Jie Han, Yoshiharu Kohayakawa, Patrick Morris +1
Given an -vertex pseudorandom graph and an -vertex graph with maximum degree at most two, we wish to find a copy of in , i.e.\ an embedding $Ï\colon V(H)\to V…