Related papers: Dynamic Complexity of Expansion
The goal of this paper is to construct invariant dynamical objects for a (not necessarily invertible) smooth self map of a compact manifold. We prove a result that takes advantage of differences in rates of expansion in the terms of a sheaf…
We study the spectra of mixed graphs about its Hermitian adjacency matrix of the second kind (i.e. N-matrix) introduced by Mohar [1]. We extend some results and define one new Hermitian adjacency matrix, and the entry corresponding to an…
In this note, we present recent progress on rigidity problems in one-dimensional complex dynamics, including the proof of Dynamical Andr\'e-Oort conjecture for curves and generic injectivity of multiplier spectrum. The proofs combine ideas…
The Dirac Hamiltonian formalism is applied to a system in $(2+1)$-dimensions consisting of a Dirac field $\psi$ minimally coupled to Chern-Simons $U(1)$ and $SO(2,1)$ connections, $A$ and $\omega$, respectively. This theory is connected to…
A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…
A dynamic graph algorithm is a data structure that supports edge insertions, deletions, and specific problem queries. While extensive research exists on dynamic algorithms for graph problems solvable in polynomial time, most of these…
In this article, we offer the dynamical system analysis of the DBI (Dirac-Born-Infeld) scalar field in a modified $f(Q)$ gravity context. We have taken a polynomial form of modified gravity and used two different kinds of scalar potential,…
In the present paper, a discrete differential calculus is introduced and used to describe dynamical systems over arbitrary graphs. The discretization of space and time allows the derivation of Heisenberg-like uncertainty inequalities and of…
We exhibit an $n$-node graph whose independent set polytope requires extended formulations of size exponential in $\Omega(n/\log n)$. Previously, no explicit examples of $n$-dimensional $0/1$-polytopes were known with extension complexity…
Dynamic Complexity is a phenomenon exhibited by a nonlinearly interacting system within which multitudes of different sizes of large scale coherent structures emerge, resulting in a globally nonlinear stochastic behavior vastly different…
The classical method for deriving the macroscopic dynamics of a lattice Boltzmann system is to use a combination of different approximations and expansions. Usually a Chapman-Enskog analysis is performed, either on the continuous Boltzmann…
Interest in inverse dynamical, spectral and scattering problems for differential equations on graphs is motivated by possible applications to nano-electronics and quantum waveguides and by a variety of other classical and quantum…
We update the table of large undirected graphs with given degree and diameter with results obtained since the publication of the survey by M. Miller and J. \v{S}ir\'{a}\v{n} in the {\em Electronic Journal of Combinatorics} (Dynamic Survey…
The classic technique of Baker [J. ACM '94] is the most fundamental approach for designing approximation schemes on planar, or more generally topologically-constrained graphs, and it has been applied in a myriad of different variants and…
Recent years have seen significant progress in the study of dynamic graph algorithms, and most notably, the introduction of strong lower bound techniques for them (e.g., Henzinger, Krinninger, Nanongkai and Saranurak, STOC 2015; Larsen and…
We give an unconditional version of a conditional, on the Extended Riemann Hypothesis, result of L. Babai, A. Banerjee, R. Kulkarni and V. Naik (2010) on the evasiveness of sparse graphs.
This is an expository article, originally written in Japanese, on a dynamical system over a non-archimedean field. The main viewpoint is from complex and non-archimedean potential theories. After quickly introducing the Berkovich projective…
We address the problem of identifying families of discrete models naturally flowing in continuum limit to relativistic quantum field theories. We call them Dirac graphs. In this work, we require the graphs to obey spectrality property,…
We review and investigate some new problems and results in the field of dynamical systems generated by iteration of maps, {\beta}-transformations, partitions, group actions, bundle dynamical systems, Hasse-Kloosterman maps, and some aspects…
Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…