Search

This paper presents a simplified model of the population migration problem, addressed to first-year engineering students in order to show them the use of linear algebra tools. The study consists of predicting the census in the city centre and in the suburbs, determining the city population equilibrium point, and making a sociological interpretation of population flows. This practical problem is part of the seminar "Applications of Linear Algebra in Engineering", which is being held at the Universitat Politècnica de Catalunya-BarcelonaTech (UPC). This seminar consists in the learning of linear algebra by the implementation of real applications where mathematical tools are required to resolve them. This paper presents an application of linear algebra to the population migration problem and analyses students' appreciation through anonymous surveys and personal interviews. The surveys assessed students' motivation towards the subject of linear algebra and their learning of mathematical concepts. Personal interviews were conducted for students in order to let them express in detail their opinion about the seminar. The results confirm that the introduction of real applications in the learning of mathematics increases students' motivation and involvement, which implies an improvement in students' performance in the first courses of STEM degrees. [ABSTRACT FROM AUTHOR]

The teaching characteristic of colleges and universities is determined by the teaching quality of teachers, but it is difficult to calculate with a linear mathematical explanation how to judge the teaching quality of teachers. In most colleges and universities, expert evaluations, supervision groups, peers listening to lectures in the classroom, and students' after-class evaluations are still used to determine the teaching ability of professors. It is undeniable that these judgment methods have certain practicality. Especially for new teachers, experts and peers can find problems in time and help new teachers quickly correct them, and they can also know how to better practice the "student-centered" teaching concept from the feedback of students after class. However, these judgment standards also have their limitations. For example, the classroom quality judgment standards for experts and peers are mostly set by some administrative departments according to social requirements, leadership requirements, and subjective cognition. Various institutions should have different weights for the same criterion, and if they all employ the same criteria, it will easily lead to imprecise conclusions. In addition, the expert group and students are also subjective and incomplete in the stage of teacher evaluation. Based on different nonquantitative factors, the evaluation standards for teachers in colleges and universities also need the scientific theoretical basis. Therefore, many scientists are considering whether to use a more intelligent and reasonable way to judge the quality of teaching. Nowadays, with the popularization of artificial intelligence (AI), the use of neural networks (NNs) is becoming more and more comprehensive. According to the characteristics of NNs, this paper uses the GA NNs algorithm to signify that this algorithm can be effectively used in the evaluation of teachers' teaching quality. In this paper, a large number of experimental results show that the use of GA NNs can be used to evaluate the quality of teaching, and the evaluation results can be obtained quantitatively in this way. For the assessment of teaching quality, quantitative results are also more powerful in teaching evaluation. [ABSTRACT FROM AUTHOR]

Conversations of educational equity in mathematics necessitate a more deliberate, nuanced look at the mathematical processes of learning for students of color from historically marginalized communities. This paper describes the theoretical work of a research collaborative that seeks to develop understanding of the experiences around mathematical identity of Latinas labeled with Learning Disabilities in mathematics classrooms. Expanding the theory of Complex Embodiment from Disability Studies, we explore new interdisciplinary theoretical and methodological tools to analyze the emotional, embodied experience of learning mathematics in the social worlds of mathematics classrooms, using emotional discourse. We take up theoretical and methodological practices around intersectionality through analysis of how power and positioning operate in mathematics identity development. We find that the young woman whose narratives we explore in this paper is positioned through deficit discourses around disability and multilingual learners, yet she understands herself through a positive mathematical affinity she shares with her mother. Over time, we see her narratives shift emotionally away from mathematics, as well as away from this connection with her mother. Her narratives help us develop a theoretical perspective that understands emotion in mathematics learning as both embodied and socially constructed. [ABSTRACT FROM AUTHOR]

It is well-known that cyclic codes have efficient encoding and decoding algorithms. In recent years, antiprimitive BCH codes have attracted a lot of attention. The objective of this paper is to study BCH codes of this type over finite fields and analyse their parameters. Some lower bounds on the minimum distance of antiprimitive BCH codes are given. The BCH codes presented in this paper have good parameters in general, containing many optimal linear codes. In particular, two open problems about the minimum distance of BCH codes of this type are partially solved in this paper. [ABSTRACT FROM AUTHOR]

