English
Related papers

Related papers: Totally p-adic Numbers of Degree 3

200 papers

For $\theta$ a non-algebraic point on a quasi projective variety over a number field, I prove that $\theta$ has an approximation by a series of algebraic points of bounded height and degree which is essentially best possible. Applications…

Number Theory · Mathematics 2007-11-26 Heinrich Massold

Let n be a positive integer. We consider the Sylvester Resultant of f and g, where f is a generic polynomial of degree 2 or 3 and g is a generic polynomial of degree n. If f is a quadratic polynomial, we find the resultant's height. If f is…

Number Theory · Mathematics 2007-05-23 Carlos D'Andrea , Kevin G. Hare

In this paper, we prove that a non-semisimple Hopf algebra H of dimension 4p with p an odd prime over an algebraically closed field of characteristic zero is pointed provided H contains more than two group-like elements. In particular, we…

Quantum Algebra · Mathematics 2012-02-07 Yi-Lin Cheng , Siu-Hung Ng

We prove an analogue of the celebrated Hall-Higman theorem, which gives a lower bound for the degree of the minimal polynomial of any semisimple element of prime power order $p^{a}$ of a finite classical group in any nontrivial irreducible…

Representation Theory · Mathematics 2008-10-07 Pham Huu Tiep , Alexander E. Zalesskii

In this paper, we study finite dimensional non-cosemisimple Hopf algebras through its underlying coalgebra. We decompose such a Hopf algebra as a direct sum of `blocks'. Blocks are closely related to each other by `rules' and form the…

Quantum Algebra · Mathematics 2015-09-22 Z. -P. Fan , D. -M. Lu

In this short survey we look at a few basic features of p-adic numbers, somewhat with the point of view of a classical analyst. In particular, with p-adic numbers one has arithmetic operations and a norm, just as for real or complex…

Classical Analysis and ODEs · Mathematics 2007-05-23 Stephen Semmes

The arithmetic partial derivative (with respect to a prime $p$) is a function from the set of integers that sends $p$ to 1 and satisfies the Leibniz rule. In this paper, we prove that the $p$-adic valuation of the sequence of higher order…

Number Theory · Mathematics 2022-06-02 Brad Emmons , Xiao Xiao

In 1984, Deligne proved that for any prime number $p$, the reduction modulo $p$ of the diagonal of a multivariate algebraic power series with integer coefficients is algebraic over the field of rational functions with coefficients in…

Symbolic Computation · Computer Science 2026-01-22 Boris Adamczewski , Alin Bostan , Xavier Caruso

A set of multivariate polynomials, over a field of zero or large characteristic, can be tested for algebraic independence by the well-known Jacobian criterion. For fields of other characteristic p>0, there is no analogous characterization…

Computational Complexity · Computer Science 2012-02-21 Johannes Mittmann , Nitin Saxena , Peter Scheiblechner

Let $H$ be a finite-dimensional Hopf algebra over an algebraically closed field of characteristic 0. If $H$ is not semisimple and $\dim(H)=2n$ for some odd integer $n$, then $H$ or $H^*$ is not unimodular. Using this result, we prove that…

Quantum Algebra · Mathematics 2012-02-14 Siu-Hung Ng

We give a dynamical construction of an infinite sequence of distinct totally $p$-adic algebraic numbers whose Weil heights tend to the limit $\frac{\log p}{p-1}$, thus giving a new proof of a result of Bombieri-Zannier. The proof is…

Number Theory · Mathematics 2019-01-24 Clayton Petsche , Emerald Stacy

Ply number is a recently developed graph drawing metric inspired by studying road networks. Informally, for each vertex v, which is associated with a point in the plane, a disk is drawn centered on v with a radius that is alpha times the…

Computational Geometry · Computer Science 2018-08-13 Michael T. Goodrich , Timothy Johnson

Let $q$ be a prime number, $k$ an algebraically closed field of characteristic 0, and $H$ a semisimple Hopf algebra of dimension $2q^3$. This paper proves that $H$ is always semisolvable. That is, such Hopf algebras can be obtained by (a…

Rings and Algebras · Mathematics 2013-08-16 Jingcheng Dong , Shuanhong Wang

Let f be a degree d polynomial defined over the nonarchimedean field C_p, normalized so f is monic and f(0)=0. We say f is post-critically bounded, or PCB, if all of its critical points have bounded orbit under iteration of f. It is known…

Number Theory · Mathematics 2017-03-29 Jacqueline Anderson

Let $K/\mathbb{Q}$ be a finite extension. We prove that the minimal height of polynomials of degree $n$ of which all roots are in $K^\times$ increases exponentially in $n$. We determine the implied constant exactly for totally real $K$ and…

Number Theory · Mathematics 2025-09-16 Thian Tromp

The dimension of a partial order $P$ is the minimum number of linear orders whose intersection is $P$. There are efficient algorithms to test if a partial order has dimension at most $2$. In 1982 Yannakakis showed that for $k\geq 3$ to test…

Combinatorics · Mathematics 2016-04-26 Stefan Felsner , Irina Mustata , Martin Pergel

Bombieri and Zannier established lower and upper bounds for the limit infimum of the Weil height in fields of totally p-adic numbers and generalizations thereof. In this paper, we use potential theoretic techniques to generalize the upper…

Number Theory · Mathematics 2012-10-31 Paul Fili

Let $k$ be a number field. For $\mathcal{H}\rightarrow \infty$, we give an asymptotic formula for the number of algebraic integers of absolute Weil height bounded by $\mathcal{H}$ and fixed degree over $k$.

Number Theory · Mathematics 2014-09-12 Fabrizio Barroero

We prove that in each degree divisible by 2 or 3, there are infinitely many totally real number fields that require universal quadratic forms to have arbitrarily large rank.

Number Theory · Mathematics 2023-07-18 Vítězslav Kala

The algebraic degree is an important parameter of Boolean functions used in cryptography. When a function in a large number of variables is not given explicitly in algebraic normal form, it might not be feasible to compute its degree.…

Cryptography and Security · Computer Science 2023-06-22 Ana Salagean , Percy Reyes-Paredes