English
Related papers

Related papers: Quadratic polynomials, multipliers and equidistrib…

200 papers

In the paper we partially solved the problem of the distribution of the discriminants of integral polynomials in the cubic case. We proved the asymptotic formula for the number of integral cubic polynomials having bounded height and bounded…

Number Theory · Mathematics 2014-11-17 D. Kaliada , F. Götze , O. Kukso

We construct an arithmetic period map for cubic fourfolds, in direct analogy with Rizov's work on K3 surfaces. For each $N\geq 1$, we introduce a Deligne-Mumford stack $\widetilde{\mathcal{C}^{[N]}}$ of cubic fourfolds with level structure…

Number Theory · Mathematics 2025-12-15 Rikuto Ito

Closed form expressions for a multivector exponential and logarithm are presented in real Clifford geometric algebras Cl(p,q)when n=p+q=1 (complex and hyperbolic numbers) and n=2 (Hamilton, split and conectorine quaternions). Starting from…

Mathematical Physics · Physics 2022-04-12 Adolfas Dargys , Arturas Acus

We detail the continued fraction expansion of the square root of the general monic quartic polynomial, noting that each line of the expansion corresponds to addition of the divisor at infinity. We analyse the data yielded by the general…

Number Theory · Mathematics 2007-05-23 Alfred J. van der Poorten

Let $C$ be a smooth genus one curve described by a quartic polynomial equation over the rational field $\mathbb Q$ with $P\in C(\mathbb Q)$. We give an explicit criterion for the divisibility-by-$2$ of a rational point on the elliptic curve…

Number Theory · Mathematics 2022-05-24 Mohammad Sadek , Tuğba Yesin

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…

Number Theory · Mathematics 2015-10-21 Kostadinka Lapkova

Let $\mathbb{F}_{q}$ be a finite field with $q$ elements and $\mathbb{F}_{q}[x]$ the ring of polynomials over $\mathbb{F}_{q}$. Let $l(x), k(x)$ be coprime polynomials in $\mathbb{F}_{q}[x]$ and $\Phi(k)$ the Euler function in…

Combinatorics · Mathematics 2020-02-21 Zhang Zihan , Han Dongchun

The study of the asymptotic distributions of zeros of generalized Jacobi polynomials with non real varying parameters, leads with quadratic differentials. In fact, the support of the limit measure of the root-counting measures sits on the…

Classical Analysis and ODEs · Mathematics 2017-12-21 Mondher Chouikhi , Faouzi Thabet

Multifractal analysis of multiplicative random cascades is revisited within the framework of {\em mixed asymptotics}. In this new framework, statistics are estimated over a sample which size increases as the resolution scale (or the…

Probability · Mathematics 2008-05-05 Emmanuel Bacry , Arnaud Gloter , Marc Hoffmann , Jean-Francois Muzy

We study the asymptotic zero distribution of the rescaled Laguerre polynomials, $\displaystyle L_n^{(\alpha_n)}(nz)$, with the parameter $\alpha_n$ varying in such a way that $\displaystyle \lim_{n\rightarrow \infty}\alpha_n/n=-1$. The…

Complex Variables · Mathematics 2010-11-10 Carlos Díaz Mendoza , Ramón Orive

In this paper, the dynamics of the Chebyshev-Halley family is studied on quadratic polynomials. A singular set, that we call cat set, appears in the parameter space associated to the family. This cat set has interesting similarities with…

Numerical Analysis · Mathematics 2012-07-17 A. Cordero , J. R. Torregrosa , P. Vindel

This article focuses on Lp-estimates for the square root of elliptic systems of second order in divergence form on a bounded domain. We treat complex bounded measurable coefficients and allow for mixed Dirichlet/Neumann boundary conditions…

Classical Analysis and ODEs · Mathematics 2021-03-29 Moritz Egert

We study the bifurcation loci of quadratic (and unicritical) polynomials and exponential maps. We outline a proof that the exponential bifurcation locus is connected; this is an analog to Douady and Hubbard's celebrated theorem that (the…

Dynamical Systems · Mathematics 2009-01-21 Lasse Rempe , Dierk Schleicher

For non-singular intersections of pairs of quadrics in 11 or more variables, we prove an asymptotic for the number of rational points in an expanding box.

Number Theory · Mathematics 2015-07-29 Ritabrata Munshi

Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…

Symbolic Computation · Computer Science 2007-05-23 Dima Grigoriev , Dmitrii V. Pasechnik

In this paper we extend a previous investigation by us regarding an iterative construction of irreducible polynomials over finite fields of odd characteristic. In particular, we show how it is possible to iteratively construct irreducible…

Dynamical Systems · Mathematics 2015-03-31 Simone Ugolini

Standard techniques for treating linear recurrences no longer apply for quadratic recurrences. It is not hard to determine asymptotics for a specific parametrized model over a wide domain of values (all $p \neq 1/2$ here). The gap between…

Number Theory · Mathematics 2024-11-08 Steven Finch

The plane partition polynomial $Q_n(x)$ is the polynomial of degree $n$ whose coefficients count the number of plane partitions of $n$ indexed by their trace. Extending classical work of E.M. Wright, we develop the asymptotics of these…

Number Theory · Mathematics 2014-01-10 Robert Boyer , Daniel Parry

We study complex one-dimensional parameter slices in a three-parameter family of rational maps with two free critical points, obtained by imposing the existence of periodic orbits with prescribed multipliers. Using explicit…

Dynamical Systems · Mathematics 2026-04-24 Pedro Iván Suárez Navarro

Among all sequences that satisfy a divide-and-conquer recurrence, the sequences that are rational with respect to a numeration system are certainly the most immediate and most essential. Nevertheless, until recently they have not been…

Computational Complexity · Computer Science 2013-07-02 Philippe Dumas