Search

Let R be a commutative ring with the identity 1R, and let R* be the multiplicative group of units in R. An element a ∈ R* is called an exceptional unit if there exists a b ∈ R* such that a + b = 1R. We set R** to be the set of all exceptional units in R. In this paper, we consider the residue-class ring Zn. For any positive integers n, s, and c ∈ Zn, let Ns(n, c) :=#{(x1, ..., xs) ∈ (Z** n ) s : x1 + ... + xs(n, c). Later on, Yang and Zhao (Monatsh. Math. 182 (2017)) extended Sander’s theorem to finite terms by using exponential sum theory. In this paper, using matrix theory, we present an explicit formula for N2(n, c). Later on, Yang and Zhao (Monatsh. Math. 182 (2017)) extended Sander’s theorem to finite terms by using exponential sum theory. In this paper, using matrix theory, we present an explicit formula for Ns(n, c). This extends and improves earlier results. [ABSTRACT FROM AUTHOR]

In this true story, one mathematics major supports another in an unexpected way. [ABSTRACT FROM AUTHOR]

Copyright of Gaceta de la Real Sociedad Matematica Espanola is the property of Real Sociedad Matematica Espanola and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper shows that K_t-minor-free (and K_{s, t}-minor-free) graphs G are subgraphs of products of a tree-like graph H (of bounded treewidth) and a complete graph K_m. Our results include optimal bounds on the treewidth of H and optimal bounds (to within a constant factor) on m in terms of the number of vertices of G and the treewidth of G. These results follow from a more general theorem whose corollaries include a strengthening of the celebrated separator theorem of Alon, Seymour, and Thomas [J. Amer. Math. Soc. 3 (1990), 801–808] and the Planar Graph Product Structure Theorem of Dujmović et al. [J. ACM 67 (2020)]. [ABSTRACT FROM AUTHOR]

This study is focused on investigating parental involvement in students' mathematical activities. It presents a comprehensive bibliometric analysis that examines new areas of research to discover current trends and future research opportunities related to parental involvement in their children's mathematics activities. This study intends to provide a meaningful contribution toward enhancing educational interventions in the future. The metadata of the publications included in this analysis was extracted from the Scopus and ERIC databases using the search criteria "(parent OR parent) AND (involvement OR support) AND (math or math) AND student." After the screening step, a comprehensive analysis was conducted on a total of 944 articles using the tools Harzing's Publish or Perish 8, Biblioshiny, and VOSviewer 1.6.20. The findings indicated that studies on this topic covered 42 years and accumulated a total of 17,392 citations. The most prolific year in terms of publications was 2023, with a peak of 80 studies published. The leading contributors to this body of research were Jianzhong Xu and James Reed Campbell, each authoring six papers. The keyword mapping results revealed several interesting research avenues for future investigation, such as the incorporation of psychological interventions, longitudinal studies, multidisciplinary approaches, and the utilization of technology. [ABSTRACT FROM AUTHOR]

In this paper, we introduced a new contraction principle via altering distance and C -class functions with rational forms which extends and generalizes the existing version provided by Hasan Ranjbar et al. [H. Ranjbar, A. Niknam, A fixed point theorem in Hilbert C ∗ -modules, Korean J. Math. , 30 (2022), 297–304]. Specifically, the rational forms involved in the contraction condition we presented involve the p -th power of the displacements which can exceed the second power mentioned in Hasan Ranjbar et al.'s paper. Moreover, we also proved a fixed point theorem for this type of contraction in the Hilbert C ∗ -module. Some adequate examples were provided to support our results. As an application, we applied our result to prove the existence of a unique solution to an integral equation and a second-order (p , q) -difference equation with integral boundary value conditions. [ABSTRACT FROM AUTHOR]

Within the context of Indian religions, Jainism has long been recognized for its extensive use of permutations and combinations. However, the application of these principles within Buddhist scriptures has received relatively little scholarly attention. This paper introduces a new example of the specific application of permutations and combinations in Buddhist scriptures. In this paper, we focus on the first saṅghādisesa rule in the Theravāda-vinaya, which lists a series of element sets and arranges these elements according to a certain pattern known as "ten-roots" (mūla), and we discover that these arrangements form a regular numerical sequence, called "oblong numbers". Moreover, similar patterns with different quantities are also found in the fourth Pārājika and the fifth saṅghādisesa rules. This indicates that the compilers of the Theravāda-vinaya did not use this mathematical knowledge without basis. Interestingly, we also found the use of this sequence in the Bakhshālī manuscript. Therefore, in this article, after summarizing and verifying the arrangement rules of the Theravāda-vinaya, we discuss whether the oblong numbers were influenced by Greek mathematics. [ABSTRACT FROM AUTHOR]

