English
Related papers

Related papers: Quasi-Stirling Permutations on Multisets

200 papers

Let $n\geq 2$ and $\Phi_{n,t,\pi}: M_n({\mathbb C}) \rightarrow M_n({\mathbb C})$ be a linear map defined by $\Phi_{n,t,\pi}(A)=(n-t)\sum_{i=1}^nE_{ii}AE_{ii}+t\sum_{i=1}^nE_{i,\pi(i)}AE_{i,\pi(i)}^\dag-A$, where $0\leq t\leq n$, $E_{ij}$s…

Quantum Physics · Physics 2014-06-20 Xiao-Fei Qi , Jin-Chuan Hou

This paper is devoted to studying difference indices of quasi-prime difference algebraic systems. We define the quasi dimension polynomial of a quasi-prime difference algebraic system. Based on this, we give the definition of the difference…

Commutative Algebra · Mathematics 2016-07-19 Jie Wang

Let $\mathcal{S}_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. A family $\mathcal{F}\subset \mathcal{S}_n$ is called intersecting if for every $\sigma,\pi\in \mathcal{F}$ there exists some $i\in [n]$ such that…

Combinatorics · Mathematics 2026-01-05 Jian Wang , Jimeng Xiao

Let $n$, $s$ and $k$ be positive integers. For distinct $i,j\in\mathbb{Z}_n$, define $||i,j||_n$ to be the distance between $i$ and $j$ when the elements of $\mathbb{Z}_n$ are written in a circle. So \[ ||i,j||_n=\min\{(i-j)\bmod…

Combinatorics · Mathematics 2023-06-07 Simon R. Blackburn , Tuvi Etzion

Generalizing a result in the theory of finite fields we prove that, apart from a couple of exceptions that can be classified, for any elements $a_1,...,a_m$ of the cyclic group of order $m$, there is a permutation $\pi$ such that…

Combinatorics · Mathematics 2014-04-22 Zoltán Lóránt Nagy

We show that quasiparticle interference (QPI) due to omnipresent weak impurities and probed by Fourier transform scanning tunneling microscopy and spectroscopy acts as a direct experimental probe of bulk odd-frequency superconducting…

Superconductivity · Physics 2023-01-11 Debmalya Chakraborty , Annica M. Black-Schaffer

Let $V$ be a finite-dimensional vector space over $\mathbb{F}_p$. We say that a multilinear form $\alpha \colon V^k \to \mathbb{F}_p$ in $k$ variables is $d$-approximately symmetric if the partition rank of difference $\alpha(x_1, \dots,…

Combinatorics · Mathematics 2021-12-30 Luka Milićević

The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on strings of symbols. That is, for every permutation $\pi = \pi_{1} \pi_{2} ... \pi_{n+1}$ there is a directed edge from the standardization of…

Combinatorics · Mathematics 2014-10-08 Richard Ehrenborg , Sergey Kitaev , Einar Steingrimsson

The notion of partial geodesic was introduced by Jamshidpey et al. in "Sets of medians in the non-geodesic pseudometric space of unsigned genomes with breakpoints", 2014. In this paper, we study the density of points on non-trivial partial…

Combinatorics · Mathematics 2018-01-16 Poly H. da Silva , Arash Jamshidpey , David Sankoff

Any permutation statistic $f:\sym\to\CC$ may be represented uniquely as a, possibly infinite, linear combination of (classical) permutation patterns: $f= \Sigma_\tau\lambda_f(\tau)\tau$. To provide explicit expansions for certain…

Combinatorics · Mathematics 2011-03-08 Petter Brändén , Anders Claesson

A permutation graph is the intersection graph of a set of segments between two parallel lines. In other words, they are defined by a permutation $\pi$ on $n$ elements, such that $u$ and $v$ are adjacent if an only if $u<v$ but…

Data Structures and Algorithms · Computer Science 2024-07-18 Paweł Gawrychowski , Wojciech Janczewski

We prove that the commutator is stable in permutations endowed with the Hamming distance, that is, two permutations that almost commute are near two commuting permutations. Our result extends to $k$-tuples of almost commuting permutations,…

Group Theory · Mathematics 2016-08-08 Goulnara Arzhantseva , Liviu Paunescu

Multi-Species entanglement, defined for a many-particle system as the entanglement between different species of particles, is shown to exist in the thermodynamic limit of the system size going to infinity. This macroscopic entanglement, as…

Quantum Physics · Physics 2011-08-25 V. Subrahmanyam

Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…

Combinatorics · Mathematics 2015-08-18 Sergey Bereg , Alexander E. Holroyd , Lev Nachmanson , Sergey Pupyrev

A permutation $\pi$ over alphabet $\Sigma = {1,2,3,\ldots,n}$, is a sequence where every element $x$ in $\Sigma$ occurs exactly once. $S_n$ is the symmetric group consisting of all permutations of length $n$ defined over $\Sigma$. $I_n$ =…

Data Structures and Algorithms · Computer Science 2020-02-19 Sai Satwik Kuppili , Bhadrachalam Chitturi

We study several aspects of the M\"{o}bius function, $\mu[\sigma,\pi]$, on the poset of permutations under the pattern containment order. First, we consider cases where the lower bound of the poset is indecomposable. We show that…

Combinatorics · Mathematics 2020-12-29 David Marchant

Motivated by the concept of partial words, we introduce an analogous concept of partial permutations. A partial permutation of length n with k holes is a sequence of symbols $\pi = \pi_1\pi_2 ... \pi_n$ in which each of the symbols from the…

Combinatorics · Mathematics 2015-03-17 Anders Claesson , Vit Jelinek , Eva Jelinkova , Sergey Kitaev

In 1974, Carlitz and Scoville introduced the Stirling-Eulerian polynomial $A_n(x,y|\alpha,\beta)$ as the enumerator of permutations by descents, ascents, left-to-right maxima and right-to-left maxima. Recently, Ji considered a refinement of…

Combinatorics · Mathematics 2024-04-16 Yao Dong , Zhicong Lin , Qiongqiong Pan

In the work of Varchenko, Zagier, Thibon, and Reiner, Saliola, Welker, linear algebraic properties of the multiplication map on the group algebra of the group algebra element are studied, which is the sum over all permutations weighted by…

Combinatorics · Mathematics 2011-04-21 Hery Randriamaro

In the first paper in this series we estimated the probability that a random permutation $\pi\in\mathcal{S}_n$ has a fixed set of a given size. In this paper, we elaborate on the same method to estimate the probability that $\pi$ has $m$…

Group Theory · Mathematics 2017-06-12 Sean Eberhard , Kevin Ford , Dimitris Koukoulopoulos