Related papers: Morphic Sequences: Complexity and Decidability
We consider smooth completion of algebraic manifolds. Having some information about its singular completions or about completions of its images we prove purity of cohohomology of the set at infinity. We deduce also some topological…
The purpose of this paper is to answer two questions left open in [B. Durand, A. Shen, and N. Vereshchagin, Descriptive Complexity of Computable Sequences, Theoretical Computer Science 171 (2001), pp. 47--58]. Namely, we consider the…
The concept of a morphism determined by an object provides a method to construct or classify morphisms in a fixed category. We show that this works particularly well for triangulated categories having Serre duality. Another application of…
Every projective module is flat. Conversely, every flat module is a direct limit of finitely generated free modules; this was proved independently by Govorov and Lazard in the 1960s. In this paper we prove an analogous result for complexes…
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
Parikh-collinear morphisms have the property that all the Parikh vectors of the images of letters are collinear, i.e., the associated adjacency matrix has rank 1. In the conference DLT-WORDS 2023 we showed that fixed points of…
In this paper, we prove that a class of regular sequences can be viewed as projections of fixed points of uniform morphisms on a countable alphabet, and also can be generated by countable states automata. Moreover, we prove that the…
On a complex symplectic manifold we prove a finiteness result for the global sections of solutions of holonomic DQ-modules in two cases: (a) by assuming that there exists a Poisson compactification (b) in the algebraic case. This extends…
The Discrete Morse Theory of Forman appeared to be useful for providing filtration-preserving reductions of complexes in the study of persistent homology. So far, the algorithms computing discrete Morse matchings have only been used for…
We define a family of quaternary sequences over the residue class ring modulo $4$ of length $pq$, a product of two distinct odd primes, using the generalized cyclotomic classes modulo $pq$ and calculate the discrete Fourier transform (DFT)…
Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group…
We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation…
We determine the symmetrized topological complexity of the circle, using primarily just general topology.
Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related…
We introduce some polynomial and analytic methods in the classification program for the complexity of planar graph homomorphisms. These methods allow us to handle infinitely many lattice conditions and isolate the new P-time tractable…
In this paper, we introduce a variation of the factor complexity, called the $N$-factor complexity, which allows us to characterize the complexity of sequences on an infinite alphabet. We evaluate precisely the $N$-factor complexity for the…
We study analytic deformations of holomorphic differential 1-forms. The initial 1-form is exact homogeneous and the deformation is by polynomial integrable 1-forms. We investigate under which conditions the elements of the deformation are…
We introduce the notion of idempotent variables for studying equations in inverse monoids. It is proved that it is decidable in singly exponential time (DEXPTIME) whether a system of equations in idempotent variables over a free inverse…
In this paper, we study the deformation theory of degenerate algebraic curves on singular varieties which appear as the degenerate limit of families of varieties. For this purpose, we systematically develop a new method to calculate the…
In this paper we consider the set of mu-types, an extension of the set of simple types freely generated from a set of atomic types and the type constructor ->, by a new operator mu, to explicitly denote solutions of recursive equations like…