1,202 research outputs found

    Tau lifetime and decays

    Full text link
    Recent results of a high-statistics study of tau lepton properties and decays at B factories are reviewed. We discuss measurements of tau lifetime, branching fractions, and spectral functions for several hadronic tau decay modes with KS0K^0_S. Results of a search for lepton flavor violating tau decays as well as CP symmetry violation are briefly discussed.Comment: Presented at the 2014 Flavor Physics and CP Violation (FPCP-2014), Marseille, France, May 26-30 2014, 19 pages, 8 figures, 3 table

    Recognition Methods of Geometrical Images of Automata Models of Systems in Control Problem

    Get PDF
    The laws of functioning of discrete deterministic dynamical systems are investigated, presented in the form of automata models defined by geometric images. Due to the use of the apparatus of geometric images of automata, developed by V.A. Tverdokhlebov, the analysis of automata models is carried out on the basis of the analysis of mathematical structures represented by geometric curves and numerical sequences. The purpose of present research is to further develop the mathematical apparatus of geometric images of automaton models of systems, including the development of new methods for recognizing automata by their geometric images, given both geometric curves and numerical sequences

    MaxCut Above Guarantee

    Get PDF
    In this paper, we study the computational complexity of the Maximum Cut problem parameterized above guarantee. Our main result provides a linear kernel for the Maximum Cut problem in connected graphs parameterized above the spanning tree. This kernel significantly improves the previous O(k?) kernel given by Madathil, Saurabh, and Zehavi [ToCS 2020]. We also provide subexponential running time algorithms for this problem in special classes of graphs: chordal, split, and co-bipartite. We complete the picture by lower bounds under the assumption of the ETH. Moreover, we initiate a study of the Maximum Cut problem above 2/3|E| lower bound in tripartite graphs

    Measurement of the branching fraction B(tau- --> K0 pi- nu) using the BaBar detector

    Full text link
    A preliminary measurement of the branching fraction B(tau- --> K0 pi- nu) is made using 384.6 fb-1 of e+e- collision data provided by the PEP-II collider, operating primarily at sqrt(s)=10.58 GeV, and recorded using the BaBar detector. From this we measure: B(tau- --> K0 pi- nu) = (0.840 +/- 0.004 (stat) +/- 0.023 (syst)) %. This result is the most precise measurement to date and is consistent with the world average.Comment: 17 pages, 3 figures, submitted to ICHEP 200

    Constraining the Kpi vector form factor by tau---> K pi nu_tau and K_l3 decay data

    Full text link
    A subtracted dispersive representation of the KπK\pi vector form factor, F+KπF_+^{K\pi}, is used to fit the Belle spectrum of \tauKpi decays incorporating constraints from results on Kl3K_{l3} decays. Through the use of three subtractions, the slope and curvature of F+KπF_+^{K\pi} are obtained directly from the data yielding λ+′=(25.49±0.31)×10−3\lambda_+'=(25.49 \pm 0.31) \times 10^{-3} and λ+"=(12.22±0.14)×10−4\lambda_+"= (12.22 \pm 0.14) \times 10^{-4}. The phase-space integrals relevant for Kl3K_{l3} analyses are calculated. Additionally, from the pole position on the second Riemann sheet the mass and width of the K∗(892)±K^*(892)^\pm are found to be mK∗(892)±=892.0±0.5m_{K^*(892)^\pm}= 892.0\pm 0.5 MeV and ΓK∗(892)±=46.5±1.1\Gamma_{K^*(892)^\pm}= 46.5 \pm 1.1 MeV. Finally, we study the PP-wave isospin-1/2 KπK\pi phase-shift and its threshold parameters.Comment: Talk presented at 15th International QCD Conference, Montpellier, France. Submitted to Nuc. Phys. (Proc. Suppl.), 4 pages, 1 figur

    Organization and Holding Sanitary and Epidemiological Measures in Stalingrad and Separate Districts of the Stalingrad Region (1942–1943)

    Get PDF
    Introduction. The victory at Stalingrad was secured not just by actions on the fronts. An important role was played by social activities, including health care for the population and the army and the fight against epidemics. Despite this, not all areas of sanitary and anti-epidemic work carried out in Stalingrad have been studied comprehensively. Methods and materials. The source base for the study was archival materials stored in the central and Volgograd regional archives. Among them are the documents of the central and regional state authorities on the sanitary condition in Stalingrad and the epidemic measures being carried out in it. In the work on the article, comparative-historical and statistical methods, the method of source study, structural-diachronic and system analysis were used. Analysis. In the frontline and liberated from occupation areas of the Stalingrad region, an extremely unfavorable sanitary condition was noted. This inevitably led to the spread of infectious diseases – cholera, tularemia, typhoid and typhus, malaria – and caused the need for urgent anti-epidemic measures. Sanitary clearing of the city, cleaning and burial of corpses, restoration of water supply, expansion of the network of medical institutions, provision of baths and deodorant chambers, mass sanitation and immunization of the population, organization of soap production in the region were considered as priorities. The work of emergency anti-epidemic commissions was restored. Results. The anti-epidemic measures implemented in Stalingrad during the war made it possible to prevent the spread of acute infectious epidemic diseases

    MaxCut Above Guarantee

    Get PDF
    In this paper, we study the computational complexity of the Maximum Cut problem parameterized above guarantee. Our main result provides a linear kernel for the Maximum Cut problem in connected graphs parameterized above the spanning tree. This kernel significantly improves the previous O(k5) kernel given by Madathil, Saurabh, and Zehavi [ToCS 2020]. We also provide subexponential running time algorithms for this problem in special classes of graphs: chordal, split, and co-bipartite. We complete the picture by lower bounds under the assumption of the ETH. Moreover, we initiate a study of the Maximum Cut problem above 23 |E| lower bound in tripartite graphs
    • …
    corecore