Related papers: Non-intersecting path explanation for block Pfaffi…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…

Webs yield an especially important realization of certain Specht modules, irreducible representations of symmetric groups, as they provide a pictorial basis with a convenient diagrammatic calculus. In recent work, the last three authors…

Graphene has emerged as a promising platform to bring nonlinear quantum optics to the nanoscale, where a large intrinsic optical nonlinearity enables long-lived and actively tunable plasmon polaritons to strongly interact. Here we…

The totally non-negative pfaffian (TNNP) is define for a skew-symmetric matrix such that all the sub-pfaffians are non-negative. It appears in the pfaffian structure of $\tau$-function for the non-singular web solitons of the BKP equation .…

First, we review the notion of a Poisson structure on a noncommutative algebra due to Block-Getzler and Xu and introduce a notion of a Hamiltonian vector field on a noncommutative Poisson algebra. Then we describe a Poisson structure on a…

We prove that the values of discrete directed polymer partition functions involving multiple non-intersecting paths remain invariant under replacing the background weights by their images under the geometric RSK correspondence. This result…

Motivated by Stanley's conjecture on the multiplication of Jack symmetric functions, we prove a couple of identities showing that skew Jack symmetric functions are semi-invariant up to translation and rotation of a $\pi$ angle of the skew…

In this paper, the intersection of bivariate orthogonal polynomials on triangle patches will be investigated. The result is interesting by its own but also has important applications in the theory of a posteriori error estimation for finite…

We study intersections of orbits in polynomial semigroup dynamics with lines on the affine plane over a number field, extending previous work of D. Ghioca, T. Tucker, M. Zieve (2008)

We study functional graphs generated by several quadratic polynomials, acting simultaneously on a finite field of odd characteristic. We obtain several results about the number of leaves in such graphs. In particular, in the case of graphs…

We obtain some recurrence relationships among the partition vectors of the partial exponential Bell polynomials. On using such results, the $n$-th Adomian polynomial for any nonlinear operator can be expressed explicitly in terms of the…

We introduce a new type of lattice path, called brick-wall lattice path, and we derive a formula which counts the number of paths on these lattices imposing certain restrictions on the Cartesian plane. Connections to the Fibonacci sequence,…

The core of this article is a general theorem with a large number of specializations. Given a manifold $N$ and a finite number of one-parameter groups of point transformations on $N$ with generators $Y, X_{(1)}, \cdots, X_{(d)} $, we…

We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…

We establish an alternative, ``perpendicular" collection of generating functions for the coefficients of Gaussian polynomials, $\begin{bmatrix}N+m\\m\end{bmatrix}_q$. We provide a general characterization of these perpendicular generating…

In this paper, we derive several formulas of counting families of non-intersecting paths for two-sided ladder-shaped regions. As an application, we give a new proof to a combinatorial interpretation of Fibonacci numbers obtained by G.…

Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…

Skew orthogonal polynomials arise in the calculation of the $n$-point distribution function for the eigenvalues of ensembles of random matrices with orthogonal or symplectic symmetry. In particular, the distribution functions are completely…

The resolvent of supersymmetric Dirac Hamiltonian is studied in detail. Due to supersymmetry the squared Dirac Hamiltonian becomes block-diagonal whose elements are in essence non-relativistic Schr\"odinger-type Hamiltonians. This enables…