Journal of Combinatorial Mathematics and Combinatorial Computing

ISSN: 0835-3026 (print) 2817-576X (online)

The Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC) began its publishing journey in April 1987 and has since become a respected platform for advancing research in combinatorics and its applications.
Open Access: The journal follows the Diamond Open Access model—completely free for both authors and readers, with no article processing charges (APCs)
Publication Frequency: From 2024 onward, JCMCC publishes four issues annually—in March, June, September, and December.
Scope: JCMCC publishes research in combinatorial mathematics and combinatorial computing, as well as in artificial intelligence and its applications across diverse fields.
Indexing & Abstracting: The journal is indexed in MathSciNet, Zentralblatt MATH, and EBSCO, enhancing its visibility and scholarly impact within the international mathematics community.
Rapid Publication: Manuscripts are reviewed and processed efficiently, with accepted papers scheduled for prompt appearance in the next available issue.
Print & Online Editions: All issues are published in both print and online formats to serve the needs of a wide readership.

Zhicheng Ma1
1Songyuan Yongsheng Construction Company, Songyuan, Jilin, 138000, China
Abstract:

In today’s era, the rapid development of artificial intelligence is transforming warehousing and logistics by enhancing efficiency and reducing labor costs. In this paper, we first employ a least squares support vector machine to develop an inventory prediction model for warehousing logistics, accurately forecasting inventory values. Next, we design an automated logistics and warehousing architecture that facilitates seamless data transfer and information feedback. Finally, this architecture is used to build a comprehensive inventory management model. Our analysis shows that the AI-based prediction nearly matches the actual inventory value (229 vs. 230) and achieves an inventory turnover rate of 5 times per month, which significantly reduces backlog and improves overall management efficiency and user satisfaction.

Yanhao Guan1, Yi Lu1, Guolin Shao1
1School of Software, Nanchang University, Nanchang, Jiangxi, 330031, China
Abstract:

The Cascaded Integrator Comb (CIC) decimation filter is a pivotal technology extensively employed in digital signal processing (DSP). This paper delves into a comprehensive examination of the CIC algorithm within software-defined radio (SDR) systems from the perspective of parallel computing and introduces a novel Non-Recursive Implementation (NR-I) on an NVIDIA GPU using CUDA. The NR-I approach significantly reduces computational load by unfolding the recursive CIC structure with pre-derived Unfold Factors. Further optimization was achieved through data-transfer enhancements using PM Implementation (PM-I) and ODT Implementation (ODT-I). Experimental results demonstrate that NR-I achieves a speedup of over 449.48. Additionally, the data-transfer optimizations resulted in substantial performance improvements, with PM-I and ODT-I reducing execution time by 43.24% and 64.22%, respectively. The GPU implementation’s speedup is significantly greater than that of OpenMP, ranging from 3.34 to 10.22 times. These results underscore the effectiveness of the proposed Non-Recursive Implementation in accelerating time-intensive and data-intensive computations.

Elahe Mehraban1,2,3, T. Aaron Gulliver4, Ömür Deveci5, Evren Hincal1,2,3
1Mathematics Research Center, Near East University TRNC, Mersin 10, 99138 Nicosia, Turkey
2Department of Mathematics, Near East University TRNC, Mersin 10, 99138 Nicosia, Turkey
3Faculty of Art and Science, University of Kyrenia, TRNC, Mersin 10, 99320 Kyrenia, Turkey
4Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, V8W 2Y2, Canada
5Department of Mathematics, Faculty of Science and Letters Kafkas University, 36100, Turkey
Abstract:

This paper presents a new sequence called the \(k-\)division sequence. The Pell and Lehmer sequences are then used to define new sequences called the \(k-\)division \(L-\)Lehmer-Pell sequences and some properties of these sequences are determined. Then the \(k-\)division \(L-\)Lehmer-Pell sequences and corresponding self-invertible matrices are used in a new Affine-Hill cipher algorithm. The security of this cipher is examined.

Yan Wu1,2,3, Gao Liang2
1School of Marxism Studies, Hefei Normal University, Hefei, Anhui, 230021, China
2Institute of Intellectual Property, University of Science and Technology of China, Hefei, Anhui, 230026, China
3School of Humanities and Social Sciences, University of Science and Technology of China, Hefei, Anhui, 230026, China
Abstract:

In the era of globalization and intense market competition, strategic human resource management (SHRM) is critical for boosting corporate competitiveness. This study employs structural equation modeling (SEM) and multiple linear regression to uncover the complex influence of SHRM perceptions on employee proactive behaviors, and uses a convolutional neural network (CNN) to explore nonlinear relationships and validate the SEM findings. Results reveal that SHRM perception has a significant positive effect on employee proactive behavior (\(\beta = 0.254\), \(p<0.001\)). Mediators such as job self-efficacy and conceptual psychological contract play a positive role, with indirect effects of 0.1043 and 0.1726, respectively, while insider identity perception significantly moderates the relationship (\(\beta = 0.09\), \(p<0.01\)). The CNN model ranks the importance of variables in descending order as: conceptual psychological contract, job self-efficacy, SHRM perception, job category, and insider identity perception, consistent with the SEM results. These findings highlight the potential of CNNs to optimize HR strategies and enhance employee motivation.

Wei Fan1
1Namseoul University, Cheonan, Chungnam, South Korea
Abstract:

One of the urgent challenges in auditing today is preventing accounting management risk. This study integrates big data auditing technology to enhance audit quality by developing an audit risk assessment index system based on material misstatement risk and inspection risk. By combining the hierarchical analysis and entropy weighting methods to assign risk indicators, the accounting audit risk index for Company Z was calculated using a multi-level fuzzy comprehensive evaluation method and regression analysis to examine impact factors. Empirical evidence shows that the overall expected audit risk is 0.412—indicating a low to average risk level—with significant correlations between the previous year’s audit opinion, audit fee, and other factors such as the largest shareholder’s holding, board size, percentage of independent directors, operating income growth, net profit, and the audit environment. The study focuses on developing effective prevention and response strategies in the era of big data and offers recommendations to reduce potential auditing risks.

Zevi Miller1, Walker Yane2
1Department of Mathematics, Miami University, Oxford, OH 45056, USA
2Department of Mathematics, St. Louis University High School, St. Louis, Missouri
Abstract:

Let \(\mathcal{F}\) be a family of graphs, and \(H\) a “host” graph. A spanning subgraph \(G\) of \(H\) is called \(\mathcal{F}\)- saturated in \(H\) if \(G\) contains no member of \(\mathcal{F}\) as a subgraph, but \(G+e\) contains a member of \(\mathcal{F}\) for any edge \(e\in E(H) – E(G)\). We let \(Sat(H,\mathcal{F})\) be the minimum number of edges in any graph \(G\) which is \(\mathcal{F}\)-saturated in \(H\), where \(Sat(H,\mathcal{F}) = |E(H)|\) if \(H\) contains no member of \(\mathcal{F}\) as a subgraph. Let \(P_{m}^{r}\) be the \(r\)-dimensional grid, with entries in each coordinate taken from \(\{1,2,\cdots , m\}\), and \(K_{t}\) the complete graph on \(t\) vertices. Also let \(S(F)\) be the family of all subdivisions of a graph \(F\). There has been substantial previous work on extremal questions involving subdivisions of graphs, involving both \(Sat(K_{n},S(F))\) and the Turan function \(ex(K_{n},S(F))\), for \(F = K_{t}\) or \(F\) a complete bipartite graph. In this paper we study \(Sat(H, S(F))\) for the host graph \(H = P_{m}^{r}\), and \(F = K_{4}\), motivated by previous work on \(Sat(K_{n}, S(K_{t}))\). Our main results are the following; 1) If at least one of \(m\) or \(n\) is odd with \(m\geq 5\) and \(n\geq 5\), then \(Sat(P_{m}\times P_{n}, S(K_{4})) = mn + 1.\) 2) For \(m\) even and \(m\geq 4\), we have \(m^{3} + 1 \le Sat(P_{m}^{3}, S(K_{4}))\le m^{3} + 2.\) 3) For \( r\geq 3\) with \(m\) even and \(m\geq 4\), we have \(Sat(P_{m}^{r}, S(K_{4})) \le m^{r} + 2^{r-1} – 2\).

LeRoy B. Beasley1
1Clocktower Plaza#317, 550 North Main, Box C3 Logan, Utah 84321, USA
Abstract:

An undirected graph is said to be cordial if there is a friendly (0,1)-labeling of the vertices that induces a friendly (0,1)-labeling of the edges. An undirected graph \(G\) is said to be \((2,3)\)-orientable if there exists a friendly (0,1)-labeling of the vertices of \(G\) such that about one-third of the edges are incident to vertices labeled the same. That is, there is some digraph that is an orientation of \(G\) that is \((2,3)\)-cordial. Examples of the smallest noncordial/non-\((2,3)\)-orientable graphs are given, and upper bounds on the possible number of edges in a cordial/\((2,3)\)-orientable graph are presented. It is also shown that if \(T\) is a linear operator on the set of all undirected graphs on \(n\) vertices that strongly preserves the set of cordial graphs or the set of \((2,3)\)-orientable graphs, then \(T\) is a vertex permutation.

Liupeng Zhao1
1TC Beirne School of law, The University of Queensland, Brisbane, Queensland, 4072, Australia
Abstract:

With the social progress and technological development, China’s criminal activities gradually show the characteristics of specialization, networking, and hotspotting, which leads to the phenomenon of high incidence but low detection rate, and the prediction of the criminal phenomenon is particularly important. In this paper, we construct a graph self-encoder, and derive the formula of the GAE loss function from the corresponding reconstructed neighbor matrix and node feature loss function of GAE. The spatial channel attention mechanism is introduced to improve the performance of the model, and the time window dimension is mapped to the perceptual self-attention module, and the objective function is constructed by generating a collection of crime matrices for future time windows. A multi-raster layer analysis model is added to optimize the model, generate a risk map of criminal activities, quantify the risk value of each element, and form a spatio-temporal prediction effect. Comparison experiments are used to analyze the optimization effect of the model, and the absolute error of the optimized model is no more than 0.05 for four types of cases. The prediction results of the cases of property invasion in different time periods show that the number of cases occurring in the early hours of the morning is 508, and the average PEI index is 0.19, which is smaller compared with other time periods.

Yujue Wang1,2, Mat Redhuan Samsudin1, Noorlida Daud1
1Universiti Teknologi MARA(UiTM) Cawangan Kelantan, Bukit Ilmu, 18500 Machang, Kelantan Darul Naim Malaysia
2College of Humanities and Arts, Xi’an International University, Xi’an, Shaanxi, 710077, China
Abstract:

With the rapid urbanization and expansion of subway rail transit, the subway has become an essential mode of public transportation. This study explores the impact of subway car color design on passengers’ psychological responses. Utilizing computer vision technology and a pruning algorithm, a target detection model for passenger expression recognition was developed, serving as an intuitive measure of psychological reactions. An optimized expression feature extraction network was constructed for facial expression recognition, while a multidimensional data analysis model, based on data mining, provided comprehensive insights. The study reveals that green, red, and yellow lighting evoke positive psychological responses, whereas blue and purple induce calmer or more somber reactions. These findings offer valuable guidance for urban subway carriage color lighting design, enhancing passenger experience.

Yuchen Wang1
1Business School, Monash University, Melbourne, VIC 3145, Australia
Abstract:

As economic globalization progresses, air transport has become increasingly vital to economic development due to its speed and convenience. This study examines the driving forces of airside economic construction across four levels: primary, secondary, derivative, and permanent influences. It explores the dynamic interplay between the aviation industry and airside economic construction. Using the entropy weight method to optimize the grey situation decision-making theory, the paper investigates the development strategies for Henan Province’s airside economy. Results indicate that the H2 area should be prioritized as the key construction zone, achieving the highest effect measurement score of 0.9789. Furthermore, focusing on the development of the tertiary industry or the joint advancement of secondary and tertiary industries in the H2 area yields the most significant economic impact, with effect measurement scores of 0.755 and 0.749, respectively.

E-mail Alert

Add your e-mail address to receive upcoming issues of Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC).

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;