Related papers: Morphic Sequences: Complexity and Decidability
Investigations of complexity of sequences lead to important applications such as effective data compression, testing of randomness, discriminating between information sources and many others. In this paper we establish formulas describing…
We show how one can handle the formalism developped by Yurii Vorobjev in order to give general results about the problems of linearisation and of normal form of a Poisson structure in the neighborhood of one of its symplectic leaves.
In this paper we introduce a method which allows us to study properties of the random uniform simplicial complex. That is, we assign equal probability to all simplicial complexes with a given number of vertices and then consider properties…
We prove the effectivity of the dynatomic cycles for morphisms of projective varieties. We then analyze the degrees of the dynatomic cycles and multiplicities of formal periodic points and apply these results to the existence of periodic…
We develop the deformation-obstruction calculus for morphisms of complexes with a fixed lift of the codomain, to derived categories of flat nilpotent deformations of abelian categories. As an application, we give an alternative proof that…
We show that the parametrised topological complexity of Cohen, Farber and Weinberger gives an invariant of group epimorphisms. We extend various bounds for the topological complexity of groups to obtain bounds for the parametrised…
We study structural and enumerative aspects of pure simplicial complexes and clique complexes. We prove a necessary and sufficient condition for any simplicial complex to be a clique complex that depends only on the list of facets. We also…
We answer two questions on the complexities of decision problems of groups, each related to a classical result. First, C. Miller characterized the complexity of the isomorphism problem for finitely presented groups in 1971. We do the same…
Sequential parametrized topological complexity is a numerical homotopy invariant of a fibration, which arose in the robot motion planning problem with external constraints. In this paper, we study sequential parametrized topological…
In this work we introduce a new notion called opacity complexity to measure the complexity of automatic sequences. We study basic properties of this notion, and exhibit an algorithm to compute it. As applications, we compute the opacity…
We investigate families of two-dimensional simplicial complexes defined in terms of vertex decompositions. They include nonevasive complexes, strongly collapsible complexes of Barmak and Miniam and analogues of 2-trees of Harary and Palmer.…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
This paper is devoted to a very classical problem that can be summarized as follows: let S be a non singular compact complex surface, f:S --> P^2 a finite morphism having simple branching, B the branch curve: to what extent does B determine…
Faraday complexity describes whether a spectropolarimetric observation has simple or complex magnetic structure. Quickly determining the Faraday complexity of a spectropolarimetric observation is important for processing large, polarised…
This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…
It is proven that the identity component of the group preserving the leaves of a generalized foliation is perfect. This shows that a well-known simplicity theorem on the diffeomorphism group extends to the nontransitive case.
We define and develop a homotopy invariant notion for the sequential topological complexity of a map $f:X\to Y,$ denoted $TC_{r}(f)$, that interacts with $TC_{r}(X)$ and $TC_{r}(Y)$ in the same way Jamie Scott's topological complexity map…
We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree…
We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…
In this paper, we consider the complexity of propositional proofs of classical and intuitionistic tautologies. In fact, we describe a nondeterministic polynomial-time decision procedure for intuitionistic implicational tautologies. For this…