Related papers: Fuzzy Presheaves are Quasitoposes
Immersions of graphs to the projective plane are studied. A classification of immersions up to regular homotopy is given. A complete invariant of immersions up to regular homotopy is constructed. Equivalence classes are described.
Crystal graphs are powerful combinatorial tools for working with the plactic monoid and symmetric functions. Quasi-crystal graphs are an analogous concept for the hypoplactic monoid and quasi-symmetric functions. This paper makes a…
Relational presheaves generalize traditional presheaves by going to the category of sets and relations (as opposed to sets and functions) and by allowing functors which are lax. This added generality is useful because it intuitively allows…
We develop a theory of quasicoherent sheaves on dagger analytic varieties based on Ind-Banach spaces. We show that they satisfy descent in the analytic topology. We define compactly supported pushforwards and produce an adjunction $f_!…
A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its vertices into any other, then it is called vertex-transitive.…
Introduced by C. R. Shallon in 1979, graph algebras establish a useful connection between graph theory and universal algebra. This makes it possible to investigate graph varieties and graph quasivarieties, i.e., classes of graphs described…
The mathematical representation of uncertainty has led to a proliferation of preference structures, such as interval-valued fuzzy sets, intuitionistic fuzzy sets, and various granular models. While these extensions are often studied…
Fuzzy systems (FSs) have enjoyed wide applications in various fields, including pattern recognition, intelligent control, data mining and bioinformatics, which is attributed to the strong interpretation and learning ability. In traditional…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
The quantum space-time and the phase space with fuzzy structure is investigated as the possible quantization formalism. In this theory the state of nonrelativistic particle corresponds to the element of fuzzy ordered set (Foset) - fuzzy…
We show that in the category of analytic sheaves on a complex analytic space, the full subcategory of quasi-coherent sheaves is an abelian subcategory.
In this paper, generalised intuitionistic fuzzy soft sets and relations on generalised intuitionistic fuzzy soft sets are defined and a few of their properties are studied. An application of generalised intuitionistic fuzzy soft sets in…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…
For each of the notions of hypergraph quasirandomness that have been studied, we identify a large class of hypergraphs F so that every quasirandom hypergraph H admits a perfect F-packing. An informal statement of a special case of our…
In this Paper we defined the improved concept of fuzzy magic Graph as the set of two injective functions defined on [0; 1] such that sum of the labeled defined on vertices greater than respective edge label while sum of two vertices and…
We introduce the notion of a quasi DG category, generalizing that of a DG category. To a quasi DG category satisfying certain additional conditions, we associate another quasi DG category, the quasi DG category of $C$-diagrams. We then show…
The Fundamental Morphism Theorem is a categorical version of the First Noether Isomorphism Theorem for categories that do not have kernels or cokernels. We consider two categories of graphs. Both categories will admit graphs with multiple…
A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subgroup generated by this automorphism have the same length.…
In this paper, we identify some categorical structures in which one can model predicative formal systems: in other words, predicative analogues of the notion of a topos, with the aim of using sheaf models to interprete predicative formal…
We show that any group that is hyperbolic relative to virtually nilpotent subgroups, and does not admit peripheral splittings, contains a quasi-isometrically embedded copy of the hyperbolic plane. In natural situations, the specific…