Related papers: On a good reduction criterion for proper polycurve…
In this paper, we present some new results on the geometrically m-step solvable Grothendieck conjecture in anabelian geometry. Specifically, we show the (weak bi-anabelian and strong bi-anabelian) geometrically m-step solvable Grothendieck…
Two sets of conditions are presented for the compactness of a real plane algebraic curve, one sufficient and one necessary, in terms of the Newton polygon of the defining polynomial.
In this paper, we prove a `cut-by-curves criterion' for the overconvergence of integrable connections on certain rigid analytic spaces and certain varieties over $p$-adic fields.
We describe a simple, but effective, method for deriving families of elliptic curves, with high rank, all of whose members have the same torsion subgroup structure.
We prove an irreducibility criterion for polynomials with power series coefficients generalizing previous known results concerning quasi-ordinary polynomials.
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
In combinatorial optimization, partial variable assignments are called persistent if they agree with some optimal solution. We propose persistency criteria for the multicut and max-cut problem as well as fast combinatorial routines to…
The main purpose of this article is to prove that, under certain assumptions in a linear prediction setting, optimal methods based upon model reduction and even an optimal predictor can be provided. The optimality is formulated in terms of…
Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…
In this paper we develop the formalism of rational complex Bezier curves. This framework is a simple extension of the CAD paradigm, since it describes arc of curves in terms of control polygons and weights, which are extended to complex…
The existence of a finite global attractor for polynomial curve system has been known since the work of Belk et al. [4]. However, except in the hyperbolic case, the rate at which the pullback of a curve under a polynomial converges to the…
The roots of a smooth curve of hyperbolic polynomials may not in general be parameterized smoothly, even not $C^{1,\alpha}$ for any $\alpha > 0$. A sufficient condition for the existence of a smooth parameterization is that no two of the…
This is the continuation of the article by the author that proves a broader class of families admitting the theorem of restriction of sections other than Abelian varieties and gives new examples of pseudo-N\'eron models. In this work, we…
Proves that if a curve has totally split reduction and the corresponding skeleton (as a metric graph) is a chain of loops with generic edge lengths, then every divisor on the graph with imposed ramification at the rightmost vertex $p$ of…
We investigate lower bounds for the number of ideal and finite vertices of right-angled hyperbolic polyhedra of finite volume. We use a geometric method of orthogonal gluings to establish new bounds in low dimensions, specifically…
We extend the criterion of Kawatani and Okawa for indecomposability of the derived category of a smooth projective variety to arbitrary schemes. For relative schemes, we also give a criterion for the nonexistence of semiorthogonal…
In the famous paper of Deligne and Mumford, they proved that a proper hyperbolic curve over a discrete valuation field has stable reduction if and only if the Jacobian variety of the curve has stable reduction in the case where the residue…
A family of proper smooth curves of genus $\geq 2$, parametrised by an open dense subset $U$ of a normal variety $S$, extends to $S$ if the natural map $\pi_1(U) \to \pi_1(S)$ on fundamental groups is an isomorphism. The criterion of this…
We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality between successive levels of resolution using dynamic…
In reference [8] we have considered a wide class of "well-behaved" reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving a dichotomy theorem for the degree-structures induced by good…