相关论文: Real Root Conjecture fails for five and higher dim…

We present a first example of a flag vector of a polyhedral sphere that is not the flag vector of any polytope. Namely, there is a unique 3-sphere with the parameters $(f_0,f_1,f_2,f_3;f_{02})=(12,40,40,12;120)$, but this sphere is not…

We describe two methods for showing that a vector can not be the f-vector of a homology d-ball. As a consequence, we disprove a conjectured characterization of the f-vectors of balls of dimension five and higher due to Billera and Lee. We…

Riffaut (2019) conjectured that a singular modulus of degree $h\ge 3$ cannot be a root of a trinomial with rational coefficients. We show that this conjecture follows from the GRH, and obtain partial unconditional results.

Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide two new tools for determining realisation numbers in arbitrary…

We give an example of a set $\Omega \subset \R^5$ which is a finite union of unit cubes, such that $L^2(\Omega)$ admits an orthonormal basis of exponentials $\{\frac{1}{|\Omega|^{1/2}} e^{2\pi i \xi_j \cdot x}: \xi_j \in \Lambda \}$ for…

We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynomials. Our algorithm outputs that no positive real root…

In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…

In a previous paper the second author showed that if $M$ is a pseudomanifold with complementarity other than the 6-vertex real projective plane and the 9-vertex complex projective plane, then $M$ must have dimension $\geq 6$, and - in case…

The Hodge conjecture is shown to hold for rationally connected fivefolds, or more generally for fivefolds for which the base of the maximal rationally connected fibration is at most 3 dimensional.

Landau's work on the singularities of Feynman diagrams suggests that they can only be of three types: either poles, logarithmic divergences, or the roots of quadratic polynomials. On the other hand, many Feynman integrals exist whose…

Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes…

Poincare had conjectured that the fact that closed loops could be shrunk to points on a surface topologically equivalent to the surface of a sphere can be generalised to three (and more) dimensions. After nearly a century the conjecture has…

A polynomial is real-rooted if all of its roots are real. For every polynomial $f(t) \in {\mathbf R}[t]$, the Hermite-Sylvester theorem associates a quadratic form $\Phi_2$ such that $f(t)$ is real-rooted if and only if $\Phi_2$ is positive…

It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax…

The Casas-Alvero conjecture states: if a complex univariate polynomial has a common root with each of its derivatives, then it has a unique root. We show that hypothetical counterexamples must have at least 5 different roots. The first case…

V. Golyshev conjectured that for any smooth polytope P of dimension at most five, the roots $z\in\C$ of the Ehrhart polynomial for P have real part equal to -1/2. An elementary proof is given, and in each dimension the roots are described…

Recently the problem of constructing a perfect Euler cuboid was related with three conjectures asserting the irreducibility of some certain three polynomials depending on integer parameters. In this paper a partial result toward proving the…

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…

For a degree $5$ real polynomial with roots $x_1\leq \cdots \leq x_5$ and roots $\xi_1\leq \cdots \leq \xi_4$ of its derivative, we set $z_j:=(x_j+x_{j+1})/2$, $1\leq j\leq 4$. We prove that one cannot have at the same time $\min_{1\leq…

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…