Related papers: On Landsberg's criterion for complete intersection…

The rational Chow ring A?(S[n],Q) of the Hilbert scheme S[n] parametrising the length n zero-dimensional subschemes of a toric surface S can be described with the help of equivariant techniques. In this paper, we explain the general method…

By a Randers' structure on a manifold $M$ we mean a Finsler structure $L^*=L+\alpha$, where $L$ is a Riemannian structure and $\alpha$ is a 1-form on $M$. This structure was first introduced by Randers ~\cite{[8]} from the standpoint of…

Using an alternate description of support varieties of pairs of modules over a complete intersection, we give several new applications of such varieties, including results for support varieties of intermediate complete intersections.…

We present a method for guaranteed collision detection with toleranced motions. The basic idea is to consider the motion as a curve in the 12-dimensional space of affine displacements, endowed with an object-oriented Euclidean metric, and…

The aim of this note is to give a simple definition of genus zero virtual orientation classes (or fundamental classes) for projective complete intersections or, more generally, for complete intersections in convex varieties, and to prove a…

Generalizing a theorem of Campercholi, we characterize, in syntactic terms, the ranges of epimorphisms in an arbitrary class of similar first-order structures (as opposed to an elementary class). This allows us to strengthen a result of…

This paper is about the local geometry of a real surfaces. It introduces machinery for studying families of subsets which are determined by conditions which are similar to base conditions, but also involve positivity/non-negativity. The…

Transcendence criteria inspired by Kolberg's paper dated 1962. In his paper dated 1962, Kolberg states and proves a theorem on the transcendence of the values of the sums of a class of certain power series in x, for algebraic values of x.…

Given a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when their representing sets have non-empty intersection. Sometimes…

Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

We study the footprint function, with respect to a monomial order, of complete intersection graded ideals in a polynomial ring with coefficients in a field. For graded ideals of dimension one, whose initial ideal is a complete intersection,…

We introduce a bottom-up model for simultaneously finding many boundary elements in an image, including contours, corners and junctions. The model explains boundary shape in each small patch using a 'generalized M-junction' comprising M…

We introduce a new criterion which tests if a given decomposition of a given ternary form $T$ of even degree is unique. The criterion is based on the analysis of the Hilbert function of the projective set of points $Z$ associated to the…

Visual place recognition tasks often encounter significant challenges in landmark detection due to the presence of irrelevant objects such as humans, cars, and trees, despite the remarkable progress achieved by previous models, especially…

We prove an existence theorem for jet differentials on complete intersection varieties that generalizes a theorem of S. Diverio. We also show that one can readily deduce hyperbolicity for generic complete intersections of high multidegree…

Since edge detection is in the forefront of image processing for object detection, it is crucial to have a good understanding of edge detection algorithms. The reason for this is that edges form the outline of an object. An edge is the…

An algorithm is demonstrated that finds an ordinary intersection in an arrangement of $n$ lines in $\mathbb{R}^2$, not all parallel and not all passing through a common point, in time $O(n \log{n})$. The algorithm is then extended to find…

We characterize the graphs $G$ for which their toric ideals $I_G$ are complete intersections. In particular we prove that for a connected graph $G$ such that $I_G$ is complete intersection all of its blocks are bipartite except of at most…

This paper presents a minimum displacement motion planning problem wherein obstacles are displaced by a minimum amount to find a feasible path. We define a metric for robot-obstacle intersection that measures the extent of the intersection…