Related papers: Dynamic Complexity of Expansion
Patnaik and Immerman introduced the dynamic complexity class DynFO of database queries that can be maintained by first-order dynamic programs with the help of auxiliary relations under insertions and deletions of edges (Patnaik and Immerman…
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed and undirected graphs, where updates may add or delete…
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of model checking a fixed monadic second-order formula over evolving subgraphs of a fixed maximal…
This paper studies dynamic complexity under definable change operations in the DynFO framework by Patnaik and Immerman. It is shown that for changes definable by parameter-free first-order formulas, all (uniform) $AC^1$ queries can be…
Given a graph whose nodes may be coloured red, the parity of the number of red nodes can easily be maintained with first-order update rules in the dynamic complexity framework DynFO of Patnaik and Immerman. Can this be generalised to other…
Finding a homomorphism from some hypergraph $\mathcal{Q}$ (or some relational structure) to another hypergraph $\mathcal{D}$ is a fundamental problem in computer science. We show that an answer to this problem can be maintained under…
Consider two planar graphs which are subject to edge insertions and deletions. We show that whether the two graphs are isomorphic can be maintained with first-order logic formulas and auxiliary data of polynomial size. This places the…
We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and non-recurrent parts. We define the spectral complexity metric in terms of the…
Reachability, distance, and matching are some of the most fundamental graph problems that have been of particular interest in dynamic complexity theory in recent years [DKMSZ18, DMVZ18, DKMTVZ20]. Reachability can be maintained with…
We study the cohomology of complexes of ordinary (non-decorated) graphs, introduced by M. Kontsevich. We construct spectral sequences converging to zero whose first page contains the graph cohomology. In particular, these series may be used…
We get three basic results in algebraic dynamics: (1). We give the first algorithm to compute the dynamical degrees to arbitrary precision. (2). We prove that for a family of dominant rational self-maps, the dynamical degrees are lower…
This thesis is divided into three parts. In the first part, we give an introduction to J. Harrison's theory of differential chains. In the second part, we apply these tools to generalize the Cauchy theorems in complex analysis. Instead of…
Graph databases in many applications---semantic web, transport or biological networks among others---are not only large, but also frequently modified. Evaluating graph queries in this dynamic context is a challenging task, as those queries…
The article investigates classes of queries maintainable by conjunctive queries (CQs) and their extensions and restrictions in the dynamic complexity framework of Patnaik and Immerman. Starting from the basic language of quantifier-free…
One of the main challenges within the growing research area of learned indexing is the lack of adaptability to dynamically expanding datasets. This paper explores the dynamization of a static learned index for complex data through…
A dynamic graph algorithm is a data structure that answers queries about a property of the current graph while supporting graph modifications such as edge insertions and deletions. Prior work has shown strong conditional lower bounds for…
This study introduces a new metric called ''DynamicScore'' to evaluate the dynamics of graphs. It can be applied to both vertices and edges. Unlike traditional metrics, DynamicScore not only measures changes in the number of vertices or…
Dynamical degrees and spectra can serve to distinguish birational automorphism groups of varieties in quantitative, as opposed to only qualitative, ways. We introduce and discuss some properties of those degrees and the Cremona degrees,…
Skew pentagram maps act on polygons by intersecting diagonals of different lengths. They were introduced by Khesin-Soloviev in 2015 as conjecturally non-integrable generalizations of the pentagram map, a well-known integrable system. In…
Complex analysis is a powerful tool to study classical integrable systems, statistical physics on the random lattice, random matrix theory, topological string theory,... All these topics share certain relations, called "loop equations" or…