Related papers: Slicing Correspondences with High Degree Hypersurf…
We introduce a new multiplication for the polytope algebra, defined via the intersection of polytopes. After establishing the foundational properties of this intersection product, we investigate finite-dimensional subalgebras that arise…
We define modular equations in the setting of PEL Shimura varieties as equations describing Hecke correspondences, and prove upper bounds on their degrees and heights. This extends known results about elliptic modular polynomials, and…
The degree of symmetry of a combinatorial object, such as a lattice path, is a measure of how symmetric the object is. It typically ranges from zero, if the object is completely asymmetric, to its size, if it is completely symmetric. We…
We describe a general algorithm for computing intersection pairings on arithmetic surfaces. We have implemented our algorithm for curves over $\mathbb Q$, and we show how to use it to compute regulators for a number of Jacobians of smooth…
Score matching is a popular method for estimating unnormalized statistical models. However, it has been so far limited to simple, shallow models or low-dimensional data, due to the difficulty of computing the Hessian of log-density…
Many algorithms for the computation of correspondences between deformable shapes rely on some variant of nearest neighbor matching in a descriptor space. Such are, for example, various point-wise correspondence recovery algorithms used as a…
Given a reduced analytic space $Y$ we introduce a class of {\it nice} cycles, including all effective $\mathbb{Q}$-Cartier divisors. Equidimensional nice cycles that intersect properly allow for a natural intersection product. Using…
Consider the spaces of pseudodifferential operators between tensor density modules over the line as modules of the Lie algebra of vector fields on the line. We compute the equivalence classes of various subquotients of these modules. There…
In recent years, networks with higher-order interactions have emerged as a powerful tool to model complex systems. Comparing these higher-order systems remains however a challenge. Traditional similarity measures designed for pairwise…
In an orientable surface with boundary, free homotopy classes of curves on surfaces are in one to one correspondence with cyclic reduced words in a set of standard generators of the fundamental group. The combinatorial length of a class is…
Reflectometry is a technique that uses the light reflected by a sample to determine properties of the sample. Interferometric reflectometry uses interference between two beams, one of which is incident on ---and reflected back by--- a…
In this paper we propose an approach for computing multiple high-quality near-isometric dense correspondences between a pair of 3D shapes. Our method is fully automatic and does not rely on user-provided landmarks or descriptors. This…
Mathematical Morphology proposes to extract shapes from images as connected components of level sets. These methods prove very suitable for shape recognition and analysis. We present a method to select the perceptually significant (i.e.,…
Let $X$ be a hypersurface, of degree $d$, in an $n$--dimensional projective space. The Hessian map is a rational map from $X$ to the projective space of symmetric matrices that sends a point $p\in X$ to the Hessian matrix of the defining…
We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…
In this paper we present the algorithms for calculating the differential geometric properties {t,n,b1,b2,b3,k1,k2,k3,k4} along-with geodesic curvature and geodesic torsion of the transversal intersection curve of four hypersurfaces (given…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
Following Brooks's calculation of the $\hat{A}$-genus of complete intersections, a new and more computable formula about the $\hat{A}$-genus and $\alpha$-invariant will be described as polynomials of multi-degree and dimension. We also give…
Given an irreducible variety $X$ over a finite field, the density of hypersurfaces of varying degree $d$ intersecting $X$ in an irreducible subvariety is $1$, by a result of Charles and Poonen. In this note, we analyse the situation fixing…
Complex structures commonly exist in natural images. When an image contains small-scale high-contrast patterns either in the background or foreground, saliency detection could be adversely affected, resulting erroneous and non-uniform…