A bijective proof of the hook-length formula for skew shapes

Recently, Naruse presented a beautiful cancellation-free hook-length formula for skew shapes. The formula involves a sum over objects called excited diagrams, and the term corresponding to each excited diagram has hook lengths in the denominator, like the classical hook-length formula due to Frame, Robinson and Thrall. In this paper, we present a simple bijection that proves an equivalent recursive version of Naruse’s result, in the same way that the celebrated hook-walk proof due to Greene, Nijenhuis and Wilf gives a bijective (or probabilistic) proof of the hook-length formula for ordinary shapes.In particular, we also give a new bijective proof of the classical hook-length formula, quite different from the known proofs.     

A Symmetry Theorem on a Modified Jeu De Taquin

For their bijective proof of the hook-length formula for the number of standard tableaux of a fixed shape Novelli et al. define a modified jeu de taquin which transforms an arbitrary filling of the Ferrers diagram with 1, 2, , n(tabloid) into a standard tableau. Their definition relies on a total order of the cells in the Ferrers diagram induced by a special standard tableau, however, this definition also makes sense for the total order induced by any other standard tableau. Given two standard tableaux P, Q of the same shape we show that the number of tabloids which result in P if we perform the modified jeu de taquin with respect to the total order induced by Q is equal to the number of tabloids which result in Q if we perform the modified jeu de taquin with respect to P. This symmetry theorem extends to skew shapes and shifted skew shapes.     

Skew domino Schensted correspondence and sign-imbalance

Using growth diagrams, we define a skew domino Schensted correspondence which is a domino analogue of the skew Robinson–Schensted correspondence due to Sagan and Stanley. The color-to-spin property of Shimozono and White is extended. As an application, we give a simple generating function for the weighted sum of skew domino tableaux, which is a generalization of Stanley’s sign-imbalance formula. The generating function gives a method to calculate the generalized sign-imbalance formula. We also extend Sjöstrand’s theorems on sign-imbalance of skew shapes.     

Staircase skew Schur functions are Schur P-positive

We prove Stanley??s conjecture that, if ?? _n is the staircase shape, then the skew Schur functions $s_{\delta_{n} / \mu}$ are non-negative sums of Schur P-functions. We prove that the coefficients in this sum count certain fillings of shifted shapes. In particular, for the skew Schur function $s_{\delta_{n} / \delta _{n-2}}$ , we discuss connections with Eulerian numbers and alternating permutations.     

Multiplicity Free Schur, Skew Schur, and Quasisymmetric Schur Functions

In this paper we classify all Schur functions and skew Schur functions that are multiplicity free when expanded in the basis of fundamental quasisymmetric functions, termed F-multiplicity free. Combinatorially, this is equivalent to classifying all skew shapes whose standard Young tableaux have distinct descent sets. We then generalize our setting, and classify all F-multiplicity free quasisymmetric Schur functions with one or two terms in the expansion, or one or two parts in the indexing composition. This identifies composition shapes such that all standard composition tableaux of that shape have distinct descent sets. We conclude by providing such a classification for quasisymmetric Schur function families, giving a classification of Schur functions that are in some sense almost F-multiplicity free.     

On some properties of symplectic Grothendieck polynomials

Grothendieck polynomials, introduced by Lascoux and Schützenberger, are certain K-theory representatives for Schubert varieties. Symplectic Grothendieck polynomials, described more recently by Wyser and Yong, represent the K-theory classes of orbit closures for the complex symplectic group acting on the complete flag variety. We prove a transition formula for symplectic Grothendieck polynomials and study their stable limits. We show that each of the K-theoretic Schur P-functions of Ikeda and Naruse arises from a limiting procedure applied to symplectic Grothendieck polynomials representing certain “Grassmannian” orbit closures.     

Dimensions of skew-shifted young diagrams and projective characters of the infinite symmetric group

We study a factorial of Schur's P-functions. In terms of these functions, we obtain an explicit formula for the dimension of a skew shifted Young diagram. The main application of this formula is a new derivation of the Nazarov's classification of indecomposable projective characters of an infinite symmetric group.Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 240, 1997, pp. 115–135.Supported by the Soros International Educational Program, grant 2093c.     

The skew energy of a digraph

