English
Related papers

Related papers: Conjugation of injections by permutations

200 papers

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…

Number Theory · Mathematics 2024-02-06 Mohan , Bhuwanesh Rao Patil , Ram Krishna Pandey

We present a bijection between cyclic permutations of {1,2,...,n+1} and permutations of {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. This non-trivial bijection involves a Foata-like…

Combinatorics · Mathematics 2012-02-02 Sergi Elizalde

Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…

Discrete Mathematics · Computer Science 2011-08-19 Steven Widmer

An involution of a real commutative algebra $A$ is a real-linear homomorphism $f : A \rightarrow A$ such that $f^2 = \mathrm{Id}$. We show that there are six involutions of the algebra of bicomplex numbers, contrary to the actual number of…

Rings and Algebras · Mathematics 2022-08-04 Pierre-Olivier Parisé

We determine a set of permutation patterns $q$ so that the number of permutations with $r$ occurrences of $q$ is asymptotically $n^r$ times the number of permutations avoiding $q$, partially settling a conjecture of Conway and Guttman. We…

Combinatorics · Mathematics 2026-03-24 Michael Waite

This article studies the poset of simple permutations with respect to the pattern involvement. We specify results on critically indecomposable posets obtained by Schmerl and Trotter to simple permutations and prove that if $\sigma, \pi$ are…

Discrete Mathematics · Computer Science 2012-01-17 Pierrot Adeline , Rossin Dominique

We enumerate bijectively the family of involutive Baxter permutations according to various parameters; in particular we obtain an elementary proof that the number of involutive Baxter permutations of size $2n$ with no fixed points is…

Combinatorics · Mathematics 2011-10-31 Eric Fusy

In this paper we give an affirmative answer to a conjecture proposed by Danny Neftin, that is, if the commutator of two permutations has at least n-4 fixed points where two permutations are in degree n symmetric group, then there exists a…

Group Theory · Mathematics 2021-06-17 Junyao Pan

In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in [Knuth] in connection to sorting algorithms. A natural generalization of this set leads us…

Combinatorics · Mathematics 2007-10-29 Sergi Elizalde

We prove that for any fixed unitary matrix $U$, any abelian self-adjoint algebra of matrices that is invariant under conjugation by $U$ can be embedded into a maximal abelian self-adjoint algebra that is still invariant under conjugation by…

Rings and Algebras · Mathematics 2024-02-01 Mitja Mastnak , Heydar Radjavi

Let $A$ and $B$ be commutative algebras and $n\geqslant 2$ an integer. Then each $n-$ Jordan homomorphism $h:A\rightarrow B$ is an $n-$homomorphism.

Rings and Algebras · Mathematics 2022-03-21 M. El Azhari

Baxter numbers are known to count several families of combinatorial objects, all of which come equipped with natural involutions. In this paper, we add a combinatorial family to the list, and show that the known bijections between these…

Combinatorics · Mathematics 2014-02-13 Kevin Dilks

We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.

Combinatorics · Mathematics 2007-05-23 Miklós Bóna , Daniel A. Spielman

Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…

Combinatorics · Mathematics 2011-03-01 Steven Widmer

If there exists a completely bounded projection of B(H) onto a von Neumann algebra M on H, then M is injective. If there exists a bounded projection and M is properly infinite, the same conclusion holds.

funct-an · Mathematics 2008-02-03 Erik Christensen , Allan M. Sinclair

We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating…

Combinatorics · Mathematics 2025-10-29 Michael Waite

An involution is usually defined as a mapping that is its own inverse. In this paper, we study quaternion involutions that have the additional properties of distribution over addition and multiplication. We review formal axioms for such…

Rings and Algebras · Mathematics 2007-06-13 Todd A. Ell , Stephen J. Sangwine

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

Combinatorics · Mathematics 2023-06-28 Anitha G , P Vanchinathan

Let $\mathcal A$ be a unital algebra equipped with an involution $(\cdot)^\dagger$, and suppose that the multiplicative set $\mathcal S\subseteq \mathcal A$ generated by the elements of the form $1 + a^\dagger a$ satisfies the Ore…

Operator Algebras · Mathematics 2011-04-14 Rodrigo Vargas Le-Bert

Define a permutation $\sigma$ to be coprime if $\gcd(m,\sigma(m)) = 1$ for $m\in[n]$. In this note, proving a recent conjecture of Pomerance, we prove that the number of coprime permutations on $[n]$ is $n!\cdot (c+o(1))^n$ where \[c =…

Number Theory · Mathematics 2022-03-30 Ashwin Sah , Mehtaab Sawhney