Counting descents, rises, and levels, with prescribed first element, in words

Recently, Kitaev and Remmel [Classifying descents according to parity, Annals of Combinatorics, to appear 2007] refined the well-known permutation statistic ``descent'' by fixing parity of one of the descent's numbers. Results in that paper were extended and generalized in several ways. In this paper, we shall fix a set partition of the natural numbers $N$, $(N_1, ..., N_t)$, and we study the distribution of descents, levels, and rises according to whether the first letter of the descent, rise, or level lies in $N_i$ over the set of words over the alphabet $[k]$. In particular, we refine and generalize some of the results in [Counting occurrences of some subword patterns, Discrete Mathematics and Theoretical Computer Science 6 (2003), 001-012.].Comment: 20 pages, sections 3 and 4 are adde

Distributions of several infinite families of mesh patterns

Br\"and\'en and Claesson introduced mesh patterns to provide explicit expansions for certain permutation statistics as linear combinations of (classical) permutation patterns. The first systematic study of avoidance of mesh patterns was conducted by Hilmarsson et al., while the first systematic study of the distribution of mesh patterns was conducted by the first two authors. In this paper, we provide far-reaching generalizations for 8 known distribution results and 5 known avoidance results related to mesh patterns by giving distribution or avoidance formulas for certain infinite families of mesh patterns in terms of distribution or avoidance formulas for smaller patterns. Moreover, as a corollary to a general result, we find the distribution of one more mesh pattern of length 2.Comment: 27 page

Enumerating Segmented Patterns in Compositions and Encoding by Restricted Permutations

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of occurrences of arbitrary segmented partially ordered patterns among compositions of (n) with a prescribed number of parts. These patterns generalize the notions of rises, drops, and levels studied in the literature. We also obtain results enumerating parts with given sizes and locations among compositions and palindromic compositions with a given number of parts. Our results are motivated by "encoding by restricted permutations," a relatively undeveloped method that provides a language for describing many combinatorial objects. We conclude with some examples demonstrating bijections between restricted permutations and other objects.Comment: 12 pages, 1 figur

Fermionic quantum computation

We define a model of quantum computation with local fermionic modes (LFMs) -- sites which can be either empty or occupied by a fermion. With the standard correspondence between the Foch space of $m$ LFMs and the Hilbert space of $m$ qubits, simulation of one fermionic gate takes $O(m)$ qubit gates and vice versa. We show that using different encodings, the simulation cost can be reduced to $O(\log m)$ and a constant, respectively. Nearest-neighbors fermionic gates on a graph of bounded degree can be simulated at a constant cost. A universal set of fermionic gates is found. We also study computation with Majorana fermions which are basically halves of LFMs. Some connection to qubit quantum codes is made.Comment: 18 pages, Latex; one reference adde

Pattern-avoiding alternating words

A word $w=w_1w_2\cdots w_n$ is alternating if either $w_1w_3\cdots$ (when the word is up-down) or $w_1>w_2w_4<\cdots$ (when the word is down-up). In this paper, we initiate the study of (pattern-avoiding) alternating words. We enumerate up-down (equivalently, down-up) words via finding a bijection with order ideals of a certain poset. Further, we show that the number of 123-avoiding up-down words of even length is given by the Narayana numbers, which is also the case, shown by us bijectively, with 132-avoiding up-down words of even length. We also give formulas for enumerating all other cases of avoidance of a permutation pattern of length 3 on alternating words

Avoiding vincular patterns on alternating words

A word $w=w_1w_2\cdots w_n$ is alternating if either $w_1w_3\cdots$ (when the word is up-down) or $w_1>w_2w_4<\cdots$ (when the word is down-up). The study of alternating words avoiding classical permutation patterns was initiated by the authors in~\cite{GKZ}, where, in particular, it was shown that 123-avoiding up-down words of even length are counted by the Narayana numbers. However, not much was understood on the structure of 123-avoiding up-down words. In this paper, we fill in this gap by introducing the notion of a cut-pair that allows us to subdivide the set of words in question into equivalence classes. We provide a combinatorial argument to show that the number of equivalence classes is given by the Catalan numbers, which induces an alternative (combinatorial) proof of the corresponding result in~\cite{GKZ}. Further, we extend the enumerative results in~\cite{GKZ} to the case of alternating words avoiding a vincular pattern of length 3. We show that it is sufficient to enumerate up-down words of even length avoiding the consecutive pattern $\underline{132}$ and up-down words of odd length avoiding the consecutive pattern $\underline{312}$ to answer all of our enumerative questions. The former of the two key cases is enumerated by the Stirling numbers of the second kind.Comment: 25 pages; To appear in Discrete Mathematic

Disordered Topological Insulators via C∗C^*-Algebras

The theory of almost commuting matrices can be used to quantify topological obstructions to the existence of localized Wannier functions with time-reversal symmetry in systems with time-reversal symmetry and strong spin-orbit coupling. We present a numerical procedure that calculates a Z_2 invariant using these techniques, and apply it to a model of HgTe. This numerical procedure allows us to access sizes significantly larger than procedures based on studying twisted boundary conditions. Our numerical results indicate the existence of a metallic phase in the presence of scattering between up and down spin components, while there is a sharp transition when the system decouples into two copies of the quantum Hall effect. In addition to the Z_2 invariant calculation in the case when up and down components are coupled, we also present a simple method of evaluating the integer invariant in the quantum Hall case where they are decoupled.Comment: Added detail regarding the mapping of almost commuting unitary matrices to almost commuting Hermitian matrices that form an approximate representation of the sphere. 6 pages, 6 figure

Topological phases of fermions in one dimension

In this paper we show how the classification of topological phases in insulators and superconductors is changed by interactions, in the case of 1D systems. We focus on the TR-invariant Majorana chain (BDI symmetry class). While the band classification yields an integer topological index $k$, it is known that phases characterized by values of $k$ in the same equivalence class modulo 8 can be adiabatically transformed one to another by adding suitable interaction terms. Here we show that the eight equivalence classes are distinct and exhaustive, and provide a physical interpretation for the interacting invariant modulo 8. The different phases realize different Altland-Zirnbauer classes of the reduced density matrix for an entanglement bipartition into two half-chains. We generalize these results to the classification of all one dimensional gapped phases of fermionic systems with possible anti-unitary symmetries, utilizing the algebraic framework of central extensions. We use matrix product state methods to prove our results.Comment: 14 pages, 3 figures, v2: references adde