An explicit formula for the number of finite cyclic projective planes or planar . Ž . difference sets is derived by applying Ramanujan sums Von Sterneck numbers and Mobius inversion over the set partition lattice to counting one-to-one solution vectors of multivariable linear congruences.
The Number of Plane Corner Cuts
✍ Scribed by Sylvie Corteel; Gaël Rémond; Gilles Schaeffer; Hugh Thomas
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 61 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
✦ Synopsis
In this article we give a generating function for the number # 2 n cut of plane corner cuts with respect to their size and prove that there exist two positive constants c and c such that, for all n > 1,
We rely on [Onn-Sturmfels] for motivations for this work and we simply recall the following definition: a (plane) corner cut of size n is a n-element subset λ of 2 which is cut off by a line, i.e., there exist w in 2 and w 0 in such that λ = v ∈ 2 w • v < w 0 . We denote by 2 n cut the set of corner cuts of size n.
📜 SIMILAR VOLUMES
Let D n denote a family of disjoint n disks in the plane. The max-min ratio λ of D n is the ratio (the maximum radius)/(the minimum radius) among the disks in D n . We prove that (1) If log λ = o(n), then there is a line both sides of which contain n/2 -o(n) intact disks (such a line is called an al
Motivated by the enumeration of a class of plane partitions studied by Proctor and by considerations about symmetry classes of plane partitions, we consider the problem of enumerating lozenge tilings of a hexagon with ''maximal staircases'' removed from some of its vertices. The case of one vertex c
## Abstract In this paper, we estimate an upper bound of the number of the cusps of a cuspidal plane curve. We prove that a cuspidal plane curve of genus __g__ has no more than (21__g__ +17)/2 cusps. For example, a rational cuspidal plane curve has no more than 8 cusps and an elliptic one has no mo
## Abstract For a finite projective plane $\Pi$, let $\bar {\chi} (\Pi)$ denote the maximum number of classes in a partition of the point set, such that each line has at least two points in the same partition class. We prove that the best possible general estimate in terms of the order of projectiv