Related papers: HNN extensions and stackable groups
We consider the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. First a number of foundational results on…
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed and undirected graphs, where updates may add or delete…
Fix an equilateral triangle group $T_i=\langle a, b; a^i, b^i, (ab)^i\rangle$ with $i\geq6$ arbitrary. Our main result is: for every presentation $\mathcal{P}$ of every countable group $Q$ there exists an HNN-extension $T_{\mathcal{P}}$ of…
Machine Learning algorithms are increasingly being used in recent years due to their flexibility in model fitting and increased predictive performance. However, the complexity of the models makes them hard for the data analyst to interpret…
The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…
In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of…
A rack is a set with a binary operation that is right-invertible and self-distributive, properties diagrammatically corresponding to Reidemeister moves II and III, respectively. A rack is said to be an {\it augmented rack} if the operation…
We canonically identify the groups of isometries and dilations of local fields and their rings of integers with subgroups of the automorphism group of the $(d+1)$-regular tree $\widetilde T_{d+1}$, where $d$ is the residual degree. Then we…
If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…
The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested "stack of stacks" structure. These systems may be used to model higher-order programs and are closely related to the…
We present a differentiable stack data structure that simultaneously and tractably encodes an exponential number of stack configurations, based on Lang's algorithm for simulating nondeterministic pushdown automata. We call the combination…
Assume $G$ is a polycyclic group and $\phi:G\to G$ an endomorphism. Let $G\ast_{\phi}$ be the ascending HNN extension of $G$ with respect to $\phi$; that is, $G\ast_{\phi}$ is given by the presentation $$G\ast_{\phi}= < G, t \ |\ t^{-1}gt =…
The solvable Farb growth of a group quantifies how well-approximated the group is by its finite solvable quotients. In this note we present a new characterization of polycyclic groups which are virtually nilpotent. That is, we show that a…
Regular nested word languages (a.k.a. visibly pushdown languages) strictly extend regular word languages, while preserving their main closure and decidability properties. Previous works have shown that considering languages of 2-nested…
In this work, we prove that every SFT, sofic shift, and strongly irreducible shift on locally finite groups has strong dynamical properties. These properties include that every sofic shift is an SFT, every SFT is strongly irreducible, every…
Let $H$ be a group and $E$ a set such that $H \subseteq E$. We shall describe and classify up to an isomorphism of groups that stabilizes $H$ the set of all group structures that can be defined on $E$ such that $H$ is a subgroup of $E$. A…
The field of constraint satisfaction problems (CSPs) studies homomorphism problems between relational structures where the target structure is fixed. Classifying the complexity of these problems has been a central quest of the field,…
Graph Neural Networks (GNNs) have emerged as the predominant approach for learning over graph-structured data. However, most GNNs operate as black-box models and require post-hoc explanations, which may not suffice in high-stakes scenarios…