Related papers: BLINK: a language to view, recognize, classify and…
All classifiers, including state-of-the-art vision models, possess invariants, partially rooted in the geometry of their linear mappings. These invariants, which reside in the null-space of the classifier, induce equivalent sets of inputs…
Creating new visual concepts often requires connecting distinct ideas through their most relevant shared attributes -- their vibe. We introduce Vibe Blending, a novel task for generating coherent and meaningful hybrids that reveals these…
A {\em net} is a graph consisting of a triangle $C$ and three more vertices, each of degree one and with its neighbour in $C$, and all adjacent to different vertices of $C$. We give a polynomial-time algorithm to test whether an input graph…
Riddles are concise linguistic puzzles that describe an object or idea through indirect, figurative, or playful clues. They are a longstanding form of creative expression, requiring the solver to interpret hints, recognize patterns, and…
A linkage mechanism consists of rigid bodies assembled by joints which can be used to translate and transfer motion from one form in one place to another. In this paper, we are particularly interested in a family of spacial linkage…
Entanglement is the essential quantum resource for a potential speed-up of information processing, as well as for sophisticated quantum communication. Quantum information networks will be required to convey information from one place to…
It is shown that if a link in 3-space bounds a proper oriented surface (without closed component) in the upper half 4-space, then the link bounds a proper oriented ribbon surface in the upper half 4-space which is a renewal embedding of the…
Analysis of stochastic processes can be used to engender critical thinking. Quantum dots have a reversible, stochastic transition between luminescent and non-luminescent states. The luminescence intermittency is known as blinking, and is…
Let $G$ be a planar graph and let $C$ be a cycle in $G$. Inside of each finite face of $G$, we write down the number of edges of that face which belong to $C$. This is the signature of $C$ in $G$. The notion of a signature arises naturally…
For a graph whose vertex set is a finite set of points in the Euclidean $d$-space consider the closed (open) balls with diameters induced by its edges. The graph is called a (an open) Tverberg graph if these closed (open) balls intersect.…
Complex networks are all around us, and they can be generated by simple mechanisms. Understanding what kinds of networks can be produced by following simple rules is therefore of great importance. We investigate this issue by studying the…
A function from configuration space to moduli space of surface may induce a homomorphism between their fundamental groups which are braid groups and mapping class groups of surface, respectively. This map $\phi: B_k \rightarrow…
Conventional wisdom holds that any region of 3-space contains infinitely many points, and the Planck length scale determines the uncertainty in every measurement of distance between two separate points. Against such a backdrop, this…
A knot (or link) diagram is said to be everywhere equivalent if all the diagrams obtained by switching one crossing represent the same knot (or link). We classify such diagrams of a closed 3-braid.
This article surveys the use of configuration space integrals in the study of the topology of knot and link spaces. The main focus is the exposition of how these integrals produce finite type invariants of classical knots and links. More…
This paper is the second in a series where we attempt to give a complete description of the space of all embedded minimal surfaces of fixed genus in a fixed (but arbitrary) closed 3-manifold. The key for understanding such surfaces is to…
The moduli space of triangles is a two-dimensional space that records triangle shapes in the plane, considered up to similarity. We study the subset corresponding to \textit{lattice triangles}, which are triangles whose vertices have…
In this final part of a 3-part paper we introduce the pair of "wings" of the abstract PL-colored complexes $\mathcal{H}_{m}^\star$, described in the second paper. The wings, via a weight enhanced Tutte's barycentric embedding of a planar…
Bounding volumes are an established concept in computer graphics and vision tasks but have seen little change since their early inception. In this work, we study the use of neural networks as bounding volumes. Our key observation is that…
Braidlab is a Matlab package for analyzing data using braids. It was designed to be fast, so it can be used on relatively large problems. It uses the object-oriented features of Matlab to provide a class for braids on punctured disks and a…