Related papers: Four-Dimensional Gallant-Lambert-Vanstone Scalar M…

The experimental techniques have evolved to a stage where various examples of nanostructures with non-trivial shapes have been synthesized, turning the dynamics of a constrained particle and the link with geometry into a realistic and…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$, and let $K$ be a number field of degree four that is Galois over $\mathbb{Q}$. The goal of this article is to classify the different isomorphism types of $E(K)_{\text{tors}}$.

We study the problem of determining the groups that can arise as the torsion subgroup of an elliptic curve over a fixed quadratic field, building on work of Kamienny-Najman, Krumm, and Trbovi\'c. By employing techniques to study rational…

Using Serre's proposed complement to Shih's Theorem, we obtain PSL_2(F_p) as a Galois group over Q for at least 614 new primes p. Under the assumption that rational elliptic curves with odd analytic rank have positive rank, we obtain Galois…

Gaussian processes (GPs) with derivatives are useful in many applications, including Bayesian optimization, implicit surface reconstruction, and terrain reconstruction. Fitting a GP to function values and derivatives at $n$ points in $d$…

Levels and sublevels in arrangements -- and, dually, $k$-sets and $(\leq k)$-sets -- are fundamental notions in discrete and computational geometry and natural generalizations of convex polytopes, which correspond to the $0$-level. A…

Let $F_k$ be the set of graphs on $k$ vertices. For a graph $G$, a $k$-decomposition is a set of induced subgraphs of $G$, each isomorphic to an element of $F_k$, such that each pair of vertices of $G$ is in exactly one element of the set.…

We give an algorithm for computing an inseparable endomorphism of a supersingular elliptic curve $E$ defined over $\mathbb F_{p^2}$, which, conditional on GRH, runs in expected $O(p^{1/2}(\log p)^2(\log\log p)^3)$ bit operations and…

Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components.…

The paper describes a sparse direct solver for the linear systems that arise from the discretization of an elliptic PDE on a two dimensional domain. The scheme decomposes the domain into thin subdomains, or ``slabs'' and uses a two-level…

We address an algorithm for the least squares fitting of a subset of the eigenvalues of an unknown Hermitian matrix lying an an affine subspace, called the Lift and Projection (LP) method, due to Chen and Chu (SIAM Journal on Numerical…

We explicitly compute family GW invariants of elliptic surfaces for primitive classes. That involves establishing a TRR formula and a symplectic sum formula for elliptic surfaces and then determining the GW invariants using an argument from…

We determine the quantum multiplication with divisor classes on the Hilbert scheme of points on an elliptic surface $S \to \Sigma$ for all curve classes which are contracted by the induced fibration $S^{[n]} \to \Sigma^{[n]}$. The formula…

We give explicit formulas as well as a quadratic time algorithm to solve (so called) generalized Vandermonde's systems of p linear equations and n variables. It allows in particular to find all (so called Lagrange's) interpolation polynoms…

As another application of the degeneration methods of [V3], we count the number of irreducible degree $d$ geometric genus $g$ plane curves, with fixed multiple points on a conic $E$, not containing $E$, through an appropriate number of…

In this note, we show how certain everywhere-regular real rational function solutions of the KP1 equation ("multi-lumps") can be constructed via the polynomial analogs of theta functions from singular rational curves with cusps. We use two…

We present a new model for hybrid planarity that relaxes existing hybrid representations. A graph $G = (V,E)$ is $(k,p)$-planar if $V$ can be partitioned into clusters of size at most $k$ such that $G$ admits a drawing where: (i) each…

A stagewise decomposition algorithm called value function gradient learning (VFGL) is proposed for large-scale multistage stochastic convex programs. VFGL finds the parameter values that best fit the gradient of the value function within a…

The low-energy expansion of genus-one string amplitudes produces infinite families of non-holomorphic modular forms after each step of integrating over a point on the torus worldsheet which are known as elliptic modular graph forms (eMGFs).…

A one-sided Jacobi hyperbolic singular value decomposition (HSVD) algorithm, using a massively parallel graphics processing unit (GPU), is developed. The algorithm also serves as the final stage of solving a symmetric indefinite eigenvalue…