Search

Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers. [ABSTRACT FROM AUTHOR]

If (S, ◦,≤) is an ordered hypersemigroup, an equivalence relation ρ on S is called congruence if (a, b) ∈ ρ implies (a ◦ x, b ◦ x) ∈ ρ and (x ◦ a, x ◦ b) ∈ ρ for every x ∈ S ; in the sense that for every u ∈ a ◦ x there exists v ∈ b ◦ x such that (u, v) ∈ ρ and for every u ∈ x◦a there exists v ∈ x◦b such that (u, v) ∈ ρ. It has been proved in Turk J Math 2021(5) [On the paper “A study on (strong) order-congruences in ordered semihypergroups”] that if S is an ordered hypersemigroup, then there exists a congruence ρ on S such that S/ρ is an ordered hypersemigroup. This result, is the main result for an involution ordered hypersemigroup by Xinyang Feng, Jian Tang and Yanfeng Luo in U.P.B. Sci. Bull, Series A, 2018, but its proof is wrong; the correct proof is given in the present paper. Examples illustrate the results. [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]

In this short note we prove that the Kurepa (K) function is different from the Smarandache-Kurepa (SK) function, therefore, these functions are not the same, as Mijajlović has unfoundedly accused the prestigious Encyclopedia of Mathematics and this author. This note is an answer to Mijajlović's paper (Žarko Mijajlović, Fifty years of Kurepa's !n hypothesis, Bulletin T.CLIV de l'Académie serbe des sciences et des arts - 2021 Classe des Sciences mathématiques et naturelles Sciences mathématiques, No. 46, 169-181 (2021). [ABSTRACT FROM AUTHOR]

Many complex physical systems exhibit a rich variety of discrete behavioural modes. Often, the system complexity limits the applicability of standard modelling tools. Hence, understanding the underlying physics of different behaviours and distinguishing between them is challenging. Although traditional machine learning techniques could predict and classify behaviour well, typically they do not provide any meaningful insight into the underlying physics of the system. In this paper we present a novel method for extracting physically meaningful clusters of discrete behaviour from limited experimental observations. This method obtains a set of physically plausible functions that both facilitate behavioural clustering and aid in system understanding. We demonstrate the approach on the V-shaped falling paper system, a new falling paper type system that exhibits four distinct behavioural modes depending on a few morphological parameters. Using just 49 experimental observations, the method discovered a set of candidate functions that distinguish behaviours with an error of 2.04%, while also aiding insight into the physical phenomena driving each behaviour. [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]

