291 citations
- Budker Institute of Nuclear PhysicsRU24 papers
- Sobolev Institute of MathematicsRU9 papers
- Istituto Nazionale di Fisica NucleareIT7 papers
- Istituto Nazionale di Fisica Nucleare, Gruppo Collegato di Cosenza6 papers
- University of CalabriaIT6 papers
- Chinese Academy of SciencesCN4 papers
- Cracow University of TechnologyPL4 papers
- École Polytechnique Fédérale de LausanneCH4 papers
- Hanyang UniversityKR4 papers
- High Energy Accelerator Research OrganizationJP4 papers
- Hiroshima Institute of TechnologyJP4 papers
- Institute for High Energy PhysicsES4 papers
21 papers · 1 filter
Electric dipole moments, from e to tau
A. G. Grozin, I. B. Khriplovich, A. S. Rudenko
We derive an upper limit on the electric dipole moment (EDM) of the tau-lepton, which follows from the precision measurements of the electron EDM.
Convergence peculiarities of lattice summation upon multiple charge spreading generalizing the Bertaut approach
Eugene V. Kholopov
Within investigating the multiple charge spreading generalizing the Bertaut approach, a set of confined spreading functions with a polynomial behaviour, but defined so as to enhanc…
Multiple charge spreading as a generalization of the Bertaut approach to lattice summation of Coulomb series in crystals
Eugene V Kholopov
The Bertaut approach associated with charge spreading so as to enhance the rate of convergence of Coulomb series in crystals is extended to the case of an arbitrary multiple spread…
Light Scalars in Field Theory
N. N. Achasov
Outline: 1. Introduction, 2. Confinement, chiral dynamics and light scalar mesons, 3. Chiral shielding of σ(600), chiral constraints, σ(600), f_0(980) and their mixing in ππ\toππ,…
Study of the process e+e-\to μ+μ- in the energy region \sqrt{s}=980, 1040 -- 1380 MeV
M. N. Achasov, V. M. Aulchenko, K. I. Beloborodov +19
The cross section of the process e+e-\toμ+μ- was measured in the SND experiment at the VEPP-2M e+e- collider in the energy region \sqrt{s}=980, 1040 -- 1380 MeV. The event numbers…
Reconstructing Extended Perfect Binary One-Error-Correcting Codes from Their Minimum Distance Graphs
Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen +1
The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A cons…