Related papers: Equations over free inverse monoids with idempoten…
We consider the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We show that given a language recognized by such a device and a linear context-free language, it is recursively decidable…
For an acyclic quiver Q, we solve the Clebsch-Gordan problem for the projective representations by computing the multiplicity of a given indecomposable projective in the tensor product of two indecomposable projectives. Motivated by this…
After tersely reviewing the various meanings that can be given to the property of a system of nonlinear ODEs to be solvable, we identify a special case of the system of two first-order ODEs with homogeneous quadratic right-hand sides which…
We establish an invertibility criterion for free polynomials and free functions evaluated on some tuples of matrices. We show that if the derivative is nonsingular on some domain closed with respect to direct sums and similarity, the…
In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…
Verification of discrete time or continuous time dynamical systems over the reals is known to be undecidable. It is however known that undecidability does not hold for various classes of systems: if robustness is defined as the fact that…
Goldmann and Russell (2002) initiated the study of the complexity of the equation satisfiability problem in finite groups by showing that it is in P for nilpotent groups while it is NP-complete for non-solvable groups. Since then, several…
In a previous work of 2014 on a quantum system governed by the repulsive Hamiltonian, the author proved uniqueness for short-range interactions described by a scattering operator consisting of regular and singular parts. In this paper, the…
The Cayley-Hamilton problem of expressing functions of matrices in terms of only their eigenvalues is well-known to simplify to finding the inverse of the confluent Vandermonde matrix. Here, we give a highly compact formula for the inverse…
Morrill and Valentin in the paper "Computational coverage of TLG: Nonlinearity" considered an extension of the Lambek calculus enriched by a so-called "exponential" modality. This modality behaves in the "relevant" style, that is, it allows…
It is shown that order-invariance of two-variable first-logic is decidable in the finite. This is an immediate consequence of a decision procedure obtained for the finite satisfiability problem for existential second-order logic with two…
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.…
The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1? This problem was proved undecidable recently; to…
The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…
We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are…
We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…
In this note, we formulate a "one-sided" version of Wormald's differential equation method. In the standard "two-sided" method, one is given a family of random variables which evolve over time and which satisfy some conditions including a…
In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…
We prove that the compressed word problem in a group that is hyperbolic relative to a collection of free abelian subgroups is solvable in polynomial time.
We present a simple proof that finding a rank-$R$ canonical polyadic decomposition of a 3-dimensional tensor over a finite field $\mathbb{F}$ is fixed-parameter tractable with respect to $R$ and $\mathbb{F}$. We also show a nontrivial upper…