Giving the proper citations, it is shown that, except of Lemma 2.4 and Theorem 2.6, almost all the results of the paper in the title have been previously published for ordered hypersemigroups in Eur. J. Pure Appl. Math. and they are not new. There are also two results obtained from ordered semigroups just putting a "o" instead of "o" (that isn't a correct way to work), without reference to ordered semigroups on which the results on ordered hypersemigroups are based. One of them can be obtained as corollary to a theorem in Eur. J. Pure Appl. Math. as well, and it is not new. [ABSTRACT FROM AUTHOR]

Prahalad Chunnilal Vaidya was an eminent general relativist, gravitation theorist, physicist, mathematician, educationist and a follower of Gandhian philosophy in post-independence India. Apart from his scientific career, Vaidya is renowned for his Vaidya metric. Though he has contributed significantly to the scientific community, very few people are aware about him or his contributions. As 23 May 2019 was the 101st birth anniversary of Vaidya, here we present his contributions and their impact through a bibliometric study. This study presents an analysis of published research works of Vaidya. During his active career, he had contributed 102 publications, including 90 journal articles, 5 conference papers, 4 book chapters, 2 review articles and 1 report. His publications have received 2004 citations, h-index of 18 and i10-index of 29 from 1979 to 2018. We analysed Vaidya's publications by type, country, journals, publishers, citations, year-wise growth, collaborated authors, top cited papers, etc. This bibliometric study is an effort to draw the attention of the younger generation of scientists to Vaidya and his contributions. [ABSTRACT FROM AUTHOR]

Cooperation among kin is common in animal societies. Kin groups may form by individuals directly discriminating relatives based on kin recognition cues, or form passively through natal philopatry and limited dispersal. We describe the genetic landscape for a primitively eusocial wasp, Polistes dominula, and ask whether individuals choose cooperative partners that are nearby and/or that are genetic relatives. Firstly, we genotyped an entire sub-population of 1361 wasps and found genetic structuring on an extremely fine scale: the probability of finding genetic relatives decreases exponentially within just a few meters of an individual’s nest. At the same time, however, we found a lack of genetic structuring between natural nest aggregations within the population. Secondly, in a separate dataset where ~2000 wasps were genotyped, we show that wasps forced experimentally to make a new nest choice tended to choose new nests near to their original nests, and that these nests tended to contain some full sisters. However, a significant fraction of wasps chose nests that did not contain sisters, despite sisters being present in nearby nests. Although we cannot rule out a role for direct kin recognition or natal nest-mate recognition, our data suggest that kin groups may form via a philopatric rule-of-thumb, whereby wasps simply select groups and nesting sites that are nearby. The result is that most subordinate helpers obtain indirect fitness benefits by breeding cooperatively. [ABSTRACT FROM AUTHOR]

The Semantic Link Network is a general semantic model for modeling the structure and the evolution of complex systems. Various semantic links play different roles in rendering the semantics of complex system. One of the basic semantic links represents cause-effect relation, which plays an important role in representation and understanding. This paper verifies the role of the Semantic Link Network in representing the core of text by investigating the contribution of cause-effect link to representing the core of scientific papers. Research carries out with the following steps: (1) Two propositions on the contribution of cause-effect link in rendering the core of paper are proposed and verified through a statistical survey, which shows that the sentences on cause-effect links cover about 65% of key words within each paper on average. (2) An algorithm based on syntactic patterns is designed for automatically extracting cause-effect link from scientific papers, which recalls about 70% of manually annotated cause-effect links on average, indicating that the result adapts to the scale of data sets. (3) The effects of cause-effect link on four schemes of incorporating cause-effect link into the existing instances of the Semantic Link Network for enhancing the summarization of scientific papers are investigated. The experiments show that the quality of the summaries is significantly improved, which verifies the role of semantic links. The significance of this research lies in two aspects: (1) it verifies that the Semantic Link Network connects the important concepts to render the core of text; and, (2) it provides an evidence for realizing content services such as summarization, recommendation and question answering based on the Semantic Link Network, and it can inspire relevant research on content computing. [ABSTRACT FROM AUTHOR]

In this study, we address the question whether (and to what extent, respectively) altmetrics are related to the scientific quality of papers (as measured by peer assessments). Only a few studies have previously investigated the relationship between altmetrics and assessments by peers. In the first step, we analyse the underlying dimensions of measurement for traditional metrics (citation counts) and altmetrics–by using principal component analysis (PCA) and factor analysis (FA). In the second step, we test the relationship between the dimensions and quality of papers (as measured by the post-publication peer-review system of F1000Prime assessments)–using regression analysis. The results of the PCA and FA show that altmetrics operate along different dimensions, whereas Mendeley counts are related to citation counts, and tweets form a separate dimension. The results of the regression analysis indicate that citation-based metrics and readership counts are significantly more related to quality, than tweets. This result on the one hand questions the use of Twitter counts for research evaluation purposes and on the other hand indicates potential use of Mendeley reader counts. [ABSTRACT FROM AUTHOR]

The need to complete multiple tasks concurrently is a common occurrence both daily life and in occupational activities, which can often include simultaneous cognitive and physical demands. As one example, there is increasing availability of head-worn display technologies that can be employed when a user is mobile (e.g., while walking). This new method of information presentation may, however, introduce risks of adverse outcomes such as a decrement to gait performance. The goal of this study was thus to quantify the effects of a head-worn display (i.e., smart glasses) on motor variability during gait and to compare these effects with those of other common information displays (i.e., smartphone and paper-based system). Twenty participants completed four walking conditions, as a single task and in three dual-task conditions (three information displays). In the dual-task conditions, the information display was used to present several cognitive tasks. Three different measures were used to quantify variability in gait parameters for each walking condition (using the cycle-to-cycle standard deviation, sample entropy, and the “goal-equivalent manifold” approach). Our results indicated that participants used less adaptable gait strategies in dual-task walking using the paper-based system and smartphone conditions compared with single-task walking. Gait performance, however, was less affected during dual-task walking with the smart glasses. We conclude that the risk of an adverse gait event (e.g., a fall) in head-down walking conditions (i.e., the paper-based system and smartphone conditions) were higher than in single-task walking, and that head-worn displays might help reduce the risk of such events during dual-task gait conditions. [ABSTRACT FROM AUTHOR]

Quantifying the impact of a scholarly paper is of great significance, yet the effect of geographical distance of cited papers has not been explored. In this paper, we examine 30,596 papers published in Physical Review C, and identify the relationship between citations and geographical distances between author affiliations. Subsequently, a relative citation weight is applied to assess the impact of a scholarly paper. A higher-order weighted quantum PageRank algorithm is also developed to address the behavior of multiple step citation flow. Capturing the citation dynamics with higher-order dependencies reveals the actual impact of papers, including necessary self-citations that are sometimes excluded in prior studies. Quantum PageRank is utilized in this paper to help differentiating nodes whose PageRank values are identical. [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]

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]

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]

