This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤ<sub>n</sub> modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study ...This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤ<sub>n</sub> modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study of ring theory, depict relationships between elements of a ring that multiply to zero. The paper explores the development and implementation of algorithms in MAPLE for constructing these ZDGs. The comparative study aims to discern the strengths, limitations, and computational efficiency of different MAPLE algorithms for creating zero divisor graphs offering insights for mathematicians, researchers, and computational enthusiasts involved in ring theory and mathematical computations.展开更多
In this paper,we investigate spacelike graphs defined over a domain Ω⊂M^(n) in the Lorentz manifold M^(n)×ℝ with the metric−ds^(2)+σ,where M^(n) is a complete Riemannian n-manifold with the metricσ,Ωhas piece...In this paper,we investigate spacelike graphs defined over a domain Ω⊂M^(n) in the Lorentz manifold M^(n)×ℝ with the metric−ds^(2)+σ,where M^(n) is a complete Riemannian n-manifold with the metricσ,Ωhas piecewise smooth boundary,and ℝ denotes the Euclidean 1-space.We prove an interesting stability result for translating spacelike graphs in M^(n)×ℝ under a conformal transformation.展开更多
Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal c...Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal coalitions) that are of interest for the game. Additionally, a partition of the game is defined in terms of the gain of each block, and subsequently, a solution to the game is defined based on distributing to each player (node and edge) present in each block a payment proportional to their contribution to the coalition.展开更多
In this paper, we investigate a blow-up phenomenon for a semilinear parabolic system on locally finite graphs. Under some appropriate assumptions on the curvature condition CDE’(n,0), the polynomial volume growth of ...In this paper, we investigate a blow-up phenomenon for a semilinear parabolic system on locally finite graphs. Under some appropriate assumptions on the curvature condition CDE’(n,0), the polynomial volume growth of degree m, the initial values, and the exponents in absorption terms, we prove that every non-negative solution of the semilinear parabolic system blows up in a finite time. Our current work extends the results achieved by Lin and Wu (Calc Var Partial Differ Equ, 2017, 56: Art 102) and Wu (Rev R Acad Cien Serie A Mat, 2021, 115: Art 133).展开更多
Let k be a positive integer and G a bipartite graph with bipartition (X,Y). A perfect 1-k matching is an edge subset M of G such that each vertex in Y is incident with exactly one edge in M and each vertex in X is inc...Let k be a positive integer and G a bipartite graph with bipartition (X,Y). A perfect 1-k matching is an edge subset M of G such that each vertex in Y is incident with exactly one edge in M and each vertex in X is incident with exactly k edges in M. A perfect 1-k matching is an optimal semi-matching related to the load-balancing problem, where a semi-matching is an edge subset M such that each vertex in Y is incident with exactly one edge in M, and a vertex in X can be incident with an arbitrary number of edges in M. In this paper, we give three sufficient and necessary conditions for the existence of perfect 1-k matchings and for the existence of 1-k matchings covering | X |−dvertices in X, respectively, and characterize k-elementary bipartite graph which is a graph such that the subgraph induced by all k-allowed edges is connected, where an edge is k-allowed if it is contained in a perfect 1-k matching.展开更多
This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears...This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears as commonplace in many realistic scenarios.Regarding this,we consider graphs composed of rings,with some possible connected paths between them.Without prior knowledge of the exact node permutations on rings,the existence of each edge can be unraveled through edge testing at a unit cost in one step.The problem examined is that of determining whether the given nodes are connected by a path or separated by a cut,with the minimum expected costs involved.Dividing the problem into different cases based on different topologies of the ring-based networks,we propose the corresponding policies that aim to quickly seek the paths between nodes.A common feature shared by all those policies is that we stick to going in the same direction during edge searching,with edge testing in each step only involving the test between the source and the node that has been tested most.The simple searching rule,interestingly,can be interpreted as a delightful property stemming from the neat structure of ring-based networks,which makes the searching process not rely on any sophisticated behaviors.We prove the optimality of the proposed policies by calculating the expected cost incurred and making a comparison with the other class of strategies.The effectiveness of the proposed policies is also verified through extensive simulations,from which we even disclose three extra intriguing findings:i)in a onering network,the cost will grow drastically with the number of designated nodes when the number is small and will grow slightly when that number is large;ii)in ring-based network,Depth First is optimal in detecting the connectivity between designated nodes;iii)the problem of multi-ring networks shares large similarity with that of two-ring networks,and a larger number of ties between rings will not influence the expected cost.展开更多
Graph learning,when used as a semi-supervised learning(SSL)method,performs well for classification tasks with a low label rate.We provide a graph-based batch active learning pipeline for pixel/patch neighborhood multi...Graph learning,when used as a semi-supervised learning(SSL)method,performs well for classification tasks with a low label rate.We provide a graph-based batch active learning pipeline for pixel/patch neighborhood multi-or hyperspectral image segmentation.Our batch active learning approach selects a collection of unlabeled pixels that satisfy a graph local maximum constraint for the active learning acquisition function that determines the relative importance of each pixel to the classification.This work builds on recent advances in the design of novel active learning acquisition functions(e.g.,the Model Change approach in arXiv:2110.07739)while adding important further developments including patch-neighborhood image analysis and batch active learning methods to further increase the accuracy and greatly increase the computational efficiency of these methods.In addition to improvements in the accuracy,our approach can greatly reduce the number of labeled pixels needed to achieve the same level of the accuracy based on randomly selected labeled pixels.展开更多
With the rapid growth of the maritime Internet of Things(IoT)devices for Maritime Monitor Services(MMS),maritime traffic controllers could not handle a massive amount of data in time.For unmanned MMS,one of the key te...With the rapid growth of the maritime Internet of Things(IoT)devices for Maritime Monitor Services(MMS),maritime traffic controllers could not handle a massive amount of data in time.For unmanned MMS,one of the key technologies is situation understanding.However,the presence of slow-fast high maneuvering targets and track breakages due to radar blind zones make modeling the dynamics of marine multi-agents difficult,and pose significant challenges to maritime situation understanding.In order to comprehend the situation accurately and thus offer unmanned MMS,it is crucial to model the complex dynamics of multi-agents using IoT big data.Nevertheless,previous methods typically rely on complex assumptions,are plagued by unstructured data,and disregard the interactions between multiple agents and the spatial-temporal correlations.A deep learning model,Graph Spatial-Temporal Generative Adversarial Network(GraphSTGAN),is proposed in this paper,which uses graph neural network to model unstructured data and uses STGAN to learn the spatial-temporal dependencies and interactions.Extensive experiments show the effectiveness and robustness of the proposed method.展开更多
To date, it is unknown whether it is possible to construct a complete graph invariant in polynomial time, so fast algorithms for checking non-isomorphism are important, including heuristic algorithms, and for successf...To date, it is unknown whether it is possible to construct a complete graph invariant in polynomial time, so fast algorithms for checking non-isomorphism are important, including heuristic algorithms, and for successful implementations of such heuristics, both the tasks of some modification of previously described graph invariants and the description of new invariants remain relevant. Many of the described invariants make it possible to distinguish a larger number of graphs in the real time of a computer program. In this paper, we propose an invariant for a special kind of directed graphs, namely, for tournaments. The last ones, from our point of view, are interesting because when fixing the order of vertices, the number of different tournaments is exactly equal to the number of undirected graphs, also with fixing the order of vertices. In the invariant we are considering, all possible tournaments consisting of a subset of vertices of a given digraph with the same set of arcs are iterated over. For such subset tournaments, the places are calculated in the usual way, which are summed up to obtain the final values of the points of the vertices;these points form the proposed invariant. As we expected, calculations of the new invariant showed that it does not coincide with the most natural invariant for tournaments, in which the number of points is calculated for each participant. So far, we have conducted a small number of computational experiments, and the minimum value of the pair correlation between the sequences representing these two invariants that we found is for dimension 15.展开更多
A{(3,4),4}-fullerene graph S is a 4-regular map on the sphere whose faces are of length 3 or 4.It follows from Euler s formula that the number of triangular faces is eight.A set H of disjoint quadrangular faces of S i...A{(3,4),4}-fullerene graph S is a 4-regular map on the sphere whose faces are of length 3 or 4.It follows from Euler s formula that the number of triangular faces is eight.A set H of disjoint quadrangular faces of S is called resonant pattern if S has a perfect matching M such that every quadrangular face in H is M-alternating.Let k be a positive integer,S is k-resonant if any i≤k disjoint quadrangular faces of S form a resonant pattern.Moreover,if graph S is k-resonant for any integer k,then S is called maximally resonant.In this paper,we show that the maximally resonant{(3,4),4}-fullerene graphs are S_6,S_8,S_(10)^(2),S_(12)^(2),S_(12)^(4),S_(12)^(5),S_(14)^(3),S_(14)^(5),S_(16)^(3),S_(18)^(5),S_(24)as shown in Fig.1.As a corollary,it is shown that if a{(3,4),4}-fullerene graph is 4-resonant,then it is also maximally resonant.展开更多
Let G be a graph. A bipartition of G is a bipartition of V (G) with V (G) = V<sub>1</sub> ∪ V<sub>2</sub> and V<sub>1</sub> ∩ V<sub>2</sub> = ∅. If a bipartition satis...Let G be a graph. A bipartition of G is a bipartition of V (G) with V (G) = V<sub>1</sub> ∪ V<sub>2</sub> and V<sub>1</sub> ∩ V<sub>2</sub> = ∅. If a bipartition satisfies ∥V<sub>1</sub>∣ - ∣V<sub>2</sub>∥ ≤ 1, we call it a bisection. The research in this paper is mainly based on a conjecture proposed by Bollobás and Scott. The conjecture is that every graph G has a bisection (V<sub>1</sub>, V<sub>2</sub>) such that ∀v ∈ V<sub>1</sub>, at least half minuses one of the neighbors of v are in the V<sub>2</sub>;∀v ∈ V<sub>2</sub>, at least half minuses one of the neighbors of v are in the V<sub>1</sub>. In this paper, we confirm this conjecture for some bipartite graphs, crown graphs and windmill graphs.展开更多
The Total Coloring Conjecture (TCC) proposes that every simple graph G is (Δ + 2)-totally-colorable, where Δ is the maximum degree of G. For planar graph, TCC is open only in case Δ = 6. In this paper, we prove tha...The Total Coloring Conjecture (TCC) proposes that every simple graph G is (Δ + 2)-totally-colorable, where Δ is the maximum degree of G. For planar graph, TCC is open only in case Δ = 6. In this paper, we prove that TCC holds for planar graph with Δ = 6 and every 7-cycle contains at most two chords.展开更多
This paper explores the connotations of mathematical aesthetics and its connections with art,facilitated by collaboration with Ester,an individual with an artistic professional background.It begins by tracing the hist...This paper explores the connotations of mathematical aesthetics and its connections with art,facilitated by collaboration with Ester,an individual with an artistic professional background.It begins by tracing the historical evolution of aesthetics from the classical pursuit of authenticity to the modern shift toward self-expression in art.The discussion then highlights the similarities in the pursuit of truth between mathematics and art,despite their methodological differences.Through an analysis of aesthetic elements in mathematics,such as lines and function graphs,the article illustrates that the beauty of mathematics is not only manifested in cognitive processes but can also be intuitively expressed through visual arts.The paper further examines the influence of mathematics on the development of art,particularly how Leonardo da Vinci applied mathematical principles to his artworks.Additionally,the article addresses art students’perceptions of mathematics,proposes the customization of math courses for art students,and discusses future trends in the integration of mathematics and art,emphasizing the significance of art therapy and the altruistic direction of art.Lastly,the authors use a poster to visually convey the idea that the beauty of mathematics can be experienced through the senses.展开更多
The integration of the history of mathematics into junior middle school mathematics education represents a significant focus of international research in mathematics and education.The mathematics curriculum standards ...The integration of the history of mathematics into junior middle school mathematics education represents a significant focus of international research in mathematics and education.The mathematics curriculum standards for compulsory education have emphasized the importance of incorporating the history of mathematics,aiming to gradually integrate it into the mathematics classroom.However,in the practical implementation of junior middle school mathematics education,the effective combination of the history of mathematics with teaching methodologies remains largely unexplored.This article explores the integration of junior middle school mathematics education and the history of mathematics,aiming to provide classroom teaching recommendations for teachers and promote the formation of students’mathematical literacy.展开更多
Assessment exercises constitute a crucial component of the teaching and learning process,serving the purpose of gauging the degree to which learning objectives have been accomplished.This study aims to assess the math...Assessment exercises constitute a crucial component of the teaching and learning process,serving the purpose of gauging the degree to which learning objectives have been accomplished.This study aims to assess the mathematics performance of Grade 7 learners using the 50-30-20 exercise.Specifically,this study seeks to determine the learners’pre-test and post-test mean scores,identify significant differences between the pre-test and post-test results,evaluate learners’exercises,and propose enhanced exercises.The research employs a quasi-experimental design,with 40 Grade 7 learners in the school year 2023-2024 as participants,selected through purposive non-random sampling.Statistical data analysis involves the use of mean,standard deviation,paired t-test,and Cohen’s D effect size.Ethical considerations were paramount,as evidenced by a letter of authorization from the school head outlining the strict adherence to voluntary participation,informed parental consent,anonymity,confidentiality,risk mitigation,results-sharing protocols,and the commitment to keeping research data confidential.The data yielded a remarkable outcome:the experimental group exhibited improvement in both the pre-test and post-test.This result substantiates the initial objective of the study,showcasing a noteworthy and favorable performance among the participants.Consequently,it suggests that a majority of the participants strongly agree that the 50-30-20 exercises contribute to enhancing their understanding and problem-solving skills,as well as their ability to grasp mathematical concepts and improve their overall performance in mathematics.Therefore,the 50-30-20 exercises not only facilitated students in understanding mathematics lessons but were also aligned with the Department of Education’s development plan.展开更多
Since the new century,China’s mathematics curriculum reform in basic education has continued to move forward in attempts and explorations,presenting many new changes,trends,movements,and developments.Sorting out,anal...Since the new century,China’s mathematics curriculum reform in basic education has continued to move forward in attempts and explorations,presenting many new changes,trends,movements,and developments.Sorting out,analyzing,and summarizing the achievements,experiences,problems,and challenges in this journey are conducive to providing insights for the reform and development of the Chinese basic education mathematics curriculum in the new era.This paper analyses the research on mathematics education in China(1999-2024)using the visual measurement of CiteSpace knowledge mapping,hoping to provide directions for the future of mathematics education in China.展开更多
The“Ordinary High School Mathematics Curriculum Standards(2017 Edition,2020 Revision)”clearly stated in“Teaching Suggestions”that“teaching activities based on the core literacy of mathematics should grasp the ess...The“Ordinary High School Mathematics Curriculum Standards(2017 Edition,2020 Revision)”clearly stated in“Teaching Suggestions”that“teaching activities based on the core literacy of mathematics should grasp the essence of mathematics,create appropriate teaching situations,put forward appropriate mathematical questions,stimulate students to think and communicate,and form and develop the core literacy of mathematics.”The task-driven teaching model is a new type of teaching method that takes tasks as the main line,teachers as the guide,and students as the main body,which can enable students to engage deeply in classroom discussions and think actively.Based on the characteristics and principles of the task-driven teaching method,this paper designs a high school mathematics classroom teaching based on the task-driven teaching method,hoping to provide a reference for the majority of front-line teachers.展开更多
At present,textbooks based on core literacy have become the inevitable demands of China’s curriculum reform,and the literacy of textbook goal construction is the key to the implementation of core literacy requirement...At present,textbooks based on core literacy have become the inevitable demands of China’s curriculum reform,and the literacy of textbook goal construction is the key to the implementation of core literacy requirements,which is a huge challenge for textbook compilers.In this paper,we use the visual metrology of the CiteSpace knowledge graph to analyze Chinese mathematics textbooks(1999-2024),hoping to guide the future direction of Chinese mathematics textbook research.展开更多
Under the background of digital transformation,the reform of the higher vocational mathematics curriculum faces urgent challenges and opportunities.This article explores the impact of digital transformation on the ref...Under the background of digital transformation,the reform of the higher vocational mathematics curriculum faces urgent challenges and opportunities.This article explores the impact of digital transformation on the reform of higher vocational mathematics curriculum and emphasizes the importance of improving teaching methods centered on learners.The article proposes specific reform methods and discusses the practical application of digital technology in the reform process.By combining digital technology with specific reform methods,further conducting innovative practice research,and continuously exploring the path of reform,we can effectively improve the quality of higher vocational mathematics classroom teaching and provide strong support for the cultivation of comprehensive qualities and employment abilities.展开更多
文摘This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤ<sub>n</sub> modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study of ring theory, depict relationships between elements of a ring that multiply to zero. The paper explores the development and implementation of algorithms in MAPLE for constructing these ZDGs. The comparative study aims to discern the strengths, limitations, and computational efficiency of different MAPLE algorithms for creating zero divisor graphs offering insights for mathematicians, researchers, and computational enthusiasts involved in ring theory and mathematical computations.
基金supported in part by the NSFC(11801496,11926352)the Fok Ying-Tung Education Foundation(China)the Hubei Key Laboratory of Applied Mathematics(Hubei University).
文摘In this paper,we investigate spacelike graphs defined over a domain Ω⊂M^(n) in the Lorentz manifold M^(n)×ℝ with the metric−ds^(2)+σ,where M^(n) is a complete Riemannian n-manifold with the metricσ,Ωhas piecewise smooth boundary,and ℝ denotes the Euclidean 1-space.We prove an interesting stability result for translating spacelike graphs in M^(n)×ℝ under a conformal transformation.
文摘Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal coalitions) that are of interest for the game. Additionally, a partition of the game is defined in terms of the gain of each block, and subsequently, a solution to the game is defined based on distributing to each player (node and edge) present in each block a payment proportional to their contribution to the coalition.
基金supported by the Zhejiang Provincial Natural Science Foundation of China(LY21A010016)the National Natural Science Foundation of China(11901550).
文摘In this paper, we investigate a blow-up phenomenon for a semilinear parabolic system on locally finite graphs. Under some appropriate assumptions on the curvature condition CDE’(n,0), the polynomial volume growth of degree m, the initial values, and the exponents in absorption terms, we prove that every non-negative solution of the semilinear parabolic system blows up in a finite time. Our current work extends the results achieved by Lin and Wu (Calc Var Partial Differ Equ, 2017, 56: Art 102) and Wu (Rev R Acad Cien Serie A Mat, 2021, 115: Art 133).
文摘Let k be a positive integer and G a bipartite graph with bipartition (X,Y). A perfect 1-k matching is an edge subset M of G such that each vertex in Y is incident with exactly one edge in M and each vertex in X is incident with exactly k edges in M. A perfect 1-k matching is an optimal semi-matching related to the load-balancing problem, where a semi-matching is an edge subset M such that each vertex in Y is incident with exactly one edge in M, and a vertex in X can be incident with an arbitrary number of edges in M. In this paper, we give three sufficient and necessary conditions for the existence of perfect 1-k matchings and for the existence of 1-k matchings covering | X |−dvertices in X, respectively, and characterize k-elementary bipartite graph which is a graph such that the subgraph induced by all k-allowed edges is connected, where an edge is k-allowed if it is contained in a perfect 1-k matching.
基金supported by NSF China(No.61960206002,62020106005,42050105,62061146002)Shanghai Pilot Program for Basic Research-Shanghai Jiao Tong University。
文摘This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears as commonplace in many realistic scenarios.Regarding this,we consider graphs composed of rings,with some possible connected paths between them.Without prior knowledge of the exact node permutations on rings,the existence of each edge can be unraveled through edge testing at a unit cost in one step.The problem examined is that of determining whether the given nodes are connected by a path or separated by a cut,with the minimum expected costs involved.Dividing the problem into different cases based on different topologies of the ring-based networks,we propose the corresponding policies that aim to quickly seek the paths between nodes.A common feature shared by all those policies is that we stick to going in the same direction during edge searching,with edge testing in each step only involving the test between the source and the node that has been tested most.The simple searching rule,interestingly,can be interpreted as a delightful property stemming from the neat structure of ring-based networks,which makes the searching process not rely on any sophisticated behaviors.We prove the optimality of the proposed policies by calculating the expected cost incurred and making a comparison with the other class of strategies.The effectiveness of the proposed policies is also verified through extensive simulations,from which we even disclose three extra intriguing findings:i)in a onering network,the cost will grow drastically with the number of designated nodes when the number is small and will grow slightly when that number is large;ii)in ring-based network,Depth First is optimal in detecting the connectivity between designated nodes;iii)the problem of multi-ring networks shares large similarity with that of two-ring networks,and a larger number of ties between rings will not influence the expected cost.
基金supported by the UC-National Lab In-Residence Graduate Fellowship Grant L21GF3606supported by a DOD National Defense Science and Engineering Graduate(NDSEG)Research Fellowship+1 种基金supported by the Laboratory Directed Research and Development program of Los Alamos National Laboratory under project numbers 20170668PRD1 and 20210213ERsupported by the NGA under Contract No.HM04762110003.
文摘Graph learning,when used as a semi-supervised learning(SSL)method,performs well for classification tasks with a low label rate.We provide a graph-based batch active learning pipeline for pixel/patch neighborhood multi-or hyperspectral image segmentation.Our batch active learning approach selects a collection of unlabeled pixels that satisfy a graph local maximum constraint for the active learning acquisition function that determines the relative importance of each pixel to the classification.This work builds on recent advances in the design of novel active learning acquisition functions(e.g.,the Model Change approach in arXiv:2110.07739)while adding important further developments including patch-neighborhood image analysis and batch active learning methods to further increase the accuracy and greatly increase the computational efficiency of these methods.In addition to improvements in the accuracy,our approach can greatly reduce the number of labeled pixels needed to achieve the same level of the accuracy based on randomly selected labeled pixels.
基金supported by National Natural Science Foundation of China under Grants No.62076249,62022092,62293545.
文摘With the rapid growth of the maritime Internet of Things(IoT)devices for Maritime Monitor Services(MMS),maritime traffic controllers could not handle a massive amount of data in time.For unmanned MMS,one of the key technologies is situation understanding.However,the presence of slow-fast high maneuvering targets and track breakages due to radar blind zones make modeling the dynamics of marine multi-agents difficult,and pose significant challenges to maritime situation understanding.In order to comprehend the situation accurately and thus offer unmanned MMS,it is crucial to model the complex dynamics of multi-agents using IoT big data.Nevertheless,previous methods typically rely on complex assumptions,are plagued by unstructured data,and disregard the interactions between multiple agents and the spatial-temporal correlations.A deep learning model,Graph Spatial-Temporal Generative Adversarial Network(GraphSTGAN),is proposed in this paper,which uses graph neural network to model unstructured data and uses STGAN to learn the spatial-temporal dependencies and interactions.Extensive experiments show the effectiveness and robustness of the proposed method.
文摘To date, it is unknown whether it is possible to construct a complete graph invariant in polynomial time, so fast algorithms for checking non-isomorphism are important, including heuristic algorithms, and for successful implementations of such heuristics, both the tasks of some modification of previously described graph invariants and the description of new invariants remain relevant. Many of the described invariants make it possible to distinguish a larger number of graphs in the real time of a computer program. In this paper, we propose an invariant for a special kind of directed graphs, namely, for tournaments. The last ones, from our point of view, are interesting because when fixing the order of vertices, the number of different tournaments is exactly equal to the number of undirected graphs, also with fixing the order of vertices. In the invariant we are considering, all possible tournaments consisting of a subset of vertices of a given digraph with the same set of arcs are iterated over. For such subset tournaments, the places are calculated in the usual way, which are summed up to obtain the final values of the points of the vertices;these points form the proposed invariant. As we expected, calculations of the new invariant showed that it does not coincide with the most natural invariant for tournaments, in which the number of points is calculated for each participant. So far, we have conducted a small number of computational experiments, and the minimum value of the pair correlation between the sequences representing these two invariants that we found is for dimension 15.
基金Supported by NSFC(Grant Nos.11801148 and 11626089)the Foundation for the Doctor of Henan Polytechnic University(Grant No.B2014-060)。
文摘A{(3,4),4}-fullerene graph S is a 4-regular map on the sphere whose faces are of length 3 or 4.It follows from Euler s formula that the number of triangular faces is eight.A set H of disjoint quadrangular faces of S is called resonant pattern if S has a perfect matching M such that every quadrangular face in H is M-alternating.Let k be a positive integer,S is k-resonant if any i≤k disjoint quadrangular faces of S form a resonant pattern.Moreover,if graph S is k-resonant for any integer k,then S is called maximally resonant.In this paper,we show that the maximally resonant{(3,4),4}-fullerene graphs are S_6,S_8,S_(10)^(2),S_(12)^(2),S_(12)^(4),S_(12)^(5),S_(14)^(3),S_(14)^(5),S_(16)^(3),S_(18)^(5),S_(24)as shown in Fig.1.As a corollary,it is shown that if a{(3,4),4}-fullerene graph is 4-resonant,then it is also maximally resonant.
文摘Let G be a graph. A bipartition of G is a bipartition of V (G) with V (G) = V<sub>1</sub> ∪ V<sub>2</sub> and V<sub>1</sub> ∩ V<sub>2</sub> = ∅. If a bipartition satisfies ∥V<sub>1</sub>∣ - ∣V<sub>2</sub>∥ ≤ 1, we call it a bisection. The research in this paper is mainly based on a conjecture proposed by Bollobás and Scott. The conjecture is that every graph G has a bisection (V<sub>1</sub>, V<sub>2</sub>) such that ∀v ∈ V<sub>1</sub>, at least half minuses one of the neighbors of v are in the V<sub>2</sub>;∀v ∈ V<sub>2</sub>, at least half minuses one of the neighbors of v are in the V<sub>1</sub>. In this paper, we confirm this conjecture for some bipartite graphs, crown graphs and windmill graphs.
文摘The Total Coloring Conjecture (TCC) proposes that every simple graph G is (Δ + 2)-totally-colorable, where Δ is the maximum degree of G. For planar graph, TCC is open only in case Δ = 6. In this paper, we prove that TCC holds for planar graph with Δ = 6 and every 7-cycle contains at most two chords.
文摘This paper explores the connotations of mathematical aesthetics and its connections with art,facilitated by collaboration with Ester,an individual with an artistic professional background.It begins by tracing the historical evolution of aesthetics from the classical pursuit of authenticity to the modern shift toward self-expression in art.The discussion then highlights the similarities in the pursuit of truth between mathematics and art,despite their methodological differences.Through an analysis of aesthetic elements in mathematics,such as lines and function graphs,the article illustrates that the beauty of mathematics is not only manifested in cognitive processes but can also be intuitively expressed through visual arts.The paper further examines the influence of mathematics on the development of art,particularly how Leonardo da Vinci applied mathematical principles to his artworks.Additionally,the article addresses art students’perceptions of mathematics,proposes the customization of math courses for art students,and discusses future trends in the integration of mathematics and art,emphasizing the significance of art therapy and the altruistic direction of art.Lastly,the authors use a poster to visually convey the idea that the beauty of mathematics can be experienced through the senses.
基金The Discipline Resource Construction Project of Jiangsu Second Normal University(Project number:JSSNU03202222)。
文摘The integration of the history of mathematics into junior middle school mathematics education represents a significant focus of international research in mathematics and education.The mathematics curriculum standards for compulsory education have emphasized the importance of incorporating the history of mathematics,aiming to gradually integrate it into the mathematics classroom.However,in the practical implementation of junior middle school mathematics education,the effective combination of the history of mathematics with teaching methodologies remains largely unexplored.This article explores the integration of junior middle school mathematics education and the history of mathematics,aiming to provide classroom teaching recommendations for teachers and promote the formation of students’mathematical literacy.
文摘Assessment exercises constitute a crucial component of the teaching and learning process,serving the purpose of gauging the degree to which learning objectives have been accomplished.This study aims to assess the mathematics performance of Grade 7 learners using the 50-30-20 exercise.Specifically,this study seeks to determine the learners’pre-test and post-test mean scores,identify significant differences between the pre-test and post-test results,evaluate learners’exercises,and propose enhanced exercises.The research employs a quasi-experimental design,with 40 Grade 7 learners in the school year 2023-2024 as participants,selected through purposive non-random sampling.Statistical data analysis involves the use of mean,standard deviation,paired t-test,and Cohen’s D effect size.Ethical considerations were paramount,as evidenced by a letter of authorization from the school head outlining the strict adherence to voluntary participation,informed parental consent,anonymity,confidentiality,risk mitigation,results-sharing protocols,and the commitment to keeping research data confidential.The data yielded a remarkable outcome:the experimental group exhibited improvement in both the pre-test and post-test.This result substantiates the initial objective of the study,showcasing a noteworthy and favorable performance among the participants.Consequently,it suggests that a majority of the participants strongly agree that the 50-30-20 exercises contribute to enhancing their understanding and problem-solving skills,as well as their ability to grasp mathematical concepts and improve their overall performance in mathematics.Therefore,the 50-30-20 exercises not only facilitated students in understanding mathematics lessons but were also aligned with the Department of Education’s development plan.
文摘Since the new century,China’s mathematics curriculum reform in basic education has continued to move forward in attempts and explorations,presenting many new changes,trends,movements,and developments.Sorting out,analyzing,and summarizing the achievements,experiences,problems,and challenges in this journey are conducive to providing insights for the reform and development of the Chinese basic education mathematics curriculum in the new era.This paper analyses the research on mathematics education in China(1999-2024)using the visual measurement of CiteSpace knowledge mapping,hoping to provide directions for the future of mathematics education in China.
文摘The“Ordinary High School Mathematics Curriculum Standards(2017 Edition,2020 Revision)”clearly stated in“Teaching Suggestions”that“teaching activities based on the core literacy of mathematics should grasp the essence of mathematics,create appropriate teaching situations,put forward appropriate mathematical questions,stimulate students to think and communicate,and form and develop the core literacy of mathematics.”The task-driven teaching model is a new type of teaching method that takes tasks as the main line,teachers as the guide,and students as the main body,which can enable students to engage deeply in classroom discussions and think actively.Based on the characteristics and principles of the task-driven teaching method,this paper designs a high school mathematics classroom teaching based on the task-driven teaching method,hoping to provide a reference for the majority of front-line teachers.
文摘At present,textbooks based on core literacy have become the inevitable demands of China’s curriculum reform,and the literacy of textbook goal construction is the key to the implementation of core literacy requirements,which is a huge challenge for textbook compilers.In this paper,we use the visual metrology of the CiteSpace knowledge graph to analyze Chinese mathematics textbooks(1999-2024),hoping to guide the future direction of Chinese mathematics textbook research.
基金Classroom Revolution Special Project for Teaching Construction and Reform at Jiangsu Vocational College of Electronics and Information(JX-G-2023-04)。
文摘Under the background of digital transformation,the reform of the higher vocational mathematics curriculum faces urgent challenges and opportunities.This article explores the impact of digital transformation on the reform of higher vocational mathematics curriculum and emphasizes the importance of improving teaching methods centered on learners.The article proposes specific reform methods and discusses the practical application of digital technology in the reform process.By combining digital technology with specific reform methods,further conducting innovative practice research,and continuously exploring the path of reform,we can effectively improve the quality of higher vocational mathematics classroom teaching and provide strong support for the cultivation of comprehensive qualities and employment abilities.