In this paper,we deeply research Lagrange interpolation of n-variables and give an application of Cayley-Bacharach theorem for it. We pose the concept of sufficient intersection about s(1 ≤ s ≤ n) algebraic hypersurfaces in n-dimensional complex Euclidean space and discuss the Lagrange interpolation along the algebraic manifold of sufficient intersection. By means of some theorems ( such as Bez...

In this paper we introduce projective geometry and one of its important theorems. We begin by defining projective space in terms of homogenous coordinates. Next, we define homgenous curves, and describe a few important properties they have. We then introduce Bezout’s Theorem, which asserts that the number of intersection points of two homogenous curves is less than or equal to the product of th...

We deal with Krull’s intersection theorem on the ideals of a commutative Noetherian ring in the fuzzy setting. We first characterise products of finitely generated fuzzy ideals in terms of fuzzy points. Then, we study the question of uniqueness and existence of primary decompositions of fuzzy ideals. Finally, we use such decompositions and a form of Nakayama’s lemma to prove the Krull intersect...

If each four spheres in a set of five unit spheres in R have nonempty intersection, then all five spheres have nonempty intersection. This result is proved using Grace’s theorem: the circumsphere of a tetrahedron encloses none of its escribed spheres. This paper provides self-contained proofs of these results; including Schläfli’s double six theorem and modified version of Lie’s line-sphere tra...

It is known from a previous paper [3] that Katona’s Intersection Theorem follows from the Complete Intersection Theorem by Ahlswede and Khachatrian via a Comparison Lemma. It also has been proved directly in [3] by the pushing–pulling method of that paper. Here we add a third proof via a new (k,k+1)-shifting technique, whose impact will be exploared elsewhere. The fourth and last of our proofs ...

Using a class sum and a collection of related Radon transforms, we present a proof G. James’s Kernel Intersection Theorem for the complex unipotent representations of the finite general linear groups. The approach is analogous to that used by F. Scarabotti for a proof of James’s Kernel Intersection Theorem for the symmetric group. In the process, we also show that a single class sum may be used...

A keystone in the classical theory of diophantine approximation is the construction of an auxilliary polynomial. The polynomial is constructed so that it is forced (for arithmetic reasons) to vanish at certain approximating points and this contradicts an upper bound on the order of vanishing obtained by other (usually geometric) techniques; the contradiction then allows one to prove finiteness ...

Erdos and Rado defined a A-system, as a family in which every two members have the same intersection. Here we obtain a new upper bound on the maximum cardinality q ( n , q ) of an n-uniform family not containing any A-system of cardinality q. Namely, we prove that, for any a > 1 and q , there exists C = C(a, q ) such that, for any n ,

Convex analysis” is developed for functions defined on integer lattice points. We investigate the class of functions which enjoy a variant of Steinitz’s exchange property. It includes linear functions on matroids, valuations on matroids (in the sense of Dress and Wenzel), and separable concave functions on the integral base polytope of submodular systems. It is shown that a function ω has the S...