I agree wholeheartedly with the authors of "At Least One Black Sheep: Pragmatics and Mathematical Language" on their main thesis that the language of mathematics is permeated by phenomena that belong to pragmatics. I also agree with what they take to be the opposite view, which is presented in Mohan Ganesalingam's monograph The Language of Mathematics (2013). I think that the conflict is to a large extent terminological and has to do with what is meant by pragmatics. [ABSTRACT FROM AUTHOR]

Background: There is widespread evidence that statistical methods play an important role in original research articles, especially in medical research. The evaluation of statistical methods and reporting in journals suffers from a lack of standardized methods for assessing the use of statistics. The objective of this study was to develop and evaluate an instrument to assess the statistical intensity in research articles in a standardized way. Methods: A checklist-type measure scale was developed by selecting and refining items from previous reports about the statistical contents of medical journal articles and from published guidelines for statistical reporting. A total of 840 original medical research articles that were published between 2007–2015 in 16 journals were evaluated to test the scoring instrument. The total sum of all items was used to assess the intensity between sub-fields and journals. Inter-rater agreement was examined using a random sample of 40 articles. Four raters read and evaluated the selected articles using the developed instrument. Results: The scale consisted of 66 items. The total summary score adequately discriminated between research articles according to their study design characteristics. The new instrument could also discriminate between journals according to their statistical intensity. The inter-observer agreement measured by the ICC was 0.88 between all four raters. Individual item analysis showed very high agreement between the rater pairs, the percentage agreement ranged from 91.7% to 95.2%. Conclusions: A reliable and applicable instrument for evaluating the statistical intensity in research papers was developed. It is a helpful tool for comparing the statistical intensity between sub-fields and journals. The novel instrument may be applied in manuscript peer review to identify papers in need of additional statistical review. [ABSTRACT FROM AUTHOR]

Research paper recommenders emerged over the last decade to ease finding publications relating to researchers’ area of interest. The challenge was not just to provide researchers with very rich publications at any time, any place and in any form but to also offer the right publication to the right researcher in the right way. Several approaches exist in handling paper recommender systems. However, these approaches assumed the availability of the whole contents of the recommending papers to be freely accessible, which is not always true due to factors such as copyright restrictions. This paper presents a collaborative approach for research paper recommender system. By leveraging the advantages of collaborative filtering approach, we utilize the publicly available contextual metadata to infer the hidden associations that exist between research papers in order to personalize recommendations. The novelty of our proposed approach is that it provides personalized recommendations regardless of the research field and regardless of the user’s expertise. Using a publicly available dataset, our proposed approach has recorded a significant improvement over other baseline methods in measuring both the overall performance and the ability to return relevant and useful publications at the top of the recommendation list. [ABSTRACT FROM AUTHOR]

With the rapid development of information technology, scientific social networks (SSNs) have become the fastest and most convenient way for researchers to communicate with each other. Many published papers are shared via SSNs every day, resulting in the problem of information overload. How to appropriately recommend personalized and highly valuable papers for researchers is becoming more urgent. However, when recommending papers in SSNs, only a small amount of positive instances are available, leaving a vast amount of unlabelled data, in which negative instances and potential unseen positive instances are mixed together, which naturally belongs to One-Class Collaborative Filtering (OCCF) problem. Therefore, considering the extreme data imbalance and data sparsity of this OCCF problem, a hybrid approach of Social and Content aware One-class Recommendation of Papers in SSNs, termed SCORP, is proposed in this study. Unlike previous approaches recommended to address the OCCF problem, social information, which has been proved playing a significant role in performing recommendations in many domains, is applied in both the profiling of content-based filtering and the collaborative filtering to achieve superior recommendations. To verify the effectiveness of the proposed SCORP approach, a real-life dataset from CiteULike was employed. The experimental results demonstrate that the proposed approach is superior to all of the compared approaches, thus providing a more effective method for recommending papers in SSNs. [ABSTRACT FROM AUTHOR]

