English
Related papers

Related papers: Newton polygons and p-integral bases

200 papers

Consider an algebraic equation $P(x,y)=0$ where $P\in \mathbb C[x,y] $ (or $\mathbb F[x,y]$ with $\mathbb F\subset \mathbb C$ a subfield) is a bivariate polynomial, it defines a plane algebraic curve. We provide an efficient method for…

Mathematical Physics · Physics 2024-06-03 Bertrand Eynard

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Number Theory · Mathematics 2022-01-19 Amit Ghosh , Kenneth Ward

A set of exactly computable orthonormal basis functions that are useful in computations involving constituent quarks is presented. These basis functions are distinguished by the property that they fall off algebraically in momentum space…

Nuclear Theory · Physics 2009-10-30 B. D. Keister , W. N. Polyzou

We propose a method for determining which integers can be written as a sum of two integral squares for quadratic fields $\Q(\sqrt{\pm p})$, where $p$ is a prime.

Number Theory · Mathematics 2010-04-20 Dasheng Wei

A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…

Optimization and Control · Mathematics 2011-11-10 Uwe Helmke , Knut Hüper , Jochen Trumpf

The Fourier transforms of polyhedral cones can be used, via Brion's theorem, to compute various geometric quantities of polytopes, such as volumes, moments, and lattice-point counts. We present a novel method of computing these conic…

Combinatorics · Mathematics 2018-08-02 Quang-Nhat Le

We use analytic combinatorics to give a direct proof of the closed formula for the generating function of $p$-Bernoulli numbers.

Combinatorics · Mathematics 2018-07-05 Markus Kuba

We investigate the folding problem that asks if a polygon P can be folded to a polyhedron Q for given P and Q. Recently, an efficient algorithm for this problem has been developed when Q is a box. We extend this idea to regular polyhedra,…

Computational Geometry · Computer Science 2021-06-01 Tonan Kamata , Akira Kadoguchi , Takashi Horiyama , Ryuhei Uehara

We present an algebraic structure in modules over integer rings with cardinality prime powers, which allows to define bases. With such structure, we prove a similar version for the basis extension theorem of linear algebra over fields.…

Rings and Algebras · Mathematics 2017-09-14 Ady Cambraia , Allan O. Moura , Anderson T. Silva

A Generalized Numeration Base is defined in this paper, and then particular cases are presented, such as Prime Base, Square Base, m-Power Base, Factorial Base, and operations in these bases. These bases are important for partitions of…

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

Let $K$ be the number field determined by a monic irreducible polynomial $f(x)$ with integer coefficients. In previous papers we parameterized the prime ideals of $K$ in terms of certain invariants attached to Newton polygons of higher…

Number Theory · Mathematics 2010-07-16 Jordi Guardia , Jesus Montes , Enric Nart

We derive inversion formulas involving orthogonal polynomials which can be used to find coefficients of differential equations satisfied by certain generalizations of the classical orthogonal polynomials. As an example we consider special…

Classical Analysis and ODEs · Mathematics 2007-05-23 Roelof Koekoek

We use the resolution of singularities algorithm of [G4] to provide new estimates for exponential sums as well as new bounds on how often a function f(x) such as a polynomial with integer coefficients is divisible by various powers of a…

Classical Analysis and ODEs · Mathematics 2014-12-11 Michael Greenblatt

We rephrase the Wootters-Fields construction [Ann. Phys., {\bf 191}, 363 (1989)] of a full set of mutually unbiased bases in a complex vector space of dimensions $N=p^r$, where $p$ is an odd prime, in terms of the character vectors of the…

Quantum Physics · Physics 2009-11-07 S. Chaturvedi

We show that the effective factorization of Ore polynomials over $\mathbb{F}_q(t)$ is still an open problem. This is so because the known algorithm in [1] presents two gaps, and therefore it does not cover all the examples. We amend one of…

Rings and Algebras · Mathematics 2015-05-28 Jose Gomez-Torrecillas , F. J. Lobillo , Gabriel Navarro

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Number Theory · Mathematics 2018-09-05 Fusun Akman

In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…

Commutative Algebra · Mathematics 2007-05-23 Vladimir P. Gerdt

Let $K$ be a quadratic field which is not an imaginary quadratic field of class number one. We describe an algorithm to compute the primes $p$ for which there exists an elliptic curve over $K$ admitting a $K$-rational $p$-isogeny. This…

Number Theory · Mathematics 2022-07-06 Barinder S. Banwait

The aim of this article is to introduce standard bases of ideals in polynomial rings with respect to a class of orderings which are not necessarily semigroup orderings. Our approach generalises the concept of standard bases with respect to…

Algebraic Geometry · Mathematics 2007-05-23 Stephan Endrass

In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized…

Numerical Analysis · Computer Science 2014-08-12 J. A. Rad , S. Kazem , M. Shaban , K. Parand