Related papers: Intersection Queries for Flat Semi-Algebraic Objec…

The goal of the paper is two-fold. At first, we attempt to give a survey of some recent applications of symmetric polynomials and divided differences to intersection theory. We discuss: polynomials universally supported on degeneracy loci;…

Let $G/\Gamma$ be the quotient of a semisimple Lie group by an arithmetic lattice. We show that for reductive subgroups $H$ of $G$ that is large enough, the orbits of $H$ on $G/\Gamma$ intersect nontrivially with a fixed compact set. As a…

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

There is a well-documented research programme on graph operators which addresses questions such as `Which graphs appear as images of graphs?'; `Which graphs are fixed under the operator?'; `What happens if the operator is iterated?' In this…

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

We investigate the viability of defining an intersection product on algebraic cycles on a singular algebraic variety by pushing forward intersection products formed on a resolution of singularities. For varieties with resolutions having a…

In the mid eighties Goldman proved an embedded curve could be isotoped to not intersect a closed geodesic if and only if their Lie bracket (as defined in that work) vanished. Goldman asked for a topological proof and about extensions of the…

Let $M$ be either the 2-sphere $\SS^2 \subset\RR^3$ or the hyperbolic plane $\HH^2 \subset \RR^3$. If $\Delta(abc)$ is a geodesic triangle on $M$ with corners at $a,b,c\in M$, we denote by $\alpha, \beta, \gamma\in M$ the midpoints of their…

In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

Let $\mathcal{T}$ be a triangular algebra over a commutative ring $\mathcal{R}$ and $\mathcal{Z(T)}$ be the center of $\mathcal{T}$. Suppose that ${\mathfrak q}\colon \mathcal{T}\times \mathcal{T}\longrightarrow \mathcal{T}$ is an…

Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting families of triangles with vertices in a given set of points. In…

Let S, T be surfaces in P3. Suppose that S intersect T is set-theoretically a smooth curve C of degree d and genus g. Suppose that S and T have no common singular points. Then if C is not a complete intersection, then deg(S), deg(T) < 2d^4.…

Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…

The local arrangement of atoms is one of the most important predictors of mechanical and functional properties of materials. However, algorithms for identifying the geometrical arrangements of atoms in complex materials systems are lacking.…

Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…

We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient way. This problem has applications in e.g. information retrieval and…

Let $P$ be a set of $n$ points in ${\mathbb R}^{d}$. A point $p \in P$ is $k$\emph{-shallow} if it lies in a halfspace which contains at most $k$ points of $P$ (including $p$). We show that if all points of $P$ are $k$-shallow, then $P$ can…

Given any arbitrary semi-algebraic set $X$, any two points in $X$ may be joined by a piecewise $C^2$ path $\gamma$ of shortest length. Suppose $\mathcal{A}$ is a semi-algebraic stratification of $X$ such that each component of $\gamma \cap…

Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…