English
Related papers

Related papers: On the DJL conjecture for order 6

200 papers

The purpose of this note is give some evidence in support of conjectures of Poonen, and Morton and Silverman, on the periods of rational numbers under the iteration of quadratic polynomials. In particular, Poonen conjectured that there are…

Dynamical Systems · Mathematics 2010-04-14 Benjamin Hutz , Patrick Ingram

For a real polynomial $p = \sum_{i=0}^{n} c_ix^i$ with no negative coefficients and $n\geq 6$, let $\beta (p) = \inf_{i=1}^{n-1} c_i^2/c_{i+1}c_{i-1}$ (so $\beta (p) \geq 1$ entails that $p$ is log concave). If $\beta(p) > 1.45...$, then…

Classical Analysis and ODEs · Mathematics 2010-10-01 David Handelman

A fooling-set matrix has nonzero diagonal, but at least one in every pair of diagonally opposite entries is 0. Dietzfelbinger et al. '96 proved that the rank of such a matrix is at least $\sqrt n$. It is known that the bound is tight (up to…

Discrete Mathematics · Computer Science 2016-12-06 Mozhgan Pourmoradnasseri , Dirk Oliver Theis

For nonzero rational D, which may be taken to be a squarefree integer, let E_D be the elliptic curve Dy^2=x^3-x over Q arising in the "congruent number" problem. It is known that the L-function of E_D has sign -1, and thus odd analytic…

Number Theory · Mathematics 2007-05-23 Noam D. Elkies

Watkins' conjecture asserts that for a rational elliptic curve $E$ the degree of the modular parametrization is divisible by $2^r$, where $r$ is the rank of $E$. In this paper we prove that if the modular degree is odd then $E$ has rank…

Number Theory · Mathematics 2016-11-18 Matija Kazalicki , Daniel Kohen

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

General Mathematics · Mathematics 2023-07-31 Mbakiso Fix Mothebe

For any prime p and any positive integer n, let B(p,n) denote the n-th layer of the cyclotomic Z_p-extension over the rationals. Based on the heuristics of Cohen and Lenstra, and refined by new results on class numbers of particular B(p,n),…

Number Theory · Mathematics 2015-01-05 John C. Miller

We identify a link between regular matroids and torus representations all of whose isotropy groups have an odd number of components. Applying Seymour's 1980 classification of the former objects, we obtain a classification of the latter. In…

Differential Geometry · Mathematics 2025-06-12 Lee Kennard , Michael Wiemeler , Burkhard Wilking

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…

Combinatorics · Mathematics 2016-07-26 Jordan Almeter , Samet Demircan , Andrew Kallmeyer , Kevin G. Milans , Robert Winslow

An integer-valued matrix $\mathbf{A}$ is $\Delta$-modular if each $\text{rank}(\mathbf{A}) \times \text{rank}(\mathbf{A})$ submatrix has determinant at most $\Delta$ in absolute value. The column number problem is to determine the maximum…

Combinatorics · Mathematics 2025-09-18 Joseph Paat , Zach Walsh , Luze Xu

The $abc$ conjecture states that there are only finitely many triples of coprime positive integers $(a,b,c)$ such that $a+b=c$ and $\operatorname{rad}(abc) < c^{1-\epsilon}$ for any $\epsilon > 0$. Using the optimized methods in a recent…

Number Theory · Mathematics 2025-07-08 Runbo Li

We study the almost sure convergence of the normalized columns in an infinite product of nonnegative matrices, and the almost sure rank one property of its limit points. Given a probability on the set of $2\times2$ nonnegative matrices,…

Probability · Mathematics 2013-05-21 Alain Thomas

We consider a space of sparse Boolean matrices of size $n \times n$, which have finite co-rank over $GF(2)$ with high probability. In particular, the probability such a matrix has full rank, and is thus invertible, is a positive constant…

Combinatorics · Mathematics 2022-06-07 Colin Cooper , Alan Frieze

Let $X/C$ be a general product of elliptic curves. Our goal is to establish the Hodge-D-conjecture for $X$. We accomplish this when $\dim X \leq 5$. For $\dim X \geq 6$, we reduce the conjecture to a matrix rank condition that is amenable…

Algebraic Geometry · Mathematics 2021-09-02 Alexandru Ghitza , James D. Lewis , Karim Mansour , Genival Da Silva

A conjecture of Mordell states that if $p$ is a prime and $p$ is congruent to $3$ mod $4$, then $p$ does not divide $y$ where $(x,y)$ is the fundamental solution to $x^{2}-py^{2}=1$. The conjecture has been verified for primes not exceeding…

Number Theory · Mathematics 2019-06-28 Debopam Chakraborty , Anupam Saikia

At the time of writing, the general problem of finding the maximal Waring rank for homogeneous polynomials of fixed degree and number of variables (or, equivalently, the maximal symmetric rank for symmetric tensors of fixed order and in…

Algebraic Geometry · Mathematics 2016-06-14 Alessandro De Paris

Let $G$ be a graph of order $n$ and $P(G,x)$ be the chromatic polynomial of $G$. Dong, Ge, Gong, Ning, Ouyang, and Tay (J. Graph Theory 96(2021) 343) conjectured that $\frac{d^k}{dx^k} \bigl( \ln[(-1)^n P(G, x)] \bigr) < 0$ holds for all $k…

Combinatorics · Mathematics 2026-03-20 Yan Yang

In this note, we show that, if the Druzkowski mappings $F(X)=X+(AX)^{*3}$, i.e. $F(X)=(x_1+(a_{11}x_1+...+a_{1n}x_n)^3,...,x_n+(a_{n1}x_1+...+a_{nn}x_n)^3)$, satisfies $TrJ((AX)^{*3})=0$, then $rank(A)\leq 1/2(n+\delta)$ where $\delta$ is…

Algebraic Geometry · Mathematics 2012-05-29 Dan Yan

We study rank-two reflexive sheaves on $\mathbb{P}^3$ with $c_2 =4$, expanding on previous results for $c_2\le3$. We show that every spectrum not previously ruled out is realized. Moreover, moduli spaces are studied and described in detail…

Algebraic Geometry · Mathematics 2025-05-06 Marcos Jardim , Alan Muniz

In 1996, Matheson and Tarjan conjectured that any n-vertex triangulation with n sufficiently large has a dominating set of size at most n/4. We prove this for graphs of maximum degree 6.

Combinatorics · Mathematics 2010-06-09 Erika L. C. King , Michael J. Pelsmajer
‹ Prev 1 4 5 6 7 8 10 Next ›