P-sets (P stands for Packet) is a set model with dynamic characteristics, which is obtained by introducing dynamic characteristics into Cantor set and improving Cantor set. According to the fact that the characteristics of class I big data are completely consistent with the basic characteristics of P-sets, this paper gives research on theory and application on class I big data from the view of mathematics. Here we introduce Class I big data which need some new definitions of data block, microdata and data link. Based on these concepts, decomposition theorem of data block and microdata relation theorem are given, and then attribute reasoning theorem and microdata intelligent discovery and the intelligent secure acquisition algorithm of microdata are also proposed. By using these theoretical results, the applications of secure acquisition of microdata are presented. In summary, P-sets mathematical model provides a new theory and method for studying class I big data. [ABSTRACT FROM AUTHOR]

Let k ≥ 2 . A generalization of the well-known Pell sequence is the k-Pell sequence. For this sequence, the first k terms are 0 , ... , 0 , 1 and each term afterwards is given by the linear recurrence P n (k) = 2 P n - 1 (k) + P n - 2 (k) + ⋯ + P n - k (k). In this paper, we extend the previous work (Rihane and Togbé in Ann Math Inform 54:57–71, 2021) and investigate the Padovan and Perrin numbers in the k-Pell sequence. [ABSTRACT FROM AUTHOR]

