Related papers: Fuzzy Presheaves are Quasitoposes
This paper addresses questions of quasi-isometric rigidity and classification for fundamental groups of finite graphs of groups, under the assumption that the Bass-Serre tree of the graph of groups has finite depth. The main example of a…
Given a reference lattice, we define fuzzy intervals to be the fuzzy sets such that their p-cuts are crisp closed intervals. We show that: given a complete reference lattice, the collection of its fuzzy intervals is a complete lattice.…
For a set-endofunctor $F$, we extend the notion of universal $F$-coalgebras to $F$-graphs. These generalized coalgebras are models for various types of graphs, such as (un)directed (hyper)graphs, relational structures or fuzzy graphs. The…
Soft set theory and rough set theory are mathematical tools to deal with uncertainties. In [3], authors combined these concepts and introduced soft rough sets. In this paper, we introduce the concepts of soft rough graphs, vertex and edge…
The notion of Intuitionistic fuzzy hypervector space has been generalized and a few basic properties on this concept are studied. It has been shown that the intersection and union of an arbitrary family of Intuitionistic fuzzy hypervector…
A structure $\cal S$ is quasi-projective if for every structure $\cal T$, for every homomorphism $f : {\cal S} \rightarrow {\cal T}$ and every epimorphism $j: {\cal S}\rightarrow {\cal T}$ there is an endomorphism $\phi$ of $\cal S$ such…
Coarse geometry is the study of large-scale properties of spaces. In this paper we study group coarse structures (i.e., coarse structures on groups that agree with the algebraic structures), by using group ideals. We introduce a large class…
In this contribution we investigate several extensions of the powerset that comprise arbitrarily nested subsets, and call them superpower set. This allows the definition of graphs with possibly infinitely nested nodes. additionally we…
An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical'…
The aim of this paper is to introduce the notion of intuitionistic fuzzy Lie subalgebras and intutionistic fuzzy Lie ideals of n-Lie algebras. It is a generalization of intuitionistic fuzzy Lie algebras. Then, we investigate some of…
A novel class of graphs, here named quasiperiodic, are constructed via application of the Horizontal Visibility algorithm to the time series generated along the quasiperiodic route to chaos. We show how the hierarchy of mode-locked regions…
A "biased expansion" of a graph is a kind of branched covering graph with additional structure related to combinatorial homotopy of circles. Some but not all biased expansions are constructed from groups ("group expansions"); these include…
Semi-transitive graphs, defined in \cite{hps98} as examples where ``uniform percolation" holds whenever $p>p_c$, are a large class of graphs more general than quasi-transitive graphs. Let $G$ be a semi-transitive graph with one end which…
A geometric stack is a quasi-compact and semi-separated algebraic stack. We prove that the quasi-coherent sheaves on the small flat topology, Cartesian presheaves on the underlying category, and comodules over a Hopf algebroid associated to…
This paper serves as an example to show the way we pass from ordered groupoids (ordered semigroups) to ordered hypergroupoids (ordered hypersemigroups), from groupoids (semigroups) to hypergroupoids (hypersemigroups). The results on…
The aim of this paper is to present the main constructions of the substructures of an almost groupoid and to discuss their basic properties. The definitions and properties concerning these new algebraic constructions extend to almost…
Fuzzy circular interval graphs are a generalization of proper circular arc graphs and have been recently introduced by Chudnovsky and Seymour as a fundamental subclass of claw-free graphs. In this paper, we provide a polynomial-time…
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…
Graphs serve as efficient tools for visualizing mathematical concepts and their interrelationships. In this paper, focusing on the discrete case with universal set with finite elements, we first introduce the rules and characteristics of…
We introduce a categorical formalism for rewriting surface-embedded graphs. Such graphs can represent string diagrams in a non-symmetric setting where we guarantee that the wires do not intersect each other. The main technical novelty is a…