English
Related papers

Related papers: On a good reduction criterion for proper polycurve…

200 papers

Orthogonal polynomials in two variables on cubic curves are considered, including the case of elliptic curves. For an integral with respect to an appropriate weight function defined on a cubic curve, an explicit basis of orthogonal…

Numerical Analysis · Mathematics 2020-11-24 Marco Fasondini , Sheehan Olver , Yuan Xu

The exact complexity of geometric cuts and bisections is the longstanding open problem including even the dimension one. In this paper, we resolve this problem for dimension one (the real line) by designing an exact polynomial time…

Data Structures and Algorithms · Computer Science 2012-07-05 Marek Karpinski , Andrzej Lingas , Dzmitry Sledneu

We examine the ranks of a subfamily of curves in a previous article, which are derived from the existence of solutions to certain Pell equations. We exhibit an abundance of curves of moderately large rank, and prove under mild conditions…

Number Theory · Mathematics 2022-11-23 P. G. Walsh

In this article, we give a criterion for the dual Selmer group of an elliptic curve which has either good ordinary reduction or multiplicative reduction at every prime above $p$ to satisfy the $\M_H(G)$-conjecture. As a by-product of our…

Number Theory · Mathematics 2015-01-05 Meng Fai Lim

Let $p\ge5$ be a prime and $T$ a Kodaira type of the special fiber of an elliptic curve. We estimate the number of elliptic curves over $\mathbb Q$ up to height $X$ with Kodaira type $T$ at $p$. This enables us find the proportion of…

Number Theory · Mathematics 2020-03-24 Mohammad Sadek

The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…

Numerical Analysis · Mathematics 2021-02-26 Aleš Vavpetič , Emil Žagar

In this work we prove a criterion for an algebraic continued fraction to have a proper palindromic symmetry in dimension $4$. As a multidimensional generalization of continued fractions, we consider Klein polyhedra.

Number Theory · Mathematics 2022-06-01 I. A. Tlyustangelov

Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the…

Algebraic Geometry · Mathematics 2020-06-16 Julia Bernatska , Yaacov Kopeliovich

Let C be a hyperelliptic curve of good reduction defined over a discrete valuation field K with algebraically closed residue field k. Assume moreover that char k \ne 2. Given d \in K^*\K^*2, we introduce an explicit description of the…

Number Theory · Mathematics 2014-09-26 Mohammad Sadek

Suppose $Y$ is a smooth variety equipped with a top form. We prove a simple theorem giving a sharp lower bound on the geometric genus of a family of subvarieties of $Y$, in terms of the dimension of this family. Two elementary applications…

Algebraic Geometry · Mathematics 2024-10-16 Yeuk Hay Joshua Lam , Federico Moretti , Giovanni Passeri

An elliptic curve $E$ over $\mathbb{Q}$ is said to be good if $N_{E}^{6}<\max\!\left\{ \left\vert c_{4}^{3}\right\vert ,c_{6}^{2}\right\} $ where $N_{E}$ is the conductor of $E$ and $c_{4}$ and $c_{6}$ are the invariants associated to a…

Number Theory · Mathematics 2022-08-30 Alexander J. Barrios

Let K be a non-archimedean field, and let f in K(z) be a rational function of degree d>1. If f has potentially good reduction, we give an upper bound, depending only on d, for the minimal degree of an extension L/K such that f is conjugate…

Number Theory · Mathematics 2015-01-05 Robert L. Benedetto

We give an optimal necessary and sufficient condition for the quotient polynomial and remainder in the division algorithm to have positive coefficients.

Classical Analysis and ODEs · Mathematics 2013-08-15 Mark B. Villarino

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

Combinatorics · Mathematics 2025-06-02 Marie-Charlotte Brandenburg , Jesús A. De Loera , Chiara Meroni

In this paper we prove in detail a criterion for an algebraic continued fraction to have a proper palindromic symmetry in dimension $4$. We also present a new proof of the criterion for an algebraic continued fraction to have a proper…

Number Theory · Mathematics 2022-12-12 Ibragim A. Tlyustangelov

We study stable reduction of curves in the case where a tamely ramified base extension is sufficient. If X is a smooth curve defined over the fraction field of a strictly henselian discrete valuation ring, there is a criterion, due to T.…

Algebraic Geometry · Mathematics 2007-11-07 Lars Halvard Halle

We introduce a simple diagnostic test for assessing the overall or partial goodness of fit of a linear causal model with errors being independent of the covariates. In particular, we consider situations where hidden confounding is…

Methodology · Statistics 2023-03-06 Christoph Schultheiss , Peter Bühlmann , Ming Yuan

The paper studies modular reduction techniques for abstract regular and chiral polytopes, with two purposes in mind: first, to survey the literature about modular reduction in polytopes; and second, to apply modular reduction, with moduli…

Combinatorics · Mathematics 2019-08-15 B. Monson , Egon Schulte

A parallelohedron is called reducible, if it can be represented as a direct product of two parallelohedra of lower dimension. In his Ph.D. thesis (2005) the first author proved a criterion of reducibility of a parallelohedron in terms of…

Metric Geometry · Mathematics 2013-06-05 Andrei Ordine , Alexander Magazinov

We study a popular algorithm for fitting polynomial curves to scattered data based on the least squares with gradient weights. We show that sometimes this algorithm admits a substantial reduction of complexity, and, furthermore, find…

Computational Complexity · Computer Science 2010-08-12 N. Chernov , C. Lesort , N. Simanyi
‹ Prev 1 3 4 5 6 7 10 Next ›