Search

The study of symmetry is a fascinating and unifying subject that connects various areas of mathematics in the twenty-first century. Algebraic structures offer a framework for comprehending the symmetries of geometric objects in pure mathematics. This paper introduces new concepts in algebraic structures, concentrating on semimodules over semirings and analysing the neutrosophic structure in this context. We explore the properties of neutrosophic subsemimodules and neutrosophic ideals after defining them. We discuss, utilizing neutrosophic products, the representations of neutrosophic ideals and subsemimodules, as well as the relationship between neutrosophic products and intersections. Finally, we derive equivalent criteria in terms of neutrosophic structures for a semiring to be fully idempotent. [ABSTRACT FROM AUTHOR]

This paper presents a survey of advanced concepts and research perspectives, of a philosophical-mathematical approach to describe the dynamics of systems of many interacting living entities. The first part introduces the general conceptual framework. Then, a critical analysis of the existing literature is developed and referred to a multiscale view of a mathematics of living organisms. This paper attempts to understand how far the present state-of-the-art is far from the achievement of such challenging objective. The overall study leads to identify research perspectives and possible hints to deal with them. [ABSTRACT FROM AUTHOR]

This paper introduces the concept of symmetric difference operators in terms of overlap and grouping functions, for which the associativity property is not strongly required. These symmetric difference operators are weaker than symmetric difference operators in terms of positive and continuous t-norms and t-conorms. Therefore, in the sense of the characters of mathematics, these operators do not necessarily satisfy certain properties, such as associativity and the neutrality principle. We analyze several related important properties based on two models of symmetric differences. [ABSTRACT FROM AUTHOR]

In recent years, the theory of convexity has influenced every field of mathematics due to its unique characteristics. Numerous generalizations, extensions, and refinements of convexity have been introduced, and one of them is set-valued convexity. Interval-valued convex mappings are a special type of set-valued maps. These have a close relationship with symmetry analysis. One of the important aspects of the relationship between convex and symmetric analysis is the ability to work on one field and apply its principles to another. In this paper, we introduce a novel class of interval-valued (I.V.) functions called CR - γ -convex functions based on a non-negative mapping γ and center-radius ordering relation. Due to its generic property, a set of new and known forms of convexity can be obtained. First, we derive new generalized discrete and integral forms of Jensen's inequalities using CR - γ -convex I.V. functions. We employ this definition and Riemann-Liouville fractional operators to develop new fractional versions of Hermite-Hadamard's, Hermite-Hadamard-Fejer, and Pachpatte's type integral inequalities. We examine various key properties of this class of functions by considering them as special cases. Finally, we support our findings with interesting examples and graphical representations. [ABSTRACT FROM AUTHOR]

In order to find solutions to math word problems, some modules have been designed to check the generated expressions, but they neither take into account the symmetry between math word problems and their corresponding mathematical expressions, nor do they utilize the efficiency of pretrained language models in natural language understanding tasks. Anyway, designing fine-tuning tasks for pretrained language models that encourage cooperation with other modules to improve the performance of math word problem solvers is an unaddressed problem. To solve these problems, in this paper we propose a BERT-based model for solving math word problems with a supervision module. Based on pretrained language models, we present a fine-tuning task to predict the number of different operators in the expressions to learn the potential relationships between the problems and the expressions. Meanwhile, a supervision module is designed to check the incorrect expressions generated and improve the model's performance by optimizing the encoder. A series of experiments are conducted on three datasets, and the experimental results demonstrate the effectiveness of our model and its component's designs. [ABSTRACT FROM AUTHOR]

A singular graph G, defined when its adjacency matrix is singular, has important applications in mathematics, natural sciences and engineering. The chemical importance of singular graphs lies in the fact that if the molecular graph is singular, the nullity (the number of the zero eigenvalue) is greater than 0, then the corresponding chemical compound is highly reactive or unstable. By this reasoning, chemists have a great interest in this problem. Thus, the problem of characterization singular graphs was proposed and raised extensive studies on this challenging problem thereafter. The graph obtained by conglutinating the starting vertices of three paths P s 1 , P s 2 , P s 3 into a vertex, and three end vertices into a vertex on the cycle C a 1 , C a 2 , C a 3 , respectively, is denoted as γ (a 1 , a 2 , a 3 , s 1 , s 2 , s 3) . Note that δ (a 1 , a 2 , a 3 , s 1 , s 2) = γ (a 1 , a 2 , a 3 , s 1 , 1 , s 2) , ζ (a 1 , a 2 , a 3 , s) = γ (a 1 , a 2 , a 3 , 1 , 1 , s) , φ (a 1 , a 2 , a 3) = γ (a 1 , a 2 , a 3 , 1 , 1 , 1) . In this paper, we give the necessity and sufficiency that the γ − graph, δ − graph, ζ − graph and φ − graph are singular and prove that the probability that a randomly given γ − graph, δ − graph, ζ − graph or φ − graph being singular is equal to 325 512 , 165 256 , 43 64 , 21 32 , respectively. From our main results, we can conclude that such a γ − graph( δ − graph, ζ − graph, φ − graph) is singular if at least one cycle is a multiple of 4 in length, and surprisingly, the theoretical probability of these graphs being singular is more than half. This result promotes the understanding of a singular graph and may be promising to propel the solutions to relevant application problems. [ABSTRACT FROM AUTHOR]

The study of symmetry is one of the most important and beautiful themes uniting various areas of contemporary arithmetic. Algebraic structures are useful structures in pure mathematics for learning a geometrical object's symmetries. In this paper, we introduce new concepts in an algebraic structure called BCI-algebra, where we present the concepts of bipolar fuzzy (closed) BCI-positive implicative ideals and bipolar fuzzy (closed) BCI-commutative ideals of BCI-algebras. The relationship between bipolar fuzzy (closed) BCI-positive implicative ideals and bipolar fuzzy ideals is investigated, and various conditions are provided for a bipolar fuzzy ideal to be a bipolar fuzzy BCI-positive implicative ideal. Furthermore, conditions are presented for a bipolar fuzzy (closed) ideal to be a bipolar fuzzy BCI-commutative ideal. [ABSTRACT FROM AUTHOR]

Recently in the paper [Mediterr. J. Math. 2016, 13, 1535–1553], the authors introduced and studied a new operator which was defined as a convolution of the three popular linear operators, namely the Sǎlǎgean operator, the Ruscheweyh operator and a fractional derivative operator. In the present paper, we consider an operator which is a convolution operator of only two linear operators (with lesser restricted parameters) that yield various well-known operators, defined by a symmetric way, including the one studied in the above-mentioned paper. Several results on the subordination of analytic functions to this operator (defined below) are investigated. Some of the results presented are shown to involve the familiar Appell function and Hurwitz–Lerch Zeta function. Special cases and interesting consequences being in symmetry of our main results are also mentioned. [ABSTRACT FROM AUTHOR]