Artificial intelligence (AI) and machine learning have become increasingly important in modern society and are poised to play an increasingly prominent role in education. This paper seeks to provide a theoretical framework for interrogating the integration of AI in education spaces. The paper argues that the eventual response of educators to recent developments in artificial intelligence is eerily like the earlier cycles of integrating ICT in education and, decades earlier, calculators into mathematics instruction. Premised on the argument that there are similarities between the calculator revolution in mathematics education and the ICT revolution in education several decades ago and the current ongoing developments in artificial intelligence, this paper offers a theoretical lens. The theoretical lens is composed of the Technology-Organization-Environment (TOE) framework, Technology Acceptance Model, Technological Pedagogical Content Knowledge, Socio-technical system theory, and Diffusion of Innovation theory. The paper concludes that despite spatial differences between the ICT revolution and the artificial intelligence revolution, there are shared similarities warranting adoption of a similar theoretical lens. Furthermore, factors that were considered pivotal in the integration of ICT are still relevant to the revolution of artificial intelligence. [ABSTRACT FROM AUTHOR]

This paper deals with a new stochastic method to solve Lotka's Law with higher degree of Newton-Cotes Quadrature Rule as an alternate method to existing solution of the value determination of the constant part of the power law; so far, M.L. Pao gave a solution with an equation to determine the area under the curve with numerical integration rule with degree=1 which is also known as Trapezoidal Rule. Here, next higher degree 2, popularly known as Simpson's 1/3 rule at closed interval [x 1,] has been used to establish a deterministic equation form to solve authors' productivity realized through Lotka's Law. Re-estimating the value of C with higher degree quadrature rule is very crucial as the probability of inclusion of more area and exclusion of unnecessary area under the curve is more precise. Another area of investigation is the determination of p value (Pao determined p=20), i.e. whether p=20 can be altered? Or equation derived through Simpson's 1/3 rule, whether it can give a minimal residual error beyond p=20. This paper is dedicated to build up a mathematical equation to solve the constant value(C) of the Lotka's law equation as well as enlighten all these investigating points. [ABSTRACT FROM AUTHOR]

This paper aims to investigate new coincidence point theorems for self‐maps under an extended rational contraction. Our approach uses the p‐adic distance in partially ordered ultrametric spaces. Furthermore, to illustrate our major discoveries, we give a comprehensive numerical analysis. This study expands on prior research in partially ordered ultrametric spaces to provide a more comprehensive understanding of such spaces using rational contraction. [ABSTRACT FROM AUTHOR]

The focus of this study is to use the mixture item response theory (MixIRT) model while implementing the no-U-turn sampler as a technique for investigating the presence of latent classes (i.e., subpopulations) among eighth-grade students who were administered TIMSS 2019 mathematics subtest in paper format from the gulf cooperation council (GCC) countries. One-, two-, and constrained three-parameter logistic MixIRT models with one to four classes were used to fit to the data, where the model data fit was assessed using Bayesian fit indices. The results indicate that multiple latent classes or subpopulations can better reflect the mathematical proficiency of eighth graders from the four GCC countries, and specifically the two-class constrained three-parameter MixIRT model provides a relatively better fit to the data. The results also indicate that when a mixture of several latent classes present, the conventional unidimensional IRT model is limited in providing information for multiple latent classes and shall be avoided. In addition to adding to the existing literature on MixIRT models for international large-scale assessments such as TIMSS on its heterogenous subpopulations from a fully Bayesian approach, this study sheds light on the limitation of conventional unidimensional IRT models and subsequently directs attention to the use of the more complex MixIRT model for such assessments. [ABSTRACT FROM AUTHOR]

This paper focuses on the possible usage of qualitative mathematics in psychology. Qualitative mathematics is understood to be equivalent to pure mathematics. First, it is explained that mathematics is a discipline studying patterns in reproducible mental objects. Qualitative mathematics is presented as an alternative to measurement, potentially offering the same level of exactness, clarity, and rigor. This perspective might lead psychologists to explore connections between a phenomenon and any kind of mathematical structure, regardless of whether the structure is quantitative. Usage of (any) mathematical structures might require scholars who are familiar with them. Consequently, changes in mathematics education may also be needed. Introducing non-numerical structures into mathematics education--thereby partially revisiting the New Math Movement--could train individuals more prepared for a creative approach to the use of structures and less inclined to view everything as quantitative. [ABSTRACT FROM AUTHOR]

