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,742 papers · 148 categories

Trend · papers per month

61122183244 · Jun 202019922001200920172026
48 results for curvilinear polygonal domains

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.

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.

Study on conical singularities in 2D surfaces, deriving Polyakov formulas.

problem Analyzing zeta-regularized determinants in surfaces with conical singularities.
method Demonstrated variational and integrated Polyakov formulas for conical singularities, circular sectors, and cones.
result Explicit formulas for the determinant of conical sectors and cones derived.

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.

Solves relative isoperimetric problem on polygonal domains, focusing on corners.

problem Relative isoperimetric problem on polygonal domains in R2\mathbb{R}^2.
method Developed techniques for polygonal domains, with special attention to corners.
result Solved the relative isoperimetric problem for a square with a square corner removed.

Method constructs orthogonal curvilinear coordinates in constant curvature spaces.

problem Creating orthogonal coordinates in spaces of constant curvature.
method Modification of Krichever's method for Euclidean space, applied to constant curvature spaces.
result Examples of orthogonal coordinate systems on the sphere and hyperbolic plane constructed.

Duality principle for approximation of geometrical objects (also known as Eudoxus exhaustion method) was extended and perfected by Archimedes in his famous tractate "Measurement of circle". The main idea of the approximation method by Archimedes is to construct a sequence of pairs of inscribed and circumscribed polygon…

2008-11-07abs ↗pdf ↗

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.

Uniform estimates for elliptic problems near polygonal domains.

problem Proving uniform solvability estimates for elliptic problems near polygonal domains.
method Suitable conformal modification of the metric to make the union of domains a manifold with boundary and relative bounded geometry.
result Rounding off the corners of the limit polygonal domain.

The image of a polygonal knot K under a spherical inversion of R^3 (union infinity) is a simple closed curve made of arcs of circles, having the same knot type as the mirror image of K. Suppose we reconnect the vertices of the inverted polygon with straight lines, making a new polygon. This may be a different knot type…

2006-02-21abs ↗pdf ↗

Study proves spectral determination of triangles and quadrilaterals, with restrictions on higher-order polygons.

problem Determining the geometry of convex polygons from their Steklov spectra.
method Analysis of characteristic polynomial and spectral properties of Steklov spectrum.
result Almost all triangles and certain quadrilaterals are uniquely determined by their Steklov spectra.

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 ↗

Study examines Hilbert area of inscribed polygons in projective geometry.

problem Understanding Hilbert area of inscribed polygons in projective geometry.
method Examined correspondence between Fock-Goncharov and Cartesian coordinates, analyzed degeneration and Hilbert area of inscribed quadrilaterals, developed microlocal condition.
result Sequence of strictly convex domains with bounded Hilbert area and divergent Goldman parameters.

Study critical points of Laplace eigenfunctions in polygons.

problem Characterize critical points of Laplace eigenfunctions in polygonal domains.
method Analyze components of the critical set with codimension 1.
result For simply connected polygons, if a second Neumann eigenfunction has infinitely many critical points, the polygon must be a rectangle.

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 ↗

We initiate the study of the higher-order Escobar constants Ik(M)I_k(M), k3k\geq 3, on bounded planar domains MM. The Escobar constants IkI_k of the unit disk and a family of polygons are provided.

2019-05-18abs ↗pdf ↗

We present differentially private efficient algorithms for learning union of polygons in the plane (which are not necessarily convex). Our algorithms achieve (α,β)(α,β)-PAC learning and (ε,δ)(ε,δ)-differential privacy using a sample of size O~(1αεklogd)\tilde{O}\left(\frac{1}{αε}k\log d\right), where the domain is [d]×[d][d]\times[d] and $…

2019-02-13abs ↗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 ↗

The monster tower is a tower of spaces over a specified base; each space in the tower is a parameter space for curvilinear data up to a specified order. We describe and analyze a natural stratification of these spaces.

2016-06-25abs ↗pdf ↗

Extends boundary estimates for Monge-Ampère equations in polygonal domains.

problem Boundary regularity for Monge-Ampère equations on convex polytopes with specific boundary conditions.
method Schauder-type techniques, inspired by Donaldson's work on the Abreu equation.
result Establishes boundary regularity result for Hölder continuous right-hand sides.

In this paper, we construct polynomial growth harmonic maps from once-punctured Riemann surfaces of any finite genus to any even-sided, regular, ideal polygon in the hyperbolic plane. We also establish their uniqueness within a class of maps which differ by exponentially decaying variations. Previously, harmonic maps f…

2016-05-25abs ↗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.

Nielsen reduction is an algorithm which decomposes any automorphism of a free group into a product of elementary Nielsen transformations. While this may be applied to a mapping class of a surface Sg,1S_{g,1} with one boundary component, the resulting decomposition in general will not have a topological interpretation. In…

2010-10-25abs ↗pdf ↗

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.

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 ↗

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 ↗

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 ↗

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 ↗

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 ↗