立体几何中的唯一性效应

线面问题是立体几何中的重点之最 ,更是难点之最 .面对它的“定义多 ,定理多” ,人们都有“记忆难 ,理解更难”的同感 .本人在教学过程中发现 ,这些看似一盘散沙的定理及其理解竟然有着一条主线———唯一性 ,唯一性成了它们的主旋律 .1　引子———唯一性　在线线、线面、面面的平行与垂直中有四个唯一性 :1)过直线外一点与已知直线平行的直线唯一 ;2 )过平面外一点与已知平面平行的平面唯一 ;3)过一点与已知平面垂直的直线唯一 ;4 )过一点与已知直线垂直的平面唯一 ,其余情况均不唯一 .为了便于记忆 ,通俗概括为 :“同类平行唯一 ,异类垂…     

二阶曲线切线型方程的意义

本文论证了二阶曲线切线型直线方程的几何意义，其主要结论丰富了二阶曲线的一般理论．     

圆锥搭台 数列唱戏

2009年高考安徽卷理第20题：1解法探究（I）思路1（化生为熟）直线与圆或圆锥曲线的交点问题,通常我们是把直线方程与椭圆方程联立,得到关于x的一元二次方程,从而解出交点坐标．要证明本题的交点唯一,则联立后的方程应该有唯一解．     

关于直线对称的点的一种求法

在解析几何中,点关于直线的对称点问题,一般可以分为两大类,即点关于特殊直线对称和点关于非特殊直线对称。前一种情况较为简单,画图后便可立即得出对称点,在此直接给出结论如下:     

直线与圆的方程

2重点、难点、热点分析 1）重点直线的倾斜角和斜率，直线方程的点斜式、两点式及一般式，两条直线的位置关系，两直线平行与垂直的条件，两条直线的交角，点到直线的距离；用二元一次不等式表示平面区域及简单的线性规划问题；     

利用行列式求两异面直线间的距离

根据空间两直线方程为一般式方程时共面或异面的充要条件，利用行列式和向量运算的性质，直接给出两异面直线间的距离公式。     

也谈斜率带来的“盲点”

文[1]中谈到：“任何直线系都无法表示过定点的所有直线,始终存在一条无法表示的直线”,笔者认为,此言值得商榷．     

巧设过一个定点的直线方程

关于直线方程的形式,教材中给出了斜截式、点斜式、截距式、两点式和一般式．学生根据具体题目选择相应的直线形式．当直线过一定点（x0,Y0）时,学生一般会用点斜式将直线设为y-Y0=k（x-x0）,     

高考专题复习系列讲座——直线和圆

[考试内窖和考试要求] 考试内容：直线的倾斜角和斜率，直线方程的点斜式和两点式，直线方程的一般式；两条直线平行与垂直的条件；两条直线的交角；点到直线的距离；用二元一次不等式表示平面区域，简单的线性规划问题；曲线与方程的概念．由巳知条件列出曲线方程；圆的标准方程和一般方程．圆的参数方程．     

分空间最多区域数的新探索

张定强在文[1]中介绍了以下结论:n个不同的点可将直线分成n 1段;n条处于一般位置的直线将一个平面最多分成n(n 1)/2 1部分;n个处于一般位置的平面最多将空间分割成n(n2 5)/6 1部分.     

Arithmetically Cohen–Macaulay bundles on complete intersection varieties of sufficiently high multidegree

Recently it has been proved that any arithmetically Cohen–Macaulay (ACM) bundle of rank two on a general, smooth hypersurface of degree at least three and dimension at least four is a sum of line bundles. When the dimension of the hypersurface is three, a similar result is true provided the degree of the hypersurface is at least six. We extend these results to complete intersection subvarieties by proving that any ACM bundle of rank two on a general, smooth complete intersection subvariety of sufficiently high multi-degree and dimension at least four splits. We also obtain partial results in the case of threefolds.     

On the calculation of extended max and min operations between convex fuzzy sets of the real line