Moderate-to-severe psoriasis is associated with significant comorbidity, an impaired quality of life, and increased medical costs, including those associated with treatments. Systematic reviews (SRs) and meta-analyses (MAs) of randomized clinical trials are considered two of the best approaches to the summarization of high-quality evidence. However, methodological bias can reduce the validity of conclusions from these types of studies and subsequently impair the quality of decision making. As co-authorship is among the most well-documented forms of research collaboration, the present study aimed to explore whether authors’ collaboration methods might influence the methodological quality of SRs and MAs of psoriasis. Methodological quality was assessed by two raters who extracted information from full articles. After calculating total and per-item Assessment of Multiple Systematic Reviews (AMSTAR) scores, reviews were classified as low (0-4), medium (5-8), or high (9-11) quality. Article metadata and journal-related bibliometric indices were also obtained. A total of 741 authors from 520 different institutions and 32 countries published 220 reviews that were classified as high (17.2%), moderate (55%), or low (27.7%) methodological quality. The high methodological quality subnetwork was larger but had a lower connection density than the low and moderate methodological quality subnetworks; specifically, the former contained relatively fewer nodes (authors and reviews), reviews by authors, and collaborators per author. Furthermore, the high methodological quality subnetwork was highly compartmentalized, with several modules representing few poorly interconnected communities. In conclusion, structural differences in author-paper affiliation network may influence the methodological quality of SRs and MAs on psoriasis. As the author-paper affiliation network structure affects study quality in this research field, authors who maintain an appropriate balance between scientific quality and productivity are more likely to develop higher quality reviews. [ABSTRACT FROM AUTHOR]

University scientific research ability is an important indicator to express the strength of universities. In this paper, the evaluation of university scientific research ability is investigated based on the output of sci-tech papers. Four university alliances from North America, UK, Australia, and China, are selected as the case study of the university scientific research evaluation. Data coming from Thomson Reuters InCites are collected to support the evaluation. The work has contributed new framework to the issue of university scientific research ability evaluation. At first, we have established a hierarchical structure to show the factors that impact the evaluation of university scientific research ability. Then, a new MCDM method called D-AHP model is used to implement the evaluation and ranking of different university alliances, in which a data-driven approach is proposed to automatically generate the D numbers preference relations. Next, a sensitivity analysis has been given to show the impact of weights of factors and sub-factors on the evaluation result. At last, the results obtained by using different methods are compared and discussed to verify the effectiveness and reasonability of this study, and some suggestions are given to promote China’s scientific research ability. [ABSTRACT FROM AUTHOR]

The translation into English of Aleksandr Yakovlevich Khinchin's (1894–1959) 1926 paper entitled ‘Ideas of intuitionism and the struggle for a subject matter in contemporary mathematics’ is made available for the first time. Here, Khinchin presented the famous foundational debate between L.E.J. Brouwer and David Hilbert of the 1920s in terms of a search for a mathematics with content. His main aim seems to have been to make intuitionism ideologically acceptable to his audience at the Communist Academy by means of the claim that insofar as Brouwer's intuitionism had a clear ‘subject matter’ and Hilbert's new program was a concession to intuitionism, the alleged victory of intuitionism not only implied the defeat of ‘empty’ formalism, but also showed the compatibility and affinity of Marxism with the newest developments in modern mathematics. This introduction provides a tentative exploration of the issue of what was tactical (or due to ideological pressure) and what was real scientific interest (or due to ignorance) (or what was both) in Khinchin's 1926 paper in the form of a detailed commentary, especially, on the tactical side of his presentation of the positions of Brouwer and Hilbert. [ABSTRACT FROM AUTHOR]

In this note we explain the importance of clarity and give other tips for mathematical writing. Some of it is mildly opinionated, but most is just common sense and experience. [ABSTRACT FROM AUTHOR]