We are interested in the energy of the skew-adjacency matrix of a directed graph D, which is simply called the skew energy of D in this paper. Properties of the skew energy of D are studied. In particular, a sharp upper bound for the skew energy of D is derived in terms of the order of D and the maximum degree of its underlying undirected graph. An infinite family of digraphs attaining the maximum skew energy is constructed. Moreover, the skew energy of a directed tree is independent of its orientation, and interestingly it is equal to the energy of the underlying undirected tree. Skew energies of directed cycles under different orientations are also computed. Some open problems are presented.     

Efficient Chebyshev spectral methods for solving multi-term fractional orders differential equations

In this paper, we state and prove a new formula expressing explicitly the derivatives of shifted Chebyshev polynomials of any degree and for any fractional-order in terms of shifted Chebyshev polynomials themselves. We develop also a direct solution technique for solving the linear multi-order fractional differential equations (FDEs) with constant coefficients using a spectral tau method. The spatial approximation with its fractional-order derivatives (described in the Caputo sense) are based on shifted Chebyshev polynomials T_L,n(x) with x ∈ (0, L), L > 0 and n is the polynomial degree. We presented a shifted Chebyshev collocation method with shifted Chebyshev–Gauss points used as collocation nodes for solving nonlinear multi-order fractional initial value problems. Several numerical examples are considered aiming to demonstrate the validity and applicability of the proposed techniques and to compare with the existing results.     

An iterative algorithm for the least Frobenius norm Hermitian and generalized skew Hamiltonian solutions of the generalized coupled Sylvester-conjugate matrix equations

The iterative method of the generalized coupled Sylvester-conjugate matrix equations \(\sum\limits _{j=1}^{l}\left (A_{ij}X_{j}B_{ij}+C_{ij}\overline {X}_{j}D_{ij}\right )=E_{i} (i=1,2,\cdots ,s)\) over Hermitian and generalized skew Hamiltonian solution is presented. When these systems of matrix equations are consistent, for arbitrary initial Hermitian and generalized skew Hamiltonian matrices X _j (1), j = 1,2,? , l, the exact solutions can be obtained by iterative algorithm within finite iterative steps in the absence of round-off errors. Furthermore, we provide a method for choosing the initial matrices to obtain the least Frobenius norm Hermitian and generalized skew Hamiltonian solution of the problem. Finally, numerical examples are presented to demonstrate the proposed algorithm is efficient.     

A Unifying Approach for Proving Hook-Length Formulas for Weighted Tree Families

We propose an expansion technique for weighted tree families, which unifies and extends recent results on hook-length formulas of trees obtained by Han [10], Chen et al. [3], and Yang [19]. Moreover, the approach presented is used to derive new hook-length formulas for tree families, where several hook-functions in the corresponding expansion formulas occur in a natural way. Furthermore we consider families of increasingly labelled trees and show close relations between hook-length formulas for such tree families and corresponding ones for weighted tree families.     

Schur positivity and log-concavity related to longest increasing subsequences

Chen proposed a conjecture on the log-concavity of the generating function for the symmetric group with respect to the length of longest increasing subsequences of permutations. Motivated by Chen’s log-concavity conjecture, Bóna, Lackner and Sagan further studied similar problems by restricting the whole symmetric group to certain of its subsets. They obtained the log-concavity of the corresponding generating functions for these subsets by using the hook-length formula. In this paper, we generalize and prove their results by establishing the Schur positivity of certain symmetric functions. This also enables us to propose a new approach to Chen’s original conjecture.     

On a shifted LR transformation derived from the discrete hungry Toda equation

The discrete hungry Toda (dhToda) equation is known as an integrable system which is derived from the study of the numbered box and ball system. In the authors’ paper (Fukuda et al., in Phys Lett A 375, 303–308, 2010), we associate the dhToda equation with a sequence of LR transformations for a totally nonnegative (TN) matrix, and then, in another paper (Fukuda et al. in Annal Math Pura Appl, 2011), based on the dhToda equation, we design an algorithm for computing the eigenvalues of the TN matrix. In this paper, in order to accelerate the convergence speed, we first introduce the shift of origin into the LR transformations associated with the dhToda equation, then derive a recursion formula for generating the shifted LR transformations.We next present a shift strategy for avoiding the breakdown of the shifted LR transformations. We finally clarify the asymptotic convergence and show that the sequence of TN matrices generated by the shifted LR transformations converges to a lower triangular matrix, exposing the eigenvalues of the original TN matrix. The asymptotic convergence is also verified through some numerical examples.     