Building on previous work in fractional calculus, this paper introduces new definitions for the (ρ, k, φ)‐proportional integral and (ρ, k, φ)‐proportional H fractional derivative. This new approach retains the semigroup properties of traditional fractional integrals. A significant advantage of this fractional calculus is its compatibility with the majority of existing studies on fractional differential equations. Furthermore, we delve into the properties of the generalized fractional integrals and derivatives. We discuss, for instance, the mapping properties of the (ρ, k, φ)‐proportional integral. To elucidate these concepts, we introduce a set of new weighted spaces. Additionally, we explore the generalized Laplace transform of both the (ρ, k, φ)‐proportional integrals and (ρ, k, φ)‐proportional H fractional derivatives. Also, examples concerning the linear (ρ, k, φ)‐proportional H fractional equations are given to illustrate the main results. [ABSTRACT FROM AUTHOR]

Hypergroups represent a generalization of groups, introduced by Marty, that are rich in applications in several sectors of mathematics and in other fields. An important class of hypergroups called join spaces is presented in this paper, along with some connections to lattice theory, in particular, to modular and to distributive lattices. In particular, we study join spaces associated with chains through functions and we analyze when such join spaces are isomorphic. Moreover, a combinatorial problem is presented for a finite context, focusing on calculating the number of isomorphisms classes of join spaces. [ABSTRACT FROM AUTHOR]

The irreducible decomposition of a monomial ideal has played an important role in combinatorial commutative algebra, with applications beyond pure mathematics, such as biology. Given a monomial ideal I of a polynomial ring S = k [ x ] over a field k and variables x = { x 1 , ... , x n } , its incidence matrix, is the matrix whose rows are indexed by the variables x and whose columns are indexed by its minimal generators. The main contribution of this paper is the introduction of a novel invariant of a monomial ideal I , termed its signature, which could be thought of as a type of canonical form of its incidence matrix, and the proof that two monomial ideals with the same signature have essentially the same irreducible decomposition. [ABSTRACT FROM AUTHOR]

This work studies a coupled non-linear Schrödinger system with a singular source term. First, we investigate the question of the local existence of solutions. Second, one proves the existence of global solutions which scatter in some Sobolev spaces. Finally, one establishes the existence of non-global solutions. The main difficulty here is to overcome the regularity problem in the non-linearity. Indeed, because of the singularity of the source term, the classical contraction method in the energy space fails in such a regime. So, this paper is to fill such a gap in the literature. The argument follows ideas in T. Cazenave and I. Naumkin (Comm. Contemp. Math. , 19 (2017), 1650038). This consists to remark that the singularity problem is only near the origin. So, one needs to impose that the solution stays away from zero. This is not trivial, since there is no maximum principle for the Schrödinger equation. The existence of global solutions which scatter follows with the pseudo-conformal transformation via the existence of local solutions. Finally, the existence of non-global solutions follows with the classical variance method. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to explain at the simplest possible level why finite mathematics based on a finite ring of characteristic p is more general (fundamental) than standard mathematics. The belief of most mathematicians and physicists that standard mathematics is the most fundamental arose for historical reasons. However, simple mathematical arguments show that standard mathematics (involving the concept of infinities) is a degenerate case of finite mathematics in the formal limit p → ∞ ; standard mathematics arises from finite mathematics in the degenerate case when operations modulo a number are discarded. Quantum theory based on a finite ring of characteristic p is more general than standard quantum theory because the latter is a degenerate case of the former in the formal limit p → ∞ . [ABSTRACT FROM AUTHOR]

This paper introduces a novel classification method for multi-class multi-label datasets, named multi-class multi-label logistic model tree (MMLMT). Our approach supports multi-label learning to predict multiple class labels simultaneously, thereby enhancing the model's capacity to capture complex relationships within the data. The primary goal is to improve the accuracy of classification tasks involving multiple classes and labels. MMLMT integrates the logistic regression (LR) and decision tree (DT) algorithms, yielding interpretable models with high predictive performance. By combining the strengths of LR and DT, our method offers a flexible and powerful framework for handling multi-class multi-label data. Extensive experiments demonstrated the effectiveness of MMLMT across a range of well-known datasets with an average accuracy of 85.90%. Furthermore, our method achieved an average of 9.87% improvement compared to the results of state-of-the-art studies in the literature. These results highlight MMLMT's potential as a valuable approach to multi-label learning. [ABSTRACT FROM AUTHOR]

