English
Related papers

Related papers: Centrosymmetric Permutations and Involutions Avoid…

200 papers

We study fixed point biased involutions that avoid a pattern. For every pattern of length three we obtain limit theorems for the asymptotic distribution of the (appropriately centered and scaled) number of fixed points of a random fixed…

Probability · Mathematics 2026-01-01 Jungeun Park , Douglas Rizzolo

In this paper we study the noncommutative supersymmetric $CP^{(N-1)}$ model in 2+1 dimensions, where the basic field is in the fundamental representation which, differently to the adjoint representation already studied in the literature,…

High Energy Physics - Theory · Physics 2008-11-26 A. F. Ferrari , A. C. Lehum , A. J. da Silva , F. Teixeira

Let $L$ be a Lie algebra over a field of characteristic different from $2$. If $L$ is perfect and centerless, then every skew-symmetric biderivation $\delta:L\times L\to L$ is of the form $\delta(x,y)=\gamma([x,y])$ for all $x,y\in L$,…

Rings and Algebras · Mathematics 2019-08-08 Matej Brešar , Kaiming Zhao

Let $G$ be a group with involution * and $\sigma\colon G\to\{\pm1\}$ a group homomorphism. The map $\sharp$ that sends $\alpha=\sum\alpha_gg$ in a group ring $RG$ to $\alpha^{\sharp}=\sum\sigma(g)\alpha_gg^*$ is an involution of $RG$ called…

Group Theory · Mathematics 2011-08-24 Edgar G. Goodaire , Cesar Polcino Milies

In the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count permutations avoiding certain patterns according to their…

Combinatorics · Mathematics 2007-05-23 A. Bernini , m. Bouvel , L. Ferrari

In this paper, we study pattern avoidances of generalized permutations and show that the number of all generalized permutations avoiding $\pi$ is independent of the choice of $\pi\in S_3$, which extends the classic results on permutations…

Combinatorics · Mathematics 2018-05-15 Zhousheng Mei , Suijie Wang

We study certain linear and antilinear symmetry generators and involution operators associated with pseudo-Hermitian Hamiltonians and show that the theory of pseudo-Hermitian operators provides a simple explanation for the recent results of…

Mathematical Physics · Physics 2009-11-07 Ali Mostafazadeh

The number of even 321-avoiding permutations of length n is equal to the number of odd ones if n is even, and exceeds it by the (n-1)/2th Catalan number otherwise. We present an involution that proves a refinement of this sign-balance…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste

The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of a linear permutation. Callan initiated the study of…

A permutation graph is a cubic graph admitting a 1-factor M whose complement consists of two chordless cycles. Extending results of Ellingham and of Goldwasser and Zhang, we prove that if e is an edge of M such that every 4-cycle containing…

Combinatorics · Mathematics 2012-04-11 Tomáš Kaiser , Jean-Sébastien Sereni , Zelealem Yilma

We consider asymptotics of set partition pattern avoidance in the sense of Klazar. Our main result derives the asymptotics of the number of set partitions avoiding a given set partition within an exponential factor, which leads to a…

Combinatorics · Mathematics 2017-07-26 Benjamin Gunby , Dömötör Pálvölgyi

Two classical sources of imprecision in static analysis by abstract interpretation are widening and merge operations. Merge operations can be done away by distinguishing paths, as in trace partitioning, at the expense of enumerating an…

Programming Languages · Computer Science 2011-06-15 David Monniaux , Laure Gonnord

A crucial permutation is a permutation that avoids a given set of prohibitions, but any of its extensions, in an allowable way, results in a prohibition being introduced. In this paper, we introduce five natural types of crucial…

Combinatorics · Mathematics 2022-06-28 Sergey Avgustinovich , Sergey Kitaev , Anna Taranenko

We consider the two permutation statistics which count the distinct pairs obtained from the last two terms of occurrences of patterns t_1...t_{m-2}m(m-1) and t_1...t_{m-2}(m-1)m in a permutation, respectively. By a simple involution in…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste

In this paper, we investigate pattern avoidance of parity restricted (even or odd) Grassmannian permutations for patterns of sizes 3 and 4. We use a combination of direct counting and bijective techniques to provide recurrence relations,…

Combinatorics · Mathematics 2023-10-24 Juan B. Gil , Jessica A. Tomasko

The systems without symmetries, e.g. the spatial and chiral symmetries, are generally thought to be improper for topological study and no conventional integral topological invariant can be well defined. In this work, with multi-band…

Mesoscale and Nanoscale Physics · Physics 2024-09-16 Yunlin Li , Jingguang Chen , Xingchao Qi , Langlang Xiong , Xianjun Wang , Yufu Liu , Fang Guan , Lei Shi , Xunya Jiang

In 2005 J.L. Waldspurger proved the following theorem: given a finite real reflection group $W$, the closed positive root cone is tiled by the images of the open weight cone under the action of the linear transformations $id-w$. Shortly…

Combinatorics · Mathematics 2017-09-05 James McKeown

A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general…

Numerical Analysis · Mathematics 2026-04-02 Jeffrey Uhlmann

There exist two deformations of standard electrodynamics that describe Lorentz symmetry violation in the photon sector: CPT-odd Maxwell-Chern-Simons theory and CPT-even modified Maxwell theory. In this article, we focus on the parity-odd…

High Energy Physics - Theory · Physics 2015-03-19 Marco Schreck

Let $\sigma$ and $\tau$ be patterns of length three; that is $\sigma, \tau \in \{123,132,213,231,312,321\}$. In this paper, we enumerate the set of cyclic permutations in $\mathcal{S}_n$ that avoid $\sigma$ in their one-line notation and…

Combinatorics · Mathematics 2024-09-04 Kassie Archer , Ethan Borsh , Jensen Bridges , Christina Graves , Millie Jeske