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]

This paper proposes a novel approach to cope with the multi-criteria group decision-making problems. We give the pairwise comparisons based on the best-worst-method (BWM), which can decrease comparison times. Additionally, our comparison results are determined with the positive and negative aspects. In order to deal with the decision matrices effectively, we consider the elimination and choice translation reality (ELECTRE III) method under the intuitionistic multiplicative preference relations environment. The ELECTRE III method is designed for a double-automatic system. Under a certain limitation, without bothering the decision-makers to reevaluate the alternatives, this system can adjust some special elements that have the most influence on the group's satisfaction degree. Moreover, the proposed method is suitable for both the intuitionistic multiplicative preference relation and the interval valued fuzzy preference relations through the transformation formula. An illustrative example is followed to demonstrate the rationality and availability of the novel method. [ABSTRACT FROM AUTHOR]

The complexity of a mathematical expression is a measure that can be used to compare the expression with other mathematical expressions and judge which one is simpler. In the paper, we analyze three effect factors for the complexity of a mathematical expression: representational length, computational time, and intelligibility. Mainly, the paper introduces a binary-lambda-calculus based calculation method for representational complexity and a rule based calculation method for algebraic computation complexity. In the process of calculating the representation complexity of mathematical expressions, we transform the de bruijn notation into the binary lambda calculus of mathematical expressions that is inspired by compressing symmetry strings in Kolmogorov complexity theorem. Furthermore, the application of complexity of mathematical expressions in MACP, a mathematics answer checking protocol, is also addressed. MACP can be used in a computer aided assessment system in order to compute correct answers, verify equivalence of expressions, check user answers whether in a simplification form, and give automatic partial grades. [ABSTRACT FROM AUTHOR]

Recently, Kim-Kim (J. Math. Anal. Appl. (2021), Vol. 493(1), 124521) introduced the λ -Sheffer sequence and the degenerate Sheffer sequence. In addition, Kim et al. (arXiv:2011.08535v1 17 November 2020) studied the degenerate derangement polynomials and numbers, and investigated some properties of those polynomials without using degenerate umbral calculus. In this paper, the y the degenerate derangement polynomials of order s ( s ∈ N ) and give a combinatorial meaning about higher order derangement numbers. In addition, the author gives some interesting identities related to the degenerate derangement polynomials of order s and special polynomials and numbers by using degenerate Sheffer sequences, and at the same time derive the inversion formulas of these identities. [ABSTRACT FROM AUTHOR]

Kim and Kim (Russ. J. Math. Phys. 26, 2019, 40-49) introduced polyexponential function as an inverse to the polylogarithm function and by this, constructed a new type poly-Bernoulli polynomials. Recently, by using the polyexponential function, a number of generalizations of some polynomials and numbers have been presented and investigated. Motivated by these researches, in this paper, multi-poly-Euler polynomials are considered utilizing the degenerate multiple polyexponential functions and then, their properties and relations are investigated and studied. That the type 2 degenerate multi-poly-Euler polynomials equal a linear combination of the degenerate Euler polynomials of higher order and the degenerate Stirling numbers of the first kind is proved. Moreover, an addition formula and a derivative formula are derived. Furthermore, in a special case, a correlation between the type 2 degenerate multi-poly-Euler polynomials and degenerate Whitney numbers is shown. [ABSTRACT FROM AUTHOR]

It is the intention of the current study to suggest a trajectory for the advancement of prospective mathematics teachers' use of meta-cognitive skills in solving mathematics-based programming problems with Scratch. Scratch is a code-based program that can be utilized in teaching various disciplines, especially geometry and its rich range of subjects such as the topic of symmetry. The present study suggests that advancing prospective teachers' meta-cognitive skills in the Scratch environment could be done through problem solving and negotiations. The present paper analyzed the implementation of the trajectory by two pedagogic supervisors who attempted, in the frame of one-year preparation (2018–2019), to educate 18 prospective teachers to use meta-cognitive skills in mathematics-based programming activities, where this attempt was based on problem solving and negotiation processes. Data were collected through videoing and recording the learning sessions of the prospective teachers and was analyzed using deductive and inductive constant comparison methods. The deductive analysis utilized theoretical models of meta-cognitive processes and negotiation processes. The research results indicated that the negotiation processes supported the development of the prospective teachers' meta-cognitive processes in solving mathematics-based programming problems with Scratch. [ABSTRACT FROM AUTHOR]

Let ST L (s) and CV L (s) denote the family of analytic and normalized functions f in the unit disk D : = z : | z | < 1 , such that the quantity z f ′ (z) / f (z) or 1 + z f ″ (z) / f ′ (z) respectively are lying in the region bounded by the limaçon (u − 1) 2 + v 2 − s 4 2 = 4 s 2 u − 1 + s 2 2 + v 2 , where 0 < s ≤ 1 / 2 . The limaçon of Pascal is a curve that possesses properties which qualify it for the several applications in mathematics, statistics (hypothesis testing problem) but also in mechanics (fluid processing applications, known limaçon technology is employed to extract electrical power from low-grade heat, etc.). In this paper we present some results concerning the behavior of f on the classes ST L (s) or CV L (s) . Some appropriate examples are given. [ABSTRACT FROM AUTHOR]

In 1984, Wang and Zheng (J. Comput. Math. 1984, 1, 70–76) introduced a new fourth order iterative method for the simultaneous computation of all zeros of a polynomial. In this paper, we present new local and semilocal convergence theorems with error estimates for Wang–Zheng's method. Our results improve the earlier ones due to Wang and Wu (Computing 1987, 38, 75–87) and Petković, Petković, and Rančić (J. Comput. Appl. Math. 2007, 205, 32–52). [ABSTRACT FROM AUTHOR]

In this paper, we bring together two concepts related to uncertainty and vagueness: fuzzy numbers and intervals. With them, we build a new structure whose elements we call interval fuzzy segments. We have undertaken this based on the conviction that the fuzzy numbers are a correct representation of the real numbers under situations of indeterminacy. We also believe that if it makes sense to consider the set of real numbers between two real bounds, then it also makes sense to consider the set of all the fuzzy numbers between two fuzzy number bounds. In this way, we extend the concept of real interval to the concept of interval fuzzy segment defined by two fuzzy bounds and a transition mapping that leads from the lower fuzzy bound to the upper fuzzy bound and this transition mapping generates the set of all the fuzzy numbers comprised between those fuzzy bounds. At the same time, this transition mapping brings the concept of interval fuzzy segment closer to the concept of line segment. [ABSTRACT FROM AUTHOR]