Related papers: Zero-Knowledge Proofs of the Conjugacy for Permuta…
We proved that, in characteristic 0, if two dominant endomorphisms of the projective plane of degree at least 2 are conjugate by some birational transformation, then they are conjugate by an automorphism. We also gave counterexamples in…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and super summit sets, provide effective…
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
We introduce a notion of permutation presentations of modules over finite groups, and completely determine finite groups over which every module has a permutation presentation. To get this result, we prove that every coflasque module over a…
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…
A group $G$ is called subgroup conjugacy separable (abbreviated as SCS), if any two finitely generated and non-conjugate subgroups of $G$ remain non-conjugate in some finite quotient of $G$. We prove that free groups and the fundamental…
We present the first constructions of single-prover proof systems that achieve perfect zero knowledge (PZK) for languages beyond NP, under no intractability assumptions: 1. The complexity class #P has PZK proofs in the model of Interactive…
We use the theory of group actions on profinite trees to prove that the fundamental group of a finite, 1-acylindrical graph of free groups with finitely generated edge groups is conjugacy separable. This has several applications: we prove…
Two knots are homology concordant if they are smoothly concordant in a homology cobordism. The group $\hat{\mathcal{C}}_{\mathbb{Z}}$ (resp. $\mathcal{C}_{\mathbb{Z}}$) was previously defined as the set of knots in homology spheres that…
For a given pure state of a composite quantum system we analyze the product of its projections onto a set of locally orthogonal separable pure states. We derive a bound for this product analogous to the entropic uncertainty relations. For…
This paper initiates the study of effective twisted conjugacy separability for finitely generated groups, which measures the complexity of separating distinct twisted conjugacy classes via finite quotients. The focus is on nilpotent groups,…
A finitely generated subgroup H of a torsion-free hyperbolic group G is called immutable if there are only finitely many conjugacy classes of injections of H into G. We show that there is no uniform algorithm to recognize immutability,…
There currently exists no algebraic algorithm for computing twisted conjugacy classes in free groups. We propose a new technique for deciding twisted conjugacy relations using nilpotent quotients. Our technique is generalization of the…
We analyse the set of matrices in SL$_3(\mathbb{F}_7)$ without eigenvalues explicitly, extracting nice bijections between the 18 equally sized conjugacy classes contained within. In doing so, we discover a set of $18$ commuting matrices for…
A Zero-Knowledge Protocol (ZKP) allows one party to convince another party of a fact without disclosing any extra knowledge except the validity of the fact. For example, it could be used to allow a customer to prove their identity to a…
Many results have been established that show how the number of conjugacy classes appearing in the product of classes affect the structure of a finite group. The aim of this paper is to show several results about solvability concerning the…
We completely determine all varieties of monoids on whose free objects all fully invariant congruences or all fully invariant congruences contained in the least semilattice congruence permute. Along the way, we find several new monoid…
Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes. In the 1980's Thompson conjectured that the equality $N(G)=N(S)$, where $Z(G)=1$ and $S$ is simple, implies the isomorphism $G\simeq S$. In a series of papers of…
When permutation methods are used in practice, often a limited number of random permutations are used to decrease the computational burden. However, most theoretical literature assumes that the whole permutation group is used, and methods…