Related papers: Dynamic Complexity of Group Problems
Let $G$ be a classical group defined over a finite field. We consider the following fundamental problems concerning conjugacy in $G$: 1. List a representative for each conjugacy class of $G$. 2. Given $x \in G$, describe the centralizer of…
Temporal graphs have been recently introduced to model changes to a given network that occur throughout a fixed period of time. The Temporal $\Delta$ Clique problem, that generalizes the well known Clique problem to temporal graphs, has…
In this paper, a complexity factor is devised for a non-static cylindrical system in the framework of massive Brans-Dicke theory. The definition of complexity is developed by taking into account the essential physical characteristics (such…
Stochastic dynamics of classical degrees of freedom, defined on vertices of locally tree-like graphs, can be studied in the framework of the dynamic cavity method which is exact for tree graphs. Such models correspond for example to…
Hybrid quantum-classical algorithms are among the most promising systems to implement quantum computing under the Noisy-Intermediate Scale Quantum (NISQ) technology. In this paper, at first, we investigate a quantum dynamics algorithm for…
Different aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize…
We have performed the dynamical system analysis to obtain the critical point in which, the value of the geometric and dynamical parameters satisfy the late-time cosmic behavior of the Universe. At the outset, the modified Friedmann…
We have designed a new multi-scale approach for Strongly Correlated Systems by combining the Dynamical Cluster Approximation (DCA) and the recently introduced dual-fermion formalism. This approach employs an exact mapping from a real…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…
We introduce a dynamical-systems approach for the study of the Sard problem in sub-Riemannian Carnot groups. We show that singular curves can be obtained by concatenating trajectories of suitable dynamical systems. As an applications, we…
The question of computing the group complexity of finite semigroups and automata was first posed in K. Krohn and J. Rhodes, \textit{Complexity of finite semigroups}, Annals of Mathematics (2) \textbf{88} (1968), 128--160, motivated by the…
A discrete unified gas kinetic scheme (DUGKS) coupled with the immersed boundary (IB) method is developed to perform interface-resolved simulation of particle-laden flows. The present method (IB-DUGKS) preserves the respective advantages of…
Efficient exact algorithms for Discrete Optimization (DO) rely heavily on strong primal and dual bounds. Relaxed Decision Diagrams (DDs) provide a versatile mechanism for deriving such dual bounds by compactly over-approximating the…
In this paper we test the performance of explicit simulations of groups of galaxies, (i.e. simulations in which each galaxy is treated as a mass point and the physics of the interactions is modelled by specific analand the physics of the…
Group-based reinforcement can induce discontinuous transitions from inactive to active phases in higher-order contagion models. However, these results are typically obtained on static interaction structures or within mean-field…
The dictionary learning problem concerns the task of representing data as sparse linear sums drawn from a smaller collection of basic building blocks. In application domains where such techniques are deployed, we frequently encounter…
We develop a new framework for the study of complex continuous time dynamical systems based on viewing them as collections of interacting control modules. This framework is inspired by and builds upon the groupoid formalism of Golubitsky,…
Clustering is a widely used unsupervised learning technique involving an intensive discrete optimization problem. Associative Memory models or AMs are differentiable neural networks defining a recursive dynamical system, which have been…
The first computation of a spin foam dynamics that provides a test of the quantum equations of motions of gravity is presented. Specifically, a triangulation that includes an inner edge is treated. The computation leverages the recently…
It is widely recognized that entanglement generation and dynamical chaos are intimately related in semiclassical models via the process of decoherence. In this work, we propose a unifying framework which directly connects the bipartite and…