In this paper, we first investigate the regularity of finite energy solutions to the following Wolff type integral system: { u (x) = R 1 (x) W β , γ (v p u r) (x) , u (x) > 0 , x ∈ R N , v (x) = R 2 (x) W β , γ (u q v s) (x) , v (x) > 0 , x ∈ R N , where γ > 1 , β > 0 , β γ < N , W β , γ is the Wolff potential, R 1 , R 2 are double bounded functions in R N and p , q > max ⁡ { 1 , γ − 1 } , r , s ≥ 0 with p − s ≥ q − r > − γ + 1. We exploit the regularity lifting lemma to obtain the optimal integrability, boundedness and decaying property of finite energy solutions to the system. Secondly, we establish sharp pointwise estimates of positive finite energy solutions to the p -Laplacian and k -Hessian systems related to the above integral system, by using the previous regularity results, the interior Hölder estimates of solutions for the corresponding differential systems and a doubling lemma of Poláčik, Quittner and Souplet (Duke Math. J.,2007). These extend Vétois's decay results (Indiana Univ. Math. J.,2019) on the positive solutions of Laplacian systems to the p -Laplacian and k -Hessian cases. We remark that our methods do not need Harnack type inequalities and it can be applied to deal with the solutions without radial structures. As far as we know, this is the first attempt to derive sharp decay estimates for possibly non-radial solutions involving k -Hessian operators. We also obtain some decay estimates of the gradients at infinity. [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]

Let G = (V, E) be a simple connected graph. A perfect matching (or Kekulé structure in chemical literature) of G is a set of disjoint edges which covers all vertices of G. The anti-forcing number of G is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by af(G). For every m ∈ N, the mth power of G, denoted by Gm, is a graph with the same vertex set as G such that two vertices are adjacent in Gm if and only if their distance is at most m in G. In this paper, we study the anti-forcing number of the powers of some graphs. [ABSTRACT FROM AUTHOR]

A Roman dominating function (RDF) on a graph G is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u with f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF f is the sum of the weights of the vertices under f. The Roman domination number, γR(G) of G is the minimum weight of an RDF in G. The Roman domination polynomial of a graph G of order n is the polynomial RD(G, x) = Σ2ni=γR(G) dR(G, i)xi, where dR(G, i) is the number of RDFs of G with weight i. In this paper we prove properties of Roman domination polynomials and determine RD(G, x) in several classes of graphs G by new approaches. We also present bounds on the number of all Roman domination polynomials in a graph. [ABSTRACT FROM AUTHOR]

This paper introduces certain relations between 1-edge contraction and the total vertex stress and the confluence number of a graph. A main result states that if a graph G with ζ(G) = k ≥ 2 has an edge vivj and a ζ-set CG such that vi, vj ∈ CG then, ζ(G/vivj ) = k − 1. In general, either S(G/ei) ≤ S(G/ej ) or S(G/ej ) ≤ S(G/ei) is true. This observation leads to an investigation into the question: for which edge(s) ei will S(G/ei) = max{S(G/ej ) : ej ∈ E(G)} and for which edge(s) will S(G/ej ) = min{S(G/el) : el∈ E(G)}? [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]

For a graph G, we define a total k-labeling ϕ as a combination of an edge labeling ϕe : E(G) → {1, 2, . . ., ke} and a vertex labeling ϕv : V (G) → {0, 2, . . ., 2kv}, where k = max {ke, 2kv}. The total k-labeling ϕ is called a vertex irregular reflexive k-labeling of G if any pair of vertices u, u' have distinct vertex weights wtϕ(u) ≠ wtϕ(u'), where wtϕ(u) = ϕ(u) + Σuu'∈E(G) ϕ(uu' ) for any vertex u ∈ V (G). The smallest value of k for which such a labeling exists is called the reflexive vertex strength of G, denoted by rvs(G). In this paper, we present a new lower bound for the reflexive vertex strength of any graph. We investigate the exact values of the reflexive vertex strength of generalized friendship graphs, corona product of two paths, and corona product of a cycle with isolated vertices by referring to the lower bound. This study discovers some interesting open problems that are worth further exploration. [ABSTRACT FROM AUTHOR]

The PI index of a graph G is given by PI(G) = Σe∈E(G) (|V (G)|−NG(e)), where NG(e) is the number of equidistant vertices for the edge e. Various topological indices of bicyclic graphs have already been calculated. In this paper, we obtained the exact value of the PI index of bicyclic graphs. We also explore the extremal graphs among all bicyclic graphs with respect to the PI index. Furthermore, we calculate the PI index of a cactus graph and determine the extremal values of the PI index among cactus graphs. [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]

