Related papers: Decomposing Sets of Inversions

An $H$-decomposition of a graph $\Gamma$ is a partition of its edge set into subgraphs isomorphic to $H$. A transitive decomposition is a special kind of $H$-decomposition that is highly symmetrical in the sense that the subgraphs (copies…

In this expository article, we highlight the direct connection between card shuffling and the functions known as $P$-partitions that come from algebraic combinatorics. While many (but not all) of the results we discuss are known, we give a…

The subject of this paper is a simulation to that in [1] but here we consider substitutions corresponding to transpositions instead of replacements.

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

In this note, I discuss in some detail the dual version of the ribbon graph decomposition of the moduli spaces of Riemann surfaces with boundary and marked points, which I introduced in math.AG/0402015, and used in math.QA/0412149 to…

We examine the reduction process of a system of second-order ordinary differential equations which is invariant under a Lie group action. With the aid of connection theory, we explain why the associated vector field decomposes in three…

Let $G(\mathbb{R})$ be a real reductive group. Suppose $\pi$ is an irreducible representation of $G(\mathbb{R})$ having a Whittaker model, and consider three invariants of $\pi$ related to nilpotents elements of the Lie algebra of $G$ (or…

Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…

We express the multigraded Betti numbers of an arbitrary monomial ideal in terms of the multigraded Betti numbers of two basic classes of ideals. This decompo- sition has multiple applications. In some concrete cases, we use it to construct…

Let $g \colon S \looparrowright N$ be a properly immersed $\pi_1$--injective surface in a non-geometric $3$--manifold $N$. We compute the distortion of $\pi_1(S)$ in $\pi_1(N)$ and show that how it is related to separability of $\pi_1(S)$…

In this note we show that pattern matching in permutations is polynomial time reducible to pattern matching in set partitions. In particular, pattern matching in set partitions is NP-Complete.

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…

The aim of this work is to show how we can decompose a module (if decomposable) into an indecomposable module with the help of the minimization process.

We exhibit a connection between two constructions of twisted modules for a general vertex operator algebra with respect to inner automorphisms. We also study pseudo-derivations, pseudo-endomorphisms, and twist deformations of ordinary…

We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…

Let $R$ be an indecomposable root system. It is well known that any root is part of a basis $B$ of $R$. But when can you extend a set of two or more roots to a basis $B$ of $R$? A $\pi$-system is a linearly independent set of roots, $C$,…

We address the problem of finding the minimum decomposition of a permutation in terms of transpositions with non-uniform cost. For arbitrary non-negative cost functions, we describe polynomial-time, constant-approximation decomposition…

We introduce Permutation and Structured Perturbation Inference (PSPI), a new problem formulation that abstracts many graph matching tasks that arise in systems biology. PSPI can be viewed as a robust formulation of the permutation inference…

Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite…