signature=d4ef1108b57db313b341e58d3b792578,Lepton polarization asymmetries of H → γ τ+τ− decay in th...

摘要:

Recently, CMS and ATLAS collaborations at LHC announced a Higgs-like particle with mass near 125???GeV. To explore its intrinsic properties, different observables are needed to be measured precisely at the LHC for various decay channels of the Higgs. In this context, we calculate the final state lepton polarization asymmetries, namely, single lepton polarization asymmetries ($P_i$) and double lepton polarization asymmetries ($P_{ij}$) in the Standard Model (SM) for radiative semileptonic Higgs decay $Ho \\\\gamma au ^+au ^-$. In the phenomenological analysis of these lepton polarization asymmetries both tree- and loop-level diagrams are considered and it is found that these diagrams give important contributions in the evaluation of said asymmetries. Interestingly, it is found that in $P_{ij}$ the tree-level diagrams contribute separately, but, however, are missing in the calculations of $P_i$ and the lepton forward???backward asymmetries ($A_{FB}$). Similar to the other observables such as the decay rate and the lepton forward???backward asymmetries, the $au $ lepton polarization asymmetries would be interesting observables. The experimental study of these observables will provide a fertile ground to explore the intrinsic properties of the SM Higgs boson and its dynamics, as well as help us to extract the signatures of the possible new physics beyond the SM.

展开

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
### 回答1: \u6b63\u786e\u7684\u89c4\u5219\u5c06\u4e00\u4e2a\u6570\u5b57\u4e0ba\uff01+2\uff01+3\uff01+...\uff0b(n-1)\uff01+n\uff01\u7684\u9636\u52a0\u7ed3\u679c\uff0c\u5176\u4e2d\uff0cn\uff01\u8868\u793a\u5b9a\u4e49\u7684\u6570\u3002 \u8981\u8ba1\u7b97s=1!+2!+3!+...+n!\uff0c\u53ef\u4ee5\u4f7f\u7528\u5fae\u4fe1\u7b97\u6cd5\u6765\u89e3\u51b3\u3002 \u7b97\u6cd5\u8bf4\u660e\uff1a \u7528\u5fae\u4fe1\u7b97\u6cd5\u6765\u8ba1\u7b97n!+[(n-1)!+(n-2)!+...+1!]\uff0c \u53ef\u4ee5\u5c06[(n-1)!+(n-2)!+...+1!] \u7528\u5fae\u4fe1\u7b97\u6765\u8ba1\u7b97\uff0c [(n-1)!+(n-2)!+...+1!] = (n-1)[(n-2)!+(n-3)!+...+1!] \u518d\u4e0e n! \u7ed3\u5408\uff0c\u53ef\u4ee5\u5f97\u5230\uff1a s = n! + (n-1)! \* [(n-2)! + (n-3)! + ... + 1!] \u4e0d\u65ad\u5904\u7406 [(n-2)! + (n-3)! + ... + 1!]\uff0c\u53ef\u4ee5\u901a\u8fc7\u5fae\u4fe1\u7b97\u6cd5\u6765\u89e3\u51b3\u3002 \u4f7f\u7528\u8fd0\u7b97\uff0c\u53ef\u4ee5\u5c06\u4ee5\u4e0b\u4ee3\u7801\u5904\u7406\u5b9a\u4e49\u7684\u7b97\u6cd5\uff1a ### 回答2: 题目分析: 根据题意,我们需要计算从1到n的阶乘的和。其中,每个阶乘实际上都可以递归地表示为前面所有阶乘的和,并最终加上1。 因此,我们可以循环遍历从1到n的所有数,每次将当前数的阶乘加入到之前所有阶乘的和中,并最终返回最终结果即可。 具体实现: 我们可以使用一个变量fac来记录当前计算到的阶乘,一开始设为1; 每次循环,我们将fac乘上当前遍历的数字i,得到当前数字i的阶乘,并加入之前所有阶乘的和中; 最后返回总和即可。 代码实现: 下面给出Python的代码实现: ```python n = int(input()) fac = 1 sum = 0 for i in range(1, n+1): fac *= i sum += fac print(sum) ``` 注意:在代码中使用变量名sum,注意不要与Python中自带的sum函数重名。 ### 回答3: 对于给定的正整数n,需要计算1!,2!,3!,...,n!,将它们相加即可得到s的值。 先来回顾一下阶乘的概念。阶乘指从1到该数的所有正整数相乘的积,比如5的阶乘为5×4×3×2×1=120。阶乘可以用递归函数或循环语句来求解。 接着,就可以设计代码来求解s的值了。首先,读入n的值;然后,从1到n循环遍历每一个整数i,计算i的阶乘并加到s上。最后输出s的值即可。 下面是实现此题的Python代码: n = int(input()) # 读入n s = 0 # 初始化s的值为0 fac = 1 # 初始化阶乘的值为1 for i in range(1, n+1): # 循环遍历1到n的整数 fac *= i # 计算i的阶乘,即fac *= i等价于fac = fac * i s += fac # 将i的阶乘加到s上 print(s) # 输出s的值 当输入n=4时,程序输出34。 最后需要注意的一点是,当n的值较大时,阶乘计算的结果可能超出计算机的整数表示范围,因此可能需要使用高精度计算方法。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值