Let F be a family of graphs. The Turán number of F, denoted by ex(n,F), is the maximum number of edges in a graph with n vertices which does not contain any subgraph isomorphic to some graph in F. A star forest is a forest whose connected components are all stars and isolated vertices. Motivated by the results of Wang, Yang and Ning about the spanning Turán number of linear forests [J. Wang and W. Yang, The Turán number for spanning linear forests, Discrete Appl. Math. 254 (2019) 291-294; B. Ning and J. Wang, The formula for Turán number of spanning linear forests, Discrete Math. 343 (2020) #111924]. In this paper, let Sn,k be the set of all star forests with n vertices and k edges. We prove that when 1 ≤ k ≤ n-1, ex(n, Sn,k) = [k²-1/2] [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]

In this paper, we investigate the 3D incompressible Hall-magnetohydrodynamics with partial dissipation. Based on the results in (Du in Bound. Value Probl. 2022:6, 2022; Du and Liu in Acta Math. Sci. 42A:5, 2022; Fei and Xiang in J. Math. Phys. 56:051504, 2015), we establish an improved blow-up criterion for classical solutions. Furthermore, using the blow-up criterion, we also obtain the existence of the classical solutions only under the condition that the initial data ∥ V 0 ∥ H 1 + ∥ B 0 ∥ H 2 are sufficiently small. [ABSTRACT FROM AUTHOR]

This paper is an overview of some recent and ongoing developments of formal logical systems designed for reasoning about systems of rational agents who act in pursuit of their individual and collective goals, explicitly specified in the language as arguments of the strategic operators, in a socially interactive context of collective objectives and attitudes which guide and constrain the agents' behavior. [ABSTRACT FROM AUTHOR]

Solving math word problems (MWP) is a challenging task due to the semantic gap between natural language texts and mathematical equations. The main purpose of the task is to take a written math problem as input and produce a proper equation as output for solving that problem. This paper describes a sequence-to-sequence (seq2seq) neural model for automatically solving Turkish MWPs based on their semantic meanings in the text. It comprises a bidirectional encoder to comprehend the semantics of the problem by encoding the input sequence and a decoder with attention to extract the equation by tracking the semantic meanings of the output symbols. We investigate the success of several embedding types, pretrained language models, and neural models. Our research is novel in the sense that there exist no studies in Turkish on this natural language processing task that utilizes pretrained language models and neural models. There is also no Turkish dataset that can be used to train the neural models for the MWP task. As the first large-scale Turkish MWP dataset, we translated the well-known English MWP datasets into Turkish using a machine translation system. Although Turkish is an agglutinative and grammatically challenging language, the proposed models achieve around 72% accuracy on the dataset compiled from three English datasets. [ABSTRACT FROM AUTHOR]

By using the generalization of the neutrosophic q-Poisson distribution series, we introduce a new subclass of analytic and bi-univalent functions defined in the open unit disk. We then apply the q-Gegenbauer polynomials to investigate the estimates for the Taylor coefficients and Fekete–Szegö type inequalities of the functions belonging to this new subclass. In addition, we consider several corollaries and the consequences of the results presented in this paper. The neutrosophic q-Poisson distribution is expected to be significant in a number of areas of mathematics, science, and technology. [ABSTRACT FROM AUTHOR]

The use of technology in teaching and learning the topic of probability and statistics in the educational system in our country, Albania, has the potential to be encouraged in different level of classes in the educational system. Lee and Hollebrands (2011) have done better characterization of teaching probability and statistics with the help of technology, through the integration of Statistical Knowledge, Technological Statistical Knowledge, and Technological Pedagogical Statistical Knowledge. Also, we have integrated this framework with Pedagogical Knowledge as a very important factor. In this paper is given as a case study, the process of mastering the concepts of probability and statistics, with students of a lower secondary school in our country to understand the role of technology in the process of teaching and learning, realized concretely during the lessons, specifically throughout a project-based learning by demonstrating the results of the project by the students themselves. Our students recognize and analyze the data, then collect and represent it, to provide graphical presentation Thus, we focus on the potential advantages of using technology in teaching and learning the topics of probability and statistics in school mathematics during different levels of educational process in our country and beyond. [ABSTRACT FROM AUTHOR]

Charles (2005) defines a Big Idea in Mathematics to be "a statement of an idea that is central to the learning of mathematics, one that links numerous mathematical understandings into a coherent whole" (p. 10). Therein, Charles listed a total of 21 Big Ideas - acknowledging the impossibility that all mathematicians and mathematics educators can agree on these - with the hope that they can be a starting point to initiate conversations. In this paper, we propose that 'Computation' can be added to this list of big ideas in mathematics and give compelling reasons to support our proposal. Additionally, we describe some implications of such an inclusion with particular emphasis on teaching and learning of mathematics at schools. [ABSTRACT FROM AUTHOR]

This study investigates the axisymmetric postbuckling of functionally graded graphene platelets reinforced composite (FG-GPLRC) annular plates resting on nonlinear elastic medium in thermal environment. Five kinds of graphene platelets (GPLs) distribution patterns including U -pattern, X -pattern, O -pattern, A -pattern, and V -pattern have been considered. The nonlinear equilibrium equations and associated boundary conditions are obtained based upon the Mindlin plate theory. The governing equations are solved via the generalized differential quadrature method (GDQM). Afterwards, the direct iterative method is implemented to accomplish postbuckling loads using the buckling mode deflection. In order to confirm the accuracy of the present model, comparisons between our data with those published in the available literature are put forth. Eventually, this paper emphasizes the impact of diverse parameters such as geometrical parameters of the structure, GPLs patterns and their geometric, GPLs weight fraction, boundary conditions, elastic medium's parameters and temperature change on the buckling and postbuckling response of nanocomposite annular plates. It can be found that elastic medium overshadows the applicability of distribution patterns and weight fraction of GPLs. [ABSTRACT FROM AUTHOR]

The aim of this paper was to introduce and investigate a new seminorm of operator tuples on a complex Hilbert space H when an additional semi-inner product structure defined by a positive (semi-definite) operator A on H is considered. We prove the equality between this new seminorm and the well-known A-joint seminorm in the case of A-doubly-commuting tuples of A-hyponormal operators. This study is an extension of a well-known result in [Results Math 75, 93(2020)] and allows us to show that the following equalities r A (T) = ω A (T) = ∥ T ∥ A hold for every A-doubly-commuting d-tuple of A-hyponormal operators T = (T 1 , ... , T d) . Here, r A (T) , ∥ T ∥ A , and ω A (T) denote the A-joint spectral radius, the A-joint operator seminorm, and the A-joint numerical radius of T , respectively. [ABSTRACT FROM AUTHOR]

Thanks to the efforts of our reviewers in 2022, the median time to first decision was 17 days and the median time to publication was 37 days. Regardless of whether the articles they examined were ultimately published, the editors would like to express their appreciation and thank the following reviewers for the time and dedication that they have shown I Mathematics i : those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). I Mathematics i was able to uphold its high standards for published papers due to the outstanding efforts of our reviewers. [Extracted from the article]

This paper is concerned with an indirect chemotaxis-consumption model with sensitivity function χ (v). Frassu and Viglialoro (Appl. Math. Lett.; 2022; 132; 108108) showed global existence and boundedness in the case that χ is a constant. However, there is a room for improvement of the main claim. This paper improves the result and extends it in the case that χ depends on v. [ABSTRACT FROM AUTHOR]

