|
Truncated Projective Plane
In geometry, a truncated projective plane (TPP), also known as a dual affine plane, is a special kind of a hypergraph or geometric configuration that is constructed in the following way. * Take a finite projective plane. * Remove one of the points (vertices) in the plane. * Remove all lines (edges) containing that point. These objects have been studied in many different settings, often independent of one another, and so, many terminologies have been developed. Also, different areas tend to ask different types of questions about these objects and are interested in different aspects of the same objects. Example: the Pasch hypergraph Consider the Fano plane, which is the projective plane of order 2. It has 7 vertices and 7 edges . It can be truncated e.g. by removing the vertex 7 and the edges containing it. The remaining hypergraph is the TPP of order 2. It has 6 vertices and 4 edges . It is a tripartite hypergraph with sides ,, (which are exactly the neighbors of the removed ve ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hypergraph
In mathematics, a hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge connects exactly two vertices. Formally, an undirected hypergraph H is a pair H = (X,E) where X is a set of elements called ''nodes'' or ''vertices'', and E is a set of non-empty subsets of X called '' hyperedges'' or ''edges''. Therefore, E is a subset of \mathcal(X) \setminus\, where \mathcal(X) is the power set of X. The size of the vertex set is called the ''order of the hypergraph'', and the size of edges set is the ''size of the hypergraph''. A directed hypergraph differs in that its hyperedges are not sets, but ordered pairs of subsets of X, with each pair's first and second entries constituting the tail and head of the hyperedge respectively. While graph edges connect only 2 nodes, hyperedges connect an arbitrary number of nodes. However, it is often desirable to study hypergraphs where all hyperedges have the same ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Non-Desarguesian Plane
In mathematics, a non-Desarguesian plane is a projective plane that does not satisfy Desargues' theorem (named after Girard Desargues), or in other words a plane that is not a Desarguesian plane. The theorem of Desargues is true in all projective spaces of dimension not 2; in other words, the only projective spaces of dimension not equal to 2 are the classical projective geometries over a field (or division ring). However, David Hilbert found that some projective planes do not satisfy it. The current state of knowledge of these examples is not complete. Examples There are many examples of both finite and infinite non-Desarguesian planes. Some of the known examples of infinite non-Desarguesian planes include: *The Moulton plane. *Moufang planes over alternative division rings that are not associative, such as the projective plane over the octonions. Since all finite alternative division rings are fields ( Artin–Zorn theorem), the only non-Desarguesian Moufang planes are infi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ergebnisse Der Mathematik Und Ihrer Grenzgebiete
''Ergebnisse der Mathematik und ihrer Grenzgebiete''/''A Series of Modern Surveys in Mathematics'' is a series of scholarly monographs published by Springer Science+Business Media. The title literally means "Results in mathematics and related areas". Most of the books were published in German or English, but there were a few in French and Italian. There have been several sequences, or ''Folge'': the original series, neue Folge, and 3.Folge. Some of the most significant mathematical monographs of 20th century appeared in this series. Original series The series started in 1932 with publication of ''Knotentheorie'' by Kurt Reidemeister as "Band 1" (English: volume 1). There seems to have been double numeration in this sequence. Neue Folge This sequence started in 1950 with the publication of ''Transfinite Zahlen'' by Heinz Bachmann. The volumes are consecutively numbered, designated as either "Band" or "Heft". A total of 100 volumes was published, often in multiple editions, but pre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Springer-Verlag
Springer Science+Business Media, commonly known as Springer, is a German multinational publishing company of books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing. Originally founded in 1842 in Berlin, it expanded internationally in the 1960s, and through mergers in the 1990s and a sale to venture capitalists it fused with Wolters Kluwer and eventually became part of Springer Nature in 2015. Springer has major offices in Berlin, Heidelberg, Dordrecht, and New York City. History Julius Springer founded Springer-Verlag in Berlin in 1842 and his son Ferdinand Springer grew it from a small firm of 4 employees into Germany's then second largest academic publisher with 65 staff in 1872.Chronology ". Springer Science+Business Media. In 1964, Springer expanded its business international ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cambridge University Press
Cambridge University Press is the university press of the University of Cambridge. Granted letters patent by King Henry VIII in 1534, it is the oldest university press in the world. It is also the King's Printer. Cambridge University Press is a department of the University of Cambridge and is both an academic and educational publisher. It became part of Cambridge University Press & Assessment, following a merger with Cambridge Assessment in 2021. With a global sales presence, publishing hubs, and offices in more than 40 countries, it publishes over 50,000 titles by authors from over 100 countries. Its publishing includes more than 380 academic journals, monographs, reference works, school and university textbooks, and English language teaching and learning publications. It also publishes Bibles, runs a bookshop in Cambridge, sells through Amazon, and has a conference venues business in Cambridge at the Pitt Building and the Sir Geoffrey Cass Sports and Social Centre. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Geometry
Finite is the opposite of infinite. It may refer to: * Finite number (other) * Finite set, a set whose cardinality (number of elements) is some natural number * Finite verb, a verb form that has a subject, usually being inflected or marked for person and/or tense or aspect * "Finite", a song by Sara Groves from the album ''Invisible Empires'' See also * * Nonfinite (other) Nonfinite is the opposite of finite * a nonfinite verb is a verb that is not capable of serving as the main verb in an independent clause * a non-finite clause In linguistics, a non-finite clause is a dependent or embedded clause that represen ... {{disambiguation fr:Fini it:Finito ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fractional Matching
In graph theory, a fractional matching is a generalization of a matching in which, intuitively, each vertex may be broken into fractions that are matched to different neighbor vertices. Definition Given a graph ''G'' = (''V'', ''E''), a fractional matching in ''G'' is a function that assigns, to each edge ''e'' in ''E'', a fraction ''f''(''e'') in , 1 such that for every vertex ''v'' in ''V'', the sum of fractions of edges adjacent to ''v'' is at most 1: \forall v\in V: \sum_f(e)\leq 1 A matching in the traditional sense is a special case of a fractional matching, in which the fraction of every edge is either 0 or 1: ''f''(''e'') = 1 if ''e'' is in the matching, and ''f''(''e'') = 0 if it is not. For this reason, in the context of fractional matchings, usual matchings are sometimes called ''integral matchings''. The size of an integral matching is the number of edges in the matching, and the matching number \nu(G) of a graph ''G'' is the largest size of a matching in ''G''. A ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fractional Matching In Hypergraphs
In graph theory, a matching in a hypergraph is a set of hyperedges, in which every two hyperedges are disjoint. It is an extension of the notion of matching in a graph. Definition Recall that a hypergraph is a pair , where is a set of vertices and is a set of subsets of called ''hyperedges''. Each hyperedge may contain one or more vertices. A matching in is a subset of , such that every two hyperedges and in have an empty intersection (have no vertex in common). The matching number of a hypergraph is the largest size of a matching in . It is often denoted by . As an example, let be the set Consider a 3-uniform hypergraph on (a hypergraph in which each hyperedge contains exactly 3 vertices). Let be a 3-uniform hypergraph with 4 hyperedges: : Then admits several matchings of size 2, for example: : : However, in any subset of 3 hyperedges, at least two of them intersect, so there is no matching of size 3. Hence, the matching number of is 2. Intersec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ryser's Conjecture
In graph theory, Ryser's conjecture is a conjecture relating the maximum matching size and the minimum transversal size in hypergraphs. This conjecture first appeared in 1971 in the Ph.D. thesis of J. R. Henderson, whose advisor was Herbert John Ryser. Preliminaries A matching in a hypergraph is a set of hyperedges such that each vertex appears in at most one of them. The largest size of a matching in a hypergraph ''H'' is denoted by \nu(H). A transversal (or vertex cover) in a hypergraph is a set of vertices such that each hyperedge contains at least one of them. The smallest size of a transversal in a hypergraph ''H'' is denoted by \tau(H). For every ''H'', \nu(H)\leq \tau(H), since every cover must contain at least one point from each edge in any matching. If H is ''r''-uniform (each hyperedge has exactly ''r'' vertices), then \tau(H) \leq r\cdot \nu(H), since the union of the edges from any maximal matching is a set of at most ''rv'' vertices that meets every edge. T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Duality (projective Geometry)
In geometry, a striking feature of projective planes is the symmetry of the roles played by points and lines in the definitions and theorems, and ( plane) duality is the formalization of this concept. There are two approaches to the subject of duality, one through language () and the other a more functional approach through special mappings. These are completely equivalent and either treatment has as its starting point the axiomatic version of the geometries under consideration. In the functional approach there is a map between related geometries that is called a ''duality''. Such a map can be constructed in many ways. The concept of plane duality readily extends to space duality and beyond that to duality in any finite-dimensional projective geometry. Principle of duality A projective plane may be defined axiomatically as an incidence structure, in terms of a set of ''points'', a set of ''lines'', and an incidence relation that determines which points lie on which lines. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isomorphic (mathematics)
In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word isomorphism is derived from the Ancient Greek: ἴσος ''isos'' "equal", and μορφή ''morphe'' "form" or "shape". The interest in isomorphisms lies in the fact that two isomorphic objects have the same properties (excluding further information such as additional structure or names of objects). Thus isomorphic structures cannot be distinguished from the point of view of structure only, and may be identified. In mathematical jargon, one says that two objects are . An automorphism is an isomorphism from a structure to itself. An isomorphism between two structures is a canonical isomorphism (a canonical map that is an isomorphism) if there is only one isomorphism between the two structures (as it is the case for solutions of a unive ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Configuration (geometry)
In mathematics, specifically projective geometry, a configuration in the plane consists of a finite set of points, and a finite arrangement of lines, such that each point is incident to the same number of lines and each line is incident to the same number of points. Although certain specific configurations had been studied earlier (for instance by Thomas Kirkman in 1849), the formal study of configurations was first introduced by Theodor Reye in 1876, in the second edition of his book ''Geometrie der Lage'', in the context of a discussion of Desargues' theorem. Ernst Steinitz wrote his dissertation on the subject in 1894, and they were popularized by Hilbert and Cohn-Vossen's 1932 book ''Anschauliche Geometrie'', reprinted in English as . Configurations may be studied either as concrete sets of points and lines in a specific geometry, such as the Euclidean or projective planes (these are said to be ''realizable'' in that geometry), or as a type of abstract incidence geometry. I ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
