In geometry, an affine plane is a system of points and lines that satisfy the following axioms:
Any two distinct points lie on a unique line.
Given any line and any point not on that line there is a unique line which contains the point and does not meet the given line. (Playfair's axiom)
There exist three non-collinear points (points not on a single line).
In an affine plane, two lines are called parallel if they are equal or disjoint. Using this definition, Playfair's axiom above can be replaced by:
Given a point and a line, there is a unique line which contains the point and is parallel to the line.
Parallelism is an equivalence relation on the lines of an affine plane.
Since no concepts other than those involving the relationship between points and lines are involved in the axioms, an affine plane is an object of study belonging to incidence geometry. They are non-degenerate linear spaces satisfying Playfair's axiom.
The familiar Euclidean plane is an affine plane. There are many finite and infinite affine planes. As well as affine planes over fields (and division rings), there are also many non-Desarguesian planes, not derived from coordinates in a division ring, satisfying these axioms. The Moulton plane is an example of one of these.
If the number of points in an affine plane is finite, then if one line of the plane contains n points then:
each line contains n points,
each point is contained in n + 1 lines,
there are n2 points in all, and
there is a total of n2 + n lines.
The number n is called the order of the affine plane.
All known finite affine planes have orders that are prime or prime power integers. The smallest affine plane (of order 2) is obtained by removing a line and the three points on that line from the Fano plane. A similar construction, starting from the projective plane of order 3, produces the affine plane of order 3 sometimes called the Hesse configuration. An affine plane of order n exists if and only if a projective plane of order n exists (however, the definition of order in these two cases is not the same).
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In combinatorial mathematics, a block design is an incidence structure consisting of a set together with a family of subsets known as blocks, chosen such that frequency of the elements satisfies certain conditions making the collection of blocks exhibit symmetry (balance). Block designs have applications in many areas, including experimental design, finite geometry, physical chemistry, software testing, cryptography, and algebraic geometry.
In mathematics, incidence geometry is the study of incidence structures. A geometric structure such as the Euclidean plane is a complicated object that involves concepts such as length, angles, continuity, betweenness, and incidence. An incidence structure is what is obtained when all other concepts are removed and all that remains is the data about which points lie on which lines. Even with this severe limitation, theorems can be proved and interesting facts emerge concerning this structure.
In mathematics, an incidence structure is an abstract system consisting of two types of objects and a single relationship between these types of objects. Consider the points and lines of the Euclidean plane as the two types of objects and ignore all the properties of this geometry except for the relation of which points are on which lines for all points and lines. What is left is the incidence structure of the Euclidean plane.
Whether cardiovascular risk scores geographically aggregate and inform on spatial development of atherosclerotic cardiovascular diseases (ASCVD) remains unknown. Our aim is to determine the spatial distribution of 10-year predicted cardiovascular risk and ...
2024
, , , , ,
We study how permutation symmetries in overparameterized multi-layer neural networks generate `symmetry-induced' critical points. Assuming a network with L layers of minimal widths r1∗,…,rL−1∗ reaches a zero-loss minimum at $ r_1^*! \c ...
We prove that every online learnable class of functions of Littlestone dimension d admits a learning algorithm with finite information complexity. Towards this end, we use the notion of a globally stable algorithm. Generally, the information complexity of ...