Related papers: On a Problem of Lang for Matrix Polynomials

Denoting by ${\mathcal L}_d(m_0,m_1,...,m_r)$ the linear system of plane curves passing through $r+1$ generic points $p_0,p_1,...,p_r$ of the projective plane with multiplicity $m_i$ (or larger) at each $p_i$, we prove the…

We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…

We give a complete factorization of the invariant factors of resultant matrices built from birational parameterizations of rational plane curves in terms of the singular points of the curve and their multiplicity graph. This allows us to…

For any elliptic curve E defined over the rationals with complex multiplication and for every prime p, we describe the image of the mod p Galois representation attached to E. We deduce information about the field of definition of torsion…

We establish asymptotic formulas for counting rational points near finite type curves on the plane, generalizing Huang's result.

We discuss, in a non-Archimedean setting, the distribution of the coefficients of $L$-polynomials of curves of genus $g$ over $\mathbb{F}_q$. Among other results, this allows us to prove that the $\mathbb{Q}$-vector space spanned by such…

The Matrix Torsion Problem (MTP) is: given a square matrix M with rational entries, decide whether two distinct powers of M are equal. It has been shown by Cassaigne and the author that the MTP reduces to the Matrix Power Problem (MPP) in…

We obtain some sharp estimates for the $p$-torsion of convex planar domains in terms of their area, perimeter, and inradius. The approach we adopt relies on the use of web functions (i.e. functions depending only on the distance from the…

We study lower bounds for the norm of the product of polynomials and their applications to the so called \emph{plank problem.} We are particularly interested in polynomials on finite dimensional Banach spaces, in which case our results…

We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…

We describe some combinatorial problems in finite projective planes and indicate how R\'edei's theory of lacunary polynomials can be applied to them.

Let E be an elliptic curve defined over Q and let G = E(Q)_tors be the associated torsion subgroup. We study, for a given G, which possible groups G <= H could appear such that H=E(K)_tors, for [K:Q]=4 and H is one of the possible torsion…

This paper explores the finiteness of the solution set of the polynomial complementarity problem (PCP). To achieve this goal, we introduce two new classes of structured tensor tuples, namely the nondegenerate tensor tuple and the strong…

We consider planar curved strictly convex domains with no or very weak smoothness assumptions and prove sharp bounds for square-functions associated to the lattice point discrepancy.

The number of rational points of a plane non-singular algebraic curve X defined over a finite field is computed, provided that the generic point of X is not an inflexion and that X is Frobenius non-classical with respect to conics.

This paper investigates the convexity of the solution set of the linear complementarity problems over tensor spaces (TLCPs). We introduce the notion of a $T$-column sufficient tensor and study its properties and relationships with several…

The aim of this paper is to show how a conjectural lower bound on the canonical height function in the spirit of Lang and Silverman leads to an explicit uniform bound on the number of rational points on curves of genus $g\geq 2$ over a…

Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials f_i with f \equiv \sum_i f_i^2…

In this paper, we prove several generalizations and applications of a fixed point theorem. This theorem is used to prove the existence and uniqueness of solutions of the linear sparse matrix problem considered.

We give a bound, linear in the complexity of the surface, on the asymptotic dimension of the curve complex as well as the capacity dimension of the ending lamination space.