Related papers: Global patterns in signed permutations
We prove that finite groups have the same complex character tables iff the group algebras are twisted forms of each other as Drinfel'd quasi-bialgebras or iff there is non-associative bi-Galois algebra over these groups. The interpretations…
For any branched double covering of compact Riemann surfaces, we consider the associated character varieties that are unitary in the global sense, which we call $\text{GL}_n\rtimes\!<\!\sigma\!>\!~$-character varieties. We restrict the…
Let $G = GL(V)$ for an N-dimensional vector space $V$ over an algebraically closed field k, and $G^{\theta}$ the fixed point subgroup of $G$ under an involution $\theta$ on $G$. In the case where $G^{\theta} = O(V)$, the generalized…
We show that the counting of observables and correlators for a 3-index tensor model are organized by the structure of a family of permutation centralizer algebras. These algebras are shown to be semi-simple and their Wedderburn-Artin…
In this paper, we study the occurrence of patterns in the cycle structures of permutations.
Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…
We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West's notion of shape-Wilf…
Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…
We show that rings of $S$-integers of a global function field $K$ of odd characteristic are first-order universally definable in $K$. This extends work of Koenigsmann and Park who showed the same for $\mathbb{Z}$ in $\mathbb{Q}$ and the…
We extend the notion of Frobenius Betti numbers and F-splitting ratio to large classes of finitely generated modules over rings of prime characteristic, which are not assumed to be local. We also prove that the strong F-regularity of a pair…
We compare the following three families of geometric objects: Schubert varieties in flag manifolds, matrix Schubert varieties, and Borel orbits of 2-nilpotent matrices. The first family is governed by permutations, the second by partial…
The signed permutation modules are a simultaneous generalization of the ordinary permutation modules and the twisted permutation modules of the symmetric group. In a recent paper Dave Benson and Peter Symonds defined a new invariant…
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…
In this paper we study the cokernels of various random integral matrix models, including random symmetric, random skew-symmetric, and random Laplacian matrices. We provide a systematic method to establish universality under very general…
Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, in the form of a continued fraction, for a fourteen-parameter family of such sequences and interpret these in…
In this paper we give a study of the symmetrized divergences $U_s(p,q)=K_s(p||q)+K_s(q||p)$ and $V_s(p,q)=K_s(p||q)K_s(q||p)$, where $K_s$ is the relative divergence of type $s, s\in\mathbb R$. Some basic properties as symmetry,…
After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation. Some recent papers consider specific families of posets and ask how many linear…
Permutation tableaux are combinatorial objects related with permutations and various statistics on them. They appeared in connection with total positivity in Grassmannians, and stationary probabilities in a PASEP model. In particular they…
In this paper we propose a notion of pattern avoidance in binary trees that generalizes the avoidance of contiguous tree patterns studied by Rowland and non-contiguous tree patterns studied by Dairyko, Pudwell, Tyner, and Wynn.…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…