1. Preliminaries
This section gathers the basic notions and notation used throughout the paper. Unless explicitly stated otherwise, we work in the finite setting. By convention, the empty set is treated as an element of every set.
1.1. Hyperstructure and Superhyperstructure
A
Hyperstructure is organized around the powerset and serves as a vehicle for modeling relations among elements of a set [
1,
2,
3,
4,
5,
6]. Owing to its flexibility, the hyperstructure framework has been investigated across several areas, including mathematics and chemistry [
7,
8,
9,
10]. A
Superhyperstructure advances this idea by utilizing the
n-th powerset to encode multi-layered hierarchical interactions, thereby enabling deeper abstraction and greater structural complexity [
11,
12,
13]. Related concepts such as
SuperHyperGraph are also known [
14,
15,
16,
17,
18]. We next record the
n-th powerset, which underpins these structures.
Definition 1 (Base Set).
A base set
S is the underlying collection from which higher-level constructions—powersets and (super)hyperstructures—are built. Formally,
All elements appearing in or in the iterated powersets ultimately arise from members of S.
Definition 2 (Powerset).
[19] The powerset
of a set S, denoted , is the family of all subsets of S, including ∅ and S itself:
Example 1 (Powerset in a geographic partition).
Let denote three disjoint administrative regions of a city: North
, South
, and Coast
. The powerset
contains subsets. Suppose their areas are
For any , the union represents the geographic footprint of the chosen regions (with and ). For instance,
since the regions are disjoint. This concretely interprets as all possible selections of regions for a planning scenario.
Definition 3 (
n-th Powerset).
(cf.[20,21,22,23]) For a set H, the n-th powerset is defined recursively by
The nonempty version is given by
where .
Example 2 (
n-th powerset (here
) for district portfolios).
Let be three disjoint districts with areas
Then
For the nonempty versions, has elements, hence
A concrete element of (a nonempty set of nonempty district-sets) is
Its geographic coverage is the union of all districts that appear in X:
Thus, parameterizes portfolios of district groupings
(e.g., policy or service bundles), while restricts to portfolios with no empty members.
To provide a self-contained foundation for hyperstructures and superhyperstructures, we recall the following standard notions.
Definition 4 (Classical Structure).
(cf. [20,21,24]) A Classical Structure
consists of a nonempty set H together with one or more classical operations
satisfying specified axioms. A classical m-ary operation has the form
with . Familiar examples include the operations defining groups, rings, and fields.
Definition 5 (Hyperoperation).
(cf. [11,25,26,27]) A hyperoperation
on a set S is a map
so that combining two inputs returns a set
of outcomes (not necessarily a singleton).
Definition 6 (Hyperstructure).
(cf. [20,21,28,29]) A Hyperstructure
augments a base set S by operating on its powerset. Formally,
where ∘ acts on subsets of S.
Example 3 (HyperStructure — capacity–constrained parcel consolidation).
Let the base set be parcels with weights (kg)
and let the vehicle capacity be kg. Consider the HyperStructure
where the hyperoperation maps two order sets to the set of all feasible trip partitions
Z such that: (i) , (ii) for every one has .
Take and . Then with total weight , so at least two trips are needed. Enumerating all set partitions of and keeping only capacity–feasible ones gives
The single–trip partition is infeasible
since . Therefore
illustrating a concrete hyperoperation on returning multiple feasible consolidation outcomes under a real capacity constraint.
Definition 7 (SuperHyperOperation).
[20] Let H be nonempty. Define recursively, for ,
For fixed and arity , an -SuperHyperOperation
is a map
If the codomain may include ∅, we obtain the neutrosophic variant; otherwise we are in the classical case.
Definition 8 (
n-Superhyperstructure).
(cf. [20,23,30,31]) An n-Superhyperstructure
generalizes hyperstructures by acting on the n-th powerset:
with ∘ defined on .
Example 4 (
n-Superhyperstructure (
)—team reorganization with size constraints).
Let be employees. A level–2 object is a set of teams
(each team is a nonempty subset of S). Define an operation
that maps programs to the set of all reorganizations
Z whose ground union is preserved and whose teams have size in (no singletons):
Take
Then . Two canonical families in are:
Counting shows the operation returns many
outcomes: the number of partitions of six labeled employees into two unlabeled triads is
and the number of partitions into three pairs (perfect matchings) is
Hence contains at least reorganizations satisfying the size constraint, which demonstrates a concrete n-Superhyperstructure on producing multiple valid teamings while preserving the same ground set.
Definition 9 (SuperHyperStructure of order
).
(cf. [11,32,33]) Let S be nonempty and . A -SuperHyperStructure
of arity s is any choice of
The special cases recover standard settings: gives ordinary s-ary operations; yields hyperoperations; and corresponds to superhyperfunctions.
Example 5 (
-SuperHyperStructure with
— two–layer service bundles to single–layer deployment).
Let be neighborhoods with areas (km2)
and population densities (persons/km2)
Thus atomic populations are
and over S one has
and total area km2, hence the average density on the union is
A level–2 bundle
is an element of . Consider two agencies’ proposals
Define the -superhyperoperation
by
A canonical output is the flattened
selection
and any other Z in the output has the same ground union. If each person needs kits/month, the single–layer monthly demand is
which is invariant
across all because it depends only on the flattened union. This realizes a concrete -SuperHyperStructure with : inputs at level 2 (bundles) and outputs at level 1 (deployable region selections) while preserving measurable aggregates.
2. Main Results
In this section, we present the main contributions of this paper.
2.1. Geography
Geography is a mathematical framework on a 2D Riemannian manifold encoding regions, features, attributes, networks, and projections to analyze spatial relations [
34,
35,
36,
37,
38,
39].
Definition 10 (Geography as a mathematical structure).
(cf.[40,41]) Fix a nonempty, connected, oriented 2-dimensional manifold M (the ground
) endowed with a Riemannian metric g. Let
and let Σ be the Borel σ-algebra on M. A geography
is a tuple
satisfying the axioms (G1)–(G6) below.
(G1) Regions (administrative/physical partition). is a countable family of pairwise μ-almost disjoint measurable sets with
For with , define adjacency
(G2) Features (typed geometric objects). is a set of triples where is a countably -rectifiable set of finite -measure, , and is a measurable attribute map
into a measurable space . Conventionally, (points, e.g. cities), 1 (curves, e.g. rivers/roads), or 2 (areas, e.g. lakes/parks).
(G3) Attribute fields (spatial variables). is a (finite or countable) index set. For each there is a measurable value space and a measurable field
Numerical fields satisfy ; for such a and any of finite μ-measure, define the aggregate
(G4) Embedded networks (transport/flow). where is a (finite or countable) simple graph and φ embeds G into M via
so that each is mapped to a rectifiable curve whose endpoints are . The network length measure ℓ is the 1-dimensional Hausdorff measure restricted to .
(G5) Spatial relations. From (G1)–(G4) derive measurable binary relations on regions/features, e.g.
for measurable . These are well-defined because d is a metric and are Borel regular.
(G6) Coordinate realization / projection (cartography). is an optional specification of coordinates: either a chart (reference ellipsoid/sphere) or a locally map (a cartographic projection) which is a local diffeomorphism off a set of μ-measure 0.
Remark 1 (Minimal consequences).
For any finite subpartition with , σ-additivity yields the exact decomposition
For any integrable numerical attribute ,
and for regions one has
so adjacency implies , while implies non-adjacency.
Example 6 (Urban water supply and mobility planning). We instantiate on a metropolitan area.
(G1) Ground and regions. Let be a bounded open set with smooth boundary, endowed with the Euclidean metric . Let Σ be the Borel σ-algebra and μ the Lebesgue area measure (so μ is the 2-dimensional Hausdorff measure). Partition M into three measurable regions (almost disjoint, finite perimeter)
with adjacencies , , and (separated by a river corridor).
(G2) Features. Let contain: (i) a curve feature where is a rectifiable river centerline crossing and separating from ; (ii) point features for reservoirs with storage attribute ; (iii) area features for urban parks.
(G3) Attribute fields. Define population density and monthly rainfall fields
measured in and , respectively. Then the regional populations are
so numerically
Monthly rainfall volume over (assuming spatially constant per region) is
since . Hence
(G4) Embedded networks. Let be the primary road graph with major hubs (one per region) and edges . Embed each edge as a rectifiable curve with lengths
The total embedded edge length is (edges disjoint except at endpoints).
(G5) Spatial relations. By construction, and since for , while (the river corridor enforces a positive gap).
(G6) Projection. Take to be the local UTM projection (chart on the chosen zone); P is and a local diffeomorphism off a null set, enabling planar cartography.
This instantiation supports concrete planning queries such as allocating stormwater storage to match and sizing road capacities along to serve .
Example 7 (Coastal evacuation and shelter capacity). We instantiate on a coastal city with tsunami hazard zoning.
(G1) Ground and regions. Let be a simply connected coastal municipality with Euclidean metric g, Borel σ-algebra Σ, and Lebesgue area measure μ. Partition M into hazard/land-use regions
where is the tsunami inundation zone (low elevation), is inland residential, and is an industrial port. Assume , , and .
(G2) Features. Include: (i) shoreline curve with carrying local berm height; (ii) evacuation shelters as point features with capacities , , ; (iii) critical bridges as curve features with width attributes.
(G3) Attribute fields. Define elevation (meters above sea level) and population density
in and . Then regional populations are
Suppose the evacuation target is all residents in . Total designated shelter capacity is
(G4) Embedded evacuation network. Let with representing the centroids of and with edges along designated evacuation corridors:
The total corridor length is . If a bridge feature on has width and safe pedestrian flux , then the link’s peak throughput is
so in principle one such link can clear in about under steady flow (ignoring transients and routing constraints).
(G5) Spatial relations. Because meets both and along positive-length arcs, and . Moreover, implies non-adjacency between and .
(G6) Projection. Take P to be a conformal coastal chart (e.g. local Mercator/UTM); since P is and locally invertible away from a null set, lengths/areas are well-defined up to the standard Jacobian factors used in map production.
This instantiation quantifies (i) required shelter capacity relative to and (ii) corridor throughput via embedded network geometry, enabling data-driven evacuation timing analyses.
2.2. HyperGeography
HyperGeography extends Geography by treating sets of atomic regions as hyperregions and using a hyperoperation to generate partitions of their union.
Definition 11 (HyperGeography).
Fix a countable family of atomic regions
such that
and are μ-almost disjoint for . Set the hyperregion universe
to be the nonempty powerset
Define the region hyperoperation
by
Equivalently,
(Thus returns all finite admissible partitions of the geometric union by atoms from S, including the coarse partition whenever ; if not, the set is still an element of because .)
Let denote the set of typed geometric features as in Definition 10(G2); we allow hyperattachment
to hyperregions via measurable maps
For spatial attributes, let be an index set and for each fix a measurable field as in (G3). For numeric attributes take and assume . Define the attribute hypervaluation
on hyperregions:
(Other admissible weightings can be inserted; this simple choice suffices for our theorems.)
Define the hypernetwork
by taking with and
and embed in M by chosen, e.g., as the μ-barycenter of and edges mapped to rectifiable curves contained in a small tubular neighborhood of .
A HyperGeography
is the tuple
Remark 2 (Well-definedness). (i) because and . (ii) is nonempty since and we can choose any measurable with . (iii) is well-defined because and have finite -measure whenever and are finite unions of finite-perimeter atoms.
Example 8 (Multi-district hospital catchment as a hyperregion). We build a concrete HyperGeography on a city partitioned into atomic districts.
Atoms and measure. Let be a bounded open set with Euclidean metric g, Borel σ-algebra Σ, and area measure μ. Fix the atomic family with
finite-perimeter boundaries , and pairwise μ-almost disjoint interiors. Assume adjacencies
and all other pairs non-adjacent.
Hyperregions and hyperoperation. The hyperregion universe is . Consider two (possibly disconnected) service catchments:
Their union in the ground space is (area km2). By Definition 11,
so the fine
partition is a valid hyperselection; any other finite atom-cover of is also admissible.
Attributes and hypervaluation. Let population density be piecewise constant (persons/km2):
Then regional populations on the atoms are
For the hyperregion , the classical
average density is
By Definition of ,
since choosing (resp. ) realizes the lower (resp. upper) endpoint.
If the expected monthly visit rate is visits/person/month, then the hyperregion’s total
baseline demand is
This number is independent of the chosen hyperselection because it depends only on the ground-space union .
Hypernetwork. Vertices are all hyperregions . In particular,
since and . Thus a path exists within the hypernetwork, even though the service hyperregion is disconnected in the ground space.
Example 9 (Renewable-energy siting across disjoint ridges). We model a wind-farm siting problem where a developer considers two separated ridges and a transmission corridor.
Atoms and adjacencies. Let with areas
and adjacencies , , all other pairs non-adjacent.
Hyperregions. Let the candidate generation sites be the two ridges
and the supporting transmission/buffer corridor be
Then (area km2), and by Definition 11
with all other finite atom-covers of the same union also admissible hyperselections.
Attributes and hypervaluation. Define wind-energy density (MWh/km2/day) as
The average
wind density over the generation hyperregion X is
The corresponding daily potential on X is MWh/day, and over a 30-day month this is MWh.
By hypervaluation,
with endpoints realized by and , respectively. For the combined siting-and-corridor hyperregion , the hypervaluation enlarges to
since one may choose (or ) yielding zero average, showing how corridor inclusion affects averaged density though not the total
potential restricted to X.
Hypernetwork and routing. In the hypernetwork , the vertices and are adjacent, as are and ; thus any hyperselection contains an embedded path from the generation atoms to the corridor atoms along shared positive-length boundaries, which represents feasible interconnections without leaving .
Operation invariants. For all , the ground-space union is fixed: . Hence any quantity expressible as an integral over (e.g. land take, environmental footprint governed by a density field) is invariant under the choice of hyperselection Z. Only how the union is partitioned (e.g. for permitting or ownership) varies.
Theorem 1 (Region layer of HyperGeography is a HyperStructure).
Let be as in Definition 11. Then
is a HyperStructure in the sense of the Definition.
Proof. By construction, is nonempty. For any , the set is nonempty because and by definition. Moreover since every is a nonempty finite subfamily of S. Hence is a hyperoperation on , proving that is a HyperStructure. □
Definition 12 (Canonical embedding of regions).
Given a Geography as in Definition 10, set (the measurable partition of M). Let and as in Definition 11. Define the singleton embedding
Lemma 1 (Compatibility of union and hyperunion).
For any one has
and
Proof. By Definition 11, always contains . Taking and gives the first claim. The second identity holds because . □
Theorem 2 (HyperGeography generalizes Geography). Let be a Geography. Construct from by taking and defining , , , and as in Definition 11. Then:
- (a)
Region recovery.
The map in Definition 12 is injective and
- (b)
-
Adjacency recovery.
For ,
so adjacency in is exactly the edge relation between and in .
- (c)
-
Attribute recovery. For any numeric attribute and any with ,
so the classical region-average is an element of the hypervaluation set.
- (d)
-
Union is a hyperselection. For there exists a canonical selection
map
Hence the ordinary union of regions is recovered as a deterministic choice inside the hyperunion.
Consequently, the composite
identifies with the singleton slice
of , and strictly generalizes by allowing operations and evaluations on arbitrary hyperregions (finite unions of atoms) rather than only single regions .
Proof. (a) Injectivity of is immediate: if then , so . Also .
(b) Using (a) and Definition 10(G1), adjacency means . Since and , the stated equivalence follows.
(c) By Definition 11, for
we may choose the admissible measurable set
; then
(d) By definition, , so for and , and . This shows that ordinary union is realized as a distinguished element of the hyperunion, proving that classical region algebra sits inside the hyperalgebra by a canonical choice. □
2.3. (m,n)-SuperHyperGeography
We formalize an (m,n)-SuperHyperGeography, show that its region layer is an -SuperHyperStructure, and prove that it strictly generalizes the HyperGeography introduced earlier.
Let
be as in Definition 10 with measurable region partition
and let
be a fixed countable family of
atomic regions such that
and distinct atoms are
-almost disjoint. To control regularity, we also track the
atomic support of a
k-level object.
Definition 13 (Atomic support and flattening).
Define recursively the atom map
and the flattening
by
We say is support-finite
if is finite; write for the set of support-finite k-level objects.
Example 10 (Atomic support and flattening at level
).
Let be equipped with the Borel σ-algebra Σ and the Lebesgue area measure μ. Fix three pairwise disjoint measurable atoms
with
Consider the level-2 object
Compute the atomic support and flattening:
1) Atomic support:
Thus X is support-finite and .
2) Flattening:
Since are pairwise disjoint,
This explicitly shows how a level-2 object X induces its atom set and the corresponding ground-set region .
Definition 14 (Canonical nesting of atoms).
For any nonempty finite define the nesting
by
Then, by immediate induction,
Example 11 (Canonical nesting of atoms and its identities).
Retain the measurable atoms from above, with the same areas, and let
For the canonical nesting is
We verify the identities in (1):
2) Flattening:
If A and C are disjoint, then
Hence, concretely, and hold for , illustrating the general formula.
Definition 15 ((m,n)-SuperHyperGeography).
Fix integers . The (m,n)-SuperHyperGeography
associated with and atom set S is the tuple
where:
- (a)
and are the domains/codomains of m- and n-level superobjects.
- (b)
-
The region superhyperoperation
(binary, for definiteness)
Equivalently, returns all n-level finite packings by atoms from whose geometric union equals .
- (c)
For each geometric feature as in (G2) define the hyperattachment
- (d)
For a numeric attribute , define the level-
m hypervaluation
- (e)
-
The level-
m hypernetwork
has
embedded in M by barycenters/rectifiable arcs along shared boundaries, as in HyperGeography.
Remark 3 (Nonemptiness and locality).
For any , the finite set yields
so ; hence the operation is well-defined and nonempty. All constructions depend only on atoms intersecting (locality).
Example 12 ((2,1)-SuperHyperGeography: multi-agency relief bundles). We instantiate with to model bundles of service areas proposed by two agencies and their induced single-layer deployment domain.
Ground and atoms. Let be a bounded urban region with Euclidean metric g, Borel σ-algebra Σ, and area measure μ. Fix finite atoms with finite-perimeter boundaries and areas (km2)
pairwise μ-almost disjoint. Define a population-density field (persons/km2), piecewise constant on atoms:
Level-2 superregions (bundles). Work in . Consider two agencies’ activation bundles
By Definition 13, , and
Hence and (km2).
(2,1)-superhyperoperation. By (2)–(3), is the nonempty set of such that
A canonical witness is
and by (1) one has .
Concrete calculations (population and demand). Atomic populations are
Thus
The average density on the combined deployment domain is
If each person requires relief kits per month, the baseline monthly demand is
By (4), the level-2 hypervaluation over X yields the envelope
realized by and , respectively; for the envelope expands to . Importantly, any induces the same ground union and hence the same D; only the partitioning
differs (e.g., for contracting or governance).
Example 13 ((1,2)-SuperHyperGeography: logistics hub governance scenarios). We instantiate with to represent site alternatives at level 1 and the induced portfolio of governance partitions at level 2.
Ground, atoms, and capacity field. Let with areas (km2)
Define a throughput-capacity density (trucks/day/km2),
Level-1 hyperregions (site selections). Work in and take
Then , and, by Definition 13,
(1,2)-superhyperoperation and admissible outputs. By (3), consists of level-2 objects with
Examples (all valid):
By (1), each has while encoding different governance/ownership partitions at level 2.
Concrete calculations (throughput). Total daily throughput (as an integral of ) over the ground union is
Average capacity density over the union is
By (4) with ,
with the endpoints realized on and , respectively. Note that and the total are invariant
across all , since they depend only on the flattened ground union; what changes across is the second-order organization (single operator vs. two-tier vs. fully disaggregated management).
Theorem 3 ((m,n)-SuperHyperStructure representation).
For fixed , the pair
is an (m,n)-SuperHyperStructure
(with arity ) on the base set S.
Proof. By definition,
and the codomain in (
2) is a nonempty subset of
. For any
, the witness
(see (
1)) satisfies the two constraints in (
3), so
and
. Hence
is a well-defined
-SuperHyperOperation on
S. Therefore
is an
-SuperHyperStructure. □
Lemma 2 (Level-1 identification).
For all one has
Proof. When , is the identity on and is geometric union of atoms. Thus both definitions coincide verbatim. □
Definition 16 (Canonical embedding into level
m).
Define by
By (1), and .
Theorem 4 (SuperHyperGeography generalizes HyperGeography). Let be the HyperGeography built on S, and let be as in Definition 15. Then:
- (a)
Exact recovery at level (1,1).
By Lemma 2, and have the same region universe and the same hyperoperation.
- (b)
-
Embedding of HyperGeography into level m. The map is injective and satisfies
hence adjacency and attribute evaluations are preserved:
- (c)
-
Hyperoperation compatibility.
For all ,
and its flattening satisfies
so the level-m superhyperoperation projects to the same geometric union as in HyperGeography.
Therefore, strictly generalizes HyperGeography by allowing operations/evaluations on m-level superregions with n-level outputs, while recovering the classical case at .
Proof. (a) is Lemma 2. For (b), injectivity of
is immediate from Definition 14, and the stated equalities follow from (
1). The adjacency equivalence uses those equalities and Definition 10(G1). For the attribute statement, take
and choose
in (
4) to obtain the classical region average as an element of
.
For (c), using Definition 15 and (
1),
thus the candidate
satisfies
and
Hence
, proving (
5). □
3. Conclusions
In this paper, we examined the viability of employing Hyperstructures and SuperHyperstructures to define
HyperGeography and
SuperHyperGeography, and we offered a concise discussion that included potential applications. Looking ahead, we hope to see broader set-theoretic extensions of the concepts introduced here, including Fuzzy Sets [
42,
43], Intuitionistic Fuzzy Sets [
44], HyperFuzzy Sets [
45,
46], Soft Sets [
47,
48] and HyperSoft Sets [
49,
50], Rough Sets [
51,
52] and HyperRough Sets [
53], Neutrosophic Sets [
54,
55], and Plithogenic Sets [
56,
57]. For example, I would like to explore whether concepts such as Fuzzy Geography (cf.[
58,
59,
60]), Neutrosophic Geography[
61,
62], and Rough Geography[
63,
64] can be integrated with the ideas of
HyperGeography and
SuperHyperGeography, in order to identify new characteristics or potential applications.
Funding
No external funding was received for this work.
Institutional Review Board Statement
This research did not involve human participants or animals, and therefore did not require ethical approval.
Data Availability Statement
This paper is theoretical and did not generate or analyze any empirical data. We welcome future studies that apply and test these concepts in practical settings.
Acknowledgments
We thank all colleagues, reviewers, and readers whose comments and questions have greatly improved this manuscript. We are also grateful to the authors of the works cited herein for providing the theoretical foundations that underpin our study. Finally, we appreciate the institutional and technical support that enabled this research.
Research Integrity
The author confirms that this manuscript is original, has not been published elsewhere, and is not under consideration by any other journal.
Use of Computational Tools
All proofs and derivations were performed manually; no computational software (e.g., Mathematica, SageMath, Coq) was used.
Code Availability
No code or software was developed for this study.
Use of Generative AI and AI-Assisted Tools
We use generative AI and AI-assisted tools for tasks such as English grammar checking, and We do not employ them in any way that violates ethical standards.
Conflicts of Interest
The authors declare no conflicts of interest regarding the publication of this work.
References
- Al Tahan, M.; Davvaz, B. Weak chemical hyperstructures associated to electrochemical cells. Iranian Journal of Mathematical Chemistry 2018, 9, 65–75. [Google Scholar] [CrossRef]
- Oguz, G.; Davvaz, B. Soft topological hyperstructure. J. Intell. Fuzzy Syst. 2021, 40, 8755–8764. [Google Scholar] [CrossRef]
- Kamporoudi, P.; Vougiouklis, T. Cyclicity in some classes of Hv-groups. Journal of Algebraic Hyperstructures and Logical Algebras 2020, 1, 91–97. [Google Scholar] [CrossRef]
- Vougiouklis, T. Fundamental relations in Hv-structures. The’Judging from the results’ proof. Journal of Algebraic Hyperstructures and Logical Algebras 2020, 1, 21–36. [Google Scholar] [CrossRef]
- Davvaz, B. Weak algebraic hyperstructures as a model for interpretation of chemical reactions. Iranian Journal of Mathematical Chemistry 2016, 7, 267–283. [Google Scholar]
- Davvaz, B.; Vougiouklis, T. Walk Through Weak Hyperstructures, A: Hv-structures; World Scientific, 2018.
- Agusfrianto, F.A.; Andromeda, S.; Hariri, M. Hyperstructures in Chemical Hyperstructures of Redox Reactions with Three and Four Oxidation States. JTAM (Jurnal Teori dan Aplikasi Matematika) 2024, 8, 50. [Google Scholar] [CrossRef]
- Chung, S.C. Chemical Hyperstructures for Ozone Depletion. Journal of the Chungcheong Mathematical Society 2019, 32, 491–508. [Google Scholar] [CrossRef]
- Chung, S.C.; Chun, K.M. Chemical Hyperstructures For Stratospheric Ozone Depletion. Journal of the Chungcheong Mathematical Society 2020, 33, 469–487. [Google Scholar]
- Chun, K.M. Chemical hyperstructures of chemical reactions for iron and indium. Journal of the Chungcheong Mathematical Society 2014, 27, 319–319. [Google Scholar] [CrossRef]
- Smarandache, F. SuperHyperStructure & Neutrosophic SuperHyperStructure, 2024. Accessed: 2024-12-01.
- Fujita, T. Medical SuperHyperStructure and Healthcare SuperHyperStructure. Journal of Medicine and Health Research 2025, 10, 243–262. [Google Scholar] [CrossRef]
- Fujita, T. HyperFuzzy and SuperHyperFuzzy Group Decision-Making. Spectrum of Decision Making and Applications 2025, pp. 1–18. [CrossRef]
- Hamidi, M.; Smarandache, F.; Davneshvar, E. Spectrum of superhypergraphs via flows. Journal of Mathematics 2022, 2022, 9158912. [Google Scholar] [CrossRef]
- Smarandache, F. Extension of HyperGraph to n-SuperHyperGraph and to Plithogenic n-SuperHyperGraph, and Extension of HyperAlgebra to n-ary (Classical-/Neutro-/Anti-) HyperAlgebra; Infinite Study, 2020.
- Hamidi, M.; Taghinezhad, M. Application of Superhypergraphs-Based Domination Number in Real World; Infinite Study, 2023.
- Street, J.E.S.I.; Salambay, K.M.D.S.; Yumbo, J.A.V.; Azogue, K.C.C. Intercultural Education from Ancestral Logic: Application of the Ayni Method Multi-Neutrosophic to Strengthen Mixed Methodology in the Waorani Community. Neutrosophic Sets and Systems 2025, 92, 263–283. [Google Scholar]
- Ghods, M.; Rostami, Z.; Smarandache, F. Introduction to Neutrosophic Restricted SuperHyperGraphs and Neutrosophic Restricted SuperHyperTrees and several of their properties. Neutrosophic Sets and Systems 2022, 50, 480–487. [Google Scholar]
- Jech, T. Set theory: The third millennium edition, revised and expanded; Springer, 2003.
- Smarandache, F. Foundation of SuperHyperStructure & Neutrosophic SuperHyperStructure. Neutrosophic Sets and Systems 2024, 63, 21. [Google Scholar]
- Smarandache, F. Introduction to SuperHyperAlgebra and Neutrosophic SuperHyperAlgebra. Journal of Algebraic Hyperstructures and Logical Algebras 2022. [Google Scholar] [CrossRef]
- Fujita, T. Similarity HyperGraph and Similarity SuperHyperGraph in Medical Science. Current Research in Interdisciplinary Studies 2025, 4, 1–11. [Google Scholar] [CrossRef]
- Das, A.K.; Das, R.; Das, S.; Debnath, B.K.; Granados, C.; Shil, B.; Das, R. A Comprehensive Study of Neutrosophic SuperHyper BCI-Semigroups and their Algebraic Significance. Transactions on Fuzzy Sets and Systems 2025, 8, 80. [Google Scholar] [CrossRef]
- Fujita, T.; Smarandache, F. A Unified Framework for U-Structures and Functorial Structure: Managing Super, Hyper, SuperHyper, Tree, and Forest Uncertain Over/Under/Off Models. Neutrosophic Sets and Systems 2025, 91, 337–380. [Google Scholar]
- Vougioukli, S. HELIX-HYPEROPERATIONS ON LIE-SANTILLI ADMISSIBILITY. Algebras Groups and Geometries 2023. [Google Scholar] [CrossRef]
- Vougioukli, S. Helix hyperoperation in teaching research. Science & Philosophy 2020, 8, 157–163. [Google Scholar] [CrossRef]
- Vougioukli, S. Hyperoperations defined on sets of S -helix matrices. 2020.
- Vougiouklis, T. Hyperstructures and their representations; Hadronic Press, 1994.
- Corsini, P.; Leoreanu, V. Applications of hyperstructure theory; Vol. 5, Springer Science & Business Media, 2013.
- Khalid, H.E.; Gungor, G.D.; Zainal, M.A.N. Neutrosophic SuperHyper Bi-Topological Spaces: Original Notions and New Insights. Neutrosophic Sets and Systems 2022, 51, 33–45. [Google Scholar]
- Smarandache, F. Extension of HyperAlgebra to SuperHyperAlgebra and Neutrosophic SuperHyperAlgebra (Revisited). In Proceedings of the International Conference on Computers Communications and Control. Springer, 2022, pp. 427–432.
- Fujita, T.; Mehmood, A.; Ghaib, A.A. HyperFuzzy Control System and SuperHyperFuzzy Control System. Smart Multi-Criteria Analytics and Reasoning Technologies 2025, 1, 1–21. [Google Scholar]
- Smarandache, F. SuperHyperFunction, SuperHyperStructure, Neutrosophic SuperHyperFunction and Neutrosophic SuperHyperStructure: Current understanding and future directions; Infinite Study, 2023.
- Krugman, P. The role of geography in development. International regional science review 1999, 22, 142–161. [Google Scholar] [CrossRef]
- Foucault, M.; Gordon, C. Questions on geography. In Space, knowledge and power; Routledge, 2016; pp. 173–182.
- Gallup, J.L.; Sachs, J.D.; Mellinger, A.D. Geography and economic development. International regional science review 1999, 22, 179–232. [Google Scholar] [CrossRef]
- Council, N.R.; on Earth, D.; on Geosciences, C.; Committee, R.G. Rediscovering geography: New relevance for science and society; National Academies Press, 1997.
- Redding, S.J. Trade and geography. Handbook of International Economics 2022, 5, 147–217. [Google Scholar] [CrossRef]
- Krugman, P.R. Development, geography, and economic theory; Vol. 6, MIT press, 1997.
- King, C.A. Mathematics in geography. International Journal of Mathematical Education in Science and Technology 1970, 1, 185–205. [Google Scholar] [CrossRef]
- Fujita, T. Exploring a unified expression of many types of philosophies and structures. philpapers.org 2025. [Google Scholar]
- Zadeh, L.A. Fuzzy sets. Information and control 1965, 8, 338–353. [Google Scholar] [CrossRef]
- Rosenfeld, A. Fuzzy graphs. In Fuzzy sets and their applications to cognitive and decision processes; Elsevier, 1975; pp. 77–95.
- Atanassov, K.T. Circular intuitionistic fuzzy sets. Journal of Intelligent & Fuzzy Systems 2020, 39, 5981–5986. [Google Scholar] [CrossRef]
- Ghosh, J.; Samanta, T.K. Hyperfuzzy sets and hyperfuzzy group. Int. J. Adv. Sci. Technol 2012, 41, 27–37. [Google Scholar]
- Song, S.Z.; Kim, S.J.; Jun, Y.B. Hyperfuzzy ideals in BCK/BCI-algebras. Mathematics 2017, 5, 81. [Google Scholar] [CrossRef]
- Maji, P.K.; Biswas, R.; Roy, A.R. Soft set theory. Computers & mathematics with applications 2003, 45, 555–562. [Google Scholar] [CrossRef]
- Jose, J.; George, B.; Thumbakara, R.K. Soft directed graphs, their vertex degrees, associated matrices and some product operations. New Mathematics and Natural Computation 2023, 19, 651–686. [Google Scholar] [CrossRef]
- Smarandache, F. Extension of soft set to hypersoft set, and then to plithogenic hypersoft set. Neutrosophic sets and systems 2018, 22, 168–170. [Google Scholar]
- Smarandache, F. New types of soft sets “hypersoft set, indetermsoft set, indetermhypersoft set, and treesoft set”: an improved version; Infinite Study, 2023.
- Pawlak, Z. Rough sets. International journal of computer & information sciences 1982, 11, 341–356. [Google Scholar]
- Broumi, S.; Smarandache, F.; Dhar, M. Rough neutrosophic sets. Infinite Study 2014, 32, 493–502. [Google Scholar]
- Fujita, T. Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond; Biblio Publishing, 2025.
- Wang, H.; Smarandache, F.; Zhang, Y.; Sunderraman, R. Single valued neutrosophic sets; Infinite study, 2010.
- Broumi, S.; Talea, M.; Bakali, A.; Smarandache, F. Single valued neutrosophic graphs. Journal of New theory 2016, pp. 86–101.
- Smarandache, F. Plithogenic set, an extension of crisp, fuzzy, intuitionistic fuzzy, and neutrosophic sets-revisited; Infinite study, 2018.
- Sultana, F.; Gulistan, M.; Ali, M.; Yaqoob, N.; Khan, M.; Rashid, T.; Ahmed, T. A study of plithogenic graphs: applications in spreading coronavirus disease (COVID-19) globally. Journal of ambient intelligence and humanized computing 2023, 14, 13139–13159. [Google Scholar] [CrossRef]
- Robinson, V.B. A perspective on the fundamentals of fuzzy sets and their use in geographic information systems. Transactions in GIS 2003, 7, 3–30. [Google Scholar] [CrossRef]
- Wang, F.; Hall, G.B. Fuzzy representation of geographical boundaries in GIS. International journal of geographical information systems 1996, 10, 573–590. [Google Scholar] [CrossRef]
- Petry, F.E.; Robinson, V.B.; Cobb, M.A.; et al. Fuzzy modeling with spatial information for geographic problems; Springer, 2005.
- Meng, Q.; Pang, N.; Zhao, S.; Gao, J. Two-stage optimal site selection for waste-to-energy plant using single-valued neutrosophic sets and geographic information system based multi-criteria decision-making approach: a case study of Beijing, China. Waste Management 2023, 156, 283–296. [Google Scholar] [CrossRef]
- Salama, A.; Bhatnagar, R.; Alharthi, N.; Tolba, R.; Shams, M.Y. Neutrosophic Fuzzy Data Science and Addressing Research Gaps in Geographic Data and Information Systems. In Proceedings of the International Conference on Intelligence of Things. Springer, 2023, pp. 128–139.
- Ahlqvist, O.; Keukelaar, J.; Oukbir, K. Rough and fuzzy geographical data integration. International Journal of Geographical Information Science 2003, 17, 223–234. [Google Scholar] [CrossRef]
- Shuliang, W.; Deren, L.; Wenzhong, S.; Xinzhou, W. Geo-rough space. Geo-Spatial Information Science 2003, 6, 54–61. [Google Scholar] [CrossRef]
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).