相关论文: Real Zeuthen numbers for two lines
We consider an infinite graph with the vertex set $\mathbb{Z}^2$ and edges connecting the vertices iff the Euclidean distance between the respective points is an integer, and the points do not lie on the same horizontal or vertical.…
For every $n = 2^k > 8$ there exist exactly $[(k+1)/2]$ mutually nonequivalent $Z_4$-linear extended perfect codes with distance 4. All these codes have different ranks.
The purpose of this paper is to exhibit infinite families of conjugate projective curves in a number field whose complement have the same abelian fundamental group, but are non-homeomorphic. In particular, for any $d>3$ we find Zariski…
In this paper we obtain an explicit formula for the number of curves in a compact complex surface $X$ (passing through the right number of generic points), that has up to one node and one singularity of codimension $k$, provided the total…
We use stable maps, and their stable lifts to the Semple bundle variety of second-order curvilinear data, to calculate certain characteristic numbers for rational plane curves. These characteristic numbers involve first-order (tangency) and…
In $d$-dimensional space (over any field), given a set of lines, a joint is a point passed through by $d$ lines not all lying in some hyperplane. The joints problem asks to determine the maximum number of joints formed by $L$ lines, and it…
For each integer $k \in [0,9]$, we count the number of plane cubic curves defined over a finite field $\mathbb{F}_q$ that do not share a common component and intersect in exactly $k\ \mathbb{F}_q$-rational points. We set this up as a…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
Let $p',q'\in R^n$. Write $p'\sim q'$ if $p'-q'$ is a multiple of $(1,\ldots,1)$. Two different points $p$ and $q$ in $R^n/\sim$ uniquely determine a tropical line $L(p,q)$, passing through them, and stable under small perturbations. This…
We obtain several new results contributing to the theory of real equiangular line systems. Among other things, we present a new general lower bound on the maximum number of equiangular lines in d dimensional Euclidean space; we describe the…
We study the number of rational points of smooth projective curves over finite fields in some relative situations in the spirit of a previous paper from an euclidean point of vue. We prove some kinds of relative Weil bounds, derived from…
Let $\calP$ be a general pencil of curves of degree $d$ in the projective plane. In this paper we review the computation of the number of curves in $\calP$ that have a hyperflex line, a flex bitangent line or a tritangent line. Then we…
A $d$-regular graph on $n$ nodes has at most $T_{\max} = \frac{n}{3} \tbinom{d}{2}$ triangles. We compute the leading asymptotics of the probability that a large random $d$-regular graph has at least $c \cdot T_{\max}$ triangles, and…
Kelly's theorem states that a set of $n$ points affinely spanning $\mathbb{C}^3$ must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least…
The n-th hull of a union of curves in R^3 is the set of points with the property: Any plane passing through the point intersects the curves at least 2n times. The hull number u(L) of a link L is defined as the minimum number of non-empty…
We prove that for any degree d, there exist (families of) finite sequences a_0, a_1,..., a_d of positive numbers such that, for any real polynomial P of degree d, the number of its real roots is less than or equal to the number of the…
First we give a sharp upper bound for the cardinal $m$ of a minimal set of generators for the module of Jacobian syzygies of a complex projective reduced plane curve $C$. Next we discuss the sharpness of an upper bound, given by A. du…
We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…
By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…
This paper provides a non-standard analogue of Bezout's theorem. This is acheived by showing that, in all characteristics, the notion of Zariski multiplicity coincides with intersection multiplicity when we consider the full families of…