Related papers: Dimensional bounds for ancient caloric functions o…

Under certain continuity conditions, we estimate upper and lower box dimension of graph of a function defined on the Sierpinski gasket. We also give an upper bound for Hausdorff dimension and box dimension of graph of function having finite…

On a complete Calabi-Yau manifold $M$ with maximal volume growth, a harmonic function with subquadratic polynomial growth is the real part of a holomorphic function. This generalizes a result of Conlon-Hein. We prove this result by proving…

We consider infinite graphs and the associated energy forms. We show that a graph is canonically compactifiable (i.e. all functions of finite energy are bounded) if and only if the underlying set is totally bounded with respect to any…

The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…

This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…

In this article, we continue our investigations of the boundary behavior of harmonic mappings. We first discuss the classical problem on the growth of radial length and obtain a sharp growth theorem of the radial length of…

Let $G$ be a graph which satisfies $c^{-1} a^r \le |B(v,r)| \le c a^r$, for some constants $c,a>1$, every vertex $v$ and every radius $r$. We prove that this implies the isoperimetric inequality $|\partial A| \ge C |A| / \log(2+ |A|)$ for…

We introduce a theory of volume polynomials and corresponding duality algebras of multi-fans. Any complete simplicial multi-fan $\Delta$ determines a volume polynomial $V_\Delta$ whose values are the volumes of multi-polytopes based on…

The concept of metric dimension has applications in a variety of fields, such as chemistry, robotic navigation, and combinatorial optimization. We show bounds for graphs with $n$ vertices and metric dimension $\beta$. For Hamiltonian…

Working in positive characteristic, we show how one can use information about the dimension of moduli spaces of rational curves on a Fano variety $X$ over $\mathbb{F}_q$ to obtain strong estimates for the number of $\mathbb{F}_q(t)$-points…

The matching polynomial of a graph encodes rich combinatorial information through its roots. We determine the maximum multiplicity of a non-zero matching polynomial root and characterize all graphs attaining the bound. We also generalize…

In this paper, a two-dimensional model for the growth of multi-layer tumors is presented. The model consists of a free boundary problem for the tumor cell membrane and the tumor is supposed to grow or shrink due to cell proliferation or…

We study the decay/growth rates in all $L^p$ norms of solutions to an inhomogeneous nonlocal heat equation in $\mathbb{R}^N$ involving a Caputo $\alpha$-time derivative and a power $\beta$ of the Laplacian when the dimension is large, $N>…

The Minkowski problem for a class of unbounded closed convex sets is considered. This is equivalent to a Monge-Amp\`ere equation on a bounded convex open domain with possibly non-integrable given data. A complete solution (necessary and…

A stochastic partial differential equation along the lines of the Kardar-Parisi-Zhang equation is introduced for the evolution of a growing interface in a radial geometry. Regular polygon solutions as well as radially symmetric solutions…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

We prove that the coindex of the box complex $\mathrm{B}(H)$ of a graph $H$ can be measured by the generalised Mycielski graphs which admit a homomorphism to it. As a consequence, we exhibit for every graph $H$ a system of linear equations…

Classical Hamming graphs are Cartesian products of complete graphs, and two vertices are adjacent if they differ in exactly one coordinate. Motivated by connections to unitary Cayley graphs, we consider a generalization where two vertices…

In this paper, we investigate properties of classes of functions related to certain elliptic operators. Firstly, we prove that a main result of Dyakonov (Acta Math. 178(1997), 143--167) on analytic functions can be extended to this more…

The goal of this article is to provide a description of the reachable set of the one-dimensional heat equation, set on the spatial domain x $\in$ (--L, L) with Dirichlet boundary controls acting at both boundaries. Namely, in that case, we…