Related papers: Limits of Recursive Triangle and Polygon Tunnels
We study the tunneling of massless scalars across black hole horizons in any number of spacetime dimensions greater than three. Our analysis finds that corrections due to backreaction and the inverse dimensional expansion are naturally…
We introduce and study an infinite random triangulation of the unit disk that arises as the limit of several recursive models. This triangulation is generated by throwing chords uniformly at random in the unit disk and keeping only those…
This is a brief review of few relevant topics on tunneling of composite particles and how the coupling to intrinsic and external degrees of freedom affects tunneling probabilities. I discuss the phenomena of resonant tunneling, different…
We continue the work begun in OEIS sequence A332636 which presents recursive sequences that have triangles that appear embedded in them. This paper i) generalizes the main result presented in A332636, ii) provides a complete set of…
The particle approach to one-dimensional potential scattering is applied to non relativistic tunnelling between two, three and four identical barriers. We demonstrate as expected that the infinite sum of particle contributions yield the…
We study the problem of finding maximum-area triangles that can be inscribed in a polygon in the plane. We consider eight versions of the problem: we use either convex polygons or simple polygons as the container; we require the triangles…
If we label the vertices of a triangle with 1, 2 and 4, and the orthocentre with 7, then any of the four numbers 1, 2, 4, 7 is the nim-sum of the other three and is their orthocentre. Regard the triangle as an orthocentric quadrangle.…
We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…
We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…
Starting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined…
We consider simple models of tunneling of an object with intrinsic degrees of freedom. This important problem was not extensively studied until now, in spite of numerous applications in various areas of physics and astrophysics. We show…
We introduce the notion of recurrence and transience for graphs over non-Archimedean ordered field. To do so we relate these graphs to random walks of directed graphs over the reals. In particular, we give a characterization of the real…
We consider the problem of finding integer-sided triangles with R/r an integer, where R and r are the radii of the circumcircle and incircle respectively. We show that such triangles are relatively rare.
Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…
In the case of tunneling of relativistic particles, differently from the nonrelativistic case, a limit of "transparent" barrier can also lead to an apparent "superluminal" behavior when considering the phase time. In this limit, the…
A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns…
An important concept in digital geometry for computer imagery is that of tunnel. In this paper we obtain a formula for the number of tunnels as a function of the number of the object vertices, pixels, holes, connected components, and 2x2…
The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of…
An expanding closed universe filled with radiation can either recollapse or tunnel to the regime of unbounded expansion, if the cosmological constant is nonzero. We re-examine the question of particle creation during tunneling, with the…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…