Related papers: An arithmetic count of osculating lines
Paths that consist of up-steps of one unit and down-steps of $k$ units, being bounded below by a horizontal line $-t$, behave like $t+1$ ordered tuples of $k$-Dyck paths, provided that $t\le k$. We describe the general case, allowing $t$…
Let $S$ be a smooth del Pezzo surface over a field $k$ of characteristic $\neq 2, 3$. We define an invariant in the Grothendieck-Witt ring $GW(k)$ for "counting" rational curves in a curve class $D$ of fixed positive degree (with respect to…
We study the number of elliptic curves, up to isomorphism, over a fixed quartic field $K$ having a prescribed torsion group $T$ as a subgroup. Let $T=\Z/m\Z \oplus \Z/n\Z$, where $m|n$, be a torsion group such that the modular curve…
We prove an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm for computing such a line was proposed by Mukhopadhyay et…
We study plane algebraic curves defined over a field k of arbitrary characteristic as coverings of the the projective line and the problem of enumerating branched coverings of $\mathbb{P}^{1}$ by using combinatorial methods.
Based on fundamental properties of light scattering by a particle we reveal the existence of the ultimate upper limit for the light absorption by any partial mode. First, we obtain this result for scattering of a plane wave by a symmetric…
Given an elliptic curve E over a number field k, the Galois action on the torsion points of E induces a Galois representation, \rho_E : Gal(\bar{k}/k) \to GL_2(\hat{Z}). For a fixed number field k, we describe the image of \rho_E for a…
Given asymptotic counts in number theory, a question of Venkatesh asks what is the topological nature of lower order terms. We consider the arithmetic aspect of the inertia stack of an algebraic stack over finite fields to partially answer…
In this paper we present new results about arrangements of lines and osculating curves associated to the Fermat curves in the projective plane. We first consider the sextactic points on the Fermat curves and show that they are distributed…
Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the…
In this note we complete the calculation of the number of $GL(\mathbb R^n)$-orbits on $\Lambda^k(\mathbb R^n)^*$, by treating the cases $(n,k)= (7,4)$ and $(8,5)$ not covered in the literature. We also calculate the number of of…
The number of Young Tableaux whose shape is a k by n rectangle is famously (nk)! 0! ... (k-1)!/((n+k-1)!(n+k-2)!... n!) implying that for each specific k, that sequence satisfies a linear recurrence equation with polynomial coefficients of…
An $(n_k)$-configuration is a set of $n$ points and $n$ lines in the projective plane such that their point-line incidence graph is $k$-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are…
We obtain sharp bounds for the number of n--cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. We prove sharp estimates on both the sum of k-th…
We give a method of counting the number of curves with a given type of singularity in a suitably ample linear series on a smooth surface using punctual Hilbert schemes. The types of singulaties for which our methods suffice include the…
We establish that, over certain ground fields, the set of osculating tangents of Cayley's ruled cubic surface gives rise to a (maximal partial) spread which is also a dual (maximal partial) spread. It is precisely the Betten-Walker spreads…
Let $P$ be a set of $n$ points in the plane, each point moving along a given trajectory. A {\em $k$-collinearity} is a pair $(L,t)$ of a line $L$ and a time $t$ such that $L$ contains at least $k$ points at time $t$, the points along $L$ do…
A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on…
We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.