Related papers: Generator Sets for the Alternating Group
We study generating functions in the context of Rota-Baxter algebras. We show that exponential generating functions can be naturally viewed in a very special case of complete free commutative Rota-Baxter algebras. This allows us to use free…
We derive presentations of the interval groups related to all quasi-Coxeter elements in the Coxeter group of type $D_n$. Type $D_n$ is the only infinite family of finite Coxeter groups that admits proper quasi-Coxeter elements. The…
The reflections in a Coxeter group are defined as conjugates of a single generator, and thus admit palindromic expressions as products of generators. Our main result gives closed formulas providing a palindromic reduced expression for each…
Operators acting on the discrete random chaos yield signed multiplicative systems, extending the notion of spin matrices and quaternions. We investigate signed groups through the associated sign matrices, focusing on generators and their…
We obtain an asymptotic upper bound for the smallest number of generators for a finite direct sum of matrix algebras with entries in a finite field. This produces an upper bound for a similar quantity for integer matrix rings. We also…
Anderson generating functions are generating series for division values of points on Drinfeld modules, and they serve as important tools for capturing periods, quasi-periods, and logarithms. They have been fundamental in recent work on…
Building on recent progress in constructing derivations on Fourier algebras, we provide the first examples of locally compact groups whose Fourier algebras support non-zero, alternating 2-cocycles; this is the first step in a larger…
The exact degree bound for the generators of rings of polynomial invariants is determined for the finite, non-cyclic groups having a cyclic subgroup of index two. It is proved that the Noether number of these groups equals one half the…
We use the cluster method to enumerate permutations avoiding consecutive patterns. We reprove and generalize in a unified way several known results and obtain new ones, including some patterns of length 4 and 5, as well as some infinite…
The aim of this paper is to construct general forms of ordinary generating functions for special numbers and polynomials involving Fibonacci type numbers and polynomials, Lucas numbers and polynomials, Chebyshev polynomials, Sextet…
We show that the direct sum of the cohomology groups of the alternating subgroups of the family of Coxeter groups of Type B exhibits an almost-Hopf ring structure. We apply techniques developed by Giusti and Sinha to fully compute a…
We define a type B analogue of the category of finite sets with surjections, and we study the representation theory of this category. We show that the opposite category is quasi-Grobner, which implies that submodules of finitely generated…
In 2011 Eriko Hironaka introduced an interesting generalization of Coxeter groups, motivated by studying certain mapping classes. The generalization is by labeling the vertices of a Coxeter graph either by +1 or by -1, and then generalizing…
We find a family of groups generated by a pair of parabolic elements in which every relator must admit a long subword of a specific form. In particular, this collection contains groups in which the number of syllables of any relator is…
Let $(W,S)$ be a Coxeter system and $\Gamma$ be a group of automorphisms of $W$ such that $\gamma(S)=S$ for all $\gamma \in \Gamma$. Then it is known that the group of fixed points $W^\Gamma$ is again a Coxeter group with a canonically…
The Pearcey process is a universal point process in random matrix theory. In this paper, we study the generating function of the Pearcey process on any number $m$ of intervals. We derive an integral representation for it in terms of a…
The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. The authors previously…
In this paper we study algebraic and asymptotic properties of generating sets of algebras over orders in number fields. Let $A$ be an associative algebra over an order $R$ in an algebraic number field. We assume that $A$ is a free…
Each quiver appearing in a seed of a cluster algebra determines a corresponding group, which we call a cluster group, which is defined via a presentation. Grant and Marsh showed that, for quivers appearing in seeds of cluster algebras of…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…