نتایج جستجو برای: ij weakly lindelof relative

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

Journal: :Journal of The Mathematical Society of Japan 2023

In this paper, we obtain the classification theorem for 3-dimensional complete space-like $\lambda$-translators $x:M^{3} \rightarrow \mathbb{R}^{4}_{1}$ with constant norm of second fundamental form and $f_{4} = \sum_{i,j,k,l} h_{ij} h_{jk} h_{kl} h_{li}$ $h_{ij}$ being components in Minkowski space $\mathbb{R}^{4}_{1}$.

2002
Ilya Kapovich Paul Schupp

Let G = a 1 ,. .. , a n | a i a j a i · · · = a j a i a j. .. , i < j be an Artin group and let m ij = m ji be the length of each of the sides of the defining relation involving a i and a j. We show if all m ij ≥ 7 then G is relatively hyperbolic in the sense of Farb with respect to the collection of its two-generator subgroups a i , a j for which m ij < ∞.

Journal: :European Journal of Operational Research 2004
Saul I. Gass Tamás Rapcsák

The Analytic Hierarchy Process (AHP) (Saaty, 1990) has been accepted as a leading multiattribute decision model both by practitioners and academics. AHP can solve decision problems in various fields by the prioritization of alternatives. The heart of the most familiar version of the AHP is the Saaty’s eigenvector method (EM) which approximates an positive reciprocal matrix n n× ) ( ij a A = , ,...

Journal: :Nonlinear Analysis-theory Methods & Applications 2022

We study the existence of fully nontrivial solutions to system ??ui+?iui=?j=1??ij|uj|p|ui|p?2uiin?,i=1,…,?,in a bounded or unbounded domain ? in RN, N?3. The ?i’s are real numbers, and nonlinear term may have subcritical (1NN?2). matrix (?ij) is symmetric admits block decomposition such that diagonal entries ?ii positive, interaction forces w...

2008
MITICĂ CRAUS ALEXANDRU ARCHIP

A parallel algorithm for finding the frequent itemsets in a set of transactions is presented. The frequent individual items are identified by their index. We assume that processors number (m) is less than the frequent items number (n). At the first stage, every processor Pi, i ∈ {1, . . . ,m − 1} sequentially computes the frequent itemsets from the interval Ii = [(i − 1) · p + 1, i · p], where ...

1998
Richard J. Sadus

The Gibbs ensemble algorithm is implemented to determine the vapour-liquid phase coexistence of a pure fluid interacting via a two-body Lennard-Jones + three-body Axilrod-Teller potential. The contribution of both two-body and three-body interactions are calculated exactly. The results are compared with both experiment and two-body only simulation data. The position of the vapour branch of the ...

Journal: :Classical and Quantum Gravity 2022

The total Hamiltonian in general relativity, which involves the first class and momentum constraints, weakly vanishes. However, when action is expanded around a classical solution as case of single scalar field inflationary model, there appears non-vanishing additional constraints; but this time theory becomes perturbative number fluctuation fields. We show that one can reorganize expansion sol...

Journal: :Numerical Algorithms 2023

Abstract Let a network be represented by simple graph $$\mathcal {G}$$ G with n vertices. A common approach to investigate properties of is use the adjacency matrix $$A=[a_{ij}]_{i,j=1}^n\in \mathbb {R}^{n\times n}$$ A = [ ...

Journal: :categories and general algebraic structures with applications 2015
xingliang liang yanfeng luo

in 2001, s. bulman-fleming et al. initiated the study of three flatness properties (weakly kernel flat, principally weakly kernel flat, translation kernel flat) of right acts $a_{s}$ over a monoid $s$ that can be described by means of when the functor $a_{s} otimes -$ preserves pullbacks. in this paper, we extend these results to$s$-posets and present equivalent descriptions of weakly kernel po...

Journal: :Discrete Applied Mathematics 1995
Maiko Shigeno Yasufumi Saruwatari Tomomi Matsui

In this paper, we propose a polynomial time algorithm for fractional assignment problems. The fractional assignment problem is interpreted as follows. Let G = (I; J;E) be a bipartite graph where I and J are vertex sets and E I J is an edge set. We call an edge subset X( E) an assignment if every vertex is incident to exactly one edge from X: Given an integer weight c ij and a positive integer w...

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

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