Related papers: The Complexity of Testing Monomials in Multivariat…
This paper describes implementation and computational results of a polynomial test of total unimodularity. The test is a simplified version of a prior method. The program also decides two related unimodularity properties. The software is…
Let $\mathbb C$ be the set of complex numbers, and let $\mathcal P$ be a collection of complex polynomial maps in several variables. Assuming at least one $P\in\mathcal P$ depends on at least two variables, we classify all possibilities for…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
This paper studies the integration problem in differential fields that may involve quantities reminiscent of the Weierstrass $\wp$ function, which are defined by a first-order nonlinear differential equation. We extend the classical notion…
We study a class of bivariate deformed Hermite polynomials and some of their properties using classical analytic techniques and the Wigner map. We also prove the positivity of certain determinants formed by the deformed polynomials. Along…
We present a deterministic algorithm which computes the multilinear factors of multivariate lacunary polynomials over number fields. Its complexity is polynomial in $\ell^n$ where $\ell$ is the lacunary size of the input polynomial and $n$…
In this work, tests of symmetry for bivariate copulas are introduced and studied using empirical Bernstein copula process. Three statistics are proposed and their asymptotic properties are established. Besides, a multiplier bootstrap…
In this paper, we use multivariate splines to investigate the volume of polytopes. We first present an explicit formula for the multivariate truncated power, which can be considered as a dual version of the famous Brion's formula for the…
This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem.…
The roots of a complex polynomial depend continuously on the coefficients; that is, an infinitesimal perturbation of the coefficients results in an infinitesimal perturbation of the roots. A short, straightforward proof of this is possible…
The purpose of this work is to analyse a family of mutually orthogonal polynomials on the unit ball with respect to an inner product which includes an additional term on the sphere. First, we will get connection formulas relating classical…
We study multiple orthogonal polynomials exploiting their explicit determinantal representation in terms of moments. Our reasoning follows that applied to solve the Hermite-Pad\'{e} approximation and interpolation problems. We study also…
The main goal of this paper is to extend [J. Algebra Appl. 20 (2021), 2150074] to generalized quaternion algebras, even when these algebras are not necessarily division rings. More precisely, in such cases, the image of a multilinear…
In this paper we use a set of partial differential equations to prove an expansion theorem for multiple complex Hermite polynomials. This expansion theorem allows us to develop a systematic and completely new approach to the complex Hermite…
We develop new polynomial methods for studying systems of word equations. We use them to improve some earlier results and to analyze how sizes of systems of word equations satisfying certain independence properties depend on the lengths of…
We survey recent progress in the proof complexity of strong proof systems and its connection to algebraic circuit complexity, showing how the synergy between the two gives rise to new approaches to fundamental open questions, solutions to…
Motivated by the Poisson Dixmier-Moeglin equivalence problem, a systematic study of commutative unitary rings equipped with a {\em biderivation}, namely a binary operation that is a derivation in each argument, is here begun, with an eye…
Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three…
In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the…
Character polynomials are used to study the restriction of a polynomial representation of a general linear group to its subgroup of permutation matrices. A simple formula is obtained for computing inner products of class functions given by…