This correction notice addresses an omission in a previously published paper titled "Ricci Vector Fields Revisited." The authors apologize for not including acknowledgements in the original paper and express their gratitude for the support received from King Saud University in Riyadh, Saudi Arabia. The authors assure readers that this correction does not impact the scientific conclusions of the paper. The correction has been approved by the Academic Editor and the original publication has been updated. The authors of the paper are Hanan Alohali, Sharief Deshmukh, and Gabriel-Eduard Vîlcu. [Extracted from the article]

This paper introduces the model of instrumental meta-orchestration (IMO), as an extension of the model of instrumental orchestration. This IMO model is defined as a systematic and intentional monitoring, by a teacher educator, of artefacts and teachers (or pre-service teachers) for facing a Metasituation, defined as a composition of situations of different natures and difficulty levels. An IMO, in itself, is a composition of instrumental orchestrations (sequenced or interwoven). This paper presents and discusses an instrumental meta-orchestration experienced in a class of undergraduate mathematics teachers. The development of the initial model results in: new concepts, such as ad hoc reaction, didactic meta-configuration, exploitation modes and didactic meta-performance; new features, such as flexibility and interactivity; and new phenomena, such as cascade effects. It also reveals the importance of unexpected events that occur between orchestrations. Moreover, it expanded the forms of destination for evaluating specific online documents, which are named webdocs. Finally, the paper discusses the contribution to mathematics teacher education of such an extended model. [ABSTRACT FROM AUTHOR]

In the paper (J Math Soc Jpn 72(1):303–331, 2020), Tse-Chung Yang and the first two current authors computed explicitly the number | SSp 2 (F q) | of isomorphism classes of superspecial abelian surfaces over an arbitrary finite field F q of even degree over the prime field F p . There it was assumed that certain commutative Z p -orders satisfy an étale condition that excludes the primes p = 2 , 3 , 5 . We treat these remaining primes in the present paper, where the computations are more involved because of the ramification. This completes the calculation of | SSp 2 (F q) | in the even degree case. The odd degree case was previous treated by Tse-Chung Yang and the first two current authors in (Doc Math 21:1607–1643, 2016). To complete the proof of our main theorem, we give a classification of lattices over local quaternion Bass orders, which is a new input to our previous works. [ABSTRACT FROM AUTHOR]

The main objective of the paper is to study the final model for the Kirchhoff-type parabolic system. Such type problems have many applications in physical and biological phenomena. Under some smoothness of the final Cauchy data, we prove that the problem has a unique mild solution. The main tool is Banach's fixed point theorem. We also consider the non-well-posed problem in the Hadamard sense. Finally, we apply truncation method to regularize our problem. The paper is motivated by the work of Tuan, Nam, and Nhat [Comput. Math. Appl. 77(1):15–33, 2019]. [ABSTRACT FROM AUTHOR]

Background: Play is an important part of the childhood. The learning potential of playing and creating non-digital games, like tabletop games, however, has not been fully explored. Aim: The study discussed in this paper identified a range of activities through which learners redesigned a mathematics-oriented tabletop game to develop their ideas and competencies in an integrated STEM (science, technology, engineering, and mathematics) class. Method: Third and fourth graders worked as teams to make changes on Triominos over a period of six weeks. Considering what could be changed from the original game, each group provided a different design for Triominos to accommodate the changes introduced. We gathered data through weekly observations of two classes (about 45 learners, ranging from age eight to ten) in a west-Canada school. In this paper, we present the works of three groups of three teammates. Results: We found that any change made by learners not only influenced mechanics, dynamics, and aesthetics of the game but also helped engage learners, encourage unconventional ideas, promote learning, and solve problems. Based on our findings, we suggest redesigning games facilitated learners deepen their understanding of mathematical concepts as part of a designed game system in STEM classes. [ABSTRACT FROM AUTHOR]

