Related papers: Morphic Sequences: Complexity and Decidability
We define decision trees for monotone functions on a simplicial complex. We define homology decidability of monotone functions, and show that various monotone functions related to semimatroids are homology decidable. Homology decidability…
Recently Dekking conjectured the form of the subword complexity function for the Fibonacci-Thue-Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.
In this paper, we prove the holomorphic convexity of the covering of a complex projective {normal} variety $X$, which corresponds to the intersection of kernels of reductive representations $\rho:\pi_1(X)\to {\rm GL}_{N}(\mathbb{C})$,…
We study finite morphisms of varieties and the link between their top multiplicity loci under certain assumptions. More precisely, we focus on how to determine that link in terms of the spaces of arcs of the varieties.
We prove a conjecture of Courcelle, which states that a graph property is definable in MSO with modular counting predicates on graphs of constant treewidth if, and only if it is recognizable in the following sense: constant-width tree…
Given an affine Poisson algebra, that is singular one may ask whether there is an associated symplectic form. In the smooth case the answer is obvious: for the symplectic form to exist the Poisson tensor has to be invertible. In the…
To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories,…
We consider deformations of singular Lagrangian varieties in symplectic spaces. We show the coherence of the direct image sheaves of relative infinitesimal Lagrangian deformations. Using this result, we prove that, under some assumptions, a…
We present the finite first-order theory (FFOT) machine, which provides an atemporal description of computation. We then develop a concept of complexity for the FFOT machine, and prove that the class of problems decidable by a FFOT machine…
The $N$th linear complexity of a sequence is a measure of predictability. Any unpredictable sequence must have large $N$th linear complexity. However, in this paper we show that for $q$-automatic sequences over $\mathbb{F}_q$ the converse…
The primary purpose of this work is to characterise strict \omega-categories as simplicial sets with structure. We prove the Street-Roberts conjecture which states that they are exactly the ``complicial sets'' defined and named by John…
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. We give some applications of this method to complexes arising from graphs. As a consequence, we answer some questions raised in…
In this note we present some algebraic examples of multicomplexes whose differentials differ from those in the spectral sequences associated to the multicomplexes. The motivation for constructing examples showing the algebraic distinction…
We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…
Kontsevich's formula for a deformation quantization of Poisson structures involves a Feynman series of graphs, with the weights given by some complicated integrals (using certain pullbacks of the standard angle form on a circe). We explain…
Intuitively, if we can prove that a program terminates, we expect some conclusion regarding its complexity. But the passage from termination proofs to complexity bounds is not always clear. In this work we consider Monotonicity Constraint…
We show that for every conjunctive query, the complexity of evaluating it on a probabilistic database is either \PTIME or #\P-complete, and we give an algorithm for deciding whether a given conjunctive query is \PTIME or #\P-complete. The…
Banyaga has shown that the group of symplectomorphisms Symp(N) of a compact symplectic manifold (N,w) determines the symplectic structure. This motivates the study of the homotopy properties of Symp(N). Gromov has shown that the group of…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…
In order to study large variations or fluctuations of finite or infinite sequences (time series), we bring to light an 1868 paper of Crofton and the (Cauchy-)Crofton theorem. After surveying occurrences of this result in the literature, we…