English
Related papers

Related papers: Combinatorial equivalence of separable elements in…

200 papers

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…

Combinatorics · Mathematics 2025-02-14 Yang Li , Zhicong Lin

It is known that, when $n$ is even, the number of permutations of $\{1,2,\dots,n\}$ all of whose cycles have odd length equals the number of those all of whose cycles have even length. Adin, Heged\H{u}s and Roichman recently found a…

Combinatorics · Mathematics 2025-04-08 Sergi Elizalde

This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…

Numerical Analysis · Mathematics 2015-10-06 Jiawang Nie

In the paper we study inverse semigroups $\mathscr{B}(G)$, $\mathscr{B}^+(G)$, $\bar{\mathscr{B}}(G)$ and $\bar{\mathscr{B}}\,^+(G)$ which are generated by partial monotone injective translations of a positive cone of a linearly ordered…

Group Theory · Mathematics 2012-01-04 Oleg Gutik , Dušan Pagon , Kateryna Pavlyk

A finite ranked poset is called a symmetric chain order if it can be written as a disjoint union of rank-symmetric, saturated chains. If $P$ is any symmetric chain order, we prove that $P^n/\mathbb{Z}_n$ is also a symmetric chain order,…

Combinatorics · Mathematics 2012-12-20 Vivek Dhand

Monotone triangles are a rich extension of permutations that biject with alternating sign matrices. The notions of weak order and descent sets for permutations are generalized here to monotone triangles, and shown to enjoy many analogous…

Combinatorics · Mathematics 2019-05-24 Zachary Hamaker , Victor Reiner

Let $G$ be a finite group and $(K,\mathcal{O},k)$ be a $p$-modular system "large enough". Let $R=\mathcal{O}$ or $k$. There is a bijection between the blocks of the group algebra $RG$ and the central primitive idempotents (the blocks) of…

Representation Theory · Mathematics 2014-06-25 Baptiste Rognerud

We develop a more general view of Stembridge's enriched $P$-partitions and use this theory to outline the structure of peak algebras for the symmetric group and the hyperoctahedral group. Initially we focus on commutative peak algebras,…

Combinatorics · Mathematics 2007-05-23 T. Kyle Petersen

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…

Number Theory · Mathematics 2020-06-09 Maxwell Schneider , Robert Schneider

In this work, we generalize the integer enumeration basis. We also construct bijections between the elements of special sets and the elements of some groups, and treat the special case of the hyperoctohedral groups. Then, we find a code…

Number Theory · Mathematics 2014-11-14 F. Patrick Rabarison , Hery Randriamaro

A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $\lambda>0$ be an integer. The partition is said to be a $\lambda$--partition if…

Combinatorics · Mathematics 2017-03-22 F. V. Weinstein

A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…

Logic · Mathematics 2017-11-07 Miloš S. Kurilić , Nenad Morača

Let $(W,S)$ be a Coxeter system of type $A$, so that $W$ can be identified with the symmetric group $\mathrm{Sym}(n)$ for some positive integer $n$ and $S$ with the set of simple transpositions $\{\,(i,i+1)\mid 1\leqslant i\leqslant…

Group Theory · Mathematics 2015-03-05 Van Minh Nguyen

In this paper, we study classes of subexcedant functions enumerated by the Bell numbers and present bijections on set partitions. We present a set of permutations whose transposition arrays are the restricted growth functions, thus defining…

Combinatorics · Mathematics 2022-08-23 Fufa Beyene , Jörgen Backelin , Roberto Mantaci , Samuel A. Fufa

We build a bijection between the set $\sttilt\Lambda$ of isomorphism classes of basic support $\tau$-tilting modules over the Auslander algebra $\Lambda$ of $K[x]/(x^n)$ and the symmetric group $\mathfrak{S}_{n+1}$, which is an…

Representation Theory · Mathematics 2020-08-05 Osamu Iyama , Xiaojin Zhang

Let ${p > 2}$ be an odd prime and ${G = SL_2(\mathbb{F}_p)}$. Denote the subgroup of upper triangular matrices as $B$. Finally, let ${\mathbb{F}}$ be an algebraically closed field of characteristic ${p}$. The Green correspondence gives a…

Representation Theory · Mathematics 2025-05-16 Denver-James Logan Marchment

Characterizing sets of permutations whose associated quasisymmetric function is symmetric and Schur-positive is a long-standing problem in algebraic combinatorics. In this paper we present a general method to construct Schur-positive sets…

Combinatorics · Mathematics 2016-11-01 Sergi Elizalde , Yuval Roichman

In this paper, we prove the existence of a measure-preserving bijection from unit square to unit segment. This bijection is also called the probability isomorphism between two probability spaces. Then we give a new proof of the existence of…

Probability · Mathematics 2016-02-03 Cong Dan Pham

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…

Combinatorics · Mathematics 2016-11-01 Frédérique Bassino , Mathilde Bouvel , Adeline Pierrot , Carine Pivoteau , Dominique Rossin

The Euler number $E_n$ (resp. Entringer number $E_{n,k}$) enumerates the alternating (down-up) permutations of $\{1,\dots,n\}$ (resp. starting with $k$). The Springer number $S_n$ (resp. Arnold number $S_{n,k}$) enumerates the type $B$…

Combinatorics · Mathematics 2022-03-22 Heesung Shin , Jiang Zeng