Related papers: Computing local intersection multiplicity of plane…
We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…
In this paper, we study one-dimensional boundary blow up problems with Kirchhoff type nonlocal terms on an interval. We perform a bifurcation analysis on the problems and obtain the precise number of solutions according to the value of the…
In this article, we study the local existence of solutions for a wave equation with a nonlocal in time nonlinearity. Moreover, a blow-up results are proved under some conditions on the dimensional space, the initial data and the nonlinear…
We give an asymptotic formula for the number of elliptic curves over $\mathbb{Q}$ with bounded Faltings height. Silverman has shown that the Faltings height for elliptic curves over number fields can be expressed in terms of modular…
The characteristic numbers of smooth plane quartics are computed using intersection theory on a component of the moduli space of stable maps. This completes the verification of Zeuthen's prediction of characteristic numbers of smooth plane…
We describe a general algorithm for computing intersection pairings on arithmetic surfaces. We have implemented our algorithm for curves over $\mathbb Q$, and we show how to use it to compute regulators for a number of Jacobians of smooth…
We study the possibility of finite-time blow-up for a two dimensional Broadwell model. In a set of rescaled variables, we prove that no self-similar blow-up solution exists, and derive some a priori bounds on the blow-up rate. In the final…
Let $\mathbb F_{q^2}$ be the finite field with $q^2$ elements. We provide a simple and effective method, using reciprocal polynomials, for the construction of algebraic curves over $\mathbb F_{q^2}$ with many rational points. The curves…
Using the Semple bundle construction, we derive an intersection-theoretic formula for the number of simultaneous contacts of specified orders between members of a generic family of degree $d$ plane curves and finitely many fixed curves. The…
Given a graph G (or more generally a matroid embedded in a projective space), we construct a sequence of varieties whose geometry encodes combinatorial information about G. For example, the chromatic polynomial of G (giving at each m>0 the…
In the present paper, we focus on a weighted version of the Bounded Negativity Conjecture which predicts that for every smooth projective surface in characteristic zero the self-intersection numbers of reduced and irreducible curves are…
There is presented an algorithm for computing the topological degree for a large class of polynomial mappings. As an application there is given an effective algebraic formula for the intersection number of a polynomial immersion M --> R^2m,…
We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial…
We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…
The paper is an introduction to the use of the classical Newton-Puiseux procedure, oriented to an algorithmic description of it. This procedure enables to get polynomial approximations for parameterizations of branches of an algebraic plane…
In this paper, we study a nonlocal boundary blow up problem on an interval and obtain the precise asymptotic formula for solutions when the bifurcation parameter in the problem is large.
We prove the finiteness of the number of blow-analytic equivalence classes of embedded plane curve germs for any fixed number of branches and for any fixed value of $\mu'$ ---a combinatorial invariant coming from the dual graphs of good…
The article provides upper bounds for the blow-up time of a system of fractional differential equations in the Caputo sense. Furthermore, concrete examples of blow-up time estimation are given using a numerical algorithm of the…
We describe a new approach to the Schubert calculus on complete flag varieties using the volume polynomial associated with Gelfand-Zetlin polytopes. This approach allows us to compute the intersection products of Schubert cycles by…
In this paper, we give a quantum algorithm which solves collision problem in an expected polynomial time. Especially, when the function is two-to-one, we present a quantum algorithm which can find a collision with certainty in a worst-case…