Related papers: Remarks and problems about algorithmic description…
Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…
We discuss the classification of reflection subgroups of finite and affine Weyl groups from the point of view of their root systems. A short case free proof is given of the well known classification of the isomorphism classes of reflection…
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…
We propose a novel and efficient algorithm for the collaborative preference completion problem, which involves jointly estimating individualized rankings for a set of entities over a shared set of items, based on a limited number of…
We study theoretical runtime guarantees for a class of optimization problems that occur in a wide variety of inference problems. these problems are motivated by the lasso framework and have applications in machine learning and computer…
In this paper, we investigate algebraic and topological properties of the Riordan groups over finite fields. These groups provide a new class of topologically finitely generated profinite groups with finite width. We also introduce,…
Let X(F,G) be the G-character variety of F where G is a rank 1 complex affine algebraic group and F is a finitely presentable discrete group. We describe an algorithm, which we implement in Mathematica, SageMath, and in Python, that takes a…
We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as 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…
We provide a combinatorial criterion for the finite generation of a valuation semigroup associated with an ample divisor on a smooth toric surface and a non-toric valuation of maximal rank. As an application, we construct a lattice polytope…
We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…
In [Frobenius1896] it was shown that many important properties of a finite group could be examined using formulas involving the character ratios of group elements, i.e., the trace of the element acting in a given irreducible representation,…
There is a natural action of the braid group on the symmetric matrices with units on the diagonal, appearing in various fields as Singularity Theory, Frobenius Manifolds or Isomonodromic deformations of certain classes of linear…
One of the most beautiful results in the integral representation theory of finite groups is a theorem of A. Weiss that detects a permutation $R$-lattice for the finite $p$-group $G$ in terms of the restriction to a normal subgroup $N$ and…
We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it…
Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary)…
This paper introduces a class of objects called decision rules that map infinite sequences of alternatives to a decision space. These objects can be used to model situations where a decision maker encounters alternatives in a sequence such…
Let $(S,\, \ast)$ be a closed oriented surface with a marked point, let $G$ be a fixed group, and let $\rho\colon\pi_1(S) \longrightarrow G$ be a representation such that the orbit of $\rho$ under the action of the mapping class group…
We prove a variant of the well-known Reidemeister-Schreier theorem for finitely $L$-presented groups. More precisely, we prove that each finite index subgroup of a finitely $L$-presented group is itself finitely $L$-presented. Our proof is…
An algorithm is proposed that solves two decision problems for pseudo-Anosov elements in the mapping class group of a surface with at least one marked fixed point. The first problem is the root problem: decide if the element is a power and…