Related papers: Configuration spaces of $\mathbb{C} \setminus k$
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…
The c-functions, related to a reductive symmetric space G/H and a fixed representation of a maximal compact subgroup K of G, are shown to satisfy polynomial bounds in imaginary directions.
We discuss the local behaviour of vector fields in the plane $\R^2$ around a regular singular point, using recently introduced reduced normal forms, i.e. Poincar\'e and Lie renormalized forms [{\it Lett. Math. Phys.} {\bf 42} (1997),…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its…
Configuration polynomials generalize the classical Kirchhoff polynomial defined by a graph. Their study sheds light on certain polynomials appearing in Feynman integrands. Contact equivalence provides a way to study the associated…
The satisfiability problem in real closed fields is decidable. In the context of satisfiability modulo theories, the problem restricted to conjunctive sets of literals, that is, sets of polynomial constraints, is of particular importance.…
The action of origin-preserving diffeomorphisms on a space of jets of symmetric connections is considered. Dimensions of moduli spaces of generic connections are calculated. Poincar\'e series of the geometric structure of symmetric…
We develop general expressions for the raising and lowering operators that belong to the orthogonal polynomials of hypergeometric type with discrete and continuous variable. We construct the creation and annihilation operators that…
A portrait is a combinatorial model for a discrete dynamical system on a finite set. We study the geometry of portrait moduli spaces, whose points correspond to equivalence classes of point configurations on the affine line for which there…
For an irreducible conic $\mathcal C$ in a Desarguesian plane of odd square order, estimating the number of points from a Baer subplane which are external to $\mathcal C$ is a natural problem. In this paper, a complete list of possibilities…
We show that the reduced point variety of a quantum polynomial algebra is the union of specific linear subspaces in $\mathbb{P}^n$, we describe its irreducible components and give a combinatorial description of the possible configurations…
We compute the number of points over finite fields of the character stack associated to a compact surface group and a reductive group with connected centre. We find that the answer is a Polynomial On Residue Classes (PORC). The key…
A system of N points, each having mass m, and a central mass M forming a planar central configuration, is considered. The equations of motion of a test particle are given and compared using different coordinates. For large values of N, even…
We study time averages for the norm of solutions to kinetic Fokker--Planck equations associated with general Hamiltonians. We provide fully explicit and constructive decay estimates for systems subject to a confining potential, allowing…
Using methods developed in multivariate splines, we present an explicit formula for discrete truncated powers, which are defined as the number of non-negative integer solutions of linear Diophantine equations. We further use the formula to…
The dimension of the third homogeneous component of a matrix quantum bialgebra, determined by pair of quantum spaces, is calculated. The Poincar\'{e} series of some deformations of $GL(n)$ is calculated. A new deformation of $GL(3)$ with…
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…
In this paper we present several formulae for computing the partial degrees of the defining polynomial of the offset curve to an irreducible affine plane curve given implicitly, and we see how these formulae particularize to the case of…
We notice that for $0<d\le 6$ the Poincar\'e polynomial of Simpson moduli space $M_{dm + 1}(\mathbb P_2)$ is divisible by the Poincar\'e polynomial of the projective space $\mathbb P_{3d-1}$. A somehow regular behaviour of the difference of…