Related papers: Variations on the Post Correspondence Problem for …
We provide a correspondence between one-sided coideal subrings and one-sided ideal two-sided coideals in an arbitrary bialgebroid. We prove that, under some expected additional conditions, this correspondence becomes bijective for Hopf…
In this paper we investigate the word problem of the free Burnside semigroup satisfying x^2=x^3 and having two generators. Elements of this semigroup are classes of equivalent words. A natural way to solve the word problem is to select a…
The Ritt problem asks if there is an algorithm that tells whether one prime differential ideal is contained in another one if both are given by their characteristic sets. We give several equivalent formulations of this problem. In…
We collect some open problems about minimal presentations of numerical semigroups and, more generally, about defining ideals and free resolutions of their semigroup rings and associated graded rings. We emphasize both long-standing problems…
We construct a category equivalent to the category $\mathbf{Mon}$ of monoids and monoid homomorphisms, based on categories with strict factorization systems. This equivalence is then extended to the category $\mathbf{Mon_s}$ of unital…
Ranking individuals based on their performance in different coalitions is a problem emerging in various domains (teams sports, scientific evaluation, argumentation, etc.). Often, for practical reasons, the number of comparable coalitions is…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
For a commutative ring $R$ with a unit, an $R$-homology rose is a topological space whose homology groups with $R$-coefficients agree with those of a bouquet of cirlces. In this paper, we study some special properties of covering spaces and…
We study a coarse homology theory with prescribed growth conditions. For a finitely generated group G with the word length metric this homology theory turns out to be related to amenability of G. We characterize vanishing of a certain…
We consider the local equivalence problem for the class of linear second order hyperbolic equations in two independent variables under an action of the pseudo-group of contact transformations. E. Cartan's method is used for finding the…
We give an explicit way of calculating the set of homotopy classes of morphisms from a Tamsamani n-category A to another one B. This calculation uses a Reedy-cofibrant cosimplicial resolution of A, using a new notion of ``free cofibration''…
There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by $\sim_p$,…
We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius…
Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.
The mod-p cohomology ring of a non-trivial finite p-group is an infinite dimensional, finitely presented graded unital algebra over the field with p elements, with generators in positive degrees. We describe an effective algorithm to test…
We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…
The problem of covering the ground set of two matroids by a minimum number of common independent sets is notoriously hard even in very restricted settings, i.e.\ when the goal is to decide if two common independent sets suffice or not.…
We show that the holographic Complexity = Volume proposal satisfies a very general notion of Momentum/Complexity correspondence (PC), based on the Momentum Constraint of General Relativity. It relates the rate of complexity variation with…
We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two…
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…