Related papers: Visible Point Vector Partition Identities for Hype…
We express the finite 3D Dimer partition function as a linear combination of determinants of oriented adjacency matrices, and the finite 3D Ising partition sum as a linear combination of products over aperiodic closed walks. The methodology…
Let $V$ be an absolutely irreducible affine variety over $\mathbb{F}_p$. A Lehmer point on $V$ is a point whose coordinates satisfy some prescribed congruence conditions, and a visible point is one whose coordinates are relatively prime.…
Accurately recognizing a revisited place is crucial for embodied agents to localize and navigate. This requires visual representations to be distinct, despite strong variations in camera viewpoint and scene appearance. Existing visual place…
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
We use two ingredients to prove the hyperbolicity of generic hypersurfaces of sufficiently high degree and of their complements in the complex projective space. One is the pullbacks of appropriate low pole order meromorphic jet…
Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant digit first). The convex hull of the set of vectors…
Depth data has a widespread use since the popularity of high-resolution 3D sensors. In multi-view sequences, depth information is used to supplement the color data of each view. This article proposes a joint encoding of multiple depth maps…
Given a positive integer $n$ and a partition $(n_1,\ldots,n_r)$ of $n$, one can consider the associated $n$-dimensional multiprojective space $\mathbb{P}^{n_1}\times \cdots \times \mathbb{P}^{n_r}$. These multiprojective spaces are…
In this paper we are proving the following fact. Let P be an arbitrary simple polygon, and let S be an arbitrary set of 15 points inside P. Then there exists a subset T of S that is not "visually discernible", that is, T is not equal to the…
We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. To decompose such problems we introduce the new concept of core points, i.e., integral points whose orbit polytopes are…
Identifying, measuring and reporting lesions accurately and comprehensively from patient CT scans are important yet time-consuming procedures for physicians. Computer-aided lesion/significant-findings detection techniques are at the core of…
Classical jittered sampling partitions $[0,1]^d$ into $m^d$ cubes for a positive integer $m$ and randomly places a point inside each of them, providing a point set of size $N=m^d$ with small discrepancy. The aim of this note is to provide a…
Vision transformers (ViTs) encoding an image as a sequence of patches bring new paradigms for semantic segmentation.We present an efficient framework of representation separation in local-patch level and global-region level for semantic…
A vast array of envy-free results have been found for the subdivision of one-dimensional resources, such as the interval $[0,1]$. The goal is to divide the space into $n$ pieces and distribute them among $n$ observers such that each…
For each finite configuration of distinct points in the plane, there is an associated lattice of noncrossing partitions. When these points form the vertices of a convex polygon, the result is the classical noncrossing partition lattice,…
Consider a problem where 4k given vectors need to be partitioned into k clusters of four vectors each. A cluster of four vectors is called a quad, and the cost of a quad is the sum of the component-wise maxima of the four vectors in the…
$\renewcommand{\Re}{\mathbb{R}}$ We re-examine parameters for the two main space decomposition techniques---bottom-vertex triangulation, and vertical decomposition, including their explicit dependence on the dimension $d$, and discover…
Hypervolume indicator is a commonly accepted quality measure for comparing Pareto approximation set generated by multi-objective optimizers. The best known algorithm to calculate it for $n$ points in $d$-dimensional space has a run time of…
We introduce smallest valid partitioning (SVP), a segmentation method for multiple change-point detection in time-series. SVP relies on a local notion of segment validity: a candidate segment is retained only if it passes a user-chosen…
The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading to novel models and algorithms, their applications, and development of associated tools. Hypergraphs are now a…