Related papers: Polynomial Approach to Explicit Formulae for Gener…
We discuss the polynomial representation for long knots and elaborate on how to obtain them with a bound on degrees of the defining polynomials, for any knot-type.
Baker devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a…
We give a new method to calculate the universal cohomology classes of coincident root loci. We show a polynomial behavior of them and apply this result to prove that generalized Pl\"ucker formulas are polynomials in the degree, just as the…
We study methods for finding the solution set of a generic system in a family of polynomial systems with parametric coefficients. We present a framework for describing monodromy based solvers in terms of decorated graphs. Under the…
A generalized vertex join of a graph is obtained by joining an arbitrary multiset of its vertices to a new vertex. We present a low-order polynomial time algorithm for finding the chromatic polynomials of generalized vertex joins of trees,…
In this note we prove an explicit binomial formula for Jack polynomials and discuss some applications of it.
We study polynomials with complex coefficients which are nondegenerate in two senses, one of Kouchnirenko and the other with respect to its Newton polyhedron, through data on contact loci and motivic nearby cycles. Introducing an explicit…
Combinatorial formulas expressing cyclic rook polynomials and cyclic permanents of rectangular matrices in terms of expansions along rows are presented
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
We define, for an arbitrary partially ordered set, a multi-variable polynomial generalizing the hook polynomial.
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
We prove a Macdonald polynomial analogue of the celebrated Nekrasov-Okounkov hook-length formula from the theory of random partitions. As an application we obtain a proof of one of the main conjectures of Hausel and Rodriguez-Villegas from…
In this paper, a new generalization of third-order Jacobsthal bihyperbolic polynomials is introduced. Some of the properties of presented polynomials are given. A Vadja formula for the generalized bihyperbolic third-order Jacobsthal…
We show that for each fixed $k$, the problem of finding $k$ pairwise vertex-disjoint directed paths between given source-sink pairs in a planar directed graph is solvable in polynomial time. In fact, it suffices to fix the number of faces…
In this paper we introduce the generalization of Multi Poly-Euler polynomials and we investigate some relationship involving Multi Poly-Euler polynomials. Obtaining a closed formula for generalization of Multi Poly-Euler numbers therefore…
We continue the study of the $k$-cut complex $\Delta_k(G)$ of a graph $G$ initiated in the paper of Bayer, Denker, Jeli\'c Milutinovi\'c, Rowlands, Sundaram and Xue [Topology of cut complexes of graphs, SIAM J. on Discrete Math. 38(2):…
The purpose of this article is to present, in a simple way, an analytic approach to special numbers and polynomials. The approach is based on the derivative polynomials. The paper is, to some extent, a review article, although it contains…
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…
In this paper, we give a practical method to compute the Jacobian matrices of generalized Chebyshev polynomials associated to arbitrary semisimple Lie algebras. The entries of each Jacobian matrix can be expressed as a linear combination of…
We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like…