Related papers: Centrosymmetric Permutations and Involutions Avoid…

A permutation of size $n$ can be identified to its diagram in which there is exactly one point per row and column in the grid $[n]^2$. In this paper we consider multidimensional permutations (or $d$-permutations), which are identified to…

Consider a lattice of n sites arranged around a ring, with the $n$ sites occupied by particles of weights $\{1,2,\dots,n\}$; the possible arrangements of particles in sites thus corresponds to the $n!$ permutations in $S_n$. The…

A permutation statistic $\operatorname{st}$ is said to be shuffle-compatible if the distribution of $\operatorname{st}$ over the set of shuffles of two disjoint permutations $\pi$ and $\sigma$ depends only on $\operatorname{st}\pi$,…

Within its traditional range of perversity parameters, intersection cohomology is a topological invariant of pseudomanifolds. This is no longer true once one allows superperversities, in which case intersection cohomology may depend on the…

Classical pattern avoidance and occurrence are well studied in the symmetric group $\mathcal{S}_{n}$. In this paper, we provide explicit recurrence relations to the generating functions counting the number of classical pattern occurrence in…

We initiate a systematic investigation of endomorphisms of graph C*-algebras C*(E), extending several known results on endomorphisms of the Cuntz algebras O_n. Most but not all of this study is focused on endomorphisms which permute the…

We study the symmetries of the spectrum of the Feinberg-Zee Random Hopping Matrix. Chandler-Wilde and Davies proved that the spectrum of the Feinberg-Zee Random Hopping Matrix is invariant under taking square roots, which implied that the…

In holographic CFTs satisfying eigenstate thermalization, there is a regime where the operator product expansion can be approximated by a random tensor network. The geometry of the tensor network corresponds to a spatial slice in the…

For a variety of pattern-avoiding classes, we describe the limiting distribution for the number of fixed points for involutions chosen uniformly at random from that class. In particular we consider monotone patterns of arbitrary length as…

Recently, Hong and Li launched a systematic study of length-four pattern avoidance in inversion sequences, and in particular, they conjectured that the number of $0021$-avoiding inversion sequences can be enumerated by the OEIS entry…

A one parameter set of noncommutative complex algebras is given. These may be considered deformation quantisation algebras. The commutative limit of these algebras correspond to the algebra of polynomial functions over a manifold or…

An algebraic description of basic discrete symmetries (space inversion P, time reversal T, charge conjugation C and their combinations PT, CP, CT, CPT) is studied. Discrete subgroups {1,P,T,PT} of orthogonal groups of multidimensional…

Exact supersymmetry can be maintained on nonanticommutative superspace with a twisted coproduct on the supergroup.We show that the usual exchange statistics for the superfields is not compatible with the twisted action of the superpoincare…

While conformal transformations of the plane preserve Laplace's equation, Lorentz-conformal mappings preserve the wave equation. We discover how simple geometric objects, such as quadrilaterals and pairs of crossing curves, are transformed…

Discrete spacetime symmetries of parity P or reflection R, and time-reversal T, act naively as $\mathbb{Z}_2$-involutions in the passive transformation on the spacetime coordinates; but together with a charge conjugation C, the total…

We construct generalized symmetries in two-dimensional symmetric product orbifold CFTs $\text{Sym}^N(\mathcal{T}),$ for a generic seed CFT $\mathcal{T}$. These symmetries are more general than the universal and maximally symmetric ones…

In this paper we study symmetric motion planning algorithms, i.e. such that the motion from one state A to another B, prescribed by the algorithm, is the time reverse of the motion from B to A. We experiment with several different notions…

The $s$-point correlation function of a Gaussian Hermitian random matrix theory, with an external source tuned to generate a multi-critical singularity, provides the intersection numbers of the moduli space for the $p$-th spin curves…

The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…

We prove that any class of permutations defined by avoiding a partially ordered pattern (POP) with height at most two has a regular insertion encoding and thus has a rational generating function. Then, we use Combinatorial Exploration to…