Search

In this paper, a new full-Newton step feasible interior-point method for convex quadratic programming is presented and analyzed. The idea behind this method is to replace the complementarity condition with a non-negative weight vector and use the algebraic equivalent transformation for the obtained equation. Under the selection of appropriate parameters, the quadratic rate of convergence of the new algorithm is established. In addition, the iteration complexity of the algorithm is obtained. Finally, some numerical results are presented to demonstrate the practical performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

In this article, we define q-cosine and q-sine Apostol-type Frobenius–Euler polynomials and derive interesting relations. We also obtain new properties by making use of power series expansions of q-trigonometric functions, properties of q-exponential functions, and q-analogues of the binomial theorem. By using the Mathematica program, the computational formulae and graphical representation for the aforementioned polynomials are obtained. By making use of a partial derivative operator, we derived some interesting finite combinatorial sums. Finally, we detail some special cases for these results. [ABSTRACT FROM AUTHOR]

Let S (m , e) be a class of numerical semigroups with multiplicity m and embedding dimension e. We call a graph G S an S (m , e) -graph if there exists a numerical semigroup S ∈ S (m , e) with V (G S) = { x : x ∈ g (S) } and E (G S) = { x y ⇔ x + y ∈ S } , where g (S) denotes the gap set of S. The aim of this article is to discuss the planarity of S (m , e) -graphs for some cases where S is an irreducible numerical semigroup. [ABSTRACT FROM AUTHOR]

The telescopic numerical semigroups are a subclass of symmetric numerical semigroups widely used in algebraic geometric codes. Suer and Ilhan gave the classification of triply generated telescopic numerical semigroups up to multiplicity 10 and by using this classification they computed some important invariants in terms of the minimal system of generators. In this article, we extend the results of Suer and Ilhan for telescopic numerical semigroups of multiplicities 8 and 12 with embedding dimension four. Furthermore, we compute two important invariants namely the Frobenius number and genus for these classes in terms of the minimal system of generators. [ABSTRACT FROM AUTHOR]

A total k-rainbow dominating function on a graph G = (V , E) is a function f : V (G) → 2 { 1 , 2 , ... , k } such that (i) ∪ u ∈ N (v) f (u) = { 1 , 2 , ... , k } for every vertex v with f (v) = ∅ , (ii) ∪ u ∈ N (v) f (u) ≠ ∅ for f (v) ≠ ∅ . The weight of a total 2-rainbow dominating function is denoted by ω (f) = ∑ v ∈ V (G) | f (v) | . The total k-rainbow domination number of G is the minimum weight of a total k-rainbow dominating function of G. The minimum total 2-rainbow domination problem (MT2RDP) is to find the total 2-rainbow domination number of the input graph. In this paper, we study the total 2-rainbow domination number of graphs. We prove that the MT2RDP is NP-complete for planar bipartite graphs, chordal bipartite graphs, undirected path graphs and split graphs. Then, a linear-time algorithm is proposed for computing the total k-rainbow domination number of trees. Finally, we study the difference in complexity between MT2RDP and the minimum 2-rainbow domination problem. [ABSTRACT FROM AUTHOR]

Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem. Another variant is the zero forcing problem. Determining minimum cardinality of a power dominating set and zero forcing set in a graph are the power domination problem and zero forcing problem, respectively. Both problems are N P -complete. In this paper, we compute the power domination number and the zero forcing number for fully connected cubic networks. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

Many problems of practical interest can be modeled and solved by using fuzzy graph (FG) algorithms. In general, fuzzy graph theory has a wide range of application in various fields. Since indeterminate information is an essential real-life problem and is often uncertain, modeling these problems based on FG is highly demanding for an expert. A vague graph (VG) can manage the uncertainty relevant to the inconsistent and indeterminate information of all real-world problems in which fuzzy graphs may not succeed in bringing about satisfactory results. Domination in FGs theory is one of the most widely used concepts in various sciences, including psychology, computer sciences, nervous systems, artificial intelligence, decision-making theory, etc. Many research studies today are trying to find other applications for domination in their field of interest. Hence, in this paper, we introduce different kinds of domination sets, such as the edge dominating set (EDS), the total edge dominating set (TEDS), the global dominating set (GDS), and the restrained dominating set (RDS), in product vague graphs (PVGs) and try to represent the properties of each by giving some examples. The relation between independent edge sets (IESs) and edge covering sets (ECSs) are established. Moreover, we derive the necessary and sufficient conditions for an edge dominating set to be minimal and show when a dominance set can be a global dominance set. Finally, we try to explain the relationship between a restrained dominating set and a restrained independent set with an example. Today, we see that there are still diseases that can only be treated in certain countries because they require a long treatment period with special medical devices. One of these diseases is leukemia, which severely affects the immune system and the body's defenses, making it impossible for the patient to continue living a normal life. Therefore, in this paper, using a dominating set, we try to categorize countries that are in a more favorable position in terms of medical facilities, so that we can transfer the patients to a suitable hospital in the countries better suited in terms of both cost and distance. [ABSTRACT FROM AUTHOR]

