Related papers: Improved Weil and Tate pairings for elliptic and h…
This paper presents a new weak Galerkin (WG) method for elliptic interface problems on general curved polygonal partitions. The method's key innovation lies in its ability to transform the complex interface jump condition into a more…
A novel algorithm to solve the quadratic programming problem over ellipsoids is proposed. This is achieved by splitting the problem into two optimisation sub-problems, quadratic programming over a sphere and orthogonal projection. Next, an…
We establish improved convergence rates for curved boundary element methods applied to the three-dimensional (3D) Laplace and Helmholtz equations with smooth geometry and data. Our analysis relies on a precise analysis of the consistency…
We study the Weil representation $\rho$ of a curve over a $p$-adic field with potential reduction of compact type. We show that $\rho$ can be reconstructed from its stable reduction. For superelliptic curves of the form $y^n=f(x)$ at primes…
We propose a new approach for the study of the quadratic stochastic Euclidean bipartite matching problem between two sets of $N$ points each, $N\gg 1$. The points are supposed independently randomly generated on a domain…
A principled approach to cyclicality and intransitivity in paired comparison data is developed. The proposed methodology enables more precise estimation of the underlying preference profile and facilitates the identification of all cyclic…
A cycle of elliptic curves is a list of elliptic curves over finite fields such that the number of points on one curve is equal to the size of the field of definition of the next, in a cyclic way. We study cycles of elliptic curves in which…
In this paper, we investigate Mannheim pairs, Frenet-Mannheim curves and Weakened Mannheim curves with respect to the modified orthogonal frame in Euclidean 3-space(E 3 ). We obtain some characterizations of these curves.
Quadratic Chabauty is a $p$-adic method for determining rational points on curves. Local heights are arithmetic invariants used in the quadratic Chabauty method. We present an algorithm to compute these local heights for hyperelliptic…
We use the relations between quadrics, trace codes and algebraic curves to construct algebraic curves over finite fields with many points and to compute generalized Hamming weights of codes.
A couple of complex projective plane curves are said to make a Zariski pair if they have the same degree and the same type of singularities, but their embeddings in the projective plane are topologically different. In this paper, we present…
We analyze the distribution of unitarized L-polynomials Lp(T) (as p varies) obtained from a hyperelliptic curve of genus g <= 3 defined over Q. In the generic case, we find experimental agreement with a predicted correspondence (based on…
The procedure of Least Square-Errors curve fitting is extensively used in many computer applications for fitting a polynomial curve of a given degree to approximate a set of data. Although various methodologies exist to carry out curve…
By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.
Given two nonempty and disjoint intersections of closed and convex subsets, we look for a best approximation pair relative to them, i.e., a pair of points, one in each intersection, attaining the minimum distance between the disjoint…
We extend results of Cogolludo-Agustin and Libgober relating the Alexander polynomial of a plane curve $C$ with the Mordell--Weil rank of certain isotrivial families of jacobians over $\mathbf{P}^2$ of discriminant $C$. In the second part…
We describe a generalised method for ellipsoid fitting against a minimum set of data points. The proposed method is numerically stable and applies to a wide range of ellipsoidal shapes, including highly elongated and arbitrarily oriented…
We prove that the quadratically enriched count of rational curves in a smooth toric del Pezzo surface passing through $k$-rational points and pairs of conjugate points in quadratic field extensions $k\subset k(\sqrt{d_i})$ can be determined…
In the pairwise weighted spanner problem, the input consists of an $n$-vertex-directed graph, where each edge is assigned a cost and a length. Given $k$ vertex pairs and a distance constraint for each pair, the goal is to find a…
In this work, we studied the properties of the spherical indicatrices of a Bertrand curve and its mate curve and presented some characteristic properties in the cases that Bertrand curve and its mate curve are slant helices, spherical…