Publication

Measurement of the branching fractions of χcJ → π+π−π0π0 via ψ(3686) → γχcJ

2026

Abstract

Using (2712.4 ± 14.3) × 106 ψ(3686) events collected with the BESIII detector operating at BEPCII, the branching fractions of χcJ → π+π−π0π0 (J = 0, 1, 2) are measured via the radiative transition ψ(3686) → γχcJ. The results are ℬ(χc0 → π+π−π0π0) = (3.10 ± 0.01 ± 0.14) × 10−2, ℬ(χc1 → π+π−π0π0) = (1.16 ± 0.01 ± 0.05) × 10−2, and B(χc2 → π+π−π0π0) = (1.92 ± 0.01 ± 0.08) × 10−2, where the first uncertainties are statistical and the second systematic. The dominant intermediate states are found to be χcJ → ρ+ρ−. These results improve upon previous measurements with significantly enhanced precision.

Official source

https://infoscience.epfl.ch/entities/publication/3b006937-3f3f-4138-99f3-d274fbf3db7f

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2026

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/3b006937-3f3f-4138-99f3-d274fbf3db7f

About this result

Related concepts (8)

Chebyshev function

In mathematics, the Chebyshev function is either a scalarising function (Tchebycheff function) or one of two related functions. The first Chebyshev function θ (x) or θ (x) is given by where denotes the natural logarithm, with the sum extending over all prime numbers p that are less than or equal to x. The second Chebyshev function ψ (x) is defined similarly, with the sum extending over all prime powers not exceeding x where Λ is the von Mangoldt function.

Prime number theorem

In mathematics, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs. The theorem was proved independently by Jacques Hadamard and Charles Jean de la Vallée Poussin in 1896 using ideas introduced by Bernhard Riemann (in particular, the Riemann zeta function).

Prime-counting function

In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number x. It is denoted by pi(x) (unrelated to the number pi). Prime number theorem Of great interest in number theory is the growth rate of the prime-counting function. It was conjectured in the end of the 18th century by Gauss and by Legendre to be approximately where log is the natural logarithm, in the sense that This statement is the prime number theorem.