Related papers: On a good reduction criterion for proper polycurve…
We study hyperbolicity for quasi-projective varieties where the boundary divisor consists of n+1 numerically parallel effective divisors on a complex projective variety of dimension n, allowing non-empty intersection. Under explicit local…
Let $C/K$ be a smooth plane quartic over a discrete valuation field. We characterize the type of reduction (i.e. smooth plane quartic, hyperelliptic genus 3 curve or bad) over $K$ in terms of the existence of a special plane quartic model…
We prove the existence and describe limiting curves resulting from deviations in partial sums in the ergodic theorem for cylindrical functions and polynomial (self-similar) adic systems. For a general ergodic measure-preserving…
Sufficient dimension reduction methods often require stringent conditions on the joint distribution of the predictor, or, when such conditions are not satisfied, rely on marginal transformation or reweighting to fulfill them approximately.…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
A somewhat pretentious presentation of number systems (N, Z, Q, R, C, Q_p, >...). The problem of a p-adic characterisation of good-reduction p-adic curves is posed.
A connected, linearly ordered path $\ga \subset R^n$ satisfying $$ x_1\prec x_2\prec x_3 \in \ga, and x_1 \prec x_2 \prec x_3 \Rightarrow |x_2 - x_1| \leq | x_3 - x_1|$$ is shown to be a rectifiable curve; a priori bounds for its length are…
A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…
We give a criterion for a quasi-ordinary polynomial to be irreducible. The criterion is based on the notion of approximate roots and that of generalized Newton polygons.
In this paper we considerably extend the class of known $\alpha$-minimizing hypercones using sub-calibration methods. Indeed, the improvement of previous results follows from a careful analysis of special cubic and quartic polynomials.
A widely believed conjecture predicts that curves of bounded geometric genus lying on a variety of general type form a bounded family. One may even ask whether the canonical degree of a curve $C$ in a variety of general type is bounded from…
In this paper, we explore three combinatorial descriptions of semistable types of hyperelliptic curves over local fields: dual graphs, their quotient trees by the hyperelliptic involution, and configurations of the roots of the defining…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…
A promising approach to investigating high-dimensional problems is to identify their intrinsically low-dimensional features, which can be achieved through recently developed techniques for effective low-dimensional representation of…
A new necessary separability criterion that relates the structures of the total density matrix and its reductions is given. The method used is based on the realignment method [K. Chen and L.A. Wu, Quant. Inf. Comput. 3, 193 (2003)]. The new…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the curvature error. Parametric polynomial curves of low degree are used and a geometric continuity is…
We are concerned with the numerical solution obtained by splitting methods of certain parabolic partial differential equations. Splitting schemes of order higher than two with real coefficients necessarily involve negative coefficients. It…
The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a…
We introduce a natural notion of depth that applies to individual cutting planes as well as entire families. This depth has nice properties that make it easy to work with theoretically, and we argue that it is a good proxy for the practical…