نتایج جستجو برای: mathcal p_c

تعداد نتایج: 7765  

Journal: :transactions on combinatorics 2014
jing li xueliang li huishu lian

let $d$ be a digraph with skew-adjacency matrix $s(d)$. then the skew energyof $d$ is defined to be the sum of the norms of all eigenvalues of $s(d)$. denote by$mathcal{o}_n$ the class of digraphs on order $n$ with no even cycles, and by$mathcal{o}_{n,m}$ the class of digraphs in $mathcal{o}_n$ with $m$ arcs.in this paper, we first give the minimal skew energy digraphs in$mathcal{o}_n$ and $mat...

2006
Guillaume Moroz

Consider a system of n polynomial equations and r polynomial inequations in n indeterminates of degree bounded by d with coefficients in a polynomial ring of s parameters with rational coefficients of bit-size at most $\sigma$. From the real viewpoint, solving such a system often means describing some semi-algebraic sets in the parameter space over which the number of real solutions of the cons...

A. Riazi K. Haghnejad Azar

We study the topological centers of $nth$ dual of Banach $mathcal{A}$-modules and we extend some propositions from Lau and "{U}lger into $n-th$ dual of Banach $mathcal{A}-modules$ where $ngeq 0$ is even number. Let   $mathcal{B}$   be a Banach  $mathcal{A}-bimodule$. By using some new conditions, we show that $ Z^ell_{mathcal{A}^{(n)}}(mathcal{B}^{(n)})=mathcal{B}^{(n)}$ and $ Z^ell_{mathcal{B}...

Journal: :Physical review 2022

We study the cross sections for electro-production of $P_c(4312)$ particle, a recently discovered pentaquark state, in electron-proton collisions assuming possible quantum numbers to be $J^{P}=\frac{1}{2}^\pm, \frac{3}{2}^\pm$. $\sqrt{s}$ is set energy future Electron Ion Collider at Brookhaven National Laboratory, order asses possibility measurement this facility. One can discriminate spin by ...

‎Let $mathcal{F}$ be an field of zero characteristic and $N_{infty‎}(‎mathcal{F})$ be the algebra of infinite strictly upper triangular‎ ‎matrices with entries in $mathcal{F}$‎, ‎and $f:N_{infty}(mathcal{F}‎)rightarrow N_{infty}(mathcal{F})$ be a non-additive Lie centralizer of $‎N_{infty }(mathcal{F})$; that is‎, ‎a map satisfying that $f([X,Y])=[f(X),Y]$‎ ‎for all $X,Yin N_{infty}(mathcal{F})...

Let $mathcal{H}$ and $mathcal{K}$ be infinite dimensional Hilbert spaces, while $mathcal{B(H)}$ and $mathcal{B(K)}$ denote the algebras of all linear bounded operators on $mathcal{H}$ and $mathcal{K}$, respectively. We characterize the forms of additive mappings from $mathcal{B(H)}$ into $mathcal{B(K)}$ that preserve the nonzero idempotency of either Jordan products of operators or usual produc...

Journal: :sahand communications in mathematical analysis 0
rahim kargar department of mathematics, payame noor university, i. r. of iran. ali ebadian department of mathematics, payame noor university, i. r. of iran.

assume that $mathbb{d}$ is the open unit disk. applying ozaki's conditions, we consider two classes of locally univalent, which denote by $mathcal{g}(alpha)$ and $mathcal{f}(mu)$ as follows begin{equation*}  mathcal{g}(alpha):=left{fin mathcal{a}:mathfrak{re}left( 1+frac{zf^{prime prime }(z)}{f^{prime }(z)}right)

Journal: :Chinese Physics C 2021

In this article, we illustrate how to calculate the hadronic coupling constants of pentaquark states with QCD sum rules based on rigorous quark-hadron quality, then study lowest diquark-diquark-antiquark type hidden-charm state spin-parity $J^P={\frac{1}{2}}^-$ in details, and partial decay widths. The total width $\Gamma(P_c)=14.32\pm3.31\,\rm{MeV}$ is compatible experimental value $\Gamma_{P_...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان - دانشکده ریاضی 1393

فرض کنی h یک فضای هیلبرت متشکل از توابع اسکالر مقدار روی یک مجموعه ی $x$ باشد. اگر برای هر x in xتابعک خطی delta_{x}:hlongrightarrow f}$ با تعریف delta_{x}(f)=f(x) برای هر fدرh یک تابعک خطی پیوسته روی فضای هیلبرت mathcal{h} باشد، آنگاه h یک فضای هیلبرت هستهِ ی بازتولید می نامند.ایده ی هسته ی بازتولید برای اولین بار در سال 1907 توسط gi{h5} روی مسائل مقدار مرزی برای توابع هارمونیک و غیرهارمونیک ...

Journal: :CoRR 2017
Mikhail Gudim

We generalise the insertion into a binary heap to any directed acyclic graph (DAG) with one source vertex. This lets us formulate a general method for converting any such DAG into a data structure with priority queue interface. We apply our method to a hypercube DAG to obtain a sorting algorithm of complexity $\mathcal{O}(n\log^2 (n))$. As another curious application, we derive a relationship b...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید