Related papers: The subpower membership problem for semigroups
A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…
In this paper we consider the Ideal Membership Problem (IMP for short), in which we are given real polynomials $f_0,f_1,\dots, f_k$ and the question is to decide whether $f_0$ belongs to the ideal generated by $f_1,\dots,f_k$. In the more…
We establish analogues in the context of group actions or group representations of some classical problems and results in additive combinatorics of groups. We also study the notion of left invariant submodular function defined on power sets…
Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…
We prove that every countable group with solvable power problem embeds into a finitely presented 2-generated group with solvable power and conjugacy problems.
Semidefinite Programming (SDP) provides tight lower bounds for Optimal Power Flow problems. However, solving large-scale SDP problems requires exploiting sparsity. In this paper, we experiment several clique decomposition algorithms that…
In this manuscript, a solution to Problem 18.91(b) in the Kourovka Notebook is given by proving the following theorem. Let $P$ be a Sylow $p$-subgroup of a group $G$ with $|P| = p^n$. Suppose that there is an integer $k$ such that $1 < k <…
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 say that a finitely generated group $\Gamma$ is self-simulable if every effectively closed action of $\Gamma$ on a closed subset of $\{\texttt{0},\texttt{1}\}^{\mathbb{N}}$ is the topological factor of a $\Gamma$-subshift of finite type.…
In this paper, we prove that the symmetric group $\mathrm{S}_n$ has $2^{n^2/16+o(n^2)}$ subgroups, settling a conjecture of Pyber from 1993. We also derive asymptotically sharp upper and lower bounds on the number of subgroups of…
We study the structure of discrete subgroups of the group $G[[r]]$ of complex formal power series under the operation of composition of series. In particular, we prove that every finitely generated fully residually free group is embeddable…
The power semigroup of a semigroup $ S $ is the semigroup of all nonempty subsets of $ S $ equipped with the naturally defined multiplication. A class $\mathcal{K} $ of semigroups is globally determined if any two members of $ \mathcal{K} $…
A numerical semigroup is a submonoid of ${\mathbb Z}_{\ge 0}$ whose complement in ${\mathbb Z}_{\ge 0}$ is finite. For any set of positive integers $a,b,c$, the numerical semigroup $S(a,b,c)$ formed by the set of solutions of the inequality…
Given an arbitrary group $G$ we construct a semigroup of idempotents (band) $B_G$ with the property that the free idempotent generated semigroup over $B_G$ has a maximal subgroup isomorphic to $G$. If $G$ is finitely presented then $B_G$ is…
The implicit signature k consists of the multiplication and the ({\omega}-1)-power. We describe a procedure to transform each {\kappa}-term over a finite alphabet A into a certain canonical form and show that different canonical forms have…
A string $S[1,n]$ is a power (or tandem repeat) of order $k$ and period $n/k$ if it can decomposed into $k$ consecutive equal-length blocks of letters. Powers and periods are fundamental to string processing, and algorithms for their…
Approximate message passing (AMP) is a family of iterative algorithms that generalize matrix power iteration. AMP algorithms are known to optimally solve many average-case optimization problems. In this paper, we show that a large class of…
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…
A basic fact taught in undergraduate algebra courses is that every finite nilpotent group is a direct product of $p$-groups. Already Bruck observed that this does not generalize to loops. In particular, there exist nilpotent loops of size…
Given a numerical semigroup $S$, we let $\mathrm P_S(x)=(1-x)\sum_{s\in S}x^s$ be its semigroup polynomial. We study cyclotomic numerical semigroups; these are numerical semigroups $S$ such that $\mathrm P_S(x)$ has all its roots in the…