相关论文: Overhang

Given a collection of n opaque unit disks in the plane, we want to find a stacking order for them that maximizes their visible perimeter---the total length of all pieces of their boundaries visible from above. We prove that if the centers…

We review the finite element approximation of the classical obstacle problem in energy and max-norms and derive error estimates for both the solution and the free boundary. On the basis of recent regularity results we present an optimal…

For any twisted ideal polygon in $\mathbb{H}^3$, we construct a harmonic map from $\mathbb{C}$ to $\mathbb{H}^3$ with a polynomial Hopf differential, that is asymptotic to the given polygon, and is a bounded distance from a pleated plane.…

In this paper, we introduce the stationary harmonic measure in the upper half plane. By bounding this measure, we are able to define both the discrete and continuous time diffusion limit aggregation (DLA) in the upper half plane with…

General estimates from below of holomorphic and subharmonic functions play one of the key roles in the theory of growth of holomorphic and subharmonic functions and in general in the theory of potential. At the same time, the most diverse…

We show that there are harmonic functions on a ball ${\mathbb{B}_n}$ of $\mathbb{R}^n$, $n\ge 2$, that are continuous up to the boundary (and even H\"older continuous) but not in the Sobolev space $H^s(\mathbb{B}_n)$ for any $s$…

The Cahn-Hilliard equation is related with a number of interesting physical phenomena like the spinodal decomposition, phase separation and phase ordering dynamics. On the other hand this equation is very stiff an the difficulty to solve it…

Let $\D$ be a set of $n$ pairwise disjoint unit balls in $\R^d$ and $P$ the set of their center points. A hyperplane $\Hy$ is an \emph{$m$-separator} for $\D$ if each closed halfspace bounded by $\Hy$ contains at least $m$ points from $P$.…

A topological graph is $k$-quasi-planar if it does not contain $k$ pairwise crossing edges. A 20-year-old conjecture asserts that for every fixed $k$, the maximum number of edges in a $k$-quasi-planar graph on $n$ vertices is $O(n)$. Fox…

We consider a Cauchy problem for stochastic heat equation driven by a real harmonizable fractional stable process $Z$ with Hurst parameter $H>1/2$ and stability index $\alpha>1$. It is shown that the approximations for its solution, which…

We study stable solutions to the fractional Allen-Cahn equation \linebreak $(-\Delta)^{s/2} u = u-u^3$, $|u|<1$ in $\mathbb{R}^n$. For every $s\in (0,1)$ and dimension $n\geq 2$, we establish sharp energy estimates, density estimates, and…

We study the function $H_n(C_{2k})$, the maximum number of Hamilton paths such that the union of any pair of them contains $C_{2k}$ as a subgraph. We give upper bounds on this quantity for $k\ge 3$, improving results of Harcos and…

A bottleneck plane perfect matching of a set of $n$ points in $\mathbb{R}^2$ is defined to be a perfect non-crossing matching that minimizes the length of the longest edge; the length of this longest edge is known as {\em bottleneck}. The…

This paper investigates the convergence of density approximations for stochastic heat equation in both uniform convergence topology and total variation distance. The convergence order of the densities in uniform convergence topology is…

Let $h(n)$ denote the maximum number of triangles with angles between $59^\circ$ and $61^\circ$ in any $n$-element planar set. Our main result is an exact formula for $h(n)$. We also prove $h(n)= n^3/24+ O(n \log n)$ as $n\to \infty$.…

Consider a subset [1,2,...,n]x[1,2,...,n] of the plane integer lattice. Take any non self-intersecting n^2-gon built on it (straight angles are allowed). The square of a side length is a positive integer. It is thus natural to ask how large…

Consider the $n$-cube graph with vertices $\{-1,1\}^n$ and edges connecting vertices with hamming distance $1$. How many hyperplanes in $\mathbb{R}^n$ are needed in order to dissect all edges? We show that at least…

A 3-$(n,4,1)$ packing design consists of an $n$-element set $X$ and a collection of $4$-element subsets of $X$, called {\it blocks}, such that every $3$-element subset of $X$ is contained in at most one block. The packing number of…

We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has…

In 1999, Jacobson and Lehel conjectured that for $k \geq 3$, every $k$-regular Hamiltonian graph has cycles of at least linearly many different lengths. This was further strengthened by Verstra\"{e}te, who asked whether the regularity can…