相关论文: Intersection probabilities for a chordal SLE path …

Consider an instance $h$ of the Gaussian free field on a simply connected planar domain with boundary conditions $-\lambda$ on one boundary arc and $\lambda$ on the complementary arc, where $\lambda$ is the special constant $\sqrt{\pi/8}$.…

The purpose of this paper is to show that for a complete intersection curve $C$ in projective space (other than a few stated exceptions), any morphism $f: C \to \mathbb{P}^r$ satisfying $\text{deg}\, f^*\mathcal{O}_{\mathbb{P}^r}(1)…

Given a finite set T of maps on a finite ring R, we look at the finite simple graph G=(V,E) with vertex set V=R and edge set E={(a,b) | exists t in T, b=t(a), b not equal to a}. An example is when R=Z_n and T consists of a finite set of…

We consider the convergence rate of the alternating projection method for the nontransversal intersection of a semialgebraic set and a linear subspace. For such an intersection, the convergence rate is known as sublinear in the worst case.…

Let ($\Sigma$, g) be a closed connected surface equipped with a riemannian metric. Let ($\lambda$ n) n$\in$N and ($\psi$ n) n$\in$N be the increasing sequence of eigenvalues and the sequence of corresponding L 2-normalized eigenfunctions of…

We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…

In the $n$-body problem, when a~cluster of bodies tends to a collision, then its normalized shape curve converges to the set of normalized central configurations, which has $SO(2)$ symmetry in the planar case. This leaves a possibility that…

Given $n$ points in the plane, a \emph{covering path} is a polygonal path that visits all the points. If no three points are collinear, every covering path requires at least $n/2$ segments, and $n-1$ straight line segments obviously suffice…

This article gives a comprehensive description of the fractal geometry of conformally-invariant (CI) scaling curves, in the plane or half-plane. It focuses on deriving critical exponents associated with interacting random paths, by…

We study some percolation problems on the complete graph over $\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the…

In a geometric inhomogeneous random graph vertices are given by the points of a Poisson process and are equipped with independent weights following a heavy tailed distribution. Any pair of distinct vertices is independently forming an edge…

We prove that on a restricted contact type hypersurface the number of leaf-wise intersections is bounded from below by a certain cup-length.

Recent work on percolation in $d=2$ [J. Phys. A {\bf 55} 204002] introduced an operator that gives a weight $k^{\ell}$ to configurations with $\ell$ `nested paths' (NP), i.e. disjoint cycles surrounding the origin, if there exists a cluster…

The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…

A cap of spherical radius $\alpha$ on a unit $d$-sphere $S$ is the set of points within spherical distance $\alpha$ from a given point on the sphere. Let $\mathcal F$ be a finite set of caps lying on $S$. We prove that if no hyperplane…

In 1974, Stoka solved Buffon's needle problem in $\mathbb{R}^d$, $d \ge 2$, i.e. he found a closed form solution for the probability that a line segment ("needle") with length $\ell$ intersects a grid of parallel hyperplanes with mutual…

We introduce an alternative definition of the relative height h^\kappa(x) of a one-dimensional fluctuating interface indexed by a continuously varying real paramater 0 \leq \kappa \leq 1. It interpolates between the height relative to the…

Given a homotopy connecting two polynomial systems we provide a rigorous algorithm for tracking a regular homotopy path connecting an approximate zero of the start system to an approximate zero of the target system. Our method uses recent…

For $\kappa\in(0,4]$, a family of annulus SLE$(\kappa;\Lambda)$ processes were introduced in [14] to prove the reversibility of whole-plane SLE$(\kappa)$. In this paper we prove that those annulus SLE$(\kappa;\Lambda)$ processes satisfy a…

We study the probability for a random line to intersect a given plane curve, defined over a finite field, in a given number of points defined over the same field. In particular, we focus on the limits of these probabilities under successive…