Related papers: Area Problems Involving Kasner Polygons
For a real K3-surface $X$, one can introduce areas of connected components of the real point set $\mathbb{R} X$ of $X$ using a holomorphic symplectic form of $X$. These areas are defined up to simultaneous multiplication by a positive real…
This paper discusses the permutations that are generated by rotating $k \times k$ blocks of squares in a union of overlapping $k \times (k+1)$ rectangles. It is found that the single-rotation parity constraints effectively determine the…
Selection lemmas are classical results in discrete geometry that have been well studied and have applications in many geometric problems like weak epsilon nets and slimming Delaunay triangulations. Selection lemma type results typically…
Algebraic Nahm equations, considered in the paper, are polynomial equations, governing the $q\rightarrow 1$ limit of the $q$-hypergeometric Nahm sums. They make an appearance in various fields: hyperbolic geometry, knot theory, quiver…
The first part of the course is devoted to the study of solutions to the Laplace equation in $\Omega\setminus K$, where $\Omega$ is a two-dimensional smooth domain and $K$ is a compact one-dimensional subset of $\Omega$. The solutions are…
Given the equations of the first and the second order surfaces in multidimensional space, our goal is to construct a univariate polynomial one of the zeros of which coincides with the square of the distance between these surfaces. To…
Given an edge-weighted undirected graph and a list of k source-sink pairs of vertices, the well-known minimum multicut problem consists in selecting a minimum-weight set of edges whose removal leaves no path between every source and its…
Constrained clustering problems generalize classical clustering formulations, e.g., $k$-median, $k$-means, by imposing additional constraints on the feasibility of clustering. There has been significant recent progress in obtaining…
We investigate elementary properties of successive radii in generalized Minkowski spaces (that is, with respect to gauges), i.e., we measure the "size" of a given convex set in a finite-dimensional real vector space with respect to another…
The first author with B. Sturmfels studied the variety of matrices with eigenvectors in a given linear subspace, called Kalman variety. We extend that study from matrices to symmetric tensors, proving in the tensor setting the…
In this paper we study the initial-value problem associated with the Benjamin-Ono-Zakharov-Kuznetsov equation. Such equation appears as a two-dimensional generalization of the Benjamin-Ono equation when transverse effects are included via…
A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…
Given a combinatorial triangulation of an $n$-gon, we study (a) the space of all possible drawings in the plane such the edges are straight line segments and the boundary has a fixed shape, and (b) the algebraic variety of possibilities for…
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \eps in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If…
Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…
For natural numbers $n,r \in \mathbb{N}$ with $n\ge r$, the Kneser graph $K(n,r)$ is the graph on the family of $r$-element subsets of $\{1,\dots,n\}$ in which two sets are adjacent if and only if they are disjoint. Delete the edges of…
Moser asked whether the collection of rectangles of dimensions 1 x 1/2, 1/2 x 1/3, 1/3 x 1/4, ..., whose total area equals 1, can be packed into the unit square without overlap, and whether the collection of squares of side lengths 1/2,…
The $K$-nearest neighbors is a basic problem in machine learning with numerous applications. In this problem, given a (training) set of $n$ data points with labels and a query point $p$, we want to assign a label to $p$ based on the labels…
We describe an algorithm for solving an important geometric problem arising in computer-aided manufacturing. When cutting away a region from a solid piece of material -- such as steel, wood, ceramics, or plastic -- using a rough tool in a…
In this work, we consider 2-surfaces in ${\mathbb R}^3$ arising from the modified Korteweg de Vries (mKdV) equation. We give a method for constructing the position vector of the mKdV surface explicitly for a given solution of the mKdV…