相关论文: Simple permutations and algebraic generating funct…

We show that normalizers and permutational isomorphisms of permutation groups given by generating sets can be computed in time simply exponential in the degree of the groups. The result is obtained by exploiting canonical forms for…

We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…

Given a prime $p$, we construct a permutation group containing at least $p^{p-2}$ non-conjugated regular elementary abelian subgroups of order $p^3$. This gives the first example of a permutation group with exponentially many non-conjugated…

We consider the problem of characterizing the class of those permutation groups that are the symmetry groups of Boolean functions. These are exactly the automorphism groups of hypergraphs. They are also called the relation groups. In this…

We introduce the notion of fully simple maps, which are maps with non self-intersecting disjoint boundaries. In contrast, maps where such a restriction is not imposed are called ordinary. We study in detail the combinatorics of fully simple…

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

We construct an uncountable family of well-quasi-ordered permutation classes, each with a distinct enumeration sequence. This disproves a conjecture that all well-quasi-ordered permutation classes have algebraic generating functions, and in…

We study the involutions belonging to the class of 321 avoiding permutations. We calculate the algebraic generating functions of the set containing the involutions avoiding 321 and of some of its subsets. Precisely we determine the…

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…

We show that an arbitrary algebra ${ A}$, (of arbitrary dimension, over an arbitrary base field and any identity is not suppose for the product), is semisimple if and only if it has zero annihilator and admits a semi-division linear basis.…

By using an approach of the invariant theory we obtain a new formula for the ordinary generating function of the numbers of the simple graphs with $n$ nodes.

A general simplicity problem in category theory is proposed. A particular example, the simplest choice of generators of an algebra is specified and illustrated by an example.

Let $G$ be a finite group. There is a standard theorem on the classification of $G$-equivariant finite dimensional simple commutative, associative, and Lie algebras (i.e., simple algebras of these types in the category of representations of…

In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in [Knuth] in connection to sorting algorithms. A natural generalization of this set leads us…

We prove that every proper subclass of the 321-avoiding permutations that is defined either by only finitely many additional restrictions or is well quasi-ordered has a rational generating function. To do so we show that any such class is…

Hereunder we continue the study of the representation theory of the algebra of permutation operators acting on the $n$-fold tensor product space, partially transposed on the last subsystem. We develop the concept of partially reduced…

A derived version of Maschke's theorem for finite groups is proved: the derived categories, bounded or unbounded, of all blocks of the group algebra of a finite group are simple, in the sense that they admit no nontrivial recollements. This…

I give a short proof of the following algebraic statement: if a vertex algebra is simple, then its underlying Lie conformal algebra is either abelian, or it is an irreducible central extension of a simple Lie conformal algebra.

In this article, we first give a short introduction to conformal algebras. Then we present three families of simple conformal algebras finite growth generated by simple Jordan algebras of types A, B, C.

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…