In this paper, we describe an educational experience in the context of the Master's degree that is compulsory in Spain to become a secondary education mathematics teacher. Master's students from two universities in Madrid (Spain) attended lectures that addressed—emphasizing the concourse of a dynamic geometry software package—some historical, didactic and mathematical issues related to linkage mechanisms, such as those arising in the 18th and 19th centuries during the development of the steam engine. Afterwards, participants were asked to provide three different kinds of feedback: (i) working on an assigned group task, (ii) individually answering a questionnaire, and (iii) proposing some classroom activity, imagining it would be addressed to their prospective pupils. All three issues focused on the specific topic of the attended lectures. In the framework of Mason's reflective discourse analysis, the information supplied by the participants has been analyzed. The objective was to explore what they have learned from the experience and what their perception is of the potential interest in linkages as a methodological instrument for their future professional activity as teachers. This analysis is then the basis upon which to reflect on the opportunities (and problems) that this particular bar-joint linkages methodological approach could bring towards providing future mathematics teachers with attractive tools that would contribute to enhancing a STEAM-oriented education. Finally, the students' answers allow us to conclude that the experience was beneficial for these pre-service teachers, both in improving their knowledge on linkages history, mathematics, industrial, technological and artistic applications, and in enhancing the use in the classroom of this very suitable STEAM context. [ABSTRACT FROM AUTHOR]

Nowadays, ICT play a fundamental role in education, as they are essential in all areas of knowledge at any educational stage. Specifically, in the area of mathematics, within the Primary Education stage, they are also very valid resources. This is demonstrated by the latest scientific studies. In recent times, the scientific literature has provided evidence of all this through different research studies. The aim of this paper is to analyze all those publications that deal with the teaching–learning processes of mathematics through ICT in primary education. The aim is to show the current state of the scientific literature and what elements and aspects to highlight are common to the documents analyzed. By means of the systematic literature review method, we analyzed 11 articles indexed in Scopus and the Web of Science, with the result that the use of ICT in this area is still scarce, as the volume of publications in this respect is very low. This could also indicate a prevalence of traditional methodologies associated with the teaching of mathematics that could hinder students' acquisition of mathematical competence. However, those studies that show the use of ICT demonstrate that its use leads to an improvement in performance, motivation, and problem solving. [ABSTRACT FROM AUTHOR]

The Sombor index of the graph G is a degree based topological index, deffned as SO =P uv2E(G) p dG(u)2 + dG(v)2, where dG(u) is the degree of the vertex u of G and E(G) is the edge set of G. In this paper we calculate SO of some graph transformations. [ABSTRACT FROM AUTHOR]

The annihilating-ideal graph of a commutative ring R with unity is deffned as the graph AG(R) whose vertex set is the set of all non-zero ideals with non-zero annihilators and two distinct vertices I and J are adjacent if and only if IJ = 0. Nikan-dish et.al. proved that AG(Zn) is weakly perfect. In this short paper, we characterize n for which AG(Zn) is perfect. [ABSTRACT FROM AUTHOR]

The Randić index R(G) of a graph G is the sum of the weights (dudv)1/2 of all edges uv in G, where du denotes the degree of vertex u. Du and Zhou [On Randić indices of trees, unicyclic graphs, and bicyclic graphs, Int. J. Quantum Chem. 111 (2011), 2760-2770] determined the n-vertex unicyclic graphs with the third maximum for n ≥ 5, the fourth maximum for n ≥ 7 and the fifth maximum for n ≥ 8. Recently, Li et al. [The Randić indices of trees, unicyclic graphs and bicyclic graphs, Ars Comb. 127 (2016), 409-419] obtained the n-vertex unicyclic graphs with the sixth maximum and the seventh maximum for n ≥ 9 and the eighth maximum for n ≥ 10. In this paper, we characterize the n-vertex unicyclic graphs with the ninth maximum, the tenth maximum, the eleventh maximum, the twelfth maximum and the thirteenth maximum of Randić values. [ABSTRACT FROM AUTHOR]

Let G be a fuzzy graph of order n, where(u) is the vertex membership, (u; v) is membership value of an edge and (u) is the strength of vertex. The first fuzzy Zagreb index is the sum -(ui)-(ui) + -(uj)-(uj) where uiuj 2 - and the corresponding fuzzy Zagreb matrix is the square matrix of order n whose (i; j)th entry whenever i 6= j, is -(ui)-(ui)+-(uj)-(uj) and zero otherwise. In this paper, we introduce the Zagreb Estrada index of fuzzy graphs and establish some bounds for it. [ABSTRACT FROM AUTHOR]

Let G be a graph with vertex set V (G) and edge set E(G). The two Zagreb indices M1 =P v2V (G) d² G(v) and M2 = Puv2E(G) dG(u)dG(v) are vertex degree based graph invariants that have been introduced in the 1970s and extensively studied ever since. In this paper, we first give a lower bound on the first Zagreb index of trees with given Roman domination number and we characterize all extremal trees. Then we present upper bound for Zagreb indices of unicyclic and bicyclic graphs with given Roman domination number. [ABSTRACT FROM AUTHOR]

