Related papers: Cabling procedure for the colored HOMFLY polynomia…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except for seven cases. We prove the polynomial-time solvability of…
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…
The HOMFLY-PT and Kauffman polynomials are related to each other for special classes of knots constructed by full twists and Jucys-Murphy twists. The conditions for this relation are articulated in terms of characters of the…
The use of algebraic techniques to solve combinatorial problems is studied in this paper. We formulate the rainbow connectivity problem as a system of polynomial equations. We first consider the case of two colors for which the problem is…
Pilgrim's Finite Global Attractor Conjecture has been verified for polynomials [1], but remains open for general rational maps. In this paper, we prove the conjecture for a family of rational maps obtained by gluing two PCF polynomials…
We establish a colorful and, more generally, matroidal solution to the problem of Goodman and Pollack on the existence of an $\mathbb{F}$-affine $k$-dimensional transversal to a family of convex sets in $\mathbb{F}^d$, where $0 \le k \le d…
For any symmetry group $H$ and any appropriate matrix dilation we give an explicit method for the construction of $H$-symmetric refinable interpolatory refinable masks which satisfy sum rule of arbitrary order $n$. For each such mask we…
In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…
We define Hodge correlators for a compact Kahler manifold X. They are complex numbers which can be obtained by perturbative series expansion of a certain Feynman integral which we assign to X. We show that they define a functorial real…
This paper presents a path to proving the Four-Color Theorem that differs from the traditional "reducible configuration" method. By introducing concepts such as "outer boundary," "primitive set," "Property A," "knot," "valid pair group,"…
In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined…
We propose and experimentally verify a method to program the effective transmission matrix of general multiport linear optical circuits in random multiple-scattering materials by phase modulation of incident wavefronts. We demonstrate the…
We show how to translate the task of computing the multiplicative structure of a Chow ring of a projective homogeneous variety into an easily understandable combinatorial task of calculating in the corresponding polynomial ring. The…
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…
Chromatic polynomials have been studied extensively, giving us results such as the Fundamental Reduction Theorem and closed formulas for the chromatic polynomials of common classes of graphs. Though, none of those extend to the context of…
Knot colorings are one of the simplest ways to distinguish knots, dating back to Reidemeister, and popularized by Fox. In this mostly expository article, we discuss knot invariants like colorability, knot determinant and number of…
The constrained linear representability problem (CLRP) for polymatroids determines whether there exists a polymatroid that is linear over a specified field while satisfying a collection of constraints on the rank function. Using a computer…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
Intrinsic projector calibration is essential in projection mapping (PM) applications, especially in dynamic PM. However, due to the shallow depth-of-field (DOF) of a projector, more work is needed to ensure accurate calibration. We aim to…