Related papers: Heights in finite projective space, and a problem …
We derive the KPZ equation as a continuum limit of height functions in asymmetric simple exclusion processes with drift that depends on the local particle configuration. To our knowledge, it is a first such result for a class of particle…
For a $d$-uniform random hypergraph on $n$ vertices in which hyperedges are included i.i.d.\ so that the average degree in the hypergraph is $n^{\delta+o(1)}$, the projection of such a hypergraph is a graph on the same $n$ vertices where an…
Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$,…
Let $F$ be a graph. We say that a hypergraph $H$ is a {\it Berge}-$F$ if there is a bijection $f : E(F) \rightarrow E(H )$ such that $e \subseteq f(e)$ for every $e \in E(F)$. Note that Berge-$F$ actually denotes a class of hypergraphs. The…
We consider the problem of adding a fixed number of new edges to an undirected graph in order to minimize the diameter of the augmented graph, and under the constraint that the number of edges added for each vertex is bounded by an integer.…
This survey is an extended version of lectures given at the Cornell Probability Summer School 2013. The fundamental facts about the Abelian sandpile model on a finite graph and its connections to related models are presented. We discuss…
Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…
Peak estimation of hybrid systems aims to upper bound extreme values of a state function along trajectories, where this state function could be different in each subsystem. This finite-dimensional but nonconvex problem may be lifted into an…
When we have a morphism f : P^n -> P^n, then we have an inequality \frac{1}{\deg f} h(f(P)) +C > h(P) which provides a good upper bound of $h(P)$. However, if $f$ is a rational map, then \frac{1}{\deg f} h(f(P))+C cannot be an upper bound…
A representation of the sharp constant in a pointwise estimate of the gradient of a harmonic function in a multidimensional half-space is obtained under the assumption that function's boundary values belong to $L^p$. This representation is…
Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…
We give the lower bound for the growth of the maximum value for a solution to the minimal surface equation with 0 boundary values over an unbounded simply connected domain.
It is a well known result that the number of points over a finite field on the Legendre family of elliptic curves can be written in terms of a hypergeometric function modulo $p$. In this paper, we extend this result, due to Igusa, to a…
We give an algorithm which requires no integer factorization for computing the canonical height of a point in $\mathbb{P}^1(\mathbb{Q})$ relative to a morphism $\phi: \mathbb{P}_{\mathbb{Q}}^1 \rightarrow \mathbb{P}_{\mathbb{Q}}^1$ of…
In this article, we continue the study of the problem of $L^p$-boundedness of the maximal operator $M$ associated to averages along isotropic dilates of a given, smooth hypersurface $S$ of finite type in 3-dimensional Euclidean space. An…
We study the height of a spanning tree $T$ of a graph $G$ obtained by starting with a single vertex of $G$ and repeatedly selecting, uniformly at random, an edge of $G$ with exactly one endpoint in $T$ and adding this edge to $T$.
The edit distance between two graphs on the same vertex set is defined to be size of the symmetric difference of their edge sets. The edit distance function of a hereditary property, $\mathcal{H}$, is a function of $p$ and measures,…
We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…
Define f(n,p) to be the maximum number of edges in a graph on n vertices with p perfect matchings. Dudek and Schmitt proved there exist constants n_p and c_p so that for even n >= n_p, f(n,p) = (n^2)/4+c_p. A graph is p-extremal if it has p…
We give a bound for the graph energy with given maximal degree in terms of the second and fourth moments of a graph. In the case in which the graph is $d$-regular we obtain the bound that is given in Van Dam, E. et al. (2014). through…