نتایج جستجو برای: nth commutativity degree
تعداد نتایج: 302875 فیلتر نتایج به سال:
In this paper, we use the Leray–Schauder degree theory to establish new results on the existence and uniqueness of anti-periodic solutions for a class of nonlinear nth-order differential equations with two deviating arguments of the form x(t) + f(t, x(n−1)(t)) + g1(t, x(t− τ1(t))) + g2(t, x(t− τ2(t))) = e(t). As an application, we also give an example to demonstrate our results. AMS Subject Cla...
In this study, a new application of Taylor expansion is considered to estimate the solution of Volterra-Fredholm integral equations (VFIEs) and systems of Volterra-Fredholm integral equations (SVFIEs). Our proposed method is based upon utilizing the nth-order Taylor polynomial of unknown function at an arbitrary point and employing integration method to convert VFIEs into a system of linear equ...
Given a bounded sequence of integers {d0,d1,d2, . . .}, 6 ≤ dn ≤M, there is an associated abstract triangulation created by building up layers of vertices so that vertices on the nth layer have degree dn. This triangulation can be realized via a circle packing which fills either the Euclidean or the hyperbolic plane. We give necessary and sufficient conditions to determine the type of the packi...
Let R be a ring with center Z(R). We write the commutator [x, y] = xy− yx, (x, y ∈ R). The following commutator identities hold: [xy,z] = x[y,z] + [x,z]y; [x, yz] = y[x,z] + [x, y]z for all x, y,z ∈ R. We recall that R is prime if aRb = (0) implies that a= 0 or b = 0; it is semiprime if aRa = (0) implies that a = 0. A prime ring is clearly a semiprime ring. A mapping f : R→ R is called centrali...
The classical problem of solving an nth degree polynomial equation has substantially influenced the development of mathematics throughout the centuries and still has several important applications to the theory and practice of present-day computing. We briefly recall the history of the algorithmic approach to this problem and then review some successful solution algorithms. We end by outlining ...
It is shown that coherence conditions for monoidal categories concerning associativity are analogous to coherence conditions for strict symmetric monoidal categories, where associativity arrows are identities. Mac Lane’s pentagonal coherence condition for associativity is decomposed into conditions concerning commutativity, among which we have a condition analogous to naturality and a degenerat...
In this paper, we prove common fixed point theorems for hybrid pairs of mappings satisfying an implicit relation in 2-metric spaces by using a new commutativity condition i.e. weak commutativity of type (KB). We also prove common fixed point theorem, of Gregus type for hybrid pairs of maps by using weak commutativity of type (KB) in 2-metric spaces. We extend, improve and generalize many known ...
We show deterministic polynomial time algorithms over some family of finite fields for solving univariate polynomial equations and some related problems such as taking nth roots, constructing nth nonresidues, constructing primitive elements and computing elliptic curve “nth roots”. In additional, we present a deterministic polynomial time primality test for some family of integers. All algorith...
In an invited paper, Baksalary [Algebraic characterizations and statistical implications of the commutativity of orthogonal projectors. In: T. Pukkila, S. Puntanen (Eds.), Proceedings of the Second International Tampere Conference in Statistics, University of Tampere, Tampere, Finland, [2], pp. 113–142] presented 45 necessary and sufficient conditions for the commutativity of a pair of orthogon...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید