Journal of Informatics and Mathematical Sciences

Applications of the Tachibana Operator for Invariant Pseudoparallel Submanifold in Kenmotsu Manifolds Equipped With a General Connection

2025-11-20T08:32:54+0530

The present paper aims to study invariant pseudoparallel submanifolds of a Kenmotsu manifold admitting general connection, obtain necessary and sufficient conditions for an invariant pseudoparallel submanifold to be totally geodesic under some conditions. Furthermore, we investigate the conditions on the general connection of an invariant submanifold of a Kenmotsu manifold.

Enhanced Survey Estimation Using Calibration under Scrambled Response and Measurement Error

2025-10-15T16:43:53+0530

This study addresses the challenges of collecting accurate data on sensitive issues by applying various Scrambled Response Techniques combined with various calibration estimators under measurement error. A simulation study using real data evaluates the performance of the proposed estimators both with and without measurement error. Results show that the proposed method consistently outperforms traditional Scrambled Response Technique, demonstrating greater efficiency and reliability in handling sensitive survey data.

A New Non-Divergent Root Finding Algorithm

2025-08-24T14:24:53+0530

A new iteration algorithm is proposed. The algorithm does not diverge when the first derivative is zero or nearly zero as in the case of Newton-Raphson method. The convergence rate of the new algorithm is linear compared to the quadratic convergence of the Newton-Raphson method (The Newton-Raphson method is faster). The algorithm significantly increases the interval of convergence for roots. A hybrid algorithm combining the increase in the range of convergence of the new method and the faster rate of convergence of the Newton-Raphson method is suggested. The criterion to select the best choice during the running of the algorithm is given. Numerical examples are treated and the three methods (Non-Divergent Algorithm, Newton-Raphson method and the Hybrid method) are contrasted with each other. The hybrid method is recommended since it decreases the number of iterations and increases the range of convergence.

Reconstruction of a Discontinuous Refractive Index Using Modified Transmission Eigenvalues

2025-09-08T08:11:09+0530

We consider the inverse problem of reconstructing a spherically symmetric and discontinuous refractive index using modified interior transmission eigenvalues. We first investigate the asymptotic behavior of the characteristic function. Then we establish the uniqueness of a discontinuous refractive index from modified transmission eigenvalues without assuming that the contrast has a fixed sign. Finally, numerical examples are presented to verify the uniqueness results.

Integrating Algorithms for Complete Bipartite Graph in Network Analysis

2025-11-23T07:28:00+0530

This study aims to provide a comprehensive overview of network analysis, emphasizing the construction and application of complete bipartite graphs within organizational networks. The approach integrates both statistical and algorithmic perspectives to explore the network relationships among components in a system. In this framework, complete bipartite graphs serve as a powerful structure for implementing classical graph theory algorithms to address key problems such as game theory valuation, minimum spanning tree (MST) construction, maximum flow determination, and maximum weight matching. To address these problems, various well-established techniques are employed: the graphical method is used to solve the value of the game, Prim’s algorithm for finding the MST, the Ford-Fulkerson Algorithm for computing the maximum flow, and the Hungarian Algorithm for identifying the maximum weight matching in a complete bipartite graph. These methodologies are demonstrated through suitable numerical examples within a unified network design framework. The complete bipartite graph structure, characterized by its full interconnectedness across vertex sets, enables greater flexibility and precision in handling complex network-related problems typically encountered in organizational and operational contexts. The findings are essential for optimizing human resource allocations across departments, improving supply chain logistics by matching suppliers to distributors, balancing workloads in distributed computing systems, and enhancing communication flow in hierarchical structures. Furthermore, this model is particularly beneficial in scenarios such as task scheduling, transportation planning, and decision-making processes where interdependent entities must be efficiently paired or evaluated.