In this paper we will identify the sets of so-called sub- and pseudo-highest intersection points of convex fuzzy sets of the real line and will explore their properties. Based on the properties of these sets, an algorithm for calculating extended max and min operations between two or more convex fuzzy sets of the real line with general membership functions, not necessarily continuous, is proposed.     

On solving general reverse convex programming problems by a sequence of linear programs and line searches

Many multiextremal global optimization problems can be formulated as problems of minimizing a linear function over the intersection of a convex set with the complement of a convex set (so-called canonical d.c. programs or general reverse convex programming problems). In this paper it is shown that these general reverse convex programming problems can be solved by a sequence of linear programs and univariate convex minimization problems (line searches).Parts of the present paper were accomplished while this author was on leave at the University of Trier as a fellow of the Alexander von Humboldt foundation.     

二阶曲线间的射影映射

平面上的射影变换,将二阶曲线变为另一二阶曲线,这个射影变换也可以称为这两个二阶曲线间的射影映射.若两个二阶曲线相切,则存在以切点为射影中心的两个二阶曲线间的射影映射;若两个二阶曲线相离,则存在以两个二阶曲线公切线交点为射影中心的射影映射;若两个二阶曲线相交,则存在以其中一交点为射影中心的两个二阶曲线间的射影映射.     

Graph limits and hereditary properties

We give a survey of some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs, chordal graphs, cographs, interval graphs, unit interval graphs, threshold graphs, and line graphs.     

Mixed unit interval graphs

The class of intersection graphs of unit intervals of the real line whose ends may be open or closed is a strict superclass of the well-known class of unit interval graphs. We pose a conjecture concerning characterizations of such mixed unit interval graphs, verify parts of it in general, and prove it completely for diamond-free graphs. In particular, we characterize diamond-free mixed unit interval graphs by means of an infinite family of forbidden induced subgraphs, and we show that a diamond-free graph is mixed unit interval if and only if it has intersection representations using unit intervals such that all ends of the intervals are integral.     

When it’s on zero,the lines become parallel: Preservice elementary teachers’ diagrammatic encounters with division by zero

We investigated preservice elementary teachers’ diagrammatic encounters with division by zero. Pairs of preservice teachers explored a transformable diagram where the locations of points on the x and y axes could be continuously varied. Quotients were defined in the diagram as the intersection of a line with the y-axis. For zero divisors, the quotient line was parallel to the y-axis, and there was no point of intersection. We report our analysis of two episodes where the transformability of the diagram spurred encounters with division by zero. In each episode, pairs of preservice teachers used repeated movements of the points in the diagram to explore the conditions under which the quotient line would become parallel to the y-axis. Our analysis shows how these movement-based material experiments gave rise to different conceptions of division by zero. We discuss how transformable diagrams create new material contexts for exploring arithmetic concepts.     

Coloring Intersection Graphs of Arc-Connected Sets in the Plane

A family of sets in the plane is simple if the intersection of any subfamily is arc-connected, and it is pierced by a line \(L\) if the intersection of any member with \(L\) is a nonempty segment. It is proved that the intersection graphs of simple families of compact arc-connected sets in the plane pierced by a common line have chromatic number bounded by a function of their clique number.     

Intersection homology with general perversities

We study intersection homology with general perversities that assign integers to stratum components with none of the classical constraints of Goresky and MacPherson. We extend Goresky and MacPherson’s axiomatic treatment of Deligne sheaves, and use these to obtain Poincaré and Lefschetz duality results for these general perversities. We also produce versions of both the sheaf-theoretic and the piecewise linear chain-theoretic intersection pairings that carry no restrictions on the input perversities.     

On the intersection problem for linear sets in the projective line

The aim of this paper is to investigate the intersection problem between two linear sets in the projective line over a finite field. In particular, we analyze the intersection between two clubs with possibly different maximum fields of linearity. We also consider the intersection between a certain linear set of maximum rank and any other linear set of the same rank. The strategy relies on the study of certain algebraic curves whose rational points describe the intersection of the two linear sets. Among other geometric and algebraic tools, function field theory and the Hasse–Weil bound play a crucial role. As an application, we give asymptotic results on semifields of BEL-rank two.