Related papers: An effective analysis of the Denjoy rank
This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…
It was noticed by Harel in [Har86] that "one can define $\Sigma_1^1$-complete versions of the well-known Post Correspondence Problem". We first give a complete proof of this result, showing that the infinite Post Correspondence Problem in a…
We study the problem of enumerating answers of Conjunctive Queries ranked according to a given ranking function. Our main contribution is a novel algorithm with small preprocessing time, logarithmic delay, and non-trivial space usage during…
The question whether a partition $\mathcal{P}$ and a hierarchy $\mathcal{H}$ or a tree-like split system $\mathfrak{S}$ are compatible naturally arises in a wide range of classification problems. In the setting of phylogenetic trees, one…
Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…
To a strongly $G$-graded algebra $A$ with $1$-component $B$ we associate the group $\mathrm{Picent}^{\mathrm{gr}}(A)$ of isomorphism classes of invertible $G$-graded $(A,A)$-bimodules over the centralizer of $B$ in $A$. Our main result is a…
We study the Constraint Satisfaction Problem CSP(A), where A is first-order definable in (Z;+,1) and contains +. We prove such problems are either in P or NP-complete.
The main result of this paper is a recursive description of all decompositions \[ \Delta^+ = \Phi_1 \sqcup \Phi_2 \sqcup \dots \sqcup \Phi_k \] of the positive roots $\Delta^+$ of an arbitrary root system $\Delta$ into a disjoint union of…
In this article, we present an effective encoding of dendrograms by embedding them into the Bruhat-Tits trees associated to $p$-adic number fields. As an application, we show how strings over a finite alphabet can be encoded in cyclotomic…
In this work, we exploit the power of \emph{finite ambiguity} for the complementation problem of B\"uchi automata by using reduced run directed acyclic graphs (DAGs) over infinite words, in which each vertex has at most one predecessor;…
We study the regularity of smooth functions $f$ defined on an open set of $\mathbb{R}^n$ and such that, for certain integers $p\geq 2$, the powers $f^p :x\mapsto (f(x))^p$ belong to a Denjoy-Carleman class $\mathcal{C}_M$ associated with a…
For given two harmonic functions $\Phi$ and $\Psi$ with real coefficients in the open unit disk $\mathbb{D}$, we study a class of harmonic functions $f(z)=z-\sum_{n=2}^{\infty}A_nz^{n}+\sum_{n=1}^{\infty}B_n\bar{z}^n$ $(A_n, B_n \geq 0)$…
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
This paper presents the first step of a wider research effort to apply tree automata completion to the static analysis of functional programs. Tree Automata Completion is a family of techniques for computing or approximating the set of…
In this paper we study higher level Deligne--Lusztig representations of reductive groups over discrete valuation rings, with finite residue field $\mathbb{F}_q$. In previous work we proved that, at even levels, these geometrically…
It is argued that a broad class of AGI-relevant algorithms can be expressed in a common formal framework, via specifying Galois connections linking search and optimization processes on directed metagraphs whose edge targets are labeled with…
The article deals with the class ${\mathcal F}_{\alpha }$ consisting of non-vanishing functions $f$ that are analytic and univalent in $\ID$ such that the complement $\IC\backslash f(\ID) $ is a convex set, $f(1)=\infty ,$ $f(0)=1$ and the…
We generalise Hinich's Theorem of descent of Deligne groupoids to the case where the dgLas involved have no negative cohomology. We apply this result to study the infinitesimal deformations of a morphism $\alpha: {\mathcal F} \to {\mathcal…
Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell 96]. This paper clarifies the mathematical foundations of these…
We present a data structure called a history graph that offers a practical basis for the analysis of genome evolution. It conceptually simplifies the study of parsimonious evolutionary histories by representing both substitutions and double…