Related papers: On the Thom-Boardman Symbols for Polynomial Multip…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
In Graph Theory a number of results were devoted to studying the computational complexity of the number modulo 2 of a graph's edge set decompositions of various kinds, first of all including its Hamiltonian decompositions, as well as the…
We give the Thom polynomials for the singularities I_2,2 and A_3 associated with maps (C^n,0) -> (C^{n+k},0) with parameter k>=0. We give the Schur function expansions of these Thom polynomials. Moreover, for the singularities A_i (with any…
We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…
The approximate joint diagonalization of a set of matrices consists in finding a basis in which these matrices are as diagonal as possible. This problem naturally appears in several statistical learning tasks such as blind signal…
We prove a formula for Thom polynomials of Morin (or A_d) singularities in any codimension. We use a combination of the test-curve method of Porteous, and the localization methods in equivariant cohomology. Our formulas are independent of…
We study the following variant of the 15 puzzle. Given a graph and two token placements on the vertices, we want to find a walk of the minimum length (if any exists) such that the sequence of token swappings along the walk obtains one of…
Fix an integer $d \geq 2$. The space $\mathcal{P}_{d}$ of polynomial maps of degree $d$ modulo conjugation by affine transformations is naturally an affine variety over $\mathbb{Q}$ of dimension $d -1$. For each integer $P \geq 1$, the…
In this paper we describe how to improve the performance of the symbolic-numeric method in (Li and Zhi,2009, 2011) for computing the multiplicity structure and refining approximate isolated singular solutions in the breadth one case. By…
Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…
Student appreciation of a function is enhanced by understanding the graphical representation of that function. From the real graph of a polynomial, students can identify real-valued solutions to polynomial equations that correspond to the…
We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
The ${\mathbb B}_n^{(k)}$ poly-Bernoulli numbers --- a natural generalization of classical Bernoulli numbers ($B_n={\mathbb B}_n^{(1)}$) --- were introduced by Kaneko in 1997. When the parameter $k$ is negative then ${\mathbb B}_n^{(k)}$ is…
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…
We revisit the fundamental Boolean Matrix Multiplication (BMM) problem. With the invention of algebraic fast matrix multiplication over 50 years ago, it also became known that BMM can be solved in truly subcubic $O(n^\omega)$ time, where…
The polynomial version of van der Waerden's theorem, proved using dynamical systems by V. Bergelson and A. Leibman in 1996, \cite{Bergelson1996}, significantly highlighted the role of dynamical systems in addressing problems related to…
Symbol letters are crucial for analytically calculating Feynman integrals in terms of iterated integrals. We present a novel method to construct the symbol letters for a given integral family without prior knowledge of the canonical…
The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been studied by Makowsky and Meer as a new sparsity condition…
It is known a method for converting a system of Boolean polynomial equations to a single Boolean polynomial equation with less variables. In this paper, we show a formula for systems of Boolean polynomial equations which is based on the…