相关论文: A short proof for the open quadrant problem
In this work we deal with a symbolic approach to the general quadratic polynomial decomposition. By means of a symbolic implementation, we investigate some properties of the components sequences like orthogonality and symmetry. We present…
Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…
In the recent years a significant progress was achieved in the field of design and fabrication of optical systems based on freeform optical surfaces. They provide a possibility to build fast, wide-angle and high-resolution systems, which…
In this expository article we give an introduction to Ehrhart theory, i.e., the theory of integer points in polyhedra, and take a tour through its applications in enumerative combinatorics. Topics include geometric modeling in…
First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…
We consider real polynomials in finitely many variables. Let the variables consist of finitely many blocks that are allowed to overlap in a certain way. Let the solution set of a finite system of polynomial inequalities be given where each…
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.…
For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…
Exact solution to many problems in mathematical physics and quantum field theory often can be expressed in terms of an algebraic curve equipped with a meromorphic differential. Typically, the geometry of the curve can be seen most clearly…
The square of a graph $G$, denoted by $G^2$, is obtained from $G$ by putting an edge between two distinct vertices whenever their distance is two. Then $G$ is called a square root of $G^2$. Deciding whether a given graph has a square root…
Euler diagrams are a tool for the graphical representation of set relations. Due to their simple way of visualizing elements in the sets by geometric containment, they are easily readable by an inexperienced reader. Euler diagrams where the…
Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…
This work sets the non isotropic noncentral elliptical shape distributions via QR decomposition in the context of zonal polynomials, avoiding the invariant polynomials and the open problems for their computation. The new shape distributions…
We develop an essentially algebraic method to study biharmonic curves into an implicit surface. Although our method is rather general, it is especially suitable to study curves into surfaces defined by a polynomial equation: in particular,…
Let Q_0 be the classical generalized quadrangle of order q = 2n arising from a non-degenerate quadratic form in a 5-dimensional vector space defined over a finite field of order q. We consider the rank two geometry X having as points all…
In the last few years, the notion of optimal polynomial approximant has appeared in the mathematics literature in connection with Hilbert spaces of analytic functions of one or more variables. In the 70s, researchers in engineering and…
The difficulty in exploring potential energy surfaces, which are nonconvex, stems from the presence of many local minima, typically separated by high barriers and often disconnected in configurational space. We obtain the global minimum on…
In 2004, Andrew Granville proved the following: A polynomial in variables $x,y,z,$ invariant under the map $\varphi: z \to -(x+y+z)$ is a polynomial in $b = z(x+y+z)$. We tell, curtly, its history and then give a variation on this theme.
In a paper from 2010, Budarina, Dickinson and Levesley studied the rational approximation properties of curves parametrized by polynomials with integral coefficients in Euclidean space of arbitrary dimension. Assuming the dimension is at…
This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…