Revistas académicas de la Universidad Católica del Norte
Not a member yet
1687 research outputs found
Sort by
Statistically pre-Cauchy Fuzzy real-valued sequences defined by Orlicz function
No full textIn this articlewehavedefined statistically pre-Cauchy sequence of fuzzy real numbers defined by Orlicz function. We have proved a necessary and sufficient condition for a sequence X =(Xk) of fuzzy real numbers to be statistically pre-Cauchy. We have also established some other results
Some characterization theorems on dominating chromatic partition-covering number of graphs
No full textLet G = (V, E) be a graph of order n = |V| and chromatic number (G) A dominating set D of G is called a dominating chromatic partition-cover or dcc-set, if it intersects every color class of every X-coloring of G. The minimum cardinality of a dcc-set is called the dominating chromatic partition-covering number, denoted dcc(G). The dcc-saturation number equals the minimum integer i such that every vertex ν ∈ V is contained in a dcc-set of cardinality k.This number is denoted by dccs(G) In this paper we study a few properties ofthese two invariants dcc(G) and dccs(G)
Some Umbral Calculus Presentations of the Chan-Chyan-Srivastava Polynomials and the Erkuș-Srivastava Polynomials
No full textIn their recent investigation involving differential operators for the generalized Lagrange polynomials, Chan et. al. [3] encountered and proved a certain summation identity and several other results for the Lagrange polynomials in several variables, which are popularly known in the literature as the Chan-Chyan-Srivastava polynomials. These multivariable polynomials have been studied systematically and extensively in the literature ever since then (see, for example, [1], [4], [9], [11], [12] and [13]). In the present paper, we investigate umbral calculus presentations ofthe Chan-Chyan-Srivastava polynomials and also of their substantially more general form, the Erkus-Srivastava polynomials [9]. Some other closely-related results are also considered
Summability results for matrices of quasi - homogeneous operators
No full textSome summability results are established for matrices of quasihomogeneous operators by uniformly vanishing sets
Periodic solutions in the singular logarithmic potential
No full textWe consider the singular logarithmic potential , a potential which plays an important role in the modelling of triaxial systems, such as elliptical galaxies or bars in the centres of galaxy discs. Using properties of the central field in the axis-symmetric case we obtain periodic solutions which are symmetric with respect to the origin for weak anisotropies. Also we generalize our result in order to include more general perturbations of the logarithmic potential
On foliations with rational first integral
No full textWe use the Kodaira’s classification of relatively minimal elliptic fi- brations to prove that a holomorphic foliation in CP2 with a dicritical compact elliptic curve has rational first integral
La (-5)-demi-reconstructibilité des relations binaires connexes finies
No full textEtant donnée une relation binaire R, de base E, on définit sa duale R? par R?(x, y) = R(y, x). La relation R est dite auto-duale si elle est isomorphe à R?. Une relation binaire R0 est hémimorphe à R, si elle est isomorphe à R ou à R?. Une relation binaire est d-demireconstructible, si elle est déterminée par la donnée de ses restrictions de cardinal d, à l’hémimorphie près. Dans ce papier, nous montrons que : Les relations binaires connexes finies de cardinal n ? 12 sont (n ? 5)-demi-reconstructibles. Given a binary relation R of basis E, we define its dual R? by R?(x, y) = R(y, x). A relation R is self-dual if it is isomorphic to R?. A binary relation R0 is hemimorphic to R, if it is isomorphic to R or to R?. A binary relation R is d-half-reconstructible if it is determined by its restrictions of cardinality d, up to hemimorphism. In this paper we obtain : The finite connected binary relations of cardinality n ? 12 are (n ? 5)-half -reconstructible
Classes of forms witt equivalent to a second trace form over fields of characteristic two
No full textLet F be a field of characteristic two. We determine all nonhyperbolic quadratic forms over F that are Witt equivalent to a second trace form
Attractors points in the autosubstitution
No full textRecently an operation of graphs called substitution has been incorporated. In an informal way, the substitution consists in the replacement of a vertex for a graph. This new graph is characterized through a function (of substitution) that it could be self definable. The substitution of each vertex of a graph G, through injectives functions of substitution, by the same G graph will be called autosubstitution and denoted by G(G). If X represents the class of all the simple and fi- nite graphs and w is an application of X in X, defined by w (G) = G(G), then it is interest in studying the dynamic properties of w and the construction of some algorithms that they permit the generating of fractal images. In function of the above-mentioned it is proposed to analyze the autosubstitution for graphs simple and finite. Framed in the area of the Graph Dynamics, inside the area of the Graph Theory, the present work will use, preferably, simple and finite graph
Un etude classique des duplications d’un groupe cyclique
No full textPour chaque entier n, nous allons a etablir la quantité, sauf isomorphism, des groupes G d’ordre 2n et de fa¸ con qu’ils aient au moins un élément d’ordre n. C’est-a-dire, nous donnerons le nombre des groupes (sauf isomorphism) d’ordre 2n, qui aient un sous-groupe isomorphic au groupe cyclique d’ordre n, Cn. En plus , nous étudierons aussi la structure de ces groupes