Related papers: Zero-Knowledge Proofs of the Conjugacy for Permuta…

Let $G$ be a primitive permutation group of degree $n$ with nonabelian socle, and let $k(G)$ be the number of conjugacy classes of $G$. We prove that either $k(G)<n/2$ and $k(G)=o(n)$ as $n\rightarrow \infty$, or $G$ belongs to explicit…

Many results have been established that show how arithmetic conditions on conjugacy class sizes affect group structure. A conjugacy class in $G$ is called vanishing if there exists some irreducible character of $G$ which evaluates to zero…

We show that every language in QMA admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowledge for classical (and quantum) polynomial-time verifiers.…

We describe some configurations of conjugate permutations which may be used as a mathematical model of some genetical processes and crystal growth.

We introduce a combinatorial criterion for verifying whether a formula is not the conjunction of an equation and a co-equation. Using this, we give a proof for the nonequationality of the free group. Furthermore, we generalize the latter…

This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the form n(n(t))…

This paper tackles the problem of formulating and proving the completeness of focused-like proof systems in an automated fashion. Focusing is a discipline on proofs which structures them into phases in order to reduce proof search…

A conjugacy class $C$ of a finite group $G$ is a sign conjugacy class if every irreducible character of $G$ takes value 0, 1 or -1 on $C$. In this paper we classify the sign conjugacy classes of the symmetric groups and thereby verify a…

Zero-knowledge proofs allow verification of computations without revealing private information. However, existing systems require memory proportional to the computation size, which has historically limited use in large-scale applications…

Using the correspondence between a cycle up-down permutation and a pair of matchings, we give a combinatorial proof of the enumeration of alternating permutations according to the given peak set.

We give an effective solution of the conjugacy problem for two by two matrices over the polynomial ring in one variable over a finite field.

Permutation tests are a distribution free way of performing hypothesis tests. These tests rely on the condition that the observed data are exchangeable among the groups being tested under the null hypothesis. This assumption is easily…

Let $G$ be a group. Two elements $x,y \in G$ are said to be in the same $z$-class if their centralizers in $G$ are conjugate within $G$. Consider $\mathbb F$ a perfect field of characteristic $\neq 2$, which has a non-trivial Galois…

We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…

The problem as to when two noncommuting observables are considered to have the same value arises commonly, but shows a nontrivial difficulty. Here, an answer is given by establishing the notion of perfect correlations between noncommuting…

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…

We determine all orthogonal transformations of a quadratic space over reals such that any orthogonal transformation which is conjugate to one of them in the linear group is conjugate in the orthogonal group.

The action of any group on itself by conjugation and the corresponding conjugacy relation play an important role in group theory. There have been many attempts to find notions of conjugacy in semigroups that would be useful in special…

When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…

We determine for which known finite simple groups $G$ and which primes $p$ the $p$-fusion system of $G$ is simple. This means first collecting together the results that were already known (and correcting two errors made in an earlier study…