The coalition in a graph G consists of two disjoint sets of vertices V1 and V2, neither of which is a dominating set but whose union V1 ∪ V2, is a dominating set. A coalition partition in a graph G is a vertex partition π = {V1, V2, . . ., Vk} such that every set Vi ∈ π is not a dominating set but forms a coalition with another set Vj ∈ π which is not a dominating set. The coalition number C(G) equals the maximum k of a coalition partition of G. In this paper, we compute the coalition numbers of all cubic graphs of order at most 10. [ABSTRACT FROM AUTHOR]

A graphoidal cover of a graph G (not necessarily finite) is a collection ψ of paths (not necessarily finite, not necessarily open) satisfying the following axioms: (GC-1) Every vertex of G is an internal vertex of at most one path in ψ, and (GC-2) every edge of G is in exactly one path in ψ. The pair (G, ψ) is called a graphoidally covered graph and the paths in ψ are called the ψ-edges of G. In a graphoidally covered graph (G, ψ), two distinct vertices u and v are ψ-adjacent if they are the ends of an open ψ-edge. A graphoidally covered graph (G, ψ) in which no two distinct vertices are ψ-adjacent is called ψ-independent and the graphoidal cover ψ is called a totally disconnecting graphoidal cover of G. Further, a graph possessing a totally disconnecting graphoidal cover is called a graphoidally independent graph. The aim of this paper is to establish complete characterization of graphoidally independent infinite cactus. [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 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]

Students’ development of reasoning through algebraic symbols is a crucial component of most mathematics courses. This paper reports the journey of one second-semester calculus student, Cedric, as he attempted to reason about and create algebraic representations for arbitrary partial sums and infinite series through two exploratory teaching interviews. We report Cedric’s symbolizing activity in terms of Eckman's (2023) expression framework, focusing on Cedric’s development and attribution of meaning to a personal expression template for denoting partial sums and series. Specifically, we describe how Cedric leveraged his initial meanings for partial sums to create personal expressions to reason about infinite series. We then describe Cedric's construction of a general personal expression template for partial sums and series, including cognitive and physical modifications he made to his personal expression template as he symbolized various series. Our results show potentially profitable task sequences and lines of questioning that instructors might utilize to help students be more successful in constructing productive meanings for algebraic symbols. [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]

Many results have been obtained when studying scientific papers citations databases in a network perspective. Articles can be ranked according to their current in-degree and their future popularity or citation counts can even be predicted. The dynamical properties of such networks and the observation of the time evolution of their nodes started more recently. This work adopts an evolutionary perspective and proposes an original algorithm for the construction of genealogical trees of scientific papers on the basis of their citation count evolution in time. The fitness of a paper now amounts to its in-degree growing trend and a “dying” paper will suddenly see this trend declining in time. It will give birth and be taken over by some of its most prevalent citing “offspring”. Practically, this might be used to trace the successive published milestones of a research field. [ABSTRACT FROM AUTHOR]

This correction notice provides updates and corrections to a research paper on deep machine learning model-based cyber-attacks detection in smart power systems. The paper proposes a deep learning-based attack detection model that addresses system disturbances caused by natural events and cyber-attacks. It discusses the use of principal component analysis (PCA) for feature selection and the potential of deep learning-based and decision tree classifiers for detecting cyber-attacks in intelligent energy grids. The notice also includes updates to references, clarifications on the experimental data set, and feature selection based on PCA. The study evaluates the effectiveness of the proposed model using various assessment indexes and compares it to conventional methods, concluding that the proposed model is effective in detecting cyber-attacks and demonstrates good performance in detecting destructive attacks. [Extracted from the article]