For a graph G with no isolated vertex, a covering total double Roman dominating function (CTDRD function) f of G is a total double Roman dominating function (TDRD function) of G for which the set fv 2 V (G)jf(v) 6= 0g is a vertex cover set. The covering total double Roman domination number ctdR(G) equals the minimum weight of an CTDRD function on G. An CTDRD function on G with weight ctdR(G) is called a ctdR(G)-function. In this paper, the graphs G with small ctdR(G) are characterised. We show that the decision problem associated with CTDRD is NP-complete even when restricted to planer graphs with maximum degree at most four. We then show that for every graph G without isolated vertices, oitR(G) < ctdR(G) < 2 oitR(G) and for every tree T, 2-(T) + 1 - ctdR(T) - 4-(T), where oitR(G) and -(T) are the outer independent total Roman domination number of G, and the minimum vertex cover number of T respectively. Moreover we investigate the ctdR of corona of two graphs. [ABSTRACT FROM AUTHOR]

Let G = (V;E) be a given graph of order n. A function f: V ! f0; 1; 2g is an independent Roman dominating function (IRDF) on G if for every vertex v 2 V with f(v) = 0 there is a vertex u adjacent to v with f(u) = 2 and fv 2 V: f(v) > 0g is an independent set. The weight of an IRDF f on G is the value f(V) = P v2V f(v). The minimum weight of an IRDF among all IRDFs on G is called the independent Roman domination number of G. In this paper, we give algorithms for computing the independent Roman domination number of G in O(jV j) time when G = (V;E) is a tree, unicyclic graph or proper interval graph. [ABSTRACT FROM AUTHOR]

Let k 1 be an integer, and let G be a finite and simple graph with vertex set V (G). A signed total Italian k-dominating function on a graph G is a function f: V (G) ! f1; 1; 2g such that P u2N(v) f(u) ≥ k for every v 2 V (G), where N(v) is the neighborhood of v, and each vertex u with f(u) = 1 is adjacent to a vertex v with f(v) = 2 or to two vertices w and z with f(w) = f(z) = 1. A set ff1; f2;: ::; fdg of distinct signed total Italian k-dominating functions on G with the property that Pd i=1 fi(v) ≤ k for each v 2 V (G), is called a signed total Italian k-dominating family (of functions) on G. The maximum number of functions in a signed total Italian k-dominating family on G is the signed total Italian k-domatic number of G, denoted by dk stI (G). In this paper we initiate the study of signed total Italian k-domatic numbers in graphs, and we present sharp bounds for dk stI (G). In addition, we determine the signed total Italian k-domatic number of some graphs. [ABSTRACT FROM AUTHOR]

In this paper, we prove that klt singularities are invariant under deformations if the generic fiber is Q-Gorenstein. We also obtain a similar result for slc singularities. These are generalizations of results of Esnault-Viehweg [Math. Ann. 271 (1985), 439-449] and S. Ishii [Math. Ann. 275 (1986), 139-148; Singularities (Iowa City, IA, 1986) Contemporary Mathematics, vol. 90 (American Mathematical Society, Providence, RI, 1989), 135-145]. [ABSTRACT FROM AUTHOR]

The weak L1 -space meets in many areas of mathematics. For example, the conjugate functions of Lebesgue integrable functions belong to the weak L1 -space. The difficulty of working with the weak L1 -space is that the weak L1 -space is not a normed space. Moreover, infinitely differentiable (even continuous) functions are not dense in this space. Due to this, the theory of approximation was not produced in this space. In the present paper, we introduced the concept of the modulus of continuity of the functions from the weak L1 -space, studied its properties, found a criterion for convergence to zero of the modulus of continuity of the function from the weak L1 -space, and proved in this space an analogue of the Jackson-type theorem. [ABSTRACT FROM AUTHOR]

