Related papers: Expressing the cone radius in the relational calcu…

This paper presents new formulary solutions for quantic polynomial equations in general forms, where we present five solutions for any fifth degree polynomial equation with real coefficients, and thereby having the possibility to calculate…

The paper proves sum-of-square-of-rational-function based representations (shortly, sosrf-based representations) of polynomial matrices that are positive semidefinite on some special sets: $\mathbb{R}^n;$ $\mathbb{R}$ and its intervals…

We give an anecdotal discussion of the problem of searching for polynomials with all roots on the unit circle, whose coefficients are rational numbers subject to certain congruence conditions. We illustrate with an example from a…

Let G be an arbitrary simple graph. The main results are explicit representations of the edge cone of G as a finite intersection of closed halfspaces. If G is bipartite and connected we determine the facets of the edge cone and present a…

We prove that for any even algebraic polynomial $p$ one can find a cosine polynomial with an arbitrary small $l_1$-norm of coefficients such that the first coefficients of its representation as an algebraic polynomial in $\cos x$ coincide…

When considering geometry, one might think of working with lines and circles on a flat plane as in Euclidean geometry. However, doing geometry in other spaces is possible, as the existence of spherical and hyperbolic geometry demonstrates.…

This article is divided in two parts. In the first part we review some recent results concerning the expected number of real roots of random system of polynomial equations. In the second part we deal with a different problem, namely, the…

Let X be a non-singular projective hypersurface of degree 4, which is defined over the rational numbers. Assume that X has dimension 39 or more, and that X contains a real point and p-adic points for every prime p. Then X is shown to…

We prove that each real semisimple Lie algebra G has a Q-form, such that every real representation of G can be realized over the rational numbers Q. This was previously proved by M.S.Raghunathan (and rediscovered by P.Eberlein) in the…

In 1955 B. Segre showed that any oval in a projective plane over a finite field of odd order is a conic. His proof constructs a conic which matches the oval in some points and tangents, and then shows that it actually coincides with the…

For a given elliptic curve, its associated $L$-function evaluated at $1$ is closely related to its real period. In this article, we generalize this principle to a rational curve. We count the rational points over all finite fields and use…

Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…

Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

In this paper, we prove the first incidence bound for points and conics over prime fields. As applications, we prove new results on expansion of bivariate polynomial images and on certain variations of distinct distances problems. These…

We show that every set S in [N]^d occupying less than p^t residue classes for some real number t < d and every prime p, must essentially lie in the solution set of a polynomial equation of degree at most (log N)^C, for some constant C…

We define a combinatorial object that can be associated with any conic-line arrangement with ordinary singularities, which we call the combinatorial Poincar\'e polynomial. We prove a Terao-type factorization statement on the splitting of…

We show that a $d$-dimensional polyhedron $S$ in $\real^d$ can be represented by $d$-polynomial inequalities, that is, $S = \{x \in \real^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge 0 \}$, where $p_0,...,p_{d-1}$ are appropriate polynomials.…