Related papers: Zero-Knowledge Proofs of the Conjugacy for Permuta…
Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…
Coalition logic is one of the most popular logics for multi-agent systems. While epistemic extensions of coalition logic have received much attention, existence of their complete axiomatisations has so far been an open problem. In this…
The permutation test is known as the exact test procedure in statistics. However, often it is not exact in practice and only an approximate method since only a small fraction of every possible permutation is generated. Even for a small…
We explicitly construct a (unitary) $\mathbb{Z}/2\mathbb{Z}$ permutation gauging of a (unitary) modular category $\mathcal{C}$. In particular, the formula for the modular data of the gauged theory is provided in terms of modular data of…
We give a combinatorial characterization of conjugacy in the sylvester monoid (the monoid of binary search trees), showing that conjugacy is decidable for this monoid. We then prove that conjugacy is undecidable in general for homogeneous…
We consider the permutation group algebra defined by Cameron and show that if the permutation group has no finite orbits, then no homogeneous element of degree one is a zero-divisor of the algebra. We proceed to make a conjecture which…
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…
In a group $G$, elements $a$ and $b$ are conjugate if there exists $g\in G$ such that $g^{-1} ag=b$. This conjugacy relation, which plays an important role in group theory, can be extended in a natural way to inverse semigroups: for…
The perfect NOT transformation, probabilistic perfect NOT transformation and conjugate transformation are studied. Perfect NOT transformation criteria on a quantum state set $S$ of a qubit are obtained. Two necessary and sufficient…
We demonstrate how a generic automated theorem prover can be applied to establish the non-orderability of groups. Our approach incorporates various tools such as positive cones, torsions, generalised torsions and cofinal elements.
We give several algorithms addressing computations of intersections of conjugate subgroups.
In this note, we examine the gauging of the $\mathbb{Z}/2\mathbb{Z}$ permutation action on the tensor square of a modular tensor category. When $\mathcal{C}$ has no nontrivial invertible objects, we provide formulas for the fusion rules of…
We classify all finite groups G such that the product of any two non-inverse conjugacy classes of G is always a conjugacy class of G. We also classify all finite groups G for which the product of any two G-conjugacy classes which are not…
We prove exactly that the squared entanglement of formation, which quantifies the bipartite entanglement, obeys a general monogamy inequality in an arbitrary multiqubit mixed state. Based on this kind of exotic monogamy relation, we are…
Let G be a group. Two elements x and y in G are said to be in the same z-class if their centralizers in G are conjugate within G. In this paper, we prove that the number of z-classes in the group of upper triangular matrices is infinite…
We study the coupling constant renormalization of gauge theories with an infinite multiplet of fermions, using the zeta function method to make sense of the infinite sums over fermions. If the gauge group K is the maximal compact subgroup…
There is a natural equivalence relation on representations of the states of a given quantum system in a Hilbert space, two representations being equivalent iff they are related by a unitary transformation. There are two equivalence classes,…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
In this paper, we derive a more precise version of the Strong Pair Correlation Conjecture on the zeros of the Riemann zeta function under Riemann Hypothesis and Twin Prime Conjecture.
In this work, we prove that the permutation group of a Reed-Solomon code is given by the polynomials of degree one that leave the set of evaluation points invariant. Our results provide a straightforward proof of the well-known cases of the…