Results 31 to 40 of about 241,064 (135)
This paper develops the theory of function‐weighted probabilistic metric spaces (FWPMSs) and establishes the existence of common fixed points (CFPs) for commutative mappings within this framework. A key lemma is also introduced to bridge the connection between CFPs and common n‐tuples fixed points.
Ehsan Lotfali Ghasab +3 more
wiley +1 more source
Irreducible highest weight representations of the simple n-Lie algebra [PDF]
A. Dzhumadil’daev classified all irreducible finite dimensional representations of the simple n-Lie algebra. Using a slightly different approach, we obtain in this paper a complete classification of all irreducible, highest weight modules, including the ...
Dana Bălibanu +5 more
core +1 more source
In this paper, we introduce a new class of generalized contractions, called enriched (Ψ, φ)‐contractions. Within this framework, we establish several fixed‐point theorems together with corresponding convergence results, which extend and unify a range of existing results in the literature.
Muhammad Umar Javed +4 more
wiley +1 more source
Dual spaces of geodesic currents
Abstract Every geodesic current on a hyperbolic surface has an associated dual space. If the current is a lamination, this dual embeds isometrically into a real tree. We show that, in general, the dual space is a Gromov hyperbolic metric tree‐graded space, and express its Gromov hyperbolicity constant in terms of the geodesic current.
Luca De Rosa, Dídac Martínez‐Granado
wiley +1 more source
The Weil algebra and the Van Est isomorphism [PDF]
This paper belongs to a series of papers devoted to the study of the cohomology of classifying spaces. Generalizing the Weil algebra of a Lie algebra and Kalkman’s BRST model, here we introduce the Weil algebra W(A) associated to any Lie algebroid A.
Marius Crainic +9 more
core +2 more sources
Edge‐Connectivity Between Edge‐Ends of Infinite Graphs
ABSTRACT In infinite graph theory, the notion of ends, first introduced by Freudenthal and Jung for locally finite graphs, plays an important role when generalizing statements from finite graphs to infinite ones. Nash‐Williams' Tree‐Packing Theorem and MacLane's Planarity Criteria are examples of results that allow a topological approach, in which ends
Leandro Aurichi, Lucas Real
wiley +1 more source
Faster algorithms for circuits in the Cayley-Menger algebraic matroid
22 pages, 7 figures.
Malić, Goran, Streinu, Ileana
openaire +2 more sources
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
ABSTRACT Given a hypergraph ℋ, the dual hypergraph of ℋ is the hypergraph of all minimal transversals of ℋ. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner hypergraphs are the conformal Sperner hypergraphs, which correspond to the families of maximal cliques of graphs.
Endre Boros +3 more
wiley +1 more source
When diverse decision makers are involved in the decision‐making process, taking average of decision values might not reflect an accurate point of view. To overcome such a scenario, the circular Fermatean fuzzy (CFF) set, an advancement of the Fermatean fuzzy (FF) set, and the interval‐valued Fermatean fuzzy set (IVFFS) are introduced in this current ...
Revathy A. +5 more
wiley +1 more source
A Language and Its Dimensions: Intrinsic Dimensions of Language Fractal Structures
The present paper introduces a novel object of study, a language fractal structure; we hypothesize that a set of embeddings of all n‐grams of a natural language constitutes a representative sample of this fractal set. (We use the term Hailonakea to refer to the sum total of all language fractal structures, over all n).
Vasilii A. Gromov +3 more
wiley +1 more source

