Publication

Search for the Lepton Number Violation Decay Ω → Π+ Π+e- E-+c. C.*

2025

Abstract

Lepton number violation decay omega -> pi(+) pi(+)e(-) e(-)+c. c.* is searched for via J/psi -> omega eta using a data sample of (1. 0087 +/- 0.0044) x 10(10) J/psi events collected via the BESIII detector at the BEPCII collider. No significant signal is observed, and the upper limit on the branching fraction of omega -> pi(+) pi(+)e(-) e(-)+c. c. at the 90% confidence level is determined for the first time to be 2.8 x 10(-6). .

Official source

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.

2025

Abstract

Official source

Related concepts (26)

Search algorithm

In computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within particular data structure, or calculated in the search space of a problem domain, with either discrete or continuous values. Although search engines use search algorithms, they belong to the study of information retrieval, not algorithmics. The appropriate search algorithm to use often depends on the data structure being searched, and may also include prior knowledge about the data.

Search engine

A search engine is a software system that finds web pages that match a web search. They search the World Wide Web in a systematic way for particular information specified in a textual web search query. The search results are generally presented in a line of results, often referred to as search engine results pages (SERPs). The information may be a mix of hyperlinks to web pages, images, videos, infographics, articles, and other types of files. Some search engines also mine data available in databases or open directories.

Binary search algorithm

In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the remaining half, again taking the middle element to compare to the target value, and repeating this until the target value is found.

Related publications (32)

Search for the Lepton Number Violation Decay Ω → Π<sup>+</sup> Π<sup>+</sup>e<sup>-</sup> E<sup>-</sup>+c. C.*

Chat with Graph Search

Measurements of branching fractions of $ {\Lambda}_c^{+}\to {\Sigma}^0{K}_S^0{\pi}^{+} $ and $ {\Lambda}_c^{+}\to {\Sigma}^0{K}_S^0{K}^{+} $

TDCOSMO: XXIII. Measurement of the Hubble constant from the doubly lensed quasar HE 1104-1805

Differential decay rate of B+ → J/ψK+ with the LHCb Upgrade I experiment