English
Related papers

Related papers: The set of forms with bounded strength is not clos…

200 papers

We consider infinite parametric families of high degree number fields composed of quadratic fields with pure cubic, pure quartic, pure sextic fields and with the so called simplest cubic, simplest quartic fields. We explicitly describe an…

Number Theory · Mathematics 2018-09-27 István Gaál , László Remete

Let $k$ be an algebraically closed field of characteristic zero and $P(x,y)\in k[x,y]$ be a polynomial which depends on all its variables. $P$ has an algebraic constraint if the set $\{(P(a,b),(P(a',b'),P(a',b),P(a,b')\,|\,a,a',b,b'\in k\}$…

Logic · Mathematics 2015-06-25 Elad Levi

We define a closure operation for rings of mixed characteristic and verify that the closure is a ring. We then show that this closure produces a ring with good properties with respect to its Fontaine ring and give an example to show that…

Commutative Algebra · Mathematics 2008-10-02 Paul C. Roberts

The second author proved that the set of post-critically finite polynomials of given degree is a set of bounded height, up to change of variables. Motivated by an observation about unicritical polynomials, we complement this by proving that…

Number Theory · Mathematics 2022-10-27 Benjamin Fraser , Patrick Ingram

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.

Logic · Mathematics 2021-09-30 Jakub Gismatullin , Katarzyna Tarasek

We study a class of meromorphic modular forms characterised by Fourier coefficients that satisfy certain divisibility properties. We present new candidates for these so-called magnetic modular forms, and we conjecture properties that these…

Number Theory · Mathematics 2024-04-08 Kilian Bönisch , Claude Duhr , Sara Maggio

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

Symbolic Computation · Computer Science 2025-02-10 Nicolas Faroß , Thomas Sturm

In the space of sextic forms in 4 variables with a decomposition of length 18 we determine and describe a closed subvariety which contains all non-identifiable sextics. The description of the subvariety is geometric, but one can derive from…

Algebraic Geometry · Mathematics 2022-08-18 Luca Chiantini

Let $F(x,y)$ be a polynomial over the rationals. We show that if $F$ is not an expander (over the rationals) then it has a special multiplicative or additive form. For example if $F$ is a homogeneous non-expander polynomial then…

Combinatorics · Mathematics 2012-12-17 Jozsef Solymosi

S\'ark\"ozy proved that dense sets of integers contain two elements differing by a $k$th power. The bounds in quantitative versions of this theorem are rather weak compared to what is expected. We prove a version of S\'ark\"ozy's theorem…

Number Theory · Mathematics 2017-05-09 Ben Green

We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or…

Algebraic Geometry · Mathematics 2010-03-29 Benoit Bertrand , Frederic Bihan , Frank Sottile

A (positive definite and non-classic integral) quadratic form is called strongly $s$-regular if it satisfies a strong regularity property on the number of representations of squares of integers. In this article, we prove that for any…

Number Theory · Mathematics 2019-09-05 Kyoungmin Kim , Byeong-Kweon Oh

In this paper, we strengthen a result by Green about an analogue of Sarkozy's theorem in the setting of polynomial rings $\mathbb{F}_q[x]$. In the integer setting, for a given polynomial $F \in \mathbb{Z}[x]$ with constant term zero, (a…

Number Theory · Mathematics 2024-04-29 Anqi Li , Lisa Sauermann

In this article, we prove that a complex cone is a set of injectivity for the twisted spherical means for the class of all continuous functions on $\mathbb C^n$ as long as it does not completely lay on the level surface of any bi-graded…

Functional Analysis · Mathematics 2014-06-13 R. K. Srivastava

We present a form convergence theorem for sequences of sectorial forms and their associated semigroups in a complex Hilbert space. Roughly speaking, the approximating forms $a_n$ are all `bounded below' by the limiting form $a$, but in…

Functional Analysis · Mathematics 2023-03-16 Hendrik Vogt , Jürgen Voigt

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

Logic · Mathematics 2015-10-06 Robert Lubarsky , Fred Richman

Let $k$ be an algebraically closed field of characteristic zero, and $k[[z]]$ the ring of formal power series over $k$. In this paper, we study equations in the semigroup $z^2k[[z]]$ with the semigroup operation being composition. We prove…

Commutative Algebra · Mathematics 2025-05-20 Fedor Pakovich

A "tensor space" is a vector space equipped with a finite collection of multi-linear forms. In previous work, we showed that (for each signature) there exists a universal homogeneous tensor space, which is unique up to isomorphism. Here we…

Representation Theory · Mathematics 2024-07-30 Nate Harman , Andrew Snowden

We extend and generalize the results of Scheiderer (2006) on the representation of polynomials nonnegative on two-dimensional basic closed semialgebraic sets. Our extension covers some situations where the defining polynomials do not…

Algebraic Geometry · Mathematics 2013-01-07 Jaka Cimpric , Salma Kuhlmann , Murray Marshall

Computers are good at evaluating finite sums in closed form, but there are finite sums which do not have closed forms. Summands which do not produce a closed form can often be ``fixed'' by multiplying them by a suitable polynomial. We…

Symbolic Computation · Computer Science 2022-10-26 Robert Dougherty-Bliss
‹ Prev 1 3 4 5 6 7 10 Next ›