Related papers: An arithmetic count of osculating lines

We give an explicit formula for the $27$ lines of a smooth cubic surface near the Fermat surface. Our formula involves convergent power series with coefficients in the extension of rational numbers with the sixth root of unity. Our main…

The shape of a number field $K$ of degree $n$ is defined as the equivalence class of the lattice of integers with respect to linear operations that are composites of rotations, reflections, and positive scalar dilations. The shape is a…

In this paper we count the number of paths and cycles in complete graphs by using the number $e$. Also, we compute the number of derangements in same way. Connection by $e$ yields some nice formulas for the number of derangements, such as…

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

Given a real finite hyperplane arrangement A and a point p not on any of the hyperplanes, we define an arrangement vo(A,p), called the *valid order arrangement*, whose regions correspond to the different orders in which a line through p can…

A collection $ \Delta $ of simple closed curves on an orientable surface is an algebraic $ k $-system if the algebraic intersection number $\langle \alpha,\beta \rangle$ is equal to $k $ in absolute value for every $ \alpha , \beta \in…

A classical result by Erd\H{o}s, and later on by Bondy and Simonivits, states that every $n$-vertex graph with no cycle of length $2k$ has at most $O(n^{1+1 /k})$ edges. This bound is known to be tight when $k \in \{2,3,5\},$ but it is a…

We study hyperplane covering problems for finite grid-like structures in $\mathbb{R}^d$. We call a set $\mathcal{C}$ of points in $\mathbb{R}^2$ a conical grid if the line $y = a_i$ intersects $\mathcal{C}$ in exactly $i$ points, for some…

We describe an algorithm for counting points on an arbitrary hyperelliptic curve over a finite field of odd characteristic, using Monsky-Washnitzer cohomology to compute a p-adic approximation to the characteristic polynomial of Frobenius.…

For an integer $k\geq 1$, a graph is called a $k$-circulant if its automorphism group contains a cyclic semiregular subgroup with $k$ orbits on the vertices. We show that, if $k$ is even, there exist infinitely many cubic arc-transitive…

For certain real quadratic fields $K$ with sufficiently small discriminant we produce explicit unit generators for specific ray class fields of $K$ using a numerical method that arose in the study of complete sets of equiangular lines in…

Let k be a regular F_p-algebra, let A = k[x,y]/(x^b - y^a) be the coordinate ring of a planar cuspical curve, and let I = (x,y) be the ideal that defines the cusp point. We give a formula for the relative K-groups K_q(A,I) in terms of the…

In this paper we asymptotically count $d$-regular $k$-uniform hypergraphs on $n$ vertices, provided $k$ is fixed and $d=d(n)=o(n^{1/2})$. In doing so, we extend to hypergraphs a switching technique of McKay and Wormald.

This paper presents fundamental algorithms for the computational theory of quadratic forms over number fields. In the first part of the paper, we present algorithms for checking if a given non-degenerate quadratic form over a fixed number…

In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where every pair of circles must either be disjoint or intersect at a right angle. Using geometric arguments, we show that such arrangements have…

We give an upper bound for the number of points of a hypersurface over a finite field that has no lines on, in terms of the dimension, the degree, and the number of the elements of the finite field.

We study the following question: given a set P of 3d-2 points and an immersed curve G in the real plane R^2, all in general position, how many real rational plane curves of degree d pass through these points and are tangent to this curve.…

We find a closed formula for the number $\operatorname{hyp}(g)$ of hyperelliptic curves of genus $g$ over a finite field $k=\mathbb{F}_q$ of odd characteristic. These numbers $\operatorname{hyp}(g)$ are expressed as a polynomial in $q$ with…

We compute the fundamental groups of the complements of the family of real conic-line arrangements with up to two conics which are tangent to each other at two points, with an arbitrary number of tangent lines to both conics. All the…

An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is…