Related papers: Actions and identities on set partitions

Let $G$ be a finite group acting on a finite dimensional complex vector space $V$ via linear transformations. Let $\mathbb{C}[V]^G$ be the algebra of polynomials that are invariant under the induced $G$-action on the polynomial ring…

We show that, in many cases, there are infinitely many sets of partitions corresponding to a single analytical Rogers-Ramanujan type identity. This means that a single analytical Rogers-Ramanujan type identity implies the existence of…

The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…

We introduce the notion of the action of a group on a labeled graph and the quotient object, also a labeled graph. We define a skew product labeled graph and use it to prove a version of the Gross-Tucker theorem for labeled graphs. We then…

An action of a compact, in particular finite group on a C*-algebra is called properly outer if no automorphism of the group that is distinct from identity is implemented by a unitary element of the algebra of local multipliers of the…

An action of a compact, in particular finite group on a C*-algebra is called properly outer if no automorphism of the group that is distinct from identity is implemented by a unitary element of the algebra of local multipliers of the…

In this paper, we study partial actions of groups on $R$-algebras, where $R$ is a commutative ring. We describe the partial actions of groups on the indecomposable algebras with enveloping actions. Then we work on algebras that can be…

A near permutation of a set is a bijection between two cofinite subsets, modulo coincidence on smaller cofinite subsets. Near permutations of a set form its near symmetric group. In this monograph, we define near actions as homomorphisms…

We introduce the notion of a graded group action on a graded algebra or, which is the same, a group action by graded pseudoautomorphisms. An algebra with such an action is a natural generalization of an algebra with a super- or a…

Difference sets are subsets of a group satisfying certain combinatorial property with respect to the group operation. They can be characterized using an equality in the group ring of the corresponding group. In this paper, we exploit the…

We study a correspondence between numerical sets and integer partitions that leads to a bijection between simultaneous core partitions and the integer points of a certain polytope. We use this correspondence to prove combinatorial results…

A partial action is associated with a normal weakly left resolving labelled space such that the crossed product and labelled space $C^*$-algebras are isomorphic. An improved characterization of simplicity for labelled space $C^*$-algebras…

Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…

Let $G$ be a nonabelian group. We say that $G$ has an abelian partition, if there exists a partition of $G$ into commuting subsets $A_1, A_2, \ldots, A_n$ of $G$, such that $|A_i|\geqslant 2$ for each $i=1, 2, \ldots, n$. This paper…

Presented are polynomial identities which imply generalizations of Euler and Rogers--Ramanujan identities. Both sides of the identities can be interpreted as generating functions of certain restricted partitions. We prove the identities by…

Euler's classic partition identity states that the number of partitions of $n$ into odd parts equals the number of partitions of $n$ into distinct parts. We develop a new generalization of this identity, which yields a previous…

The distinguishing number $D(G,X)$ of an action of a group $G$ on a set $X$ is the least size of a partition of $X$ such that no element of $G$ acting nontrivially on $X$ preserves this partition. In this paper we describe the…

Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…

We present a new identity involving compositions (i.e. ordered partitions of natural numbers). The Formula has its origin in complex dynamical systems and appears when counting, in the polynomial family $\{f_c:z \mapsto z^d + c \}$,…

The celebrated Rogers-Ramanujan identities equate the number of integer partitions of $n$ ($n\in\mathbb N_0$) with parts congruent to $\pm 1 \pmod{5}$ (respectively $\pm 2 \pmod{5}$) and the number of partitions of $n$ with super-distinct…