Graphs describe pairwise relations, while hypergraphs represent interactions involving more than two vertices. Super-HyperGraphs further permit vertices to be selected from iterated powersets, so that incidences can occur among nested objects such as teams, clusters, departments, portfolios, or control units. Many systems with such hierarchical organization are also time-dependent: their relations appear, disappear, or change activity over discrete or continuous time. Existing temporal graphs and temporal hypergraphs record temporal activation of edges or hyperedges, but they usually operate over a single-level vertex domain and therefore do not retain the identity of higher-level interacting objects. This paper develops the temporal \(n\)-Super-HyperGraph as a time-labeled higher-order structure for dynamic hierarchical connectivity. The first contribution is a precise definition based on a finite base set \(V_0\), an \(n\)-level supervertex family \(V\subseteq \mathcal{P}^n(V_0)\), a superedge family \(E\subseteq \mathcal{P}^{\ast}(V)\), a time domain \(T\), and an activity map \(\Lambda:E\to 2^T\). The second contribution is a hierarchy result showing that static \(n\)-Super-HyperGraphs, temporal hypergraphs, and temporal graphs are recovered by forgetting time or by imposing natural restrictions on \(n\) and edge cardinality. The third contribution is a collection of structural results proving that snapshots, time restrictions, temporal unions, temporal intersections, activity complements, and time shifts preserve the defining conditions of the model. The paper also presents a construction algorithm from static snapshots, proves its correctness, analyzes its complexity, and illustrates the interpretation of the model through project-management, logistics, and smart-building examples. These results give a rigorous mathematical basis for studying dynamic higher-order systems in which both temporal activation and hierarchical identity are essential.

Let \(G=(V(G),E(G))\) be a finite, simple, undirected graph. For a vertex \(v\in V(G)\), the closed neighborhood is denoted by \(N_G[v]\) and consists of \(v\) together with every vertex adjacent to \(v\). A dominator coloring of \(G\) is a proper vertex coloring in which every vertex dominates at least one color class; equivalently, for each \(v\in V(G)\) there exists a color class \(C\) such that \(C\subseteq N_G[v]\). The least number of colors required in such a coloring is the dominator chromatic number, denoted by \(\chi_d(G)\). This manuscript determines the dominator chromatic number for the modular products \(P_n\diamond P_m\) and \(C_n\diamond C_m\), where \(P_n\) is a path and \(C_n\) is a cycle. The results give closed expressions in terms of \(h=\min\{n,m\}\) and \(g=\max\{n,m\}\), including the exceptional small orders where the parity pattern of the product changes. The constructions identify the color classes that are forced by proper coloring and the additional singleton classes needed to satisfy the domination condition. Representative colorings of \(P_5\diamond P_5\) and \(C_4\diamond C_6\) illustrate how the decisive vertices in the second row control the transition from ordinary proper coloring to dominator coloring.

Closed forms are derived for nested finite sums of the form \[\sum_{a_{n-1}=c}^{a_n}\sum_{a_{n-2}=c}^{a_{n-1}}\cdots\sum_{a_0=c}^{a_1}x^{a_0},\] where \(a_n\) and \(c\) are integers and \(x\) is real or complex. This elementary identity is then used to evaluate multiple sums whose summands contain terms of the Horadam sequence \(\bigl(W_j(a,b;p,q)\bigr)\). The sequence is defined by \[W_0=a,\qquad W_1=b,\qquad W_j=pW_{j-1}-qW_{j-2}\quad(j\geq 2),\] where \(a,b,p,q\in\mathbb C\) with \(p\ne0\) and \(q\ne0\). The resulting identities include weighted sums involving Lucas sequences of the first and second kinds, Fibonacci and Lucas numbers, gibonacci sequences, and products of two and three shifted terms. The formulas show how the depth of summation is absorbed into binomial coefficients and shifted sequence indices, yielding compact expressions suitable for direct use in recurrence and summation problems.

