arXiv research

Formula connects length and correlation functions via ghost polygons and Poisson bracket.

Computational ghost imaging is an imaging technique in which an object is imaged from light collected using a single-pixel detector with no spatial resolution. Recently, ghost cytometry has been proposed for a high-speed cell-classification method that involves ghost imaging and machine learning in flow cytometry. Ghos…

Ghost points affect stability in finite difference schemes for diffusion equations.

In this paper we define and study the "ghost loop orbifold" of an orbifold $X$ consisting of those loops that remain constant in the coarse moduli space of $X$. We construct a configuration space model for the ghost loop orbifold using an idea of G. Segal. From this we exhibit the relation between the Hochschild and cy…

The study counts periodic orbits on smooth manifolds, adding ghost orbits for completeness.

Ghost mechanism explains abrupt learning in RNNs, revealing constraints on optimization landscapes.

A BV algebra is a formal framework within which the BV quantization algorithm is implemented. In addition to the gauge symmetry, encoded in the BV master equation, the master action often exhibits further global symmetries, which may be in turn gauged. We show how to carry this out in a BV algebraic set up. Depending o…

Nyquist ghost artifacts in EPI are originated from phase mismatch between the even and odd echoes. However, conventional correction methods using reference scans often produce erroneous results especially in high-field MRI due to the non-linear and time-varying local magnetic field changes. Recently, it was shown that …

We show that the (4,5)-torus knot $T_{4,5}$ admits exactly one ghost character. We then show that this ghost character provides the following two important results. (1) It is known that for any knot $K$ every (meridionally) trace-free $\SL_2(\C)$-representation of the knot group $G(K)$ yields an $\SL_2(\C)$-representat…

Study reveals hidden null components in overparametrized neural networks.

We show that the $(4,5)$- and $(5,6)$-torus knots admit ghost characters. Consequently, these knots provide counterexamples to Ng's conjecture, which proposes an isomorphism between the complexification of degree $0$ abelian knot contact homology and the coordinate ring of the character variety of the $2$-fold branched…

We use conformal, but ghostful, Weyl gravity to study its ghost-free, second derivative, partially massless (PM) spin 2 component in presence of Einstein gravity with positive cosmological constant. Specifically, we consider both gravitational- and self- interactions of PM via the fully non-linear factorization of conf…

We propose a model in which a spliced vector bundle (with an arbitrary number of gauge structures in the splice) possesses a geometry which do not split. The model employs connection 1-forms with values in a space-product of Lie algebras, and therefore interlaces the various gauge structures in a non-trivial manner. Sp…

A new metric GNQ audits LLMs for privacy risks during training.

New findings on null measurability in symmetrization interface of VC learning.

After defining cohomologically higher order BRST and anti-BRST operators for a compact simple algebra {\cal G}, the associated higher order Laplacians are introduced and the corresponding supersymmetry algebra $Σ$ is analysed. These operators act on the states generated by a set of fermionic ghost fields transforming u…

New methods classify convex lattice polygons for affine dimers.

On every split supermanifold equipped with the Rothstein even super-Poisson bracket we construct a deformation quantization by means of a Fedosov-type procedure. In other words, the supercommutative algebra of all smooth sections of the dual Grassmann algebra bundle of an arbitrarily given vector bundle E (equipped wit…

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

General area-preserving motion of polygonal curves is formulated as a system of ODEs. Solution polygonal curves belong to a prescribed polygonal class, which is similar to the admissible class used in the crystalline curvature flow. The ODEs are discretized implicitly in time keeping a given constant area speed while s…

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

In the past few years, deep learning has transformed artificial intelligence research and led to impressive performance in various difficult tasks. However, it is still unclear how the brain can perform credit assignment across many areas as efficiently as backpropagation does in deep neural networks. In this paper, we…

New property: polygons have a fixed dimension regardless of ambient space dimensions.

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

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

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…

The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. 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…

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 $l_1$-metric is thus inherited from the product of the two finite dendrons via an isometric embedding. The rectangular cell complexe…

Optimal Reeb graphs identified for polygon decomposition.

Improved pricing of vanilla options using modified Adams method and sinh-acceleration.

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

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

New formula for spherical polygon area via prequantization.

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

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 …

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

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…

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…

Investigates dual foliations of polygon spaces based on area and perimeter.

We consider the convex-concave saddle point problem $\min_{x}\max_{y} f(x)+y^\top A x-g(y)$ where $f$ is smooth and convex and $g$ is smooth and strongly convex. We prove that if the coupling matrix $A$ has full column rank, the vanilla primal-dual gradient method can achieve linear convergence even if $f$ is not stron…

Characterizes polygonal surfaces in pseudo-hyperbolic spaces.

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

Solitons are special polygon midpoints under affine transformations.

Short proof for ideal polygons with near optimal orthogeodesic decomposition.

We study polygonal analogues of several moving boundary problems and their time discretization which preserves the constant area speed property. We establish various polygonal analogues of geometric formulas for moving boundaries and make use of the geometric formulas for our numerical scheme and its analysis of genera…

In this paper, we study the symplectic volume of the moduli space of polygons by using Witten's formula. We propose to use this volume as a measure for the flexibility of a polygon with fixed side-lengths. The main result of our is that among all the Spherical and Euclidean polygons with fixed perimeter the regular one…

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

Fast algorithm samples confined polygons efficiently.