Intuitionistic fuzzy sets (IFS), Pythagorean fuzzy sets (PFS), and q-rung orthopair fuzzy sets (q-ROFS) are among those concepts which are widely used in real-world applications. However, these theories have their own limitations in terms of membership and non-membership functions, as they cannot be obtained from the whole unit plane. To overcome these restrictions, we developed the concept of a complex linear Diophantine fuzzy set (CLDFS) by generalizing the notion of a linear Diophantine fuzzy set (LDFS). This concept can be applied to real-world decision-making problems involving complex uncertain information. The main motivation behind this paper is to study the applications of CLDFS in a non-associative algebraic structure (AG-groupoid), which has received less attention as compared to associative structures. We characterize a strongly regular AG-groupoid in terms of newly developed CLDF-score left (right) ideals and CLDF-score $(0,2)$-ideals. Finally, we construct a novel approach to decision-making problems based on the proposed CLDF-score ideals, and some practical examples from civil engineering are considered to demonstrate the flexibility and clarity of the initiated CLDF-score ideals.

Predicates and rules are usually enclosed as built-in functions in automated geometry reasoning systems, meaning users cannot add any predicate or rule, thus resulting in a limited reasoning capability of the systems. A method for expanding predicates and rules in automated geometry reasoning systems is, thus, proposed. Specifically, predicate and rule descriptions are transformed to knowledge trees and forests based on formal representations of geometric knowledge, and executable codes are dynamically and automatically generated by using “code templates”. Thus, a transformation from controlled natural language descriptions to mechanization algorithms is completed, and finally, the dynamic expansion of predicates and rules in the reasoning system is achieved. Moreover, the method has been implemented in an automated geometry reasoning system for Chinese college entrance examination questions, and the practicality and effectiveness of the method were tested. In conclusion, the enclosed setting, which is a shortcoming of traditional reasoning systems, is avoided, the user-defined dynamic expansion of predicates and rules is realized, the application scope of the reasoning system is extended, and the reasoning capability is improved.

Many properties of special polynomials, such as recurrence relations, sum formulas, and symmetric properties, have been studied in the literature with the help of generating functions and their functional equations. In this paper, we define the generalized $(p,q)$-Bernoulli–Fibonacci and generalized $(p,q)$-Bernoulli–Lucas polynomials and numbers by using the $(p,q)$-Bernoulli numbers, unified $(p,q)$-Bernoulli polynomials, $h\left(x\right)$-Fibonacci polynomials, and $h\left(x\right)$-Lucas polynomials. We also introduce the generalized bivariate $(p,q)$-Bernoulli–Fibonacci and generalized bivariate $(p,q)$-Bernoulli–Lucas polynomials and numbers. Then, we derive some properties of these newly established polynomials and numbers by using their generating functions with their functional equations. Finally, we provide some families of bilinear and bilateral generating functions for the generalized bivariate $(p,q)$-Bernoulli–Fibonacci polynomials.

Interval-valued intuitionistic fuzzy graph (IVIFG), belonging to the FGs family, has good capabilities when facing with problems that cannot be expressed by FGs. When an element membership is not clear, neutrality is a good option that can be well supported by an IVIFG. The previous definitions of limitations in edge irregular FG have led us to offer new definitions in IVIFGs. Hence, in this paper, some types of edge irregular interval-valued intuitionistic fuzzy graphs (EI-IVIFGs) such as neighborly edge totally irregular (NETI), strongly edge irregular (SEI), and strongly edge totally irregular (SETI) are introduced. A comparative study between NEI-IVIFGs and NETI-IVIFGs is done. With the help of IVIFGs, the most efficient person in an organization can be identified according to the important factors that can be useful for an institution. Finally, an application of IVIFG has been introduced.

An important development in geometric algebra in recent years is the new system known as point geometry, which treats points as direct objects of operations and considerably simplifies the process of geometric reasoning. In this paper, we provide a complete formal description of the point geometry theory architecture and give a rigorous and reliable formal verification of the point geometry theory based on the theorem prover Coq. Simultaneously, a series of tactics are also designed to assist in the proof of geometric propositions. Based on the theoretical architecture and proof tactics, a universal and scalable interactive point geometry machine proof system, PointGeo, is built. In this system, any arbitrary point-geometry-solvable geometric statement may be proven, along with readable information about the solution’s procedure. Additionally, users may augment the rule base by adding trustworthy rules as needed for certain issues. The implementation of the system expands the library of Coq resources on geometric algebra, which will become a significant research foundation for the fields of geometric algebra, computer science, mathematics education, and other related fields.

In this manuscript, we introduce a few new types of dominations in intuitionistic fuzzy directed graphs (IFDGs) based on different types of strong arcs (SAs). Our work is not only a direct extension of domination in directed fuzzy graphs (DFGs) but also fills the gap that exists in the literature regarding the dominations in different extended forms of fuzzy graphs (FGs). In the beginning, we introduce several types of strong arcs in IFDGs, like semi-$\beta$ strong arcs, semi-$\delta$ strong arcs, etc. Then, we introduce the concepts of domination in IFDGs based on these strong arcs and discuss its various useful characteristics. Moreover, the dominating set (DS), minimal dominating set (MDS), etc., are described with some fascinating results. We also introduce the concept of an independent set in IFDGs and investigate its relations with the DS, minimal independent set (MIS) and MDS. We also provide numerous important characterizations of domination in IFDGs based on minimal and maximal dominating sets. In this context, we discuss the lower and upper dominations of some IFDGs. In addition, we introduce the terms status and structurally equivalent and examine a few relationships with the dominations in IFDGs. Finally, we investigate the most expert (influential) person in the organization by utilizing the concepts of domination in IFGs.