The Fibonacci sequence has broad applications in mathematics, where its inherent patterns and properties are utilized to solve various problems. The sequence often emerges in areas involving growth patterns, series, and recursive relationships. It is known for its connection to the golden ratio, which appears in numerous natural phenomena and mathematical constructs. In this research paper, we introduce new concepts of convergence and summability for sequences of real and complex numbers by using Fibonacci sequences, called Δ -Fibonacci statistical convergence, strong Δ -Fibonacci summability, and Δ -Fibonacci statistical summability. And, these new concepts are supported by several significant theorems, properties, and relations in the study. Furthermore, for this type of convergence, we introduce one-sided Tauberian conditions for sequences of real numbers and two-sided Tauberian conditions for sequences of complex numbers. [ABSTRACT FROM AUTHOR]

The matrix square root is widely encountered in many fields of mathematics. In this paper, based on the properties of M-matrix and quadratic matrix equations, we study the square root of M-matrix, and prove that for a regular M-matrix there always exists a regular M-matrix as its square root. In addition, a structure-preserving doubling algorithm is proposed to compute the square root. Theoretical analysis and numerical experiments are given to show that our method is feasible and is effective under certain conditions. [ABSTRACT FROM AUTHOR]

In this paper, the Cauchy problem for a class of coupled system of the four-dimensional cubic focusing nonlinear Schrödinger equations was investigated. By exploiting the double Duhamel method and the long-time Strichartz estimate, the global well-posedness and scattering were proven for the system below the ground state. In our proof, we first established the variational characterization of the ground state, and obtained the threshold of the global well-posedness and scattering. Second, we showed that the non-scattering is equivalent to the existence of an almost periodic solution by following the concentration-compactness/rigidity arguments of Kenig and Merle [17] (Invent. Math., 166 (2006), 645–675). Then, we obtained the global well-posedness and scattering below the threshold by excluding the almost periodic solution. [ABSTRACT FROM AUTHOR]

This paper is devoted to dealing with a kind of new Kirchhoff-type problem in RN that involves a general double-phase variable exponent elliptic operator ϕ. Specifically, the operator ϕ has behaviors like |τ|q(x)−2 τ if |τ| is small and like |τ| p(x)−2 τ if |τ| is large, where 1 < p(x) < q(x) < N. By applying some new analytical tricks, we first establish existence results of solutions for this kind of Kirchhoff-double-phase problem based on variational methods and critical point theory. In particular, we also replace the classical Ambrosetti–Rabinowitz type condition with four different superlinear conditions and weaken some of the assumptions in the previous related works. Our results generalize and improve the ones in [Q. H. Zhang, V. D. Rădulescu, J. Math. Pures Appl., 118 (2018), 159–203.] and other related results in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new family of the generalized k-Leonardo numbers and study their properties. We investigate the Gaussian Leonardo numbers and associated new families of these Gaussian forms. We obtain combinatorial identities like Binet formula, Cassini’s identity, partial sum, etc. in the closed form. Moreover, we give various generating and exponential generating functions. [ABSTRACT FROM AUTHOR]

A signed graph (G, σ) is called a parity signed graph if there exists a bijective mapping f : V (G) → {1, . . ., |V (G)|} such that for each edge uv in G, f(u) and f(v) have same parity if σ(uv) = +1, and opposite parity if σ(uv) = −1. The rna number σ−(G) of G is the least number of negative edges among all possible parity signed graphs over G. Equivalently, σ−(G) is the least size of an edge-cut of G that has nearly equal sides. In this paper, we show that for the generalized Petersen graph Pn,k, σ−(Pn,k) lies between 3 and n. Moreover, we determine the exact value of σ−(Pn,k) for k ∈ {1, 2}. The rna numbers of some famous generalized Petersen graphs, namely, Petersen graph, Dürer graph, Möbius-Kantor graph, Dodecahedron, Desargues graph and Nauru graph are also computed. Recently, Acharya, Kureethara and Zaslavsky characterized the structure of those graphs whose rna number is 1. We use this characterization to show that the smallest order of a (4n + 1)-regular graph having rna number 1 is 8n + 6. We also prove the smallest order of (4n − 1)-regular graphs having rna number 1 is bounded above by 12n − 2. In particular, we show that the smallest order of a cubic graph having rna number 1 is 10. [ABSTRACT FROM AUTHOR]

