Revistas académicas de la Universidad Católica del Norte
Not a member yet
1687 research outputs found
Sort by
Arising of Bergman reproducing kernel in Bose-Fock space
No full textWe introduce a Bose-Fock space A (Dd) of anti-holomorphic complex-valued functions on the unit polydisc Dd in Cd, with d ? NU {?}.A unitary isomorphism U from the abstract Bose-Fock space ?H to A ( Dd) is produced, and it is shown that U transforms twisted coherent vectors into Bergman kernels in Dd
On lagranges polynomials of three variables
No full textThe present paper introduces a three variables analogue of Lagranges Polynomials and gives certain results involving these polynomials and the four Appell's functions F1 , F2, F3 and F4
On characterization of reflection and coreflection in categories
No full textThe main purpose of the present paper is to present a criteria of reflection and its dual through generalized pushout (GPO) and generalized pullback (GPB) structures. Several results related to reflective and coreflective subcategories are obtained
Generalized Drazin-type spectra of Operator matrices
No full textIn this paper, we investigate the limit points set of surjective and approximate point spectra of upper triangular operator matrices . We prove that σ*(MC) ∪ W=σ*(A)∪ σ*(B) where W is the union of certain holes in σ*(MC), which happen to be subsets of σlgD(B) ∩ σrgD(A), σ* ∈ {σlgD, σrgD} are the limit points set of surjective and approximate point spectra. Furthermore, several sufficient conditions for σ* (MC) = σ* (A)∪σ* (B) holds for every C ∈ ℬ(Y,X) are given
Preface
No full textA.N. Kolmogorov and J. von Neumann proposed in the 30's two sets of axioms for the mathematical modelling of random phenomena
A new family of chromatically unique 6-bridge graph
No full textFor a graph G, let P(G, λ) denote the chromatic polynomial of G. Two graphs G and H are chromatically equivalent (or simply χ-equivalent), denoted by G ∼ H, if P(G, λ) = P(H, λ). A graph G is chromatically unique (or simply χ-unique) if for any graph H such as H ∼ G, we have H ≅ = G, i.e, H is isomorphic to G. In this paper, the chromatic uniqueness of a new family of 6-bridge graph θ(a, a, b, b, b, c) where 2 ≤ a ≤ b ≤ c, is investigated
A new type of difference class of interval numbers
No full textIn this article we introduce the notation difference operator ∆m (m ≥ 0 be an integer) for studying some properties defined with interval numbers. We introduced the classes of sequence ℓ(p)(∆m), c̄(p)(∆m) and c̄0(p)(∆m) and investigate different algebraic properties like completeness, solidness, convergence free etc
Generalizations of Hermite-Hadamard and Ostrowski type inequalities for MTm-preinvex functions
No full textIn the present paper, the notion of MTm-preinvex function is introduced and some new integral inequalities involving MTm-preinvex functions along with beta function are given. Moreover, some generalizations of Hermite-Hadamard and Ostrowski type inequalities for MTm-preinvexfunctions via classical integrals and Riemann-Liouville fractional integrals are established. These results not only extends the results appeared in the literature (see [10], [11], [12]), but also provide new estimates on these types
On the local convergence of a two-step steffensen-type method for solving generalized equations
No full textWe use a two-step Steffensen-type method [1], [2], [4], [6], [13]-[16] to solve a generalized equation in a Banach space setting under Hölder-type conditions introduced by us in [2], [6] for nonlinear equations. Using some ideas given in [4], [6] for nonlinear equations, we provide a local convergence analysis with the following advantages over related [13]-[16]: finer error bounds on the distances involved, and a larger radius of convergence. An application is also provided
A technique based on the euclidean algorithm and its applications to cryptography and nonlinear diophantine equations
No full textThe main objective of this work is to build, based on the Euclidean algorithm, a “matrix of algorithms ” where is a fixed matrix o