Search results for "MUTATION"

Permutation properties and the fibonacci semigroup

1989

Cyclic and lift closures for k…21-avoiding permutations

2011

We prove that the cyclic closure of the permutation class avoiding the pattern k(k-1)...21 is finitely based. The minimal length of a minimal permutation is 2k-1 and these basis permutations are enumerated by (2k-1).c"k where c"k is the kth Catalan number. We also define lift operations and give similar results. Finally, we consider the toric closure of a class and we propose some open problems.

HEIGHTS OF CHARACTERS IN BLOCKS OF $p$-SOLVABLE GROUPS

2005

In this paper, it is proved that if $B$ is a Brauer $p$ -block of a $p$ -solvable group, for some odd prime $p$ , then the height of any ordinary character in $B$ is at most $2b$ , where $p^b$ is the largest degree of the irreducible characters of the defect group of $B$ . Some other results that relate the heights of characters with properties of the defect group are obtained.

Quantum Queries on Permutations with a Promise

2009

This paper studies quantum query complexities for deciding (exactly or with probability 1.0) the parity of permutations of n numbers, 0 through n *** 1. Our results show quantum mechanism is quite strong for this non-Boolean problem as it is for several Boolean problems: (i) For n = 3, we need a single query in the quantum case whereas we obviously need two queries deterministically. (ii) For even n , n /2 quantum queries are sufficient whereas we need n *** 1 queries deterministically. (iii) Our third result is for the problem deciding whether the given permutation is the identical one. For this problem, we show that there is a nontrivial promise such that if we impose that promise to the …

Central Units, Class Sums and Characters of the Symmetric Group

2010

In the search for central units of a group algebra, we look at the class sums of the group algebra of the symmetric group S n in characteristic zero, and we show that they are units in very special instances.

Group algebras whose units satisfy a group identity

1997

Let F G FG be the group algebra of a torsion group over an infinite field F F . Let U U be the group of units of F G FG . We prove that if U U satisfies a group identity, then F G FG satisfies a polynomial identity. This confirms a conjecture of Brian Hartley.

The complex of words and Nakaoka stability

2005

We give a new simple proof of the exactness of the complex of injective words and use it to prove Nakaoka's homology stability for symmetric groups. The methods are generalized to show acyclicity in low degrees for the complex of words in "general position". Hm(§ni1;Z) = Hm(§n;Z) for n=2 > m where §n denotes the permutation group of n elements. An elementary proof of this fact has not been available in the literature. In the first section the complex C⁄(m) of abelian groups is studied which in de- gree n is freely generated by injective words of length n. The alphabet consists of m letters. The complex C⁄(m) has the only non vanishing homology in degree m (Theorem 1). This is a result of F.…

Asymptotics for the standard and the Capelli identities

2003

Let {c n (St k )} and {c n (C k )} be the sequences of codimensions of the T-ideals generated by the standard polynomial of degreek and by thek-th Capelli polynomial, respectively. We study the asymptotic behaviour of these two sequences over a fieldF of characteristic zero. For the standard polynomial, among other results, we show that the following asymptotic equalities hold: $$\begin{gathered} c_n \left( {St_{2k} } \right) \simeq c_n \left( {C_{k^2 + 1} } \right) \simeq c_n \left( {M_k \left( F \right)} \right), \hfill \\ c_n \left( {St_{2k + 1} } \right) \simeq c_n \left( {M_{k \times 2k} \left( F \right) \oplus M_{2k \times k} \left( F \right)} \right), \hfill \\ \end{gathered} $$ wher…

Der Satz von Tits für PGL2(R), R ein kommutativer Ring vom stabilen Rang 2

1996

Certain permutation groups on sets with distance relation are characterized as groups of projectivities PGL2(R) on the projective line over a commutative ring R of stable rank 2, thus generalizing a classical result of Tits where R is a field.

Quantum Queries on Permutations

2015

K. Iwama and R. Freivalds considered query algorithms where the black box contains a permutation. Since then several authors have compared quantum and deterministic query algorithms for permutations. It turns out that the case of \(n\)-permutations where \(n\) is an odd number is difficult. There was no example of a permutation problem where quantization can save half of the queries for \((2m+1)\)-permutations if \(m\ge 2\). Even for \((2m)\)-permutations with \(m\ge 2\), the best proved advantage of quantum query algorithms is the result by Iwama/Freivalds where the quantum query complexity is \(m\) but the deterministic query complexity is \((2m-1)\). We present a group of \(5\)-permutati…