10.9k citations
- University of MichiganUS1.5k papers
- Michigan State UniversityUS1.5k papers
- Centre National de la Recherche ScientifiqueFR1.4k papers
- Lawrence Berkeley National LaboratoryUS1.4k papers
- McGill UniversityCA1.4k papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR1.3k papers
- University of ManchesterGB1.3k papers
- University of LiverpoolGB1.3k papers
- University of TorontoCA1.3k papers
- University of OxfordGB1.3k papers
- TRIUMFCA1.3k papers
- Argonne National LaboratoryUS1.3k papers
48 papers · 1 filter
Arithmetic progressions consisting of unlike powers
N. Bruin, K. Gyory, L. Hajdu +1
In this paper we present some new results about unlike powers in arithmetic progression. We prove among other things that for given and there are only finitely…
Line Broadening and Decoherence of Electron Spins in Phosphorus-Doped Silicon Due to Environmental 29^Si Nuclear Spins
Eisuke Abe, Akira Fujimoto, Junichi Isoya +2
Phosphorus-doped silicon single crystals with 0.19 % <= f <= 99.2 %, where f is the concentration of 29^Si isotopes, are measured at 8 K using a pulsed electron spin resonance tech…
Perturbative Wilson loops from unquenched Monte Carlo simulations at weak couplings
Kit Yan Wong, Howard D. Trottier, R. M. Woloshyn
Perturbative expansions of several small Wilson loops are computed through next-to-next-to-leading order in unquenched lattice QCD, from Monte Carlo simulations at weak couplings.…
A quadratic lower bound for colourful simplicial depth
Tamon Stephen, Hugh Thomas
We show that any point in the convex hull of each of (d+1) sets of (d+1) points in R^d is contained in at least floor((d+2)^2/4) simplices with one vertex from each set.
Colorful subgraphs in Kneser-like graphs
Gábor Simonyi, Gábor Tardos
Combining Ky Fan's theorem with ideas of Greene and Matousek we prove a generalization of Dol'nikov's theorem. Using another variant of the Borsuk-Ulam theorem due to Bacon and Tuc…
The Colourful Feasibility Problem
Antoine Deza, Sui Huang, Tamon Stephen +1
We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by Barany and Onn with new methods. We perform benchmarking o…