Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Fano plane

Known as: Fano configuration, Fano's Geometry 
In finite geometry, the Fano plane (after Gino Fano) is the finite projective plane of order 2, having the smallest possible number of points and… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
One of the most intriguing problems, in $q$-analogs of designs, is the existence question of an infinite family of $q$-analog of… Expand
  • table 1
  • table 2
  • table 3
  • table 5
  • table 4
Is this relevant?
2008
2008
We prove that the family of Q-Fano threefolds with Picard number one is birationally unbounded. 
Is this relevant?
2007
2007
Recently it has been observed that the group E{sub 7} can be used to describe a special type of quantum entanglement of seven… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A polynomial f is said to have the half-plane property if there is an open half-plane H ⊂ C such that f is non-zero whenever all… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2005
2005
Let PG2(2) be the Fano plane, i. e., the unique hypergraph with 7 triples on 7 vertices in which every pair of vertices is… Expand
  • figure 1
Is this relevant?
2002
2002
Abstract.We give a structure theorem for n-dimensional smooth toric Fano varieties whose associated polytope has ``many'' pairs… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We discuss how the theory of quantum cohomology may be generalized to "gravitational quantum cohomology" by studying topological… Expand
  • figure 1
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Let Z be a compact complex (2n+1)-manifold which carries a complex contact structure, meaning a codimension-1 holomorphic sub… Expand
Is this relevant?
1986
1986
Abstract A matroid has the max-flow min-cut property if a certain circuit packing problem has an optimal solution that is… Expand
Is this relevant?
Highly Cited
1977
Highly Cited
1977
Abstract The max-flow min-cut theorem of Ford and Fulkerson (for undirected networks) may be regarded as a statement about the… Expand
Is this relevant?