Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

8162432 · May 202619922001200920172026
48 results for Dirichlet polygon

New heat trace coefficients reveal curvature effects in polygonal domains.

problem Understanding heat trace behavior in polygonal domains with curved corners.
method Local heat trace expansion through order t1/2t^{1/2}, analyzing both Dirichlet and Neumann boundary conditions.
result Sharp sign law for the Dirichlet angular factor of the first corner-curvature heat invariant.

Formula for Laplacian determinants on polygonal domains with slits.

problem Determining the ζζ-regularized determinant of the Laplacian on polygonal domains with slits.
method Patchwork method for heat trace asymptotics, comparison formula for smooth conformal metrics.
result Polyakov-Alvarez type formula for Laplacian determinants on polygonal domains with slits.

In this paper, we study Alexandrov-embedded r-noids with genus 1 and horizontal ends. Such minimal surfaces are of two types and we build several examples of the first one. We prove that if a polygon bounds an immersed polygonal disk, it is the flux polygon of an r-noid with genus 1 of the first type. We also study the…

2003-12-03abs ↗pdf ↗

The functional determinant of an elliptic operator with positive, discrete spectrum may be defined as eZ(0)e^{-Z'(0)}, where Z(s)Z(s), the zeta function, is the sum nλns\sum_n^{\infty} λ_n^{-s} analytically continued to ss around the origin. In this paper Z(0)Z'(0) is calculated for the Laplace operator with Dirichlet boundary…

1993-04-08abs ↗pdf ↗

In this thesis we deal with spectral invariants for polygons and closed orbisurfaces of constant Gaussian curvature. In each case our method is to study the heat kernel and the asymptotic expansion of the heat trace. First, we investigate hyperbolic polygons, i.e. relatively compact domains in the hyperbolic plane with…

2017-11-09abs ↗pdf ↗

Let Ω0Ω_0 be a polygon in $\RR^2$, or more generally a compact surface with piecewise smooth boundary and corners. Suppose that $Ω_\e$ is a family of surfaces with $\calC^\infty$ boundary which converges to Ω0Ω_0 smoothly away from the corners, and in a precise way at the vertices to be described in the paper. Fedosov …

2008-12-30abs ↗pdf ↗

Starting from an arbitrary sequence of polygons whose total perimeter is 2n2n, we can build an (oriented) surface by pairing their sides in a uniform fashion. Chmutov and Pittel (arXiv:1503.01816) have shown that, regardless of the configuration of polygons we started with, the degree sequence of the graph obtained thi…

2019-02-04abs ↗pdf ↗

New methods classify convex lattice polygons for affine dimers.

problem Not all convex lattice polygons are characteristic polygons of affine dimers.
method General constructions and algorithm for finding affine dimers with prescribed polygons.
result All lattice triangles, generalised parallelograms, and polygons of genus at most two admit an affine dimer.

The pentagram map's limit point is related to infinitesimal perturbations of polygons.

problem Understanding the limit point of the pentagram map and its relation to polygon perturbations.
method Interpreting Glick's operator as the infinitesimal monodromy of a polygon.
result Glick's operator measures the extent to which a perturbed polygon does not close up.

Study finds finitely many non-congruent polygonal domains with same Steklov spectrum.

problem Inverse Steklov problem on convex polygons.
method Analysis of Steklov eigenvalues and isoperimetric bounds.
result For almost all convex polygonal domains, there exist at most finitely many non-congruent domains with the same Steklov spectrum.

The paper classifies vertices in planar polygons formed by convex domains.

problem Classifying vertices in planar polygons formed by convex domains.
method Analyzing polygons formed by homothets and translates of a convex domain.
result The number of singular boundary points in a CC-polygon is between nn and 2(n1)+m2(n-1)+m for a strictly convex domain with mm singular boundary points.

In this paper, we discuss centroaffine geometry of polygons in 33-space. For a polygon XX that is locally convex with respect to an origin together with a transversal vector field UU, we define the centroaffine dual pair (Y,V)(Y,V) similarly to [6]. We prove that vertices of (X,U)(X,U) correspond to flattening points for …

2018-12-03abs ↗pdf ↗

We establish a fundamental connection between smooth and polygonal knot energies, showing that the Minimum Distance Energy for polygons inscribed in a smooth knot converges to the Moebius Energy of the smooth knot as the polygons converge to the smooth knot. However, the polygons must converge in a ``nice'' way, and th…

2003-05-29abs ↗pdf ↗

The pentagram map takes a planar polygon PP to a polygon PP' whose vertices are the intersection points of consecutive shortest diagonals of PP. This map is known to interact nicely with Poncelet polygons, i.e. polygons which are simultaneously inscribed in a conic and circumscribed about a conic. A theorem of R. Sc…

2019-06-25abs ↗pdf ↗

Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic l1l_1-metric is thus inherited from the product of the two finite dendrons via an isometric embedding. The rectangular cell complexe…

2010-05-11abs ↗pdf ↗

Study on Poncelet polygons' centers and circumcenters in various geometries.

problem Understanding Poncelet polygons' geometric centers in different geometries.
method Analyzing the Circumcenter of Mass and Center of Mass of Poncelet polygons, proving Dan Reznik's invariants, and exploring spherical geometry.
result Proof of Dan Reznik's invariants for billiard trajectories and insights into Poncelet polygons' centers in spherical geometry.

The study proves analogues of the discrete isoperimetric inequality in hyperbolic geometry.

problem Finding the minimum perimeter for polygons with a fixed area in hyperbolic geometry.
method Proving analogues of the discrete isoperimetric inequality for cyclic and tangential polygons in hyperbolic geometry, considering both single and multiple polygons.
result Established two versions of the isoperimetric inequality for multiple polygons in hyperbolic geometry with certain area or perimeter restrictions.

The map S transforms polygon sides, and almost no convex polygons remain convex.

problem Investigating whether convex polygons remain convex under the map S.
method Analyzing the dynamics of the map S and proving properties of the set of polygons that remain convex.
result The set of polygons that remain convex under iterations of S has measure zero and is an algebraic subvariety of codimension two.

In this article we investigate a family of nonlinear evolutions of polygons in the plane called the ββ-polygon flow and obtain some results analogous to results for the smooth curve shortening flow: (1) any planar polygon shrinks to a point and (2) a regular polygon with five or more vertices is asymptotically stable …

2016-10-12abs ↗pdf ↗

Our main result is that if a generic convex domain in Rn\R^n collapses to a domain in Rn1\R^{n-1}, then the difference between the first two Dirichlet eigenvalues of the Euclidean Laplacian, known as the fundamental gap, diverges. The boundary of the domain need not be smooth, merely Lipschitz continuous. To motivate th…

2008-10-27abs ↗pdf ↗

The study proves a discrete Blaschke theorem for convex polygons in 2-dimensional space forms.

problem Investigating curvature and circumradius constraints for convex polygons in 2-space forms.
method Defining curvature at each vertex and proving a Blaschke-type theorem.
result The circumradius of a convex polygon satisfies a specific inequality related to its vertex curvatures.

We study polygon spaces arising from planar configurations of necklaces with some of the beads fixed and some of the beads sliding freely. These spaces include configuration spaces of flexible polygons and some other natural polygon spaces. We characterise critical points of the oriented area function in geometric term…

2020-01-08abs ↗pdf ↗

Consider a convex polygon P in the plane, and denote by U a homothetical copy of the vector sum of P and (-P). Then the polygon U, as unit ball, induces a norm such that, with respect to this norm, P has constant Minkowskian width. We define notions like Minkowskian curvature, evolutes and involutes for polygons of con…

2014-06-12abs ↗pdf ↗

Characterizes polygonal surfaces in pseudo-hyperbolic spaces.

problem Understanding polygonal surfaces in pseudo-hyperbolic spaces.
method Characterizes polygonal surfaces by total curvature finiteness and asymptotic flatness, using comparison of ideal boundaries.
result Polygonal surfaces have parabolic type and polynomial quartic differential.

Maximal distortion between geodesic and Euclidean diameters in polygonal domains is studied.

problem Maximal ratio of geodesic to Euclidean diameters in polygonal domains with holes.
method Analyzes convex polygons with holes, using geometric triangulations as a comparison.
result The supremum of the ratio is between Ω(h1/3)Ω(h^{1/3}) and O(h1/2)O(h^{1/2}) for convex polygons.

Solitons are special polygon midpoints under affine transformations.

problem Characterizing polygons whose midpoints under affine transformations form a new polygon.
method Analyzing midpoints polygons and their relationship to affine transformations and differential equations.
result A large class of polygons are on an orbit of a one-parameter subgroup of the affine group, and these curves are solutions to a specific differential equation.

The study proves constant-curvature analogues of hot spots conjecture for triangles.

problem Proving the hot spots conjecture in constant curvature domains.
method Analyzing geodesic triangles of constant negative curvature and using Killing fields.
result First mixed Dirichlet-Neumann Laplace eigenfunctions have no non-vertex critical points in constant curvature triangles.

The study connects polygon areas and projective structures in 3D space.

problem Relating polygon areas and projective structures in 3D space.
method Investigates positive tuples of complete flags in R^3 and their associated polygons in RP^2.
result Establishes a relationship between Holmes-Thompson area and projective structures.

We describe all families of star-shaped n-polygons in the Euclidean plane with prescribed perimeter and area ; they are leaves of a foliation F on the space of star-shaped n-polygons. By the way, we study some geometric properties of convex polygons, for instance their inscriptibility in a circle and their regularity i…

2019-02-12abs ↗pdf ↗

We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued quadratic invariant bb on the space of those isometric deformations which, for conv…

2004-10-04abs ↗pdf ↗