Related papers: Polynomial-time Tests for Difference Terms in Idem…

We study the relationship of backcrossing algebras with mutation algebras and algebras satisfying $\omega$-polynomial identities: we show that in a backcrossing algebra every element of weight 1 generates a mutation algebra and that for any…

Let F be a homogeneous real polynomial of even degree in any number of variables. We consider the problem of giving explicit conditions on the coefficients so that F is positive definite or positive semi-definite. In this note we produce a…

For a finite set of homogeneous locally nilpotent derivations of the algebra of polynomials in several variables, a finite dimensionality criterion for the Lie algebra generated by these derivations is known. Also the structure of the…

We characterize the languages in the individual levels of the quantifier alternation hierarchy of first-order logic with two variables by identities. This implies decidability of the individual levels. More generally we show that the…

This paper presents efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with $\epsilon$-transitions. It gives an algorithm for testing the exponential ambiguity of an automaton $A$ in time…

In this survey article we discuss the question: to what extent is an algebraic variety determined by its ring of differential operators? In the case of affine curves, this question leads to a variety of mathematical notions such as the Weyl…

Let $n$ be a positive integer and let $f_1, \ldots, f_r$ be polynomials in $n^2$ indeterminates over an algebraically closed field $K$. We describe an algorithm to decide if the invertible matrices contained in the variety of $f_1, \ldots,…

We study idempotents in intensional Martin-L\"of type theory, and in particular the question of when and whether they split. We show that in the presence of propositional truncation and Voevodsky's univalence axiom, there exist idempotents…

Together with a characteristic function, idempotent permutations uniquely determine idempotent maps, as well as their linearly ordered arrangement simultaneously. Furthermore, in-place linear time transformations are possible between them.…

The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an…

This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…

If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…

We show that deciding whether an argument a is stronger than an argument b with respect to the discussion-based semantics of Amgoud and Ben-Naim is decidable in polynomial time. At its core, this problem is about deciding whether, for two…

Join-preserving maps on the discrete time scale $\omega^+$, referred to as time warps, have been proposed as graded modalities that can be used to quantify the growth of information in the course of program execution. The set of time warps…

We consider the following problem. Let us fix a finite alphabet A; for any given d-uple of letter frequencies, how to construct an infinite word u over the alphabet A satisfying the following conditions: u has linear complexity function, u…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

We investigate the computational complexity of the problem of deciding if an algebra homomorphism can be factored through an intermediate algebra. Specifically, we fix an algebraic language, L, and take as input an algebra homomorphism f…

This article presents a combinatorial result on indexed languages which was inspired by an attempt to understand the structure of groups with indexed language word problem. We show that a sufficiently long word in an indexed language can be…

We show that, for each finite algebra A, either it has symmetric term operations of all arities or else some finite algebra in the variety generated by A has two automorphisms without a common fixed point. We also show this two-automorphism…

We study the class of those linear relations that can be factorized as products of idempotent relations. We provide several characterizations of this class, extending known factorization results for operators to the more general setting of…