Related papers: The hereditariness problem for the \v{C}ern\'y con…
The \v{C}ern\'y conjecture (\v{C}ern\'y, 1964) states that each n-state \san\ possess a \sw\ of length $(n-1)^2$. From the other side the best upper bound for the \rl\ of n-state \sa\ known so far is equal to $\frac{n^3-n}6$ (Pin, 1983) and…
We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…
This article focuses on subset reachability in synchronizing automata. First, we provide families of synchronizing automata with subsets which cannot be reached with short words. These families do not fulfil Don's Conjecture about subset…
The Kleene theorem establishes a fundamental link between automata and expressions over the free monoid. Numerous generalisations of this result exist in the literature. Lifting this result to a weighted setting has been widely studied.…
We give partial affirmative answers to Landis conjecture in all dimensions for two different types of linear, second order, elliptic operators in a domain $\Omega\subset \mathbb{R}^N$. In particular, we provide a sharp decay criterion that…
The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be transformed into the trivial presentation by a finite sequence of "elementary transformations" which are Nielsen transformations together with…
The theme of this paper is the multiplicity of the consistent sets appearing in the consistent histories approach to quantum mechanics. We propose one criterion for choosing preferred families among them: that the physically realizable…
A descent conjecture of Wittenberg [Wit24, Conjecture 3.7.4] predicts that if all the twists of a rationally connected torsor over a smooth base satisfy weak approximation with Brauer-Manin obstruction, then so does the base. We give an…
In this article, we introduce a relation including ideals of an evolution algebra and hereditary subsets of vertices of its associated graph and establish some properties among them. This relation allows us to determine maximal ideals and…
The emptiness and containment problems for probabilistic automata are natural quantitative generalisations of the classical language emptiness and inclusion problems for Boolean automata. It is well known that both problems are undecidable.…
We study the way in which the abstract structure of a small overlap monoid is reflected in, and may be algorithmically deduced from, a small overlap presentation. We show that every C(2) monoid admits an essentially canonical C(2)…
We show that for tame valued fields of equal characteristic with divisible value group, the $C_i$ property lifts from the residue field to the valued field under suitable hypotheses on the residue field. We apply this transfer principle to…
Subzero automata is a class of tree automata whose acceptance condition can express probabilistic constraints. Our main result is that the problem of determining if a subzero automaton accepts some regular tree is decidable.
This paper provides a homotopical version of the adjoint lifting theorem in category theory, allowing for Quillen equivalences to be lifted from monoidal model categories to categories of algebras over colored operads. The generality of our…
We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping $F\colon \mathbb{C}^n \to \mathbb{C}^n$ whose Jacobian determinant is a nonzero constant) has a…
In this article we present a solution to a conjecture of Vladimir Voevodsky regarding C-systems. This conjecture provides, under some assumptions, a lift of a functor $M\colon \mathrm{CC} \rightarrow \mathcal{C}$, where $\mathrm{CC}$ is a…
We have improved an algorithm generating synchronizing automata with a large length of the shortest reset words. This has been done by refining some known results concerning bounds on the reset length. Our improvements make possible to…
A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation). In analogy to…
The assignment (nonstable K_0-theory), that to a ring R associates the monoid V(R) of Murray-von Neumann equivalence classes of idempotent infinite matrices with only finitely nonzero entries over R, extends naturally to a functor. We prove…
We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…