How do the curators of science and technology collections represent the daily realities of doing science? Through the acquisition of Professor Stephen Hawking's office by the Science Museum, this paper will explore what is involved in making major acquisitions for national collections. How do curators consider what to preserve from the eclectic range of items found in the working spaces of scientists? What do the personal artefacts of a scientist's life represent, and what do acts of curatorial choices say about the narratives that are foregrounded -- and those that are not -- in positioning that life historically? And how do those choices illuminate the considerations involved in the way science and technology is represented in our national collections? By going beyond the glass case, we consider what it takes to bring an object into a collection: the intellectual considerations of how its stories are preserved for a nation and the practical considerations required so that items can even be considered for future display. The paper illuminates the formal and informal networks around scientists' collections, and the processes and judgements that science and technology curators make every day when choosing what could be important for defining our history. Using the Stephen Hawking office as a case study the article explores the representation of scientific practice in museum collections, the relationship of some collections with celebrity and disability, and some of the challenges posed by science and technology acquisitions compared to other types of museum object. The paper explores how knowledge is generated in museum collections, through the act of acquiring a new collection. It asks fundamental questions, which are essential to the fields of museology and science and technology studies, about the contribution to knowledge made by personal scientific objects. It goes beyond the study of collections as artefacts of display in exhibitions and galleries, providing a detailed analysis of a routine but oftenneglected aspect of behind-the-scenes museum work: the acquisition of a collection. Arguing that a large and complex collection is a vital tool for understanding the complexity of science, the paper uses the 'museum as method' (Thomas, 2016) which prioritises simple curatorial questions and the use of the objects in exploration; this enables scholars and curators to respond to material evidence of scientific knowledge, and identify narratives that are prioritised, and others that are obscured, in the historic record. In doing so, it suggests that curators are uniquely placed to provide insights into the roles of human and non-human actors in the construction of scientific knowledge, demonstrating how the Hawking collection allows us to explore the nature of scientific practice, the creation of scientific celebrity, and the potential to give visibility to disability within the history of science whilst de-centring the myth of the scientific genius in museum narratives. [ABSTRACT FROM AUTHOR]

A paper of Reeder–Yu [J. Amer. Math. Soc. 27 (2014), pp. 437–477] gives a construction of epipelagic supercuspidal representations of p-adic groups. The input for this construction is a pair (\lambda, \chi) where \lambda is a stable vector in a certain representation coming from a Moy–Prasad filtration, and \chi is a character of the additive group of the residue field. We say two such pairs are equivalent if the resulting supercuspidal representations are isomorphic. In this paper we describe the equivalence classes of such pairs. As an application, we give a classification of the simple supercuspidal representations for split adjoint groups. Finally, under an assumption about unramified base change, we describe properties of the Langlands parameters associated to these simple supercuspidals, showing that they have trivial L-functions and minimal Swan conductors, and showing that each of these simple supercuspidals lies in a singleton L-packet. [ABSTRACT FROM AUTHOR]

The document titled "Discussion of 'A general theory for anisotropic Kirchhoff-Love shells with in-plane bending of embedded fibers'" is a critique of a paper that contains misleading and incorrect statements. The objections mainly focus on two remarks made in the paper. The document argues that the symmetrization employed in a previous work is valid for all cases, contrary to what the paper suggests. It also disputes the claim that a theory fails to properly account for the energetic effect of a change in geodesic curvature. The document provides counterarguments and references to support its claims. The author of the document is David J Steigmann. [Extracted from the article]

The safety of chemicals, drugs, novel foods and genetically modified crops is often tested using repeat-dose sub-acute toxicity tests in rats or mice. It is important to avoid misinterpretations of the results as these tests are used to help determine safe exposure levels in humans. Treated and control groups are compared for a range of haematological, biochemical and other biomarkers which may indicate tissue damage or other adverse effects. However, the statistical analysis and presentation of such data poses problems due to the large number of statistical tests which are involved. Often, it is not clear whether a “statistically significant” effect is real or a false positive (type I error) due to sampling variation. The author's conclusions appear to be reached somewhat subjectively by the pattern of statistical significances, discounting those which they judge to be type I errors and ignoring any biomarker where the p-value is greater than p = 0.05. However, by using standardised effect sizes (SESs) a range of graphical methods and an over-all assessment of the mean absolute response can be made. The approach is an extension, not a replacement of existing methods. It is intended to assist toxicologists and regulators in the interpretation of the results. Here, the SES analysis has been applied to data from nine published sub-acute toxicity tests in order to compare the findings with those of the author's. Line plots, box plots and bar plots show the pattern of response. Dose-response relationships are easily seen. A “bootstrap” test compares the mean absolute differences across dose groups. In four out of seven papers where the no observed adverse effect level (NOAEL) was estimated by the authors, it was set too high according to the bootstrap test, suggesting that possible toxicity is under-estimated. [ABSTRACT FROM AUTHOR]

