Related papers: Rational series in the free group and the Connes o…
We give a formal treatment of simple type theories, such as the simply-typed $\lambda$-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional…
Motivated by a classic result for free groups, one says that a group $G$ has the Magnus property if the following holds: whenever two elements generate the same normal subgroup of $G$, they are conjugate or inverse-conjugate in $G$. It is a…
We give an algorithm for solving equations and inequations with rational constraints in virtually free groups. Our algorithm is based on Rips classification of measured band complexes. Using canonical representatives, we deduce an algorithm…
We introduce the notion of corestricted free products of a family of profinite groups indexed over an arbitrary profinite space. Using arithmetic results of the second author, this enables us to prove an analogue of Riemann's existence…
We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.
We study rational Cherednik algebras over an algebraically closed field of positive characteristic. We first prove several general results about category O, and then focus on rational Cherednik algebras associated to the general and special…
We address the question of computing one selected term of an algebraic power series. In characteristic zero, the best algorithm currently known for computing the $N$th coefficient of an algebraic series uses differential equations and has…
We establish the existence and uniqueness of finite free resolutions - and their attendant Betti numbers - for graded commuting d-tuples of Hilbert space operators. Our approach is based on the notion of free cover of a (perhaps…
This paper proves normalisation theorems for intuitionist and classical negative free logic, without and with the $\invertediota$ operator for definite descriptions. Rules specific to free logic give rise to new kinds of maximal formulas…
Solving algebraic word problems requires executing a series of arithmetic operations---a program---to obtain a final answer. However, since programs can be arbitrarily complicated, inducing them directly from question-answer pairs is a…
We investigate the ability of a free pro-$\CC$ group of infinite rank to abstractly solve abstract embedding problems, and conclude that for some varieties $\CC$, the profinite completion of any order, of a free pro-$\CC$ group of infinite…
Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic. The robust subclass of aperiodic languages is defined by: counter-free…
Let $b \geq 2$ be an integer and $S$ be a finite non-empty set of primes not containing divisors of $b$. For any non-dense set $A \subset [0,1)$ such that $A \cap \mathbb{Q}$ is invariant under $\times b$ operation, we prove the finiteness…
We present in this paper a new method to deal with automatic sequences. This method allows us to prove a M\"obius-randomness-principle for automatic sequences from which we deduce the Sarnak conjecture for this class of sequences.…
Let $K$ be a complete non-Archimedean field $K$ with separated power series, treated in the analytic Denef--Pas language. We prove the existence of definable retractions onto an arbitrary closed definable subset of $K^{n}$, whereby…
The landmark quantum complexity result MIP$^*$=RE was used to prove the existence of a non Connes embeddable tracial von Neumann algebra. Recently, similar ideas were used to give a negative solution to the Aldous-Lyons conjecture: there is…
Nicolas Monod introduced the class of groups with the fixed-point property for cones, characterized by always admitting a non-zero fixed point whenever acting (suitably) on proper weakly complete cones. He proved that his class of groups…
We define an extension of the polynomial calculus on a W*-probability space by introducing an abstract algebra which contains polynomials. This extension allows us to define transition operators for additive and multiplicative free…
Starting from a generalization of the standard axioms for a monoid we present a stepwise development of various, mutually equivalent foundational axiom systems for category theory. Our axiom sets have been formalized in the Isabelle/HOL…
We present a novel length-aware solving algorithm for the quantifier-free first-order theory over regex membership predicate and linear arithmetic over string length. We implement and evaluate this algorithm and related heuristics in the Z3…