نتایج جستجو برای: pairwise strongly compact

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

2015
J. L. Li C. H. Qiu T. D. Zhong

In this paper, we prove that the Hodge-Laplace operator on strongly pseudoconvex compact complex Finsler manifolds is a self-adjoint elliptic operator. Then, from the decomposition theorem for self-adjoint elliptic operators, we obtain a Hodge decomposition theorem on strongly pseudoconvex compact complex Finsler manifolds. M.S.C. 2010: 53C56, 32Q99.

A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...

2007
G. MARINESCU

We obtain an embedding theorem for compact strongly pseudoconvex CR manifolds which are bounadries of some complete Hermitian manifolds. We use this to compactify some negatively curved Kähler manifolds with compact strongly pseudoconvex boundary. An embedding theorem for Sasakian manifolds is also derived.

2000
Johan Kustermans

Consider a closed subgroup H of a locally compact group G together with a strongly continuous unitary representation u of H on a Hilbert space K. The construction of the induced representation uses these three ingredients to supply a new strongly continuous unitary representation ρ of the larger group G on a new Hilbert space K. Induced group representations for finite groups where first introd...

Journal: :IET Communications 2007
Terasan Niyomsataya Ali Miri Monica Nevins

We present a closed form upper bound for the average pairwise error probabilities (PEP) of space-time codes for a keyhole channel. It is derived from the exact conditional PEP for given fading channel coefficients, using a moment generating function-based approach. We include simulation results for varying numbers of antennas which affirm that the proposed PEP serves as a tight bound for codes ...

Journal: :Discrete and Continuous Dynamical Systems 2023

For an infinite discrete group $ G acting on a compact metric space X $, we introduce several weak versions of equicontinuity along subsets and show that if minimal system (X, G) admits invariant measure then is distal only it pairwise IP$ ^* $-equicontinuous; the product (X\times X, has dense set points, $-equicontinuous central$ with being abelian, order \infty FIP$ $-equicontinuous.

Journal: :European Journal of Operational Research 2018
Sándor Bozóki János Fülöp

Pairwise comparison matrices are frequently applied in multi-criteria decision making. A weight vector is called efficient if no other weight vector is at least as good in approximating the elements of the pairwise comparison matrix, and strictly better in at least one position. A weight vector is weakly efficient if the pairwise ratios cannot be improved in all nondiagonal positions. We show t...

Journal: :CoRR 2008
Paul C. Attie

We present a pairwise normal form for finite-state shared memory concurrent programs: all variables are shared between exactly two processes, and the guards on transitions are conjunctions of conditions over this pairwise shared state. This representation has been used to efficiently (in polynomial time) synthesize and model-check correctness properties of concurrent programs. Our main result i...

2008
Taufik DJATNA Yasuhiko MORIMOTO

Considerable attention has been devoted to the development of feature selection algorithms for various applications in the last decade. Most of them concentrate to the single attributes. In contrast, limited research work has been devoted to determine correlated and pairwise attributes or features due to the difficulty of the problem. We present a novel feature selection algorithm for strongly ...

Journal: :CoRR 2018
Sariel Har-Peled Haim Kaplan Wolfgang Mulzer Liam Roditty Paul Seiferth Micha Sharir Max Willert

We present a deterministic linear time algorithm to find a set of five points that stab a set of n pairwise intersecting disks in the plane. We also give a simple construction with 13 pairwise intersecting disks that cannot be stabbed by three points.

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

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