Related papers: Optimizing generalized kernels of polygons

We tackle the problem of optimizing over all possible positive definite radial kernels on Riemannian manifolds for classification. Kernel methods on Riemannian manifolds have recently become increasingly popular in computer vision. However,…

Low-rank approximation is a common tool used to accelerate kernel methods: the $n \times n$ kernel matrix $K$ is approximated via a rank-$k$ matrix $\tilde K$ which can be stored in much less space and processed more quickly. In this work…

We introduce the notion of an $\varepsilon$-cover for a kernel range space. A kernel range space concerns a set of points $X \subset \mathbb{R}^d$ and the space of all queries by a fixed kernel (e.g., a Gaussian kernel $K(p,\cdot) =…

The concept of partial structure R1 (pR1) is a generalization of the concept of single atom R1 (sR1) (Zhang & Donahue, 2024). The hypothesis is that the deepest hole of a pR1 map determines the orientation and location of a missing…

Given a simple polygon $P$ consisting of $n$ vertices, we study the problem of designing space-efficient algorithms for computing (i) the visibility polygon of a point inside $P$, (ii) the weak visibility polygon of a line segment inside…

Highly localized kernels constructed by orthogonal polynomials have been fundamental in recent development of approximation and computational analysis on the unit sphere, unit ball and several other regular domains. In this work we first…

We present a quantum interior-point method (IPM) for second-order cone programming (SOCP) that runs in time $\widetilde{O} \left( n\sqrt{r} \frac{\zeta \kappa}{\delta^2} \log \left(1/\epsilon\right) \right)$ where $r$ is the rank and $n$…

We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…

H. Widom derived formulae expressing correlation functions of orthogonal and symplectic ensembles of random matrices in terms of orthogonal polynomials (H. Widom. J. Stat. Phys. 94, (1999) 347-363). We obtain similar results for discrete…

For $\beta \geq 1$, the \emph{$\beta$-skeleton depth} ($\SkD_\beta$) of a query point $q\in \mathbb{R}^d$ with respect to a distribution function $F$ on $\mathbb{R}^d$ is defined as the probability that $q$ is contained within the…

We consider the construction of a polygon $P$ with $n$ vertices whose turning angles at the vertices are given by a sequence $A=(\alpha_0,\ldots, \alpha_{n-1})$, $\alpha_i\in (-\pi,\pi)$, for $i\in\{0,\ldots, n-1\}$. The problem of…

As helioseismology matures and turns into a precision science, modeling finite-frequency, geometric and systematical effects is becoming increasingly important. Here we introduce a general formulation for treating perturbations of arbitrary…

The use of kernel functions is a common technique to extract important features from data sets. A quantum computer can be used to estimate kernel entries as transition amplitudes of unitary circuits. Quantum kernels exist that, subject to…

Convolution is an important tool in the construction of positive definite kernels on a manifold. This contribution provides conditions on an $L^2$-positive definite and zonal kernel on the unit sphere of $\mathbb{C}^q$ in order that the…

For any $\pi$-formal group scheme $G$, the Frobenius morphism between arithmetic jet spaces restricts to generalized kernels of the projection map. Using the functorial properties of such kernels of arithmetic jet spaces, we show that this…

Research of cycles through specific vertices is a central topic in graph theory. In this context, we focus on a well-studied computational problem, \textsc{$T$-Cycle}: given an undirected $n$-vertex graph $G$ and a set of $k$ vertices…

Orthogonal rational functions (ORF) on the unit circle generalize orthogonal polynomials (poles at infinity) and Laurent polynomials (poles at zero and infinity). In this paper we investigate the properties of and the relation between these…

Orthogonal graph drawings are used in applications such as UML diagrams, VLSI layout, cable plans, and metro maps. We focus on drawing planar graphs and assume that we are given an \emph{orthogonal representation} that describes the desired…

We study $\ell$-isogeny graphs of ordinary elliptic curves defined over $\mathbb{F}_q$ with an added level structure. Given an integer $N$ coprime to $p$ and $\ell,$ we look at the graphs obtained by adding $\Gamma_0(N),$ $\Gamma_1(N),$ and…

A $P$-polynomial corner, for $P \in \mathbb{Z}[z]$ a polynomial, is a triple of points $(x,y),\; (x+P(z),y),\; (x,y+P(z))$ for $x,y,z \in \mathbb{Z}$. In the case where $P$ has an integer root of multiplicity $1$, we show that if $A…