相关论文: Heights in finite projective space, and a problem …

Using the theory of $(\phi,\Gamma)$-modules and the formalism of Selmer complexes we construct the p-adic height for p-adic representations with coefficients in an affinoid algebra over $Q_p$.

We study the asymptotic Dirichlet problem for A-harmonic equations and for the minimal graph equation on a Cartan-Hadamard manifold M whose sectional curvatures are bounded from below and above by certain functions depending on the distance…

Certain lower bounds are obtained on the canonical height associated to the morphism $\phi(z)=z^d+c$.

We construct an algorithm for solving the following problem: given a number field $K$, a positive integer $N$, and a positive real number $B$, determine all points in $\mathbb P^N(K)$ having relative height at most $B$. A theoretical…

We consider the growth of heights of the points of the orbits of (piecewise) affine maps of the plane, with rational parameters. We analyse the asymptotic growth rate of both global and local ($p$-adic) heights, for the primes $p$ that…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

Let us recall the well-known Shirshov's Height Theorem. "Let A be a finitely generated algebra of degree d. Then there exists a finite set Y which is the subset of A that A has and an integer h' = h(A) such that A has Shirshov's height h'…

We consider the problem of layering general directed graphs under height and possibly also width constraints. Given a directed graph G = (V,A) and a maximal height, we propose a layering approach that minimizes a weighted sum of the number…

The best constant in the usual Lp norm inequality for the centered Hardy-Littlewood maximal function on R1 is obtained for the class of all ``peak-shaped'' functions. A positive function on the line is called ``peak-shaped'' if it is…

We consider the task of drawing a graph on multiple horizontal layers, where each node is assigned a layer, and each edge connects nodes of different layers. Known algorithms determine the orders of nodes on each layer to minimize crossings…

In this paper, we obtain the necessary equations in a conformal parameter induced by the first or second fundamental forms for a surface that is isometrically immersed in the warped product $\mathbb{R} \times_{f} \mathbb{M}^{2}(\kappa)$…

In this paper, we will give an upper bound and a lower bound of the arithmetic Hilbert-Samuel function of projective hypersurfaces, which are uniform and explicit. These two bounds have the optimal dominant terms. As an application, we use…

In some applications of matching, the structural or hierarchical properties of the two graphs being aligned must be maintained. The hierarchical properties are induced by the direction of the edges in the two directed graphs. These…

In this paper, we develop an algorithm for computing Coleman--Gross (and hence Nekov\'a\v{r}) $p$-adic heights on hyperelliptic curves over number fields with arbitrary reduction type above $p$. This height is defined as a sum of local…

We give a new proof of a result of DiPippo and Wan for counting points of bounded height on projective spaces over global function fields. The new proof adapts the geometry of numbers arguments used by Schanuel in the number field case.

We obtain lower and upper bounds for the maximum weight of a directed cut in the classes of weighted digraphs and weighted acyclic digraphs as well as in some of their subclasses. We compare our results with those obtained for the maximum…

Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called \emph{Main Problem of Subspace Coding} is to determine the maximum size…

Let F and G be morphisms of degree at least 2 from P^N to P^N that are defined over the algebraic closure of Q. We define the arithmetic distance d(F,G) between F and G to be the supremum over all algebraic points P of |h_F(P)-h_G(P)|,…

Several recent papers construct auxiliary polynomials to bound the Weil height of certain classes of algebraic numbers from below. Following these techniques, the author gave a general method for introducing auxiliary polynomials to…

The paper aims at proving global height estimates for Killing graphs defined over a complete manifold with nonempty boundary. To this end, we first point out how the geometric analysis on a Killing graph is naturally related to a weighted…