Related papers: Nilpotent dynamics on signed interaction graphs an…

We show that, for every finitely generated group with decidable word problem and undecidable domino problem, there exists a sequence of effective subshifts whose inverse limit is not the topological factor of any effective dynamical system.…

Real complex systems are inherently time-varying. Thanks to new communication systems and novel technologies, it is today possible to produce and analyze social and biological networks with detailed information on the time of occurrence and…

Let $R$ be a finite product of integral domains and $D$ be a union of prime ideals (it is possible that $R$ is just an integral domain). Let $n \geq 1$ be a positive integer. This paper introduces the $n$-total graph of a $(R, D)$. The…

Dynamical systems of the gauge glass are investigated by the method of the gauge transformation.Both stochastic and deterministic dynamics are treated. Several exact relations are derived among dynamical quantities such as equilibrium and…

Consider a finite and simple graph $G=(V,E)$ with maximum degree $\Delta$. A strong Roman dominating function over the graph $G$ is understood as a map $f : V (G)\rightarrow \{0, 1,\ldots , \left\lceil \frac{\Delta}{2}\right\rceil+ 1\}$…

To a simple graph we associate a so-called graph series, which can be viewed as the Hilbert--Poincar\'e series of a certain infinite jet scheme. We study new $q$-representations and examine modular properties of several examples including…

Recent studies from social, biological, and engineering network systems have drawn attention to the dynamics over signed networks, where each link is associated with a positive/negative sign indicating trustful/mistrustful,…

Empirically defining some constant probabilistic orbits of f(x) and g(x) iterated high-order functions, the stability of these functions in possible entangled interaction dynamics of the environment through its orbit's connectivity (open…

We propose a new framework for the study of continuous time dynamical systems on networks. We view such dynamical systems as collections of interacting control systems. We show that a class of maps between graphs called graph fibrations…

In this paper we investigate the extremal relationship between two well-studied graph parameters: the order of the largest homogeneous set in a graph $G$ and the maximal number of distinct degrees appearing in an induced subgraph of $G$,…

Let $\Phi = \{\phi_e\}_{e\in E}$ be a finitely irreducible conformal graph directed Markov system (CGDMS) with symbolic representation $E_A^{\infty}$ and limit set $J$. Under a mild condition on the system, we give a multifractal analysis…

In this communication, the co-maximal subgroup graph $\Gamma(G)$ of a finite group $G$ is examined when $G$ is a finite nilpotent group, finite abelian group, dihedral group $D_n$, dicyclic group $Q_{2^n}$, and $p$-group. We derive the…

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…

Given a 2-generated finite group $G$, the non-generating graph of $G$ has as vertices the elements of $G$ and two vertices are adjacent if and only if they are distinct and do not generate $G$. We consider the graph $\Sigma(G)$ obtained…

It was recently argued that one-dimensional systems of several strongly interacting fermions of different mass undergo critical transitions between different spatial orderings when the external confinement adiabatically changes its shape.…

Let $K$ be an algebraically closed field of characteristic zero and let $G$ be a finitely generated subgroup of the multiplicative group of $K$. We consider $K$-valued sequences of the form $a_n:=f(\varphi^n(x_0))$, where $\varphi\colon…

Signed networks provide a principled framework for representing systems in which interactions are not merely present or absent but qualitatively distinct: friendly or antagonistic, supportive or conflicting, excitatory or inhibitory. This…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

It is well known that if $G$ is a group and $H$ is a normal subgroup of $G$ of finite index $k$, then $x^k \in H$ for every $x \in G$. We examine finite groups $G$ with the property that $x^k \in H$ for every subgroup $H$ of $G$, where $k$…

This paper deals with structural controllability of leader-follower networks. The system matrix defining the network dynamics is a pattern matrix in which a priori given entries are equal to zero, while the remaining entries take nonzero…