Bijections on two variations of noncrossing partitions

We find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin paths, UH-free Schröder paths and Schröder paths without peaks at even height. We also give a direct bijection between 2-distant noncrossing partitions and 12312-avoiding partitions.     

2-Binary trees: Bijections and related issues

A 2-binary tree is a binary rooted tree whose root is colored black and the other vertices are either black or white. We present several bijections concerning different types of 2-binary trees as well as other combinatorial structures such as ternary trees, non-crossing trees, Schröder paths, Motzkin paths and Dyck paths. We also obtain a number of enumeration results with respect to certain statistics.     

Laurent biorthogonal polynomials, q-Narayana polynomials and domino tilings of the Aztec diamonds

A Toeplitz determinant whose entries are described by a q-analogue of the Narayana polynomials is evaluated by means of Laurent biorthogonal polynomials which allow of a combinatorial interpretation in terms of Schröder paths. As an application, a new proof is given to the Aztec diamond theorem by Elkies, Kuperberg, Larsen and Propp concerning domino tilings of the Aztec diamonds. The proof is based on the correspondence with non-intersecting Schröder paths developed by Johansson.     

Some combinatorial interpretations ofq-analogs of Schröder numbers

We introduce two definitions of Schröder numberq-analogs and show some combinatorial interpretations of theseq-numbers. We use the following combinatorial objects for these interpretations: Schröder paths, 1-colored parallelogram polyominoes and permutations with forbidden subsequences (4231, 4132). We enumerate these objects according to various parameters by means of a recentq-counting technique. We prove that the firstq-Schröder number enumerates of Schröder paths with respect to area and the number of permutation inversions, while the second one counts the 1-colored parallelogram polyominoes according to their width and area. Finally, we illustrate some relations among the parameters characterizing the combinatorial objects.     

The butterfly decomposition of plane trees

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition, which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one correspondence between doubly rooted plane trees and free Dyck paths, which implies a simple derivation of a relation between the Catalan numbers and the central binomial coefficients. We also establish a one-to-one correspondence between leaf-colored doubly rooted plane trees and free Schröder paths. The classical Chung-Feller theorem as well as some generalizations and variations follow quickly from the butterfly decomposition. We next obtain two involutions on free Dyck paths and free Schröder paths, leading to parity results and combinatorial identities. We also use the butterfly decomposition to give a combinatorial treatment of Klazar's generating function for the number of chains in plane trees. Finally we study the total size of chains in plane trees with n edges and show that the average size of such chains tends asymptotically to (n+9)/6.     

Lattice paths and generalized cluster complexes

In this paper we propose a variant of the generalized Schröder paths and generalized Delannoy paths by giving a restriction on the positions of certain steps. This generalization turns out to be reasonable, as attested by the connection with the faces of generalized cluster complexes of types A and B. As a result, we derive Krattenthaler's F-triangles for these two types by a combinatorial approach in terms of lattice paths.     

Limits of areas under lattice paths

We consider sequences of polynomials which count lattice paths by area. In some cases the reversed polynomials approach a formal power series as the length of the paths tend to infinity. We find the limiting series for generalized Schröder, Motzkin, and Catalan paths. The limiting series for Schröder paths and their generalizations are shown to count partitions with restrictions on the multiplicities of odd parts and no restrictions on even parts. The limiting series for generalized Motzkin and Catalan paths are shown to count generalized Frobenius partitions and some related arrays.     

On the combinatorics of the Pfaff identity

Recently, there has been a revival of interest in the Pfaff identity on hypergeometric series because of the specialization of Simons and a generalization of Munarini. We present combinatorial settings and interpretations of the specialization and the generalization; one is based on free Dyck paths and free Schröder paths, and the other relies on a correspondence of Foata and Labelle between the Meixner endofunctions and bicolored permutations, and an extension of the technique developed by Labelle and Yeh for the Pfaff identity. Applying the involution on weighted Schröder paths, we derive a formula for the Narayana numbers as an alternating sum of the Catalan numbers.     

Restricted signed permutations counted by the Schröder numbers

Gire, West, and Kremer have found ten classes of restricted permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. In this paper we enumerate eleven classes of restricted signed permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. We obtain five of these enumerations by elementary methods, five by displaying isomorphisms with the classical Schröder generating tree, and one by giving an isomorphism with a new Schröder generating tree. When combined with a result of Egge and a computer search, this completes the classification of restricted signed permutations counted by the large Schröder numbers in which the set of restrictions consists of two patterns of length 2 and two of length 3.     

Riordan paths and derangements

Riordan paths are Motzkin paths without horizontal steps on the x-axis. We establish a correspondence between Riordan paths and -avoiding derangements. We also present a combinatorial proof of a recurrence relation for the Riordan numbers in the spirit of the Foata-Zeilberger proof of a recurrence relation on the Schröder numbers.     

Symmetric Schröder paths and restricted involutions

Let A_k be the set of permutations in the symmetric group S_k with prefix 12. This paper concerns the enumeration of involutions which avoid the set of patterns A_k. We present a bijection between symmetric Schröder paths of length 2n and involutions of length n+1 avoiding A₄. Statistics such as the number of right-to-left maxima and fixed points of the involution correspond to the number of steps in the symmetric Schröder path of a particular type. For each k≥3 we determine the generating function for the number of involutions avoiding the subsequences in A_k, according to length, first entry and number of fixed points.     