Extended Bressoud-Wei and Koike skew Schur function identities

The Jacobi-Trudi identity expresses a skew Schur function as a determinant of complete symmetric functions. Bressoud and Wei extend this idea, introducing an integer parameter t?−1 and showing that signed sums of skew Schur functions of a certain shape are expressible once again as a determinant of complete symmetric functions. Koike provides a Jacobi-Trudi-style definition of universal rational characters of the general linear group and gives their expansion as a signed sum of products of Schur functions in two distinct sets of variables. Here we extend Bressoud and Wei's formula by including an additional parameter and extending the result to the case of all integer t. Then we introduce this parameter idea to the Koike formula, extending it in the same way. We prove our results algebraically using Laplace determinantal expansions.     

Detecting Curves of Symmetry in Images Via Hough Transform

The Hough transform is a standard pattern recognition technique introduced between the 1960s and the 1970s for the detection of straight lines, circles, and ellipses with several applications including the detection of symmetries in images. Recently, based on algebraic geometry arguments, the procedure has been extended to the automated recognition of special classes of algebraic plane curves. This allows us to detect curves of symmetry present in images, that is, curves that recognize midpoints maps of various shapes extracted by an ad hoc symmetry algorithm, here proposed. Further, in the case of straight lines, the detection of lines of symmetry allows us, by a pre-processing step of the image, to improve the efficiency of the recognition algorithm on which the Hough transform technique is founded, without loss of generality and additional computational costs.     

Analysis of a decoupled time‐stepping algorithm for reduced MHD system modeling magneto‐convection

In this article, we analyze the stability and error estimate of a decoupled algorithm for a magneto‐convection problem. Magneto‐convection is assumed to be modeled by a coupled system of reduced magneto‐hydrodynamic (RMHD) equations and convection‐diffusion equation. The proposed algorithm applies the second‐order backward difference formula in time and finite element in space. To obtain a noniterative decouple algorithm from the fully discrete nonlinear system, we use a second‐order extrapolation in time to the nonlinear terms such that their skew symmetry properties are preserved. We prove the stability of the algorithm and derive error estimates without assuming any stability conditions. The algorithm is unconditionally stable and requires the solution of one RMHD problem and one convection‐diffusion equation per time step. Numerical test is presented that illustrates the accuracy and efficiency of the algorithm.     

Arithmetic distributions of convergents arising from Jacobi-Perron algorithm

We study the distribution modulo m of the convergents associated with the d-dimensional Jacobi-Perron algorithm for a.e. real numbers in (0, 1)^d by proving the ergodicity of a skew product of the Jacobi-Perron transformation; this skew product was initially introduced in [5] for regular continued fractions.     

Bilabelled increasing trees and hook-length formulae

We introduce two different kinds of increasing bilabellings of trees, for which we provide enumeration formulae. One of the bilabelled tree families considered is enumerated by the reduced tangent numbers and is in bijection with a tree family introduced by Poupard [11]. Both increasing bilabellings naturally lead to hook-length formulae for trees and forests; in particular, one construction gives a combinatorial interpretation of a formula for labelled unordered forests obtained recently by Chen et al. [1].     

Cylindric skew Schur functions

Cylindric skew Schur functions, which are a generalisation of skew Schur functions, arise naturally in the study of P-partitions. Also, recent work of A. Postnikov shows they have a strong connection with a problem of considerable current interest: that of finding a combinatorial proof of the non-negativity of the 3-point Gromov-Witten invariants. After explaining these motivations, we study cylindric skew Schur functions from the point of view of Schur-positivity. Using a result of I. Gessel and C. Krattenthaler, we generalise a formula of A. Bertram, I. Ciocan-Fontanine and W. Fulton, thus giving an expansion of an arbitrary cylindric skew Schur function in terms of skew Schur functions. While we show that no non-trivial cylindric skew Schur functions are Schur-positive, we conjecture that this can be reconciled using the new concept of cylindric Schur-positivity.