中文
相关论文

相关论文: An equivalence relation on the symmetric group and…

200 篇论文

We consider a large family of equivalence relations on permutations in Sn that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our most general setting, two permutations are equivalent if one…

组合数学 · 数学 2011-11-17 Steven Linton , James Propp , Tom Roby , Julian West

We study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same…

组合数学 · 数学 2017-08-23 William Kuszmaul , Ziling Zhou

Let $n$ be a positive integer, $\sigma$ be an element of the symmetric group $\mathcal{S}_n$ and let $\sigma$ be a cycle of length $n$. The elements $\alpha ,\beta \in \mathcal{S}_n$ are $\sigma$-equivalent, if there are natural numbers $k$…

组合数学 · 数学 2014-10-31 Krasimir Yordzhev

We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…

组合数学 · 数学 2025-10-15 Yong Liao , Yuping Yang , Houyi Yu

A permutation on an alphabet $ \Sigma $, is a sequence where every element in $ \Sigma $ occurs precisely once. Given a permutation $ \pi $= ($\pi_{1} $, $ \pi_{2} $, $ \pi_{3} $,....., $ \pi_{n} $) over the alphabet $ \Sigma $ =$\{ $0, 1,…

离散数学 · 计算机科学 2016-01-19 Bhadrachalam Chitturi , Krishnaveni K S

In this paper, we consider the family of pattern-replacement equivalence relations referred to as the "indices and values adjacent" case. Each such equivalence is determined by a partition $P$ of a subset of $S_c$ for some $c$. In 2010,…

组合数学 · 数学 2014-03-04 William Kuszmaul

Motivated by classification, up to order isomorphism, of some dense subgroups of Euclidean space that are free of minimal rank, we obtain apparently new invariants for an equivalence relation (intermediate between Hermite and Smith) on…

交换代数 · 数学 2017-03-14 David Handelman

Given k sets such that no one is contained in another, there is an associated lattice on the power set P([k]) corresponding to inclusion relations among unions of the sets. Two lattices on P([k]) are equivalent if there is a permutation of…

组合数学 · 数学 2013-12-11 Donald M. Davis

Let $N$ be a positive integer. For any positive integer $L\leq N$ and any positive divisor $r$ of $N$, we enumerate the equivalence classes of dessins d'enfants with $N$ edges, $L$ faces and two vertices whose automorphism groups are cyclic…

数论 · 数学 2022-09-19 Madoka Horie

We study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same…

组合数学 · 数学 2014-03-04 William Kuszmaul

Using the standard Coxeter presentation for the symmetric group $S_n$, two reduced expressions for the same group element are said to be commutation equivalent if we can obtain one expression from the other by applying a finite sequence of…

历史与综述 · 数学 2024-02-12 Hugh Denoncourt , Dana C. Ernst , Dustin Story

For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…

几何拓扑 · 数学 2017-05-11 Jun Ge , Slavik Jablan , Louis H. Kauffman , Pedro Lopes

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…

组合数学 · 数学 2011-01-26 Matthew J. Samuel

Given a permutation pattern p and an equivalence relation on permutations, we study the corresponding equivalence classes all of whose members avoid p. Four relations are studied: Conjugacy, order isomorphism, Knuth-equivalence and toric…

组合数学 · 数学 2010-06-01 Henning Ulfarsson

In the building of a finite group of Lie type we consider the incidence relations defined by oppositeness of flags. Such a relation gives rise to a homomorphism of permutation modules (in the defining characteristic) whose image is a simple…

群论 · 数学 2020-01-30 Peter Sin

A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position. Two geometric realizations of a simple graph are geo-isomorphic if there is a vertex bijection between them…

组合数学 · 数学 2024-06-13 Sally Cockburn , Yonghyun Song

We consider a class of homogeneous self-similar sets with complete overlaps and give a sufficient condition for the Lipschitz equivalence between members in this class.

动力系统 · 数学 2016-12-13 Xiu Chen , Kan Jiang , Wenxia Li

In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…

环与代数 · 数学 2013-09-26 A. Tsurkov

We construct the complete invariant for fused links. It is proved that the set of equivalence classes of $n$-component fused links is in one-to-one correspondence with the set of elements of the abelization $UVP_n/UVP_n^{\prime}$ up to…

几何拓扑 · 数学 2016-01-01 Timur Nasybullov

Let $G$ be a finite group. For all $a \in \Z$, such that $(a,|G|)=1$, the function $\rho_a: G \to G$ sending $g$ to $g^a$ defines a permutation of the elements of $G$. Motivated by a recent generalization of Zolotarev's proof of classic…

群论 · 数学 2013-11-14 Márton Hablicsek , Guillermo Mantilla-Soler
‹ 上一页 1 2 3 10 下一页 ›