Background: Sponsors that seek to commercialize new drugs apply to the Food and Drug Administration (FDA) which independently analyzes the raw data and reports the results on its website. Objectives: This study sought to determine if there are differences between the FDA assessments and journal reports on biologic agents developed for the treatment of rheumatoid arthritis. Methods: Available data on FDA-approved drugs were extracted from the website, and a systematic literature search was conducted to identify matching studies in peer-reviewed medical journals. Outcome measures were the American College of Rheumatology response criteria ACR20 (efficacy) and withdrawal due to adverse events (safety). As effect size odds ratios were estimated for each active trial arm vs. control arm (i.e. for both sources: FDA and journal report), followed by calculation of the ratios of the FDA and journal report odds ratios. A ratio of odds ratios not equal to 1 was categorized as a discrepancy. Results: FDA reports were available for 8 of 9 FDA-approved biologic agents for rheumatoid arthritis; all identified trials (34) except one were published in peer-reviewed journals. Overall, discrepancies were noted for 20 of the 33 evaluated trials. Differences in the apparent benefit reporting were found in 39% (24/61) pairwise comparisons and in 11 cases these were statistically significant; the FDA report showed greater benefit than the journal publication in 15 comparisons and lesser benefit in 9. Differences in the reported harms were found in 51% (28/55) pairwise comparisons and were statistically significant in 5. The “signal” in FDA reports showed a less harmful effect than the journal publication in 17 comparisons whereas a more harmful effect in 11. The differences were attributed to differences in analytic approach, patient inclusion, rounding effect, and counting discrepancies. However, no differences were categorized as critical. Conclusion: There was no empirical evidence to suggest biased estimates between the two sources. Increased and detailed transparency in publications would improve the understanding and credibility of published results. Further, the FDA report was found to be a useful source when data are missing in the published report (i.e. reporting bias). [ABSTRACT FROM AUTHOR]

An $(r, \delta)$ -locally repairable code ($(r, \delta)$ -LRC for short) was introduced by Prakash et al. for tolerating multiple failed nodes in distributed storage systems, which was a generalization of the concept of $r$ -LRCs produced by Gopalan et al.. An $(r, \delta)$ -LRC is said to be optimal if it achieves the Singleton-like bound. Recently, Chen et al. generalized the construction of cyclic $r$ -LRCs proposed by Tamo et al. , and constructed several classes of optimal $(r, \delta)$ -LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$ , respectively in terms of a union of the set of zeros controlling the minimum distance and the set of zeros ensuring the locality. Following the work of , , this paper first characterizes $(r, \delta)$ -locality of a cyclic code via its zeros. Then we construct several classes of optimal cyclic $(r, \delta)$ -LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$ , respectively from the product of two sets of zeros. Our constructions include all optimal cyclic $(r,\delta)$ -LRCs proposed in , , and our method seems more convenient to obtain optimal cyclic $(r, \delta)$ -LRCs with flexible parameters. Moreover, many optimal cyclic $(r,\delta)$ -LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$ , respectively with $(r+\delta -1)\nmid n$ can be obtained from our method. [ABSTRACT FROM AUTHOR]

In an iterated non-cooperative game, if all the players act to maximize their individual accumulated payoff, the system as a whole usually converges to a Nash equilibrium that poorly benefits any player. Here we show that such an undesirable destiny is avoidable in an iterated Rock-Paper-Scissors (RPS) game involving two rational players, X and Y. Player X has the option of proactively adopting a cooperation-trap strategy, which enforces complete cooperation from the rational player Y and leads to a highly beneficial and maximally fair situation to both players. That maximal degree of cooperation is achievable in such a competitive system with cyclic dominance of actions may stimulate further theoretical and empirical studies on how to resolve conflicts and enhance cooperation in human societies. [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]

The aim of this paper is to introduce a new type of multi-valued operators and to present some basic problems of the fixed points and strict fixed points for them. Obtained results generalize, complement and extend classical results given by Ćirić (Mat. Vesnik 9 (24): 265-272, (1972)) or Nadler (Pacific J. Math. 30: 475-488 (1969)), as well as recent results given by Alecsa and PetruŞel (Anal. Univ. Vest Timisoara, LVII (1): 23-42 (2019)). [ABSTRACT FROM AUTHOR]