The first degcity index \(\operatorname{DC}_{1}(G)\) of a connected graph \(G\) is the edge sum \[\operatorname{DC}_{1}(G)=\sum\limits_{uv\in E(G)}\bigl[e_G(u)+e_G(v)\bigr]\bigl[d_G(u)+d_G(v)\bigr],\] where \(d_G(u)\) and \(e_G(u)\) denote the degree and eccentricity of a vertex \(u\), respectively. The index combines local valency and global distance information in a single degree–eccentricity descriptor. This paper determines closed expressions for the first degcity index under six standard graph operations: disjoint union, join, Cartesian product, composition, symmetric difference and disjunction. The formulas separate the contributions of edges inherited from the factor graphs from the contributions created by the operation. The statements use the eccentricity behaviour in joins and the edge and degree relations in product-type operations, giving formulas that are consistent with the usual definitions of these graph operations.

Given a permutation \(\pi\) of size \(n\), we consider the associated grid graph \(G_{\pi}\) whose \(i\)th column has height \(\pi_i\), with vertical edges between consecutive levels and horizontal edges between equal levels in adjacent columns. We investigate global degree statistics of these graphs when \(\pi\) ranges over the Catalan avoidance class \(\mathrm{Av}_n(213)\) (and, by reversal, also over \(\mathrm{Av}_n(312)\)). We obtain explicit closed formulas for two accumulated quantities over \(\mathrm{Av}_n(213)\): the total number of horizontal edges and, for each \(r\in\{1,2,3,4\}\), the total number of degree-\(r\) vertices. The proofs rely on the Catalan decomposition induced by the position of the minimum entry, which leads to gluing recurrences and algebraic ordinary generating functions, and are completed using universal identities for the total number of vertices and the sum of degrees. As an application, we derive asymptotic degree proportions for a uniformly random permutation in \(\mathrm{Av}_n(213)\): the expected proportion of degree-4 vertices, equivalently the global degree-4 proportion over the class, tends to \(1\), with a deficit of order \(n^{-1/2}\), contrasting with the unrestricted case.

This article proposes an enhanced accelerated iterative method for solving systems of nonlinear equations based on a double-step-length strategy. To improve computational efficiency, the Jacobian matrix in Newton’s method is approximated using an acceleration mechanism, resulting in a fully derivative-free scheme. Moreover, an inexact line-search technique, inspired by Li and Fukushima [1], is employed to determine the two step lengths adaptively. Under mild assumptions, the global convergence of the proposed method is rigorously established. Numerical experiments confirm the efficiency and robustness of the method, demonstrating superior performance compared with approaches reported in the literature. In addition, the proposed technique is successfully applied to motion control problems involving two-joint planar robotic manipulators, highlighting its practical applicability and effectiveness.

This article develops an application of the generalized method of lines to a time-dependent Navier–Stokes system in fluid mechanics. In the last section, we present a numerical example and the corresponding software in order to illustrate the applicability of the results.

In this paper, we study pairwise asymptotic criteria for sequences of compact sets in the Hausdorff hyperspace of a metric space. We introduce the notions of \(\mathcal I\)-statistically pre-Cauchy and frequent Cauchy compact-set sequences and examine their relation to convergence under suitable additional assumptions. After establishing basic permanence properties, we show that \(\mathcal I\)-statistical convergence implies the corresponding pre-Cauchy condition. For bounded sequences, we obtain two explicit characterizations, one in terms of double means of Hausdorff distances and the other in terms of bounded moduli. We also investigate the relation between frequent Cauchy behavior and frequent convergence under compactness assumptions on the hyperspace or on the closure of the range of the sequence. Finally, we present criteria under which pairwise asymptotic conditions can be upgraded to actual \(\mathcal I\)-statistical convergence, and we include examples that illustrate both the scope and the limitations of the pairwise approach in the hyperspace setting.