Related papers: Morphic Sequences: Complexity and Decidability
We study deformations of complex projective varieties that are homotopically or homologically trivial. We formulate several conjectures and give some examples and partial answers.
I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…
We answer several questions of I.Protasov and E.Zelenyuk concerning topologies on groups determined by T-sequences. A special attention is paid to studying the operation of supremum of two group topologies.
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO is fixed-parameter…
A classical result in complex geometry says that the automorphism group of a manifold of general type is discrete. It is more generally true that there are only finitely many surjective morphisms between two fixed projective manifolds of…
Morphisms are homomorphisms under the concatenation operation of the set of words over a finite set. Changing the elements of the finite set does not essentially change the morphism. We propose a way to select a unique representing member…
We show that if f: X --> Y is a finite, separable morphism of smooth curves defined over a finite field F_q, where q is larger than an explicit constant depending only on the degree of f and the genus of X, then f maps X(F_q) surjectively…
In the article, we exhibit a series of new examples of rigid plane curves, that is, curves, whose collection of singularities determines them almost uniquely up to a projective transformation of the plane.
This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…
We describe the deformation cohomology of a symplectic groupoid, and use it to study deformations via Moser path methods, proving a symplectic groupoid version of the Moser Theorem. Our construction uses the deformation cohomologies of Lie…
Twenty years ago Gromov asked about how large is the set of isomorphism classes of groups whose systolic area is bounded from above. This article introduces a new combinatorial invariant for finitely presentable groups called {\it…
The determinisation problem for min-plus (tropical) weighted automata was recently shown to be decidable. However, the proof is purely existential, relying on several non-constructive arguments. Our contribution in this work is twofold:…
We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…
We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.
We describe polarized complexity-one T-varieties combinatorially in terms of so-called divisorial polytopes, and show how geometric properties of such a variety can be read off the corresponding divisorial polytope. We compare our…
We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees. Given an MSO-formula phi(X,x) that is positive in X, it is decidable whether the…
This paper reproduces the text of a part of the Author's DPhil thesis. It gives a proof of the classification of non-trivial, finite homogeneous geometries of sufficiently high dimension which does not depend on the classification of the…
In this paper we obtain exact normal forms with functional invariants for local diffeomorphisms, under the action of the symplectomorphism group in the source space. Using these normal forms we obtain exact classification results for the…
We develop a graphical calculus for the microformal or thick morphisms introduced by Ted Voronov. This allows us to write the infinite series arising from pullbacks, compositions, and coordinate transformations of thick morphisms as sums…