Related papers: Decomposing Sets of Inversions
In this paper we consider a transformation $L_a$ of sequences of complex numbers. We find the inverse transformation of $L_a$ as well as the inverse of a related transformation $\tilde{L}_a$. We explore a connection to the binomial…
The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of…
In this note, we consider the problem of finding a step-by-step transformation between two longest increasing subsequences in a sequence, namely Longest Increasing Subsequence Reconfiguration. We give a polynomial-time algorithm for…
A consecutive pattern in a permutation $\pi$ is another permutation $\sigma$ determined by the relative order of a subsequence of contiguous entries of $\pi$. Traditional notions such as descents, runs and peaks can be viewed as particular…
We argue that the existing knowledge about modular decomposition of graphs and clan decomposition of 2-structures can be put to use advantageously in a context of data analysis. We show how to obtain visual descriptions of co-occurrence…
We consider principal pivot transform (pivot) on graphs. We define a natural variant of this operation, called dual pivot, and show that both the kernel and the set of maximally applicable pivots of a graph are invariant under this…
The descent set D(w) of a permutation w of 1,2,...,n is a standard and well-studied statistic. We introduce a new statistic, the connectivity set C(w), and show that it is a kind of dual object to D(w). The duality is stated in terms of the…
Consider a unital C*-algebra A, a von Neumann algebra M, a unital sub-C*-algebra C of A and a unital *-homomorphism $\pi$ from C to M. Let u: A --> M be a decomposable map (i.e. a linear combination of completely positive maps) which is a…
For an integer $m \geq 2$, let $\mathcal{P}_m$ be the partition of the unit interval $I$ into $m$ equal subintervals, and let $\mathcal{F}_m$ be the class of piecewise linear maps on $I$ with constant slope $\pm m$ on each element of…
We give an operadic interpretation of the known result of L.Shapiro and A.B.Stephens that characterizes percolating permutation matrices. A relation of ideals and suboperads of the non-symmetric operad of permutations to percolative…
There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…
Centrosymmetric involutions in the symmetric group S_{2n} are permutations \pi such that \pi=\pi^{-1} and \pi(i)+\pi(2n+1-i)=2n+1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the…
The set of all subsets of any inverse semigroup forms an involution semiring under set-theoretical union and element-wise multiplication and inversion. We find structural conditions on a finite inverse semigroup guaranteeing that neither…
Let $S=\{K_{1,3},K_3,P_4\}$ be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph $G$ into graphs taken from any non-empty $S'\subseteq S$. The problem is known to be NP-complete for any…
We introduce the notion of the descent set polynomial as an alternative way of encoding the sizes of descent classes of permutations. Descent set polynomials exhibit interesting factorization patterns. We explore the question of when…
Given a graph $G$, a subgraph $H$ is isometric if $d_H(u,v) = d_G(u,v)$ for every pair $u,v\in V(H)$, where $d$ is the distance function. A graph $G$ is distance preserving (dp) if it has an isometric subgraph of every possible order. A…
The main result of this paper is a recursive description of all decompositions \[ \Delta^+ = \Phi_1 \sqcup \Phi_2 \sqcup \dots \sqcup \Phi_k \] of the positive roots $\Delta^+$ of an arbitrary root system $\Delta$ into a disjoint union of…
We start with a given modular invariant M of a two dimensional su(n)_k conformal field theory (CFT) and present a general method for solving the Ocneanu modular splitting equation and then determine, in a step-by-step explicit construction,…
We consider chaining multiplicative-inverse operations in finite fields under alternating polynomial bases. When using two distinct polynomial bases to alternate the inverse operation we obtain a partition of $\mathbb F_{p^n}\setminus…
Various algorithms have been proposed to enumerate all connected induced subgraphs of a graph $G=(V,E)$. As a variation we enumerate all "packings of connected sets", i.e. partitions $\Pi$ of $V$ with the property that each part of $\Pi$…