Related papers: Configuration polynomials under contact equivalenc…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…
We analyze the characteristic polynomial associated to an ellipsoid and another quadric in the context of the contact detection problem. We obtain a necessary and sufficient condition for an efficient method to detect contact. This…
A family of polynomials parameterized by the conjugacy classes of a finite Coxeter group is investigated. These polynomials, together with the character table of the group, determine the associated generic degrees. The polynomials are…
This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…
In this paper, we introduce a geometric structure called top, which is a trivialized bundle of plane pencils over a Riemannian 3-manifold, defined as the set of kernels of a circle of 1-forms (e.g. of contact and integrable forms) with…
The degree of a point configuration is defined as the maximal codimension of its interior faces. This concept is motivated from a corresponding Ehrhart-theoretic notion for lattice polytopes and is related to neighborly polytopes and the…
Symanzik polynomials are defined on Feynman graphs and they are used in quantum field theory to compute Feynman amplitudes. They also appear in mathematics from different perspectives. For example, recent results show that they allow to…
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…
The vector space of the tensors $\mathcal F$ of type (0,3) having the same symmetries as the covariant derivative of the fundamental form of an almost contact metric manifold is considered. A scheme of decomposition of $\mathcal F$ into…
We characterize all possible relative positions between a hyperboloid of one sheet and a sphere through the roots of a characteristic polynomial associated to these quadrics. The classification is also suitable for a hyperboloid and a…
We show some applications of the formulas-as-polynomials correspondence: 1) a method for (dis)proving formula isomorphism and equivalence based on showing (in)equality; 2) a constructive analogue of the arithmetical hierarchy, based on the…
We study universal polynomials of characteristic classes associated to the $\mathcal{A}$-classification (i.e. up to right-left equivalence) of holomorphic map-germs $(\mathbb{C}^2,0) \to (\mathbb{C}^n, 0)$ $(n=2,3)$. That enables us to…
These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…
We study paving matroids, their realization spaces, and their closures, along with matroid varieties and circuit varieties. Within this context, we introduce three distinct methods for generating polynomials within the associated ideals of…
A contact manifold is a manifold equipped with a distribution of codimension one that satisfies a `maximal non-integrability' condition. A standard example of a contact structure is a strictly pseudoconvex CR manifold, and operators of…
To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism…
The principal filtration of the infinite-dimensional odd Contact Lie superalgebra over a field of characteristic $p>2$ is proved to be invariant under the automorphism group by investigating ad-nilpotent elements and determining certain…
Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…
Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…