A new generation of universal tools and languages for modeling and simulation multi-physical domain applications has emerged and became widely accepted; they generate large-scale systems of differential algebraic equations (DAEs) automatically. Motivated by the characteristics of DAE systems with large dimensions, high index or block structures, we first propose a modified Pantelides' algorithm (MPA) for any high order DAEs based on the Σ matrix, which is similar to Pryce's Σ method. By introducing a vital parameter vector, a modified Pantelides' algorithm with parameters has been presented. It leads to a block Pantelides' algorithm (BPA) naturally which can immediately compute the crucial canonical offsets for whole (coupled) systems with block-triangular form. We illustrate these algorithms by some examples, and preliminary numerical experiments show that the time complexity of BPA can be reduced by at least O (ℓ) compared to the MPA, which is mainly consistent with the results of our analysis. [ABSTRACT FROM AUTHOR]

Fuzzy graph models enjoy the ubiquity of being present in nature and man-made structures, such as the dynamic processes in physical, biological, and social systems. As a result of inconsistent and indeterminate information inherent in real-life problems that are often uncertain, for an expert, it is highly difficult to demonstrate those problems through a fuzzy graph. Resolving the uncertainty associated with the inconsistent and indeterminate information of any real-world problem can be done using a vague graph (VG), with which the fuzzy graphs may not generate satisfactory results. The limitations of past definitions in fuzzy graphs have led us to present new definitions in VGs. The objective of this paper is to present certain types of vague graphs (VGs), including strongly irregular (SI), strongly totally irregular (STI), neighborly edge irregular (NEI), and neighborly edge totally irregular vague graphs (NETIVGs), which are introduced for the first time here. Some remarkable properties associated with these new VGs were investigated, and necessary and sufficient conditions under which strongly irregular vague graphs (SIVGs) and highly irregular vague graphs (HIVGs) are equivalent were obtained. The relation among strongly, highly, and neighborly irregular vague graphs was established. A comparative study between NEI and NETIVGs was performed. Different examples are provided to evaluate the validity of the new definitions. A new definition of energy called the Laplacian energy (LE) is presented, and its calculation is shown with some examples. Likewise, we introduce the notions of the adjacency matrix (AM), degree matrix (DM), and Laplacian matrix (LM) of VGs. The lower and upper bounds for the Laplacian energy of a VG are derived. Furthermore, this study discusses the VG energy concept by providing a real-time example. Finally, an application of the proposed concepts is presented to find the most effective person in a hospital. [ABSTRACT FROM AUTHOR]

If G is a graph, its Laplacian is the difference between the diagonal matrix of its vertex degrees and its adjacency matrix. A one-edge connection of two graphs G 1 and G 2 is a graph G = G 1 ⊙ u v G 2 with V (G) = V (G 1) ∪ V (G 2) and E (G) = E (G 1) ∪ E (G 2) ∪ { e = u v } where u ∈ V (G 1) and v ∈ V (G 2) . In this paper, we study some structural conditions ensuring the presence of 2 in the Laplacian spectrum of bicyclic graphs of type G 1 ⊙ u v G 2 . We also provide a condition under which a bicyclic graph with a perfect matching has a Laplacian eigenvalue 2. Moreover, we characterize the broken sun graphs and the one-edge connection of two broken sun graphs by their Laplacian eigenvalue 2. [ABSTRACT FROM AUTHOR]

Let Γ be a numerical semigroup. We associate an undirected graph G (Γ) with a numerical semigroup Γ with vertex set { v i : i ∈ N \ Γ } and edge set { v i v j ⇔ i + j ∈ Γ } . In this article, we discuss the connectedness, diameter, girth, and some other related properties of the graph G (Γ) . [ABSTRACT FROM AUTHOR]

An interesting and challenging problem in mathematics is how to construct fair dice pairs. In this paper, by means of decomposing polynomials in a residue class ring and applying the Discrete Fourier Transformation, we present all the 2000 fair dice pairs and their 8 equivalence classes in a four-person game, identifying what we call the mandarin duck property of fair dice pairs. [ABSTRACT FROM AUTHOR]

A double Roman dominating function (DRDF) f on a given graph G is a mapping from V (G) to { 0 , 1 , 2 , 3 } in such a way that a vertex u for which f (u) = 0 has at least a neighbor labeled 3 or two neighbors both labeled 2 and a vertex u for which f (u) = 1 has at least a neighbor labeled 2 or 3. The weight of a DRDF f is the value w (f) = ∑ u ∈ V (G) f (u) . The minimum weight of a DRDF on a graph G is called the double Roman domination number γ d R (G) of G. In this paper, we determine the exact value of the double Roman domination number of the generalized Petersen graphs P (n , 2) by using a discharging approach. [ABSTRACT FROM AUTHOR]