A bijection between ordered trees and 2-Motzkin paths and its many consequences

A new bijection between ordered trees and 2-Motzkin paths is presented, together with its numerous consequences regarding ordered trees as well as other combinatorial structures such as Dyck paths, bushes, {0,1,2}-trees, Schröder paths, RNA secondary structures, noncrossing partitions, Fine paths, and Davenport-Schinzel sequences.RésuméUne nouvelle bijection entre arbres ordonnés et chemins de Motzkin bicolorés est présentée, avec ses nombreuses conséquences en ce qui concerne les arbres ordonnés ainsi que d'autres structures combinatoires telles que chemins de Dyck, buissons, arbres de type {0,1,2}, chemins de Schröder, structures secondaires de type RNA, partitions non croisées, chemins de Fine, et enfin suites de Davenport-Schinzel.     

Bijections on two variations of noncrossing partitions

We find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin paths, UH-free Schröder paths and Schröder paths without peaks at even height.     

Analytic solutions of a second-order nonautonomous iterative functional differential equation

In this paper a second-order nonautonomous iterative functional differential equation is considered. By reducing the equation with the Schröder transformation to another functional differential equation without iteration of the unknown function, we give existence of its local analytic solutions. We first discuss the case that the constant α given in the Schröder transformation does not lie on the unit circle in C and the case that the constant lies on the circle but fulfills the Diophantine condition. Then we further study the case that the constant is a unit root in C but the Diophantine condition is offended. Finally, we investigate analytic solutions of the form of power functions.     

Schrödinger operators and associated hyperbolic pencils

For a large class of Schrödinger operators, we introduce the hyperbolic quadratic pencils by making the coupling constant dependent on the energy in the very special way. For these pencils, many problems of scattering theory are significantly easier to study. Then, we give some applications to the original Schrödinger operators including one-dimensional Schrödinger operators with L²-operator-valued potentials, multidimensional Schrödinger operators with slowly decaying potentials.     

Improved inhomogeneous Strichartz estimates for the Schrödinger equation

We study inhomogeneous Strichartz estimates for the Schrödinger equation for dimension n?3. Using a frequency localization, we obtain some improved range of Strichartz estimates for the solution of inhomogeneous Schrödinger equation except dimension n=3.     

Estimates on Green functions and Schrödinger-type equations for non-symmetric diffusions with measure-valued drifts

In this paper, we establish sharp two-sided estimates for the Green functions of non-symmetric diffusions with measure-valued drifts in bounded Lipschitz domains. As consequences of these estimates, we get a 3G type theorem and a conditional gauge theorem for these diffusions in bounded Lipschitz domains.Informally the Schrödinger-type operators we consider are of the form L+μ⋅∇+ν where L is a uniformly elliptic second order differential operator, μ is a vector-valued signed measure belonging to Kd,1 and ν is a signed measure belonging to Kd,2. In this paper, we establish two-sided estimates for the heat kernels of Schrödinger-type operators in bounded C1,1-domains and a scale invariant boundary Harnack principle for the positive harmonic functions with respect to Schrödinger-type operators in bounded Lipschitz domains.     

Stability estimate for an inverse problem for the magnetic Schrödinger equation from the Dirichlet-to-Neumann map

We consider the problem of stability estimate of the inverse problem of determining the magnetic field entering the magnetic Schrödinger equation in a bounded smooth domain of Rn with input Dirichlet data, from measured Neumann boundary observations. This information is enclosed in the dynamical Dirichlet-to-Neumann map associated to the solutions of the magnetic Schrödinger equation. We prove in dimension n?2 that the knowledge of the Dirichlet-to-Neumann map for the magnetic Schrödinger equation measured on the boundary determines uniquely the magnetic field and we prove a Hölder-type stability in determining the magnetic field induced by the magnetic potential.     

Some set partition statistics in non-crossing partitions and generating functions

In this paper we shall give the generating functions for the enumeration of non-crossing partitions according to some set partition statistics explicitly, which are based on whether a block is singleton or not and is inner or outer. Using weighted Motzkin paths, we find the continued fraction form of the generating functions. There are bijections between non-crossing partitions, Dyck paths and non-nesting partitions, hence we can find applications in the enumeration of Dyck paths and non-nesting partitions. We shall also study the integral representation of the enumerating polynomials for our statistics. As an application of integral representation, we shall give some remarks on the enumeration of inner singletons in non-crossing partitions, which is equivalent to one of udu's at high level in Dyck paths investigated in [Y. Sun, The statistic “number of udu's” in Dyck paths, Discrete Math. 284 (2004) 177-186].     

Spectral properties of a class of reflectionless Schrödinger operators

We prove that one-dimensional reflectionless Schrödinger operators with spectrum a homogeneous set in the sense of Carleson, belonging to the class introduced by Sodin and Yuditskii, have purely absolutely continuous spectra. This class includes all earlier examples of reflectionless almost periodic Schrödinger operators. In addition, we construct examples of reflectionless Schrödinger operators with more general types of spectra, given by the complement of a Denjoy-Widom-type domain in C, which exhibit a singular component.