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

A procedure is described that makes use of the generating function of characters to obtain a new generating function $H$ giving the multiplicities of each weight in all the representations of a simple Lie algebra. The way to extract from…

We classify simple groups that act by birational transformations on compact complex K\"ahler surfaces. Moreover, we show that every finitely generated simple group that acts non-trivially by birational transformations on a projective…

Classes of algebraic structures that are defined by equational laws are called varieties or equational classes. A variety is finitely generated if it is defined by the laws that hold in some fixed finite algebra. We show that every…

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

We complete the proof of the fact that all principal permutation classes generated by a pattern longer than two have a nonrational generating function.

Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…

We introduce the notion of crossings and nestings of a permutation. We compute the generating function of permutations with a fixed number of weak exceedances, crossings and nestings. We link alignments and permutation patterns to these…

The multiplicative structure of the trivial symplectic groupoid over $\mathbb R^d$ associated to the zero Poisson structure can be expressed in terms of a generating function. We address the problem of deforming such a generating function…

We define the geometric simpleness for toroidal groups. We give an example of quasi-abelian variety which is geometrically simple, but not simple. We show that any quasi-abelian variety is isogenous to a product of geometrically simple…

To a semisimple and cosemisimple Hopf algebra over an algebraically closed field, we associate a planar algebra defined by generators and relations and show that it is a connected, irreducible, spherical, non-degenerate planar algebra with…

Under suitable assumptions on the base field, we prove that a commutative semisimple Yetter-Drinfel'd Hopf algebra over a finite abelian group is trivial, i.e., is an ordinary Hopf algebra, if its dimension is relatively prime to the order…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

We prove that a transposed Poisson algebra is simple if and only if its associated Lie bracket is simple. Consequently, any simple finite-dimensional transposed Poisson algebra over an algebraically closed field of characteristic zero is…

This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is…

Associative algebras with involution over a field of zero characteristic are considered. It is proved that in this case for any finitely generated associative algebra with involution there exists a finite dimensional algebra with involution…

We introduce a new Hopf algebra that operates on pairs of finite interval partitions and permutations of equal length. This algebra captures vincular patterns, which involve specifying both the permutation patterns and the consecutive…

A curious generating function $S_0(x)$ for permutations of $[n]$ with exactly $n$ inversions is presented. Moreover, $(xC(x))^iS_0(x)$ is shown to be the generating function for permutations of $[n]$ with exactly $n-i$ inversions, where…

The classification of gradings by abelian groups on finite direct sums of simple finite-dimensional nonassociative algebras over an algebraically closed field is reduced, by means of the use of loop algebras, to the corresponding problem…

In this paper, a method to generate permutations of a string under a set of constraints decided by the user is presented. The required permutations are generated without generating all the permutations.

In this paper we shall prove that any $2$-transitive finitely homogeneous structure with a supersimple theory satisfying a generalized amalgamation property is a random structure. In particular, this adapts a result of Koponen for binary…