Related papers: When is a trigonometric polynomial not a trigonome…

The article proved the upper bound of leading coefficient of characteristic polynomial of graded ideal in a ring of generalized polynomials.

We introduce a "workable" notion of degree for non-homogeneous polynomial ideals and formulate and prove ideal theoretic B\'ezout Inequalities for the sum of two ideals in terms of this notion of degree and the degree of generators. We…

The classical version of B\'ezout's Theorem gives an integer-valued count of the intersection points of hypersurfaces in projective space over an algebraically closed field. Using work of Kass and Wickelgren, we prove a version of…

Classically, B\'ezout's theorem says that an intersection of hypersurfaces in a projective space is rationally equivalent to a number of copies of a smaller projective space, the number depending on the degrees of the hypersurfaces. We give…

Using toric geometry we prove a B\'ezout type theorem for weighted projective spaces.

We study the boundary of the nonnegative trigonometric polynomials from the algebraic point of view. In particularly, we show that it is a subset of an irreducible algebraic hypersurface and established its explicit form in terms of…

The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].

Let $B$ be the set of odd integers that are sums of two coprime squares. We prove that the trigonometric polynomial $S(\alpha;N)=\sum_{b\in B,b\leq N} e(b\alpha)$ satisfies \[ \frac{S(\alpha; N)}{N/\sqrt{\log N}}<<_{A,A'} \frac{1}{\phi(q)}…

The aim of this work is to use Napoleon's Theorem in different regular polygons, and decide whether we can prove Napoleon's Theorem is only limited with triangles or it could be done in other regular polygons that can create regular…

Following work of Mazur-Tate and Satoh, we extend the definition of division polynomials to arbitrary isogenies of elliptic curves, including those whose kernels do not sum to the identity. In analogy to the classical case of division…

The idea of orthogonal polynomials has been generalized in two ways to achieve new types of polynomials: noncommutative orthogonal polynomials and biorthogonal polynomials. This paper brings these two different generalizations together to…

We prove that any derived equivalence between triangular algebras is standard, that is, it is isomorphic to the derived tensor functor given by a two-sided tilting complex.

Function theory on the unit disc proved key to a range of problems in statistics, probability theory, signal processing literature, and applications, and in this, a special place is occupied by trigonometric functions and the Fejer-Riesz…

In this article we present a generalization of a Leibniz's geometrical theorem and an application of it.

We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…

This paper, a continuation of [3], involves a closer study of polynomials of supertropical semirings and their version of tropical geometry in which we introduce the concept of relatively prime polynomials and resultants, with the aid of…

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…

Subresultant is a powerful tool for developing various algorithms in computer algebra. Subresultants for polynomials in standard basis (i.e., power basis) have been well studied so far. With the popularity of basis-preserving algorithms,…

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…