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

We consider the early time regime of the Kardar-Parisi-Zhang (KPZ) equation in $1+1$ dimensions in curved (or droplet) geometry. We show that for short time $t$, the probability distribution $P(H,t)$ of the height $H$ at a given point $x$…

We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…

Generalised hypertree width ($ghw$) is a hypergraph parameter that is central to the tractability of many prominent problems with natural hypergraph structure. Computing $ghw$ of a hypergraph is notoriously hard. The decision version of the…

The number of points on a certain one parameter family of algebraic surface over a finite field $\F_p$ can be expressed as $p^2+A_p(\lambda),$ where $A_p(\lambda)$ is a character sum and $\lambda$ is an element of the finite field $\F_p.$…

In an earlier work, the first author and Petsche solved an energy minimization problem for local fields and used the result to obtain lower bounds on the height of algebraic numbers all whose conjugates lie in various local fields, such as…

We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…

We study the problem of selecting a maximum-weight subgraph of a given graph such that the subgraph can be drawn within a prescribed drawing area subject to given non-uniform vertex sizes. We develop and analyze heuristics both for the…

We give examples of points with particularly low height on elliptic curves over quadratic fields, recovered by a search over elliptic divisibility sequences. The smallest example identified satisfies dh(P)=0.0077127...: improving on the…

Given a hereditary property $\mathcal H$ of graphs and some $p\in[0,1]$, the edit distance function $\operatorname{ed}_{\mathcal H}(p)$ is (asymptotically) the maximum proportion of "edits" (edge-additions plus edge-deletions) necessary to…

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

Let $\mathbb{Z}_q$ denote the cyclic group of order $q$. A $\mathbb{Z}_q$-edge-weighted $K_f$ is the complete graph $K_f$ equipped with a weight function $\omega : E(K_f) \to \mathbb{Z}_q$. A subdivision of a graph $H$ in a…

It is known that any isogeny graph consisting of ordinary elliptic curves over $\mathbb{F}_q$ with $q = p$ or $p^2$ has a special structure, called a volcano graph. We have a bound $h < \log_2 \sqrt{4q}$ of a height $h$ of the $2$-volcano…

(see paper for full abstract) Cut problems and connectivity problems on digraphs are two well-studied classes of problems from the viewpoint of parameterized complexity. After a series of papers over the last decade, we now have (almost)…

A \emph{complete geometric graph} consists of a set $P$ of $n$ points in the plane, in general position, and all segments (edges) connecting them. It is a well known question of Bose, Hurtado, Rivera-Campo, and Wood, whether there exists a…

We study a variant of the Erd\H{o}s Matching Problem in random hypergraphs. Let $\mathcal{K}_p(n,k)$ denote the Erd\H{o}s-R\'enyi random $k$-uniform hypergraph on $n$ vertices where each possible edge is included with probability $p$. We…

We give a formula with explicit error term for the number of $K$-rational points $P$ satisfying $H(f(P)) \le X$ as $X \to \infty$, where $f$ is a nonconstant morphism between projective spaces defined over a number field $K$ and $H$ is the…

The performance of distributed averaging depends heavily on the underlying topology. In various fields, including compressed sensing, multi-party computation, and abstract graph theory, graphs may be expected to be free of short cycles,…

Let $k$ be a number field and $V(k)$ an $n$-dimensional projective variety over $k$. We use the $K$-theory of a $C^*$-algebra $A_V$ associated to $V(k)$ to define a height of points of $V(k)$. The corresponding counting function is…

In p-median location interdiction the aim is to find a subset of edges in a graph, such that the objective value of the p-median problem in the same graph without the selected edges is as large as possible. We prove that this problem is…

Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is central in fine-grained complexity. In undirected graphs, the Strong Exponential Time Hypothesis (SETH) yields a lower bound on the time vs.…