English
Related papers

Related papers: The regulator dominates the rank

200 papers

The power domination number arises from the monitoring of electrical networks and its determination is an important problem. Upper bounds for power domination numbers can be obtained by constructions. Lower bounds for the power domination…

We discuss several approaches to motivic complexes and explicit constructions of the regulator maps from the motivic complexes to Deligne complexes.

Number Theory · Mathematics 2007-05-23 A. B. Goncharov

We consider two general frameworks for multiple domination, which are called <r,s>-domination and parametric domination. They generalise and unify {k}-domination, k-domination, total k-domination and k-tuple domination. In this paper, known…

Combinatorics · Mathematics 2014-10-08 V. Zverovich

In this paper the family of elliptic curves over \Q given by the equation E_{p}: Y^2=(X-p)^3+X^3+(X+p)^3 where p is a prime number, is studied. It is shown that the maximal rank of the elliptic curves is at most 3 and some conditions under…

Number Theory · Mathematics 2012-01-30 A. Astaneh-Asl

We show that the average and typical ranks in a certain parametric family of elliptic curves described by D. Ulmer tend to infinity as the parameter $d \to\infty$. This is perhaps unexpected since by a result of A. Brumer, the average rank…

Number Theory · Mathematics 2009-03-18 Carl Pomerance , Igor E. Shparlinski

For any number field $K$ and integer $0\leq r \leq 4$, we prove that there are infinitely many elliptic curves over $K$ of rank $r$. Our elliptic curves are obtained by specializing well-chosen nonisotrivial elliptic curves over the…

Number Theory · Mathematics 2026-02-12 David Zywina

We establish a lower bound for the cop number of graphs of high girth in terms of the minimum degree, and more generally, in terms of a certain growth condition. We show, in particular, that the cop number of any graph with girth $g$ and…

Combinatorics · Mathematics 2020-05-25 Peter Bradshaw , Seyyed Aliasghar Hosseini , Bojan Mohar , Ladislav Stacho

In this paper, we investigate geometrical properties of the rank metric space and covering properties of rank metric codes. We first establish an analytical expression for the intersection of two balls with rank radii, and then derive an…

Information Theory · Computer Science 2009-06-23 Maximilien Gadouleau , Zhiyuan Yan

We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…

Combinatorics · Mathematics 2020-01-07 Carlos Hoppen , Giovane Mansan

We establish an upper bound for the rank of every power of an arbitrary quadratic form. Specifically, for any $s\in\mathbb{N}$, we prove that the $s$-th power of a quadratic form of rank $n$ grows as $n^s$. Furthermore, we demonstrate that…

Algebraic Geometry · Mathematics 2025-01-03 Cosimo Flavi

In this note, we first try to prove a uniform lower bound of nodal volume in elliptic homogenization setting. This lower bound is far from optimal. But, we can prove a constant lower bound in dimension two. Motivated by the proof, we extend…

Analysis of PDEs · Mathematics 2025-12-23 Jiahuan Li , Zhichen Ying

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

Group Theory · Mathematics 2025-12-23 Zeev Dvir

Let $\mathbb{F}_q$ be a finite field of odd characteristic and $K= \mathbb{F}_q(t)$. For any integer $d\geq 2$ coprime to $q$, consider the elliptic curve $E_d$ over $K$ defined by $y^2=x(x^2+t^{2d} x-4t^{2d})$. We show that the rank of the…

Number Theory · Mathematics 2018-09-21 Richard Griffon

The structure of minimal weight rainbow domination functions of cubic graphs are studied. Based on general observations for cubic graphs, generalized Petersen graphs $P(ck,k)$ are characterized whose 4- and 5-rainbow domination numbers…

Combinatorics · Mathematics 2024-03-13 Janez Žerovnik

We generalize Waldschmidt's bound for Leopoldt's defect and prove a similar bound for Gross's defect for an arbitrary extension of number fields. As an application, we prove new cases of Gross's finiteness conjecture (also known as the…

Number Theory · Mathematics 2026-02-09 Alexandre Maksoud

In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid for regular graphs of degree four and five. Also, we give examples to show the order of the bound we give is sharp.

Combinatorics · Mathematics 2012-07-18 Shisen Luo

We study elliptic surfaces over $\mathbb{Q}(T)$ with coefficients of a Weierstrass model being polynomials in $\mathbb{Q}[T]$ with degree at most 2. We derive an explicit expression for their rank over $\mathbb{Q}(T)$ depending on the…

Number Theory · Mathematics 2021-09-03 Francesco Battistoni , Sandro Bettin , Christophe Delaunay

We obtain explicit, computable upper bounds for the Neron-Tate height of rational points on curves of genus at least two over number fields. The bounds use automorphisms acting on the Mordell-Weil lattice of the Jacobian. We prove an…

Number Theory · Mathematics 2025-09-30 Madhavi Prakash

Let $A,B$ be nonzero rational numbers. Consider the elliptic curve $E_{A,B}/\mathbb{Q}(t)$ with Weierstrass equation $y^2=x^3+At^6+B$. An algorithm to determine $\mathrm{rank } E_{A,B}(\mathbb{Q}(t))$ as a function of $(A,B)$ was presented…

Number Theory · Mathematics 2025-09-05 Remke Kloosterman

Let $k$ be a perfect field with $\mathrm{char}(k)\neq 2,3$, set $K=k(t)$, and let $\mathcal{W}_n^{\min}$ be the moduli stack of minimal elliptic curves over $K$ of Faltings height $n$, constructed via the height-moduli framework of…

Algebraic Geometry · Mathematics 2026-05-01 Jun-Yong Park