In this paper, we study the uniqueness problems of fn(z)L(g) and gn(z)L(f) when they share a non-zero small function α(z) with finite weights, where L(h) represents any one of h(k)(z), h(z + c), h(z + c) - h(z) and h(k)(z + c), k ≥ 1 and c is a non-zero constant. Here f(z) and g(z) are transcendental meromorphic (or entire) functions and α(z) is a small function with respect to both f(z) and g(z). Our results improve and supplement the recent results due to Gao and Liu [Bull. Korean Math. Soc. 59 (2022), 155-166]. [ABSTRACT FROM AUTHOR]

This paper focuses on establishing boundedness properties and Parseval–Goldstein-type relations for the generalized Mehler–Fock transform initially introduced by B. L. J. Braaksma and B. M. Meulenbeld (Compositio Math., 18(3):235–287, 1967). Also, we derive an inversion formula for this transform over Lebesgue spaces. [ABSTRACT FROM AUTHOR]

Very recently, Pushpa and Vasuki (Arab. J. Math. 11, 355–378, 2022) have proved Eisenstein series identities of level 5 of weight 2 due to Ramanujan and some new Eisenstein identities for level 7 by the elementary way. In their paper, they introduced seven restricted color partition functions, namely P ∗ (n) , M (n) , T ∗ (n) , L (n) , K (n) , A (n) , and B(n), and proved a few congruence properties of these functions. The main aim of this paper is to obtain several new infinite families of congruences modulo 2 a · 5 ℓ for P ∗ (n) , modulo 2 3 for M(n) and T ∗ (n) , where a = 3 , 4 and ℓ ≥ 1 . For instance, we prove that for n ≥ 0 , P ∗ (5 ℓ (4 n + 3) + 5 ℓ - 1) ≡ 0 (mod 2 3 · 5 ℓ). In addition, we prove witness identities for the following congruences due to Pushpa and Vasuki: M (5 n + 4) ≡ 0 (mod 5) , T ∗ (5 n + 3) ≡ 0 (mod 5). [ABSTRACT FROM AUTHOR]

Recent rank-based attacks have reduced the security of Rainbow, which is one of the multi-layer UOV signatures, below the NIST security requirements by speeding up iterative kernel-finding operations using classical mathematics techniques. If quantum algorithms are applied to perform these iterative operations, the rank-based attacks may be more threatening to multi-layer UOV, including Rainbow. In this paper, we propose a quantum rectangular MinRank attack called the Q-rMinRank attack, the first quantum approach to key recovery attacks on multi-layer UOV signatures. Our attack is a general model applicable to multi-layer UOV signature schemes, and in this paper, we provide examples of its application to Rainbow and the Korean TTA standard, HiMQ. We design two quantum oracle circuits to find the kernel in consideration of the depth-width trade-off of quantum circuits. One is to reduce the width of the quantum circuits using qubits as a minimum, and the other is to reduce the depth using parallelization instead of using a lot of qubits. By designing quantum circuits to find kernels with fewer quantum resources and complexity by adding mathematical techniques, we achieve quadratic speedup for the MinRank attack to recover the private keys of multi-layer UOV signatures. We also estimate quantum resources for the designed quantum circuits and analyze quantum complexity based on them. The width-optimized circuit recovers the private keys of Rainbow parameter set V with only 1089 logical qubits. The depth-optimized circuit recovers the private keys of Rainbow parameter set V with a quantum complexity of 2 174 , which is lower than the complexity of 2 221 recovering the secret key of AES-192, which provides the same security level as parameter set III. [ABSTRACT FROM AUTHOR]

Purpose - The language load within mathematics test items can lead to inaccuracy in assessing Orang Asli pupils' mathematical ability due to their struggle in comprehending the academic language. This study aims to determine the validity of using test accommodations in the form of oral academic language and oral native language when administering mathematics computation and word problem test items among the Orang Asli pupils. Methodology - By employing a quantitative approach, this study utilised random equivalent group design to examine the validity of using oral test accommodations among 334 Grade Four Orang Asli pupils. Three testlets were constructed and used in this study: written test in the academic language (WAL), oral test in the academic language (OAL), and oral test in the native language (ONL). The three testlets comprised Paper 1 and Paper 2, each consisting of 20 mathematics computation and 20-word problem test items, respectively. One-way ANOVA was used to analyse and examine if there were differences in the mathematics performance between the three groups of tests administered to the Orang Asli pupils. Findings - The results indicated that the test scores of the pupils on the oral tests were higher compared to the written test administered to the pupils for both mathematics computation and word problem items. For computation items, the pupils performed better in the OAL testlet, followed by the ONL testlet. On the other hand, the pupils obtained the highest test scores in the ONL testlet compared to the OAL testlet for word problem items. Furthermore, the results illustrate that there is a difference in the mathematics performance of the Orang Asli pupils between the oral tests in both languages and written tests in the academic language. Significant - This study clearly shows that language plays a prominent role in affecting the Orang Asli pupils' mathematics performance. By utilising the oral test as a promising test accommodation, this measure could help address the language barrier faced by the Orang Asli pupils in mathematics testing. [ABSTRACT FROM AUTHOR]

