相关论文: Avoiding maximal parabolic subgroups of S_k

A tropical polynomial in nr variables divided into blocks of r variables each, is r-symmetric, if it is invariant under the action of Sn that permutes the blocks. For r=1 we call these tropical polynomials symmetric. We can define…

Dealing with large numbers of symmetries is often problematic. One solution is to focus on just symmetries that generate the symmetry group. Whilst there are special cases where breaking just the symmetries in a generating set is complete,…

Formulas for the expansion of arbitrary invariant group functions in terms of the characters for the Sp(2N), SO(2N+1), and SO(2N) groups are derived using a combinatorial method. The method is similar to one used by Balantekin to expand…

The symmetric group acts on polynomial differential forms on $\mathbb{R}^{n}$ through its action by permuting the coordinates. In this paper the $S_{n}% $-invariants are shown to be freely generated by the elementary symmetric polynomials…

A Hopf algebra with four generators among which an involution (reflection) operator, is introduced. The defining relations involve commutators and anticommutators. The discrete series representations are developed. Designated by…

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

We prove that the generating function of the positive singular braid monoid is rational and we give the exact formula for such monoid on three strands.

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…

We extend Friedman's theorem to show that, for any fixed $r>1$, a random $2r$--regular Schreier graph associated with the action of $r$ uniformly random permutations of $[n]$ on $k_{n}$--tuples of distinct elements in $[n]$ has a…

We study permutations in $S_n$ that simultaneously avoid the pattern $132$ and satisfy the adjacency bound $|\pi_{i+1} - \pi_i| \leq m$ for all $i$, denoting their number by $A_n^{(m)}$. This combination of a global pattern restriction and…

Let k be an algebraically closed field. We show that the Cremona group of all birational transformations of the projective plane P^2 over k is not a simple group. The strategy makes use of hyperbolic geometry, geometric group theory, and…

We consider the action of a permutation group $G$ of order $k$ on the tropical polynomial semiring in $n$ variables. We prove that the sub-semiring of invariant polynomials is finitely generated if and only if $G$ is generated by…

We study the combinatorial representation theory of the ``planar rook algebra" $P_n$. This algebra has a basis consisting of planar rook diagrams and multiplication given by diagram concatenation. For each integer $0 \le k \le n$, we…

In this paper we compute the generating rank of $k$-polar Grassmannians defined over commutative division rings. Among the new results, we compute the generating rank of $k$-Grassmannians arising from Hermitian forms of Witt index $n$…

A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary…

We discuss permutation representations which are obtained by the natural action of $S_n \times S_n$ on some special sets of invertible matrices, defined by simple combinatorial attributes. We decompose these representations into…

Polyregular functions are the class of string-to-string functions definable by pebble transducers, an extension of finite-state automata with outputs and multiple two-way reading heads (pebbles) with a stack discipline. If a polyregular…

Let $K$ be an imaginary quadratic field of discriminant less than or equal to -7 and $K_{(N)}$ be its ray class field modulo $N$ for an integer $N$ greater than 1. We prove that singular values of certain Siegel functions generate $K_{(N)}$…

If X is an n-element set, we call a family G of subsets of X a k-generator for X if every subset of X can be expressed as a union of at most k disjoint sets in G. Frein, Leveque and Sebo conjectured that for n > 2k, the smallest…

Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We study generating functions for the number…