Not everyone is a great artist, but we don't often hear, "I dislike art." Most people are able to appreciate visual arts, music and sports, without necessarily excelling in it themselves. On the other hand, the phrase "I dislike math" is widely prevalent. This is especially ironic in our current society, where mathematics affects our day-to-day activities in essential ways such as e-commerce and e-mail. This paper describes the opportunity to popularize mathematics by focusing on its fun and creative aspects, and illustrates this opportunity through a brief discussion of interdisciplinary topics that expose the beauty, elegance and value of mathematics within and beyond the typical K-16 curriculum. We share practical outreach methods inspired by real mathematics, and our experience with a liberal-arts 'math for poets' course which aims to develop math appreciation without losing its rigor or depth. While many of us are not comfortable doing live performances or making fancy videos, we all can use these methods to encourage a more positive mindset about mathematics in our communities. [ABSTRACT FROM AUTHOR]

This paper presents a study on the extent to which creative literature been used as a vessel to carry forward the development of mathematical thought. The role of mathematics as a driving force for literature is highlighted, and while many examples exist that clearly show an attempt to disperse mathematical ideas, with Lewis Carroll, OuLiPo and ancient poetry considered, the argument that the sole purpose of the writings was for the sake of mathematical development is not clear-cut. [ABSTRACT FROM AUTHOR]

This paper argues that interactive theorem provers (ITPs) could play an important role in fostering students' appreciation and understanding of proof and of mathematics in general. It shows that the ITP Lean has three features that mitigate existing difficulties in teaching and learning mathematical proof. One is that it requires students to identify a proof strategy at the start. The second is that it gives students instant feedback while still allowing them to explore with maximum autonomy. The third is that elementary formal logic finds a natural place in the activity of creating proofs. The challenge in using Lean is that students have to learn its command language, in addition to mathematics course content and elementary logic. [ABSTRACT FROM AUTHOR]

The Dirichlet-Ferguson measure is a cornerstone in nonparametric Bayesian statistics and the study of the distributional properties of expectations with respect to such measure is an important line of research initiated in Cifarelli and Regazzini (1979a,b) and still very active, see Letac and Piccioni (2018) and Lijoi and Prünster (2009). In this paper we provide explicit upper bounds for the d3, the d2 and the convex distances between random vectors whose components are means of the Dirichlet-Ferguson measure and a random vector distributed according to the multivariate Gaussian law. These results are applied to the Gaussian approximation of linear transformations of random vectors with the Dirichlet distribution, yielding presumably optimal rates on the d3 and the d2 distances and presumably suboptimal rates on the convex and the Kolmogorov distances. [ABSTRACT FROM AUTHOR]

For a spectrally negative Lévy process, scale functions appear in the solution of twosided exit problems, and in particular in relation with the Laplace transform of the first time it exits a closed interval. In this paper, we consider the Laplace transform of more general functionals, which can depend simultaneously on the values of the process and its supremum up to the exit time. These quantities will be expressed in terms of generalized scale functions, which can be defined using excursion theory. In the case the functional does not depend on the supremum, these scale functions coincide with the ones found on the literature, see e.g. Li and Palmowski (2018) and therefore the results in this work are an extension of them. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to provide a complete description of the eigenvalues of the generator of a neutral multi-type Moran model, and the applications to the study of the speed of convergence to stationarity. The Moran model we consider is a non-reversible in general, continuoustime Markov chain with an unknown stationary distribution. Specifically, we consider N individuals such that each one of them is of one type among K possible allelic types. The individuals interact in two ways: by an independent irreducible mutation process and by a reproduction process, where a pair of individuals is randomly chosen, one of them dies and the other reproduces. Our main result provides explicit expressions for the eigenvalues of the infinitesimal generator matrix of the Moran process, in terms of the eigenvalues of the jump rate matrix. As consequences of this result, we study the convergence in total variation of the process to stationarity and show a lower bound for the mixing time of the Moran process. Furthermore, we study in detail the spectral decomposition of the neutral multi-allelic Moran model with parent independent mutation scheme, which is the unique mutation scheme that makes the neutral Moran process reversible. Under the parent independent mutation, we also prove the existence of a cutoff phenomenon in the chi-square and the total variation distances when initially all the individuals are of the same type and the number of individuals tends to infinity. Additionally, in the absence of reproduction, we prove that the total variation distance to stationarity of the parent independent mutation process when initially all the individuals are of the same type has a Gaussian profile. [ABSTRACT FROM AUTHOR]

