English
Related papers

Related papers: Comments on the height reducing property II

200 papers

Let $\mathcal A$ be an $\mathbb F$-algebra and let $\mathcal S$ be its generating set. The length of $\mathcal S$ is the smallest number $k$ such that $\mathcal A$ equals the $\mathbb F$-linear span of all products of length at most $k$ of…

Rings and Algebras · Mathematics 2025-05-19 M. A. Khrystik

It is proved that if $D$ is a $UFD$ and $R$ is a $D$-algebra, such that $U(R)\cap D\neq U(D)$, then $R$ has a maximal subring. In particular, if $R$ is a ring which either contains a unit $x$ which is not algebraic over the prime subring of…

Rings and Algebras · Mathematics 2012-08-28 A. Azarang

We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…

Algebraic Geometry · Mathematics 2020-07-20 David Kazhdan , Tamar Ziegler

For a complex number $x$, $\Vert x\Vert:=\min\{|x-m|:m\in\mathbb{Z}\}$. Let $k\geq 1$ be an integer, and $K$ be a number field. Let $\alpha_1,\ldots,\alpha_k$ be algebraic numbers with $|\alpha_i|\geq 1$ and let $d_i$ denotes the degree of…

Number Theory · Mathematics 2025-12-15 Veekesh Kumar , Gorekh Prasad

Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…

Information Theory · Computer Science 2014-04-22 Vakhtang Lomadze

Given a polynomial system $\mathcal{F}$ over a finite field $k$ which is not necessarily of dimension zero, we consider the Weil descent $\mathcal{F}'$ of $\mathcal{F}$ over a subfield $k'$. We prove a theorem which relates the last fall…

Algebraic Geometry · Mathematics 2021-03-15 Ming-Deh Huang

Given an ideal of forms in an algebra (polynomial ring, tensor algebra, exterior algebra, Lie algebra, bigraded polynomial ring), we consider the Hilbert series of the factor ring. We concentrate on the minimal Hilbert series, which is…

Commutative Algebra · Mathematics 2018-11-19 Ralf Fröberg , Samuel Lundqvist

We investigate the structure of polynomials of degree four in many variables over a fixed prime field $\mathbb{F}=\mathbb{F}_{p}$. In 2007, Green and Tao proved that if a polynomial $f:\mathbb{F}^{n}\rightarrow\mathbb{F}$ is poorly…

Combinatorics · Mathematics 2019-03-05 Amichai Lampert

Define the special tree number, denoted $\mathfrak{st}$, to be the least size of a tree of height $\omega_1$ which is neither special nor has a cofinal branch. This cardinal had previously been studied in the context of fragments of…

Logic · Mathematics 2023-01-10 Corey Bacal Switzer

A rational function of degree at least two with coefficients in an algebraically closed field is post-critically finite (PCF) if all of its critical points have finite forward orbit under iteration. We show that the collection of PCF…

Number Theory · Mathematics 2015-01-14 Robert L. Benedetto , Patrick Ingram , Rafe Jones , Alon Levy

1973 Schinzel proved that the standard logarithmic height h on the maximal totally real field extension of the rationals is either zero or bounded from below by a positive constant. In this paper we study this property for canonical heights…

Number Theory · Mathematics 2013-11-19 Lukas Pottmeyer

This paper is concerned with Mahler's method. We study in detail the structure of linear relations between values of Mahler functions at algebraic points. In particular, given a field ${\bf k}$, a Mahler function $f(z)\in{\bf k}\{z\}$, and…

Number Theory · Mathematics 2017-11-15 Boris Adamczewski , Colin Faverjon

We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…

Symbolic Computation · Computer Science 2010-01-06 Xiaolin Qin , Yong Feng , Jingwei Chen , Jingzhong Zhang

What can be said about the subalgebras of the polynomial ring, with minimal or maximal Hilbert function? This question was discussed in a recent paper by M. Boij and A. Conca. In this paper we study the subalgebras generated in degree two…

Commutative Algebra · Mathematics 2021-02-26 Lisa Nicklasson

Let f in Q[z] be a polynomial of degree d at least two. The associated canonical height \hat{h}_f is a certain real-valued function on Q that returns zero precisely at preperiodic rational points of f. Morton and Silverman conjectured in…

Number Theory · Mathematics 2008-12-03 Robert L. Benedetto , Benjamin Dickman , Sasha Joseph , Benjamin Krause , Daniel Rubin , Xinwen Zhou

Let $A$ be a nonempty subset of finite abelian group $G$ of order $n$. For an integer $h \geq 2$, the restricted $h$-fold sumset $h^\wedge A$ is the set of all sums of $h$ distinct elements of $A$. It is known that if $G$ is a group of…

Number Theory · Mathematics 2026-05-26 Vivekanand Goswami , Raj Kumar Mistri

Suppose we are given a computably enumerable object arise from algorithmic randomness or computable analysis. We are interested in the strength of oracles which can compute an object that approximates this c.e. object. It turns out that,…

Logic · Mathematics 2019-12-09 Noam Greenberg , Joseph S. Miller , Andre Nies

Let $f(x)=x^{n}+ax^{3}+bx+c$ be the minimal polynomial of an algebraic integer $\theta$ over the rationals with certain conditions on $a,~b,~c,$ and $n.$ Let $K=\mathbb{Q}(\theta)$ be a number field and $\mathcal{O}_{K}$ be the ring of…

Number Theory · Mathematics 2025-01-08 Tapas Chatterjee , Karishan Kumar

Let F and G be morphisms of degree at least 2 from P^N to P^N that are defined over the algebraic closure of Q. We define the arithmetic distance d(F,G) between F and G to be the supremum over all algebraic points P of |h_F(P)-h_G(P)|,…

Number Theory · Mathematics 2011-05-30 Shu Kawaguchi , Joseph H. Silverman

A polynomial identity testing algorithm must determine whether a given input polynomial is identically equal to 0. We give a deterministic black-box identity testing algorithm for univariate polynomials of the form $\sum_{j=0}^t c_j…

Computational Complexity · Computer Science 2009-12-08 Pascal Koiran