Related papers: Snakes can be fooled into thinking they live in a …
The goal of this paper is to study the family of snake polyominoes. More precisely, we focus our attention on the class of partially directed snakes. We establish functional equations and length generating functions of two dimensional,…
Snake modules introduced by Mukhin and Young form a family of modules of quantum affine algebras. The aim of this paper is to prove that the Hernandez-Leclerc conjecture about monoidal categorifications of cluster algebras is true for prime…
We study relationship among versions of the Knapsack Problem where variables take values in Z and the number of them is fixed. In particular, we construct a finitely presented group where the problem of solvability of exponential equations…
For every labeled forest $\mathsf{F}$ with set of vertices $[n]$ we can consider the subgroup $G$ of the symmetric group $S_n$ that is generated by all the cycles determined by all maximal paths of $\mathsf{F}$. We say that $G$ is the chain…
In the 60's, Berger famously showed that translational tilings of $\mathbb{Z}^2$ with multiple tiles are algorithmically undecidable. Recently, Bhattacharya proved the decidability of translational monotilings (tilings by translations of a…
We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…
It is shown that the knapsack problem (introduced by Myasnikov, Nikolaev, and Ushakov) is undecidable in a direct product of sufficiently many copies of the discrete Heisenberg group (which is nilpotent of class 2). Moreover, for the…
The Donald-Flanigan conjecture asserts that for any finite group and for any field, the corresponding group algebra can be deformed to a separable algebra. The minimal unsolved instance, namely the quaternion group over a field of…
We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.
Let K be a Cantor set embedded in the real line R. Following Funar and Neretin, we define the diffeomorphism group of K as the group of homeomorphisms of K which locally look like a diffeomorphism between two intervals of R.…
Let $T_1$ and $T_2$ be homogeneous trees of even degree $\ge 4$. A BM group $\Gamma$ is a torsion free discrete subgroup of $\aut (T_1) \times \aut (T_2)$ which acts freely and transitively on the vertex set of $T_1 \times T_2$. This…
We prove that a finitely generated group $G$ is virtually free if and only if there exists a generating set for $G$ and $k > 0$ such that all $k$-locally geodesic words with respect to that generating set are geodesic.
The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton…
A generalized Baumslag-Solitar group (GBS group) is a finitely generated group $G$ which acts on a tree with all edge and vertex stabilizers infinite cyclic. We show that Out(G) either contains non-abelian free groups or is virtually…
In this last decade, an important stochastic model emerged: the Brownian map. It is the limit of various models of random combinatorial maps after rescaling: it is a random metric space with Hausdorff dimension 4, almost surely homeomorphic…
We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.
Accessible groups for which the language of all words defining the identity is accepted by a certain class of nested stack automata are virtually free.
We study the model-checking problem for recursion schemes: does the tree generated by a given higher-order recursion scheme satisfy a given logical sentence. The problem is known to be decidable for sentences of the MSO logic. We prove…
A fair sack is a finite set of independent dice, not required to be fair and allowed to have any number of sides, for which all totals are equally likely. These have been studied for over 60 years. Most results restrict the possible orders…
We consider the question of when a random walk on a finite abelian group with a given step distribution can be used to reconstruct a binary labeling of the elements of the group, up to a shift. Matzinger and Lember (2006) give a sufficient…