424 citations
- Institute for Research in Fundamental SciencesIR51 papers
- University of TehranIR16 papers
- Institute of Nuclear Physics, Polish Academy of SciencesPL12 papers
- Jagiellonian UniversityPL12 papers
- University of GroningenNL12 papers
- University of KashanIR12 papers
- University of Silesia in KatowicePL12 papers
- Semnan UniversityIR10 papers
- Persian Gulf UniversityIR9 papers
- Graduate University of Advanced TechnologyIR8 papers
- Vilnius UniversityLT8 papers
- University of Science and Technology of MazandaranIR7 papers
17 papers · 1 filter
Improved determination of flavor asymmetry in the proton by BONuS experiment at JLAB and using an approach by Brodsky, Hoyer, Peterson, and Sakai
Maral Salajegheh, Hamzeh Khanpour, S. Mohammad Moosavi Nejad
The experimental data taken from both Drell-Yan and deep-inelastic scattering (DIS) experiments suggest a sign-change in flavor asymmetry in the proton at l…
Dissipative entanglement swapping in the presence of detuning and Kerr medium: Bell state measurement method
Mahnaz Ghasemi, Mohammad K Tavassoly, Alireza Nourmandipour
In this paper, we investigate the possibility of the entanglement swapping between two independent nonperfect cavities consisting of an atom with finite lifetime of atomic levels (…
On the saturation number of graphs
Saeid Alikhani, Neda Soltani
Let be a simple connected graph. A matching in a graph is a collection of edges of such that no two edges from share a vertex. A matching is maximal i…
First determination of -meson fragmentation functions and their uncertainties at next-to-next-to-leading order
Maryam Soleymaninia, Hamzeh Khanpour, S. Mohammad Moosavi Nejad
We present, for the first time, a set of next-to-next-to-leading order (NNLO) fragmentation functions (FFs) describing the production of charmed-meson from partons. Exploi…
On global minimizers of quadratic functions with cubic regularization
Andrea Cristofari, Tayebeh Dehghan Niri, Stefano Lucidi
In this paper, we analyze some theoretical properties of the problem of minimizing a quadratic function with a cubic regularization term, arising in many methods for unconstrained…
The cost number and the determining number of a graph
Saeid Alikhani, Samaneh Soltani
The distinguishing number of a graph is the least integer such that has an vertex labeling with labels that is preserved only by a trivial automorphism. The…