The aim of this paper is to introduce the cyclic-Fibonacci hybrid sequence and give some properties. By taking into account the cyclic-Fibonacci hybrid sequence modulo m, the method will be given to determine the period lengths of this sequence according to the different m values. In the final part of this paper, we study the cyclic-Fibonacci hybrid sequence in groups and then we calculate the cyclic-Fibonacci hybrid lengths of polyhedral groups (2; 2; 2), (2; n; 2) and (n; 2; 2) as applications of the results produced. [ABSTRACT FROM AUTHOR]

A binary operation # on Z + is said to be an associative arithmetic if both # and its iteration — the binary operation ∗ defined recursively by: x∗1 = x and x∗y = [x ∗ (y −1)]#x — are associative. E. Rosinger [6] showed that under reasonable conditions an associative arithmetic must be ordinary addition. However, in the general case, there are associative arithmetics that are not ordinary addition. This paper gives examples of these as well as results towards a structure theorem for associative arithmetics. The paper also describes the role that this particular math problem has played in my mathematical life. [ABSTRACT FROM AUTHOR]

In the paper, we introduce a new class of noncyclic φ-contractions as a generalization of the class of noncyclic contractions which was first introduced in the paper [R. Esp'ınola, M. Gabeleh, On the structure of minimal sets of relatively nonexpansive mappings, Numerical Functional Analysis and Optimization 34 (8), 845-860, 2013] and study the existence, uniqueness and convergence of a fixed point for such class of noncyclic mapping in the framework of uniformly convex Banach spaces. We obtain existence results of the best proximity points for cyclic φ-contractions as a consequence of our main theorems. [ABSTRACT FROM AUTHOR]

The article deals with the results of mathematics examinations at the University of Finance and Administration in Prague before, during, and immediately after the Covid-19 pandemicrelated restrictions. The first objective is to evaluate whether the non-standard forms of testing (correspondence and online), used on an emergency basis during the pandemic, were adequate compared to the standard form (face-to-face) applied before the pandemic. The second objective is to assess whether and to what extent the results of the examinations have changed after the return of teaching and testing methods to normal. It turns out that the use of non-standard forms, although more challenging for teachers to control, did not lead to better results – the results in the correspondence form were similar to the standard form and even worse in the online form. The results of examinations administered in the standard form after the return to normal teaching were significantly better than in any of the periods studied, including the standard form of examination before the pandemic. Possible reasons for the results are analysed in the paper. [ABSTRACT FROM AUTHOR]

Because the classical art of memory was part of rhetoric, Latin authors did not develop detailed techniques for memorizing numbers. During the Renaissance, some methods for memorizing numerical data were added to the ars memoriae, partly due to the growing readership of memory treatises among merchants. However, the memorization of numerical data remained a marginal topic in memory manuals, and the available techniques were cumbersome when dealing with multiple long numbers. As numerical thinking became prevalent in the “outillage mental” of the time, a specific mnemonic technique was devised in the 17th century. By converting numbers into consonants and then forming words by adding vowels, mnemonists could employ mental images to represent these words and effectively memorize the corresponding numbers. This paper aims to trace the spread of this new technique from France to the Holy Roman Empire and, in the 18th century, to England. Additionally, it will show how new fields of knowledge were incorporated into treatises of the 17th and 18th centuries. Thus, this paper will shed light on how the Scientific Revolution led to the development of new mnemonics by practitioners with sociological backgrounds different from those of Renaissance humanists and orators. [ABSTRACT FROM AUTHOR]

Gender disparity in science and mathematics performance is being researched internationally. In a complex education system, like Pakistan, studying the difference in isolation may not generate holistic understanding. Therefore, this paper investigates changes in trends of performance in Science and Mathematics for both genders across public and private schools. Data were gathered from a nationwide sample of elementary grades students (n=15,391) using SATs/MATS. Independent t-test and two-way-ANOVA were employed to analyse data. Results revealed that girls outperformed boys in Science (p<0.01) while no gender differences in performance were observed in Mathematics. Gender and school systems demonstrated significant interaction effect only in mathematics, unveiling that girls perform better in public schools while this difference diminished in the private school system. The results show implications for employing gender-fair policies and practices in science and mathematics education. [ABSTRACT FROM AUTHOR]

The level of difficulty of mathematical test items is a critical aspect for evaluating test quality and educational outcomes. Accurately predicting item difficulty during test creation is thus significantly important for producing effective test papers. This study used more than ten years of content and score data from China's Henan Provincial College Entrance Examination in Mathematics as an evaluation criterion for test difficulty, and all data were obtained from the Henan Provincial Department of Education. Based on the framework established by the National Center for Education Statistics (NCES) for test item assessment methodology, this paper proposes a new framework containing eight features considering the uniqueness of mathematics. Next, this paper proposes an XGBoost-based SHAP model for analyzing the difficulty of mathematics tests. By coupling the XGBoost method with the SHAP method, the model not only evaluates the difficulty of mathematics tests but also analyzes the contribution of specific features to item difficulty, thereby increasing transparency and mitigating the "black box" nature of machine learning models. The model has a high prediction accuracy of 0.99 for the training set and 0.806 for the test set. With the model, we found that parameter-level features and reasoning-level features are significant factors influencing the difficulty of subjective items in the exam. In addition, we divided senior secondary mathematics knowledge into nine units based on Chinese curriculum standards and found significant differences in the distribution of the eight features across these different knowledge units, which can help teachers place different emphasis on different units during the teaching process. In summary, our proposed approach significantly improves the accuracy of item difficulty prediction, which is crucial for intelligent educational applications such as knowledge tracking, automatic test item generation, and intelligent paper generation. These results provide tools that are better aligned with and responsive to students' learning needs, thus effectively informing educational practice. [ABSTRACT FROM AUTHOR]

Uncertainty theory, founded in 2007, has become a branch of mathematics to model uncertainty rather than randomness. As an indispensable part of uncertainty theory, uncertain graph and uncertain network optimization has received the wide attention of many scholars. Naturally, a series of original research achievements have been obtained on uncertain graph and uncertain network optimization. This paper aims to present a state-of-the-art review on the recent advance in uncertain graph and uncertain network optimization. Furthermore, it hopes to predict the possible future research directions. Based on Web of Science database, this paper retrieves 144 related papers from 2011 to 2021 to analyze the features of published articles. More precisely, we analyze the annual number of publications, key topics and sub-fields, journals, and most-cited articles. In addition, the main results and models for uncertain graph and uncertain network optimization are summarized. Furthermore, the limitations of existing literature and the possible development trend are discussed. [ABSTRACT FROM AUTHOR]

This paper studies the engineering students' understanding of the concept of derivative with a discrete approach using sequences introduced by Weigand [21]. In this approach, a step-by-step method of difference sequence for functions defined on Z and Q is proposed. This concept was taught as part of a mathematics course in an engineering college in an Iranian university. HomeWorks with questions based on derivative with a discrete approach were constructed and performed for the participants. Their written answers, which were used to explore the students' mental structures of these mentioned concepts, were analyzed using APOS (Action-Process-Object-Schema) theory and we performed interviews so that the students could explain about their written answers. The results show that students tend to adopt an algorithmic approach when solving derivative problems and students' understanding of the meaning of derivative with a discrete approach was mainly procedural. Also according to the observed mental structures, a suggested genetic decomposition for the derivative with a discrete approach is presented. [ABSTRACT FROM AUTHOR]

In this paper, we established the Boyd-Wong type and Meir-Keeler type contractions in a new generalized b-metric space. Two types of fixed point theorems are proven, which extend the same results in the metric and b-metric spaces. Some examples and one application are also discussed to show the applicability of the results. [ABSTRACT FROM AUTHOR]

Fourier transform is one of the oldest and well-known technique in the field of mathematics and engineering mathematical works. As the concept of uncertainty has been introduced in the mathematics, most of the works gravitate towards the use Neutrosophic set. So, it is also important to study the Fourier transform in the sense of Neutrosophic set. In this paper we have applied the Neutrosophic Fourier transform in solving heat equation, and integral equation. Where detailed examples are given to clarify each case. [ABSTRACT FROM AUTHOR]

This note is written to show that the definition of the LA-semihypergroup by V. Amjad, K. Hila and F. Yousafzai "Generalized hyperideals in locally associative left almost semihypergroups, New York J. Math. 2014" should be corrected and that it is not enough to replace the multiplication "·" of an LA-semigroup by the hyperoperation "ο" to pass from an LA-semigroup to an LA-semihypergroup. The two examples of the paper based on the definition of the LA-semihypergroup are wrong that is a further indication that this definition needs correction. According to the last section of the paper, the paper generalizes the results of an LA-semigroup by M. Akram, N. Yaqoob and M. Khan "On (m, n) -ideals of left almost semigroups, Appl. Math. Sci. (Ruse) 2013" while the paper duplicates, without citation, the section 4 of the paper by W. Khan, F. Yousafzai, W. Guo and M. Khan "On (m, n) -ideals of left almost semigroups, J. Semigroup Theory Appl. 2014" with the usual change of "·" to "ο". [ABSTRACT FROM AUTHOR]

This paper describes students' perspectives about the possible learning opportunities they experienced when participating in a WhatsApp group project created to help prepare for the final secondary school Bagrut (matriculation) exam in mathematics. "Bagroup" project was initiated by the Ministry of Education and the Center for Educational Technology and launched as a national project three months before Bagrut examination. It was meant to serve as an additional environment for learning mathematics and provide an online tool during which teachers presented specific problems via blended learning, and students had the opportunity to ask questions, present problems with which they were having difficulty, and receive feedback from teachers and peers. To obtain a complete picture of the students' points of view, we used a mixedmethod research model. Quantitative data were obtained via a questionnaire with Likert statements and open questions, and qualitative data were obtained by observing four Bagroup study groups over the three-month period. Factor analysis revealed three categories of factors: those contributing to learner's emotional needs, those that promote learning, and those that inhibit learning. The findings may have implications for improving distance and remote learning. [ABSTRACT FROM AUTHOR]

The aim of this paper is to establish some fixed point results for enriched Kannan-type mappings in convex metric spaces. We first give an affirmative answer to a recent Berinde and Păcurar's question (Remark 2.3) [J. Comput. Appl. Math., 386 (2021), 113217]. Furthermore, we establish the existence and uniqueness of fixed points for Suzuki-enriched Kannan-type mappings in the setting of convex metric spaces. Finally, we present an application to approximate the solution of the Volterra integral equations to support our results. [ABSTRACT FROM AUTHOR]

In this paper, we study normalized solutions of the fractional Schrödinger equation with a critical nonlinearity... we prove the existence of a second normalized solution under some conditions on a, p, s, and N. This is a continuation of our previous work (Z. Angew. Math. Phys., 73 (2022) 149) where only one solution is obtained. [ABSTRACT FROM AUTHOR]

The concept of contraction mappings plays a significant role in mathematics, particularly in the study of fixed points and the existence of solutions for various equations. In this study, we described two types of enriched contractions: enriched F-contraction and enriched F'-contraction associated with u-fold averaged mapping, which are involved with Kirk's iterative technique with order u. The contractions extracted from this paper generalized and unified many previously common super contractions. Furthermore, u-fold averaged mappings can be seen as a more general form of both averaged mappings and double averaged mappings. Moreover, we demonstrated that the ufold averaged mapping with enriched contractions has a unique fixed point. Our work examined the necessary conditions for the u-fold averaged mapping and weak enriched contractions to have equal sets of fixed points. Additionally, we illustrated that an appropriate Kirk's iterative algorithm can effectively approximate a fixed point of a u-fold averaged mapping as well as the two enriched contractions. Also, we delved into the well-posedness, limit shadowing property, and Ulam-Hyers stability of the u-fold averaged mapping. Furthermore, we established necessary conditions that guaranteed the periodic point property for each of the illustrated strengthened contractions. To underscore the generality of our findings, we presented several examples that aligned with comparable results found in the existing literature. [ABSTRACT FROM AUTHOR]

This paper explores the ideals and their structural properties in two generalizations of the partial transformation semigroup. Furthermore, principal, maximal, and minimal ideals within these semigroups are elucidated. [ABSTRACT FROM AUTHOR]

The embedding of a torus into an inner form of PGL2 defines an adelic toric period. A general version of Duke's theorem states that this period equidistributes as the discriminant of the splitting field tends to infinity. In this paper we consider a torus embedded diagonally into two distinct inner forms of PGL2. Assuming the Generalized Riemann Hypothesis (and some additional technical assumptions), we show simultaneous equidistribution as the discriminant tends to infinity, with an effective logarithmic rate. Our proof is based on a probabilistic approach to estimating fractional moments of L-functions twisted by extended class group characters. [ABSTRACT FROM AUTHOR]

In the present paper, we have obtained common best proximity point theorems of nonself maps in Hausdorff topological space. Further, our results extend the results due to Gerald F. Jungck, thereby proving a generalized version of Kirk's theorem (J. London Math. 1(1):107–111, 1969). [ABSTRACT FROM AUTHOR]