Related papers: The conjugacy problem for positive homogeneously p…
Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any…
We present four generalized small cancellation conditions for finite presentations and solve the word- and conjugacy problem in each case. Our conditions $W$ and $W^*$ contain the non-metric small cancellation cases C(6), C(4)T(4), C(3)T(6)…
In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $M_n(K)$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used…
Let $R=K[G]$ be a group ring of a group $G$ over a field $K$. The Ore condition says that for any $a,b\in R$ there exist $u,v\in R$ such that $au=bv$, where $u\ne0$ or $v\ne0$. It always holds whenever $G$ is amenable. Recently it was shown…
Let $G$ be a finite abelian group with exponent $n$, and let $r$ be a positive integer. Let $A$ be a $k\times m$ matrix with integer entries. We show that if $A$ satisfies some natural conditions and $|G|$ is large enough then, for each…
For a left cancellative monoid $S$ we consider a quotient of the reduced semigroup C$^*$-algebra $C_r^*(S)$ known as the boundary quotient. We present two potential groupoid models for this boundary quotient, obtained as reductions of…
We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside groups (which include…
The solvability of monomial groups is a well-known result in character theory. Certain properties of Artin L-series suggest a generalization of these groups, namely to such groups where every irreducible character has some multiple which is…
We give a unified solution to the conjugacy problem for Thompson's groups F, T, and V. The solution uses strand diagrams, which are similar in spirit to braids and generalize tree-pair diagrams for elements of Thompson's groups. Strand…
In this paper we study some combinatorial aspects of the singular Artin monoids. Firstly, we show that a singular Artin monoid $SA$ can be presented as a semidirect product of a graph monoid with its associated Artin group $A$. Such a…
The Deligne-Simpson problem in the multiplicative version is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\in SL(n,{\bf C})$ so that there exist irreducible $(p+1)$-tuples…
Proofs of two results about a monomial ideal -- describing membership in auxiliary ideals associated to the monomial ideal -- are given which do not invoke resolution of singularities. The AM--GM inequality is used as a substitute for…
Let $\mathscr{C}$ be a classical group defined over a finite field. We present comprehensive theoretical solutions to the following closely related problems: 1) List a representative for each conjugacy class of $\mathscr{C}$. 2) Given $x…
The long-standing problem of finding coherent states for the (bound state portion of the) hydrogen atom is positively resolved. The states in question: (i) are normalized and are parameterized continuously, (ii) admit a resolution of unity…
In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…
We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether…
A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act itself has a finite presentation; it is weakly right coherent if every finitely generated right ideal of $S$ has a finite…
In this article, we study the combinatorics of congruence subgroups of the modular group. More precisely, we consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of…
If the standard model of quarks and leptons is extended to include three singlet right-handed neutrinos, then the resulting fermion structure admits an infinite number of anomaly-free solutions with just one simple constraint. Well-known…
A minimal monomial ideal is the combinatorially simplest monomial ideal whose lcm-lattice equals a given finite atomic lattice $\hat{L}$. The minimal ideal inherits many nice properties of any ideal $I$ whose lcm-lattice also equals…