Related papers: Configuration polynomials under contact equivalenc…

The class of $\left(\binom{n+1}{2}_{n-1} \binom{n+1}{3}_3\right)$-configurations which contain at least $n-2$ $K_n$-graphs coincides with the class of so called systems of triangle perspectives i.e. of configurations which contain a bundle…

Let G be a finite connected graph. The Kirchhoff polynomial of G is a certain homogeneous polynomial whose degree is equal to the first betti number of G. These polynomials appear in the study of electrical circuits and in the evaluation of…

In recent times a great amount of progress has been achieved in symplectic and contact geometry, leading to the development of powerful invariants of 3-manifolds such as Heegaard Floer homology and embedded contact homology. These…

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.

We define the contact homology algebra for any contact manifold and show that it is an invariant of the contact manifold. More precisely, given a contact manifold $(M,\xi)$ and some auxiliary data $\mathcal{D}$, we define an algebra…

To any metric spaces there is an associated metric profile. The rectifiability of the metric profile gives a good notion of curvature of a sub-Riemannian space. We shall say that a curvature class is the rectifiability class of the metric…

This paper establishes the orderability of contact manifolds which are quotients of fillable contact manifolds under finite group actions compatible with the filling, the prototypical example being $\mathbb{R}P^{2n-1}$ as the quotient of…

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…

We give a criterion for the existence of a non-degenerate quasihomogeneous polynomial in a configuration, i.e. in the space of polynomials with a fixed set of weights, and clarify the relation of this criterion to the necessary condition…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

This article presents numerical methods in order to solve problems of tolerance analysis. A geometric specification, a contact specification and a functional requirement can be respectively characterized by a finite set of geometric…

E. Bayer-Fluckiger gave a necessary and sufficient condition for a polynomial to be realized as the characteristic polynomial of a semisimple isometry of an even unimodular lattice, by describing the local-global obstruction, and the author…

We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.

A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…

Two infinite sequences of minimal surfaces in space are constructed using symmetry analysis. In particular, explicit formulas are obtained for the self-intersecting minimal surface that fills the trefoil knot.

We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…

Consider a linear realization of a matroid over a field. One associates with it a configuration polynomial and a symmetric bilinear form with linear homogeneous coefficients. The corresponding configuration hypersurface and its non-smooth…

Dodgson polynomials appear in Schwinger parametric Feynman integrals and are closely related to the well known Kirchhoff (or first Symanzik) polynomial. In this article a new combinatorial interpretation and a generalisation of Dodgson…