In extending Stein's method to new target distributions, the first step is to find a Stein operator that suitably characterises the target distribution. In this paper, we introduce a widely applicable technique for proving sufficiency of these Stein characterisations, which can be applied when the Stein operators are linear differential operators with polynomial coefficients. The approach involves performing an asymptotic analysis to prove that only one characteristic function satisfies a certain differential equation associated to the Stein characterisation. We use this approach to prove that all Stein operators with linear coefficients characterise their target distribution, and verify on a case-by-case basis that all polynomial Stein operators in the literature with coefficients of degree at most two are characterising. For X denoting a standard Gaussian random variable and Hp the p-th Hermite polynomial, we also prove, amongst other examples, that the Stein operators for Hp(X), p = 3; 4;: ::; 8, with coefficients of minimal possible degree characterise their target distribution, and that the Stein operators for the products of p = 3; 4;: ::; 8 independent standard Gaussian random variables are characterising (in both settings the Stein operators for the cases p = 1; 2 are already known to be characterising). We leverage our Stein characterisations of H3(X) and H4(X) to derive characterisations of these target distributions in terms of iterated Gamma operators from Malliavin calculus, that are natural in the context of the Malliavin-Stein method. [ABSTRACT FROM AUTHOR]

The simple exclusion process studied in this paper consists of a system of K particles moving on the vertex set of a finite undirected connected graph. If there is one, the particle at x chooses one of the deg(x) neighbors of its current location uniformly at random at rate ρx > 0, and jumps to that vertex if and only if it is empty. Though this model is a natural mathematical object, it is also motivated by applications in the control of robotic swarms. After expressing the stationary distribution and the limiting occupation times of the process, we study how the total number of particles affects the occupation times ratios at different vertices. Using a novel qualitative argument based on combinatorial techniques, we prove that, while the occupation time at x increases with both D(x) = deg(x)=ρx and the total number of particles, the limiting occupation time increases faster with the total number of particles at vertices with a low D(x). [ABSTRACT FROM AUTHOR]

In a recent paper, Yu et al. obtained convergence and stability results of the K* iterative method for quasistrictly contractive mappings [An iteration process for a general class of contractive-like operators: Convergence, stability and polynomiography. AIMS Mathematics 2021; 6 (7): 6699-6714.]. To guarantee these convergence and stability results, the authors imposed some strong conditions on parametric control sequences which are used in the K* iterative method. The aim of the presented work is twofold: (a) to recapture the aforementioned results without any restrictions imposed on the mentioned parametric control sequences (b) to complete the work of Yu et al. by adding a result regarding the data dependency of the fixed points of quasi-strictly contractive mappings. We also furnish some illustrative examples to support our results. Our work can be considered an important refinement and complement of the work of Yu et al. [ABSTRACT FROM AUTHOR]

The binary quadratic-residue codes and the punctured Reed-Muller codes ${\mathcal {R}}_{2}((m-1)/2, m))$ are two families of binary cyclic codes with parameters $[n, (n+1)/2, d \geq \sqrt {n}]$. These two families of binary cyclic codes are interesting partly due to the fact that their minimum distances have a square-root bound. The objective of this paper is to construct two families of binary cyclic codes of length $2^{m}-1$ and dimension near $2^{m-1}$ with good minimum distances. When $m \geq 3$ is odd, the codes become a family of duadic codes with parameters $[2^{m}-1, 2^{m-1}, d]$ , where $d \geq 2^{(m-1)/2}+1$ if $m \equiv 3 \pmod {4}$ and $d \geq 2^{(m-1)/2}+3$ if $m \equiv 1 \pmod {4}$. The two families of binary cyclic codes contain some optimal binary cyclic codes. [ABSTRACT FROM AUTHOR]

This paper deals with studying some algebraic structures of the graphs as an attempt to visualize abstract mathematics. We have used some binary graph operations to investigated the algebraic structures of graphs with examples. This work emphasizes specifically the construction of semigroup or monoid and semiring, and their properties. This manuscript also aims to give a focused introduction of a class of homomorphism on the semiring of graphs. Some instances of real-life decision problems are consequently discussed. This article is also in a nascent stage of relating number theory and graph theory through mappings. [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 paper under discussion has some shortcomings in regard to mathematical formulation of the problem related to acoustics, its justification, some references analyses and the text, and we feel that this study has not been finished to its full extent. From the point of view of acoustic jet formation, the mathematical model used by the authors has a number of significant limitations which are not taken into account. Moreover, the formal analogy between the parameters of electromagnetic waves and acoustic waves should be used with caution in the conditions of localized beams (acoustic jet), and the limits of their application should be justified. [ABSTRACT FROM AUTHOR]