Related papers: Triangle Presentations Encoded by Perfect Differen…
A triangle presentation is a combinatorial datum that encodes the action of a group on a $2$-dimensional triangle complex with prescribed links, which is simply transitive on the vertices. We provide the first infinite family of triangle…
Triangle presentations are combinatorial structures on finite projective geometries which characterize groups acting simply transitively on the vertices of a locally finite building of type $\tilde{\text{A}}_{n-1}$ ($n\ge3$). From a type…
Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…
We introduce a comprehensive data structure, tangle structure trees, which simultaneously displays all the $\mathcal{F}$-tangles of an abstract separation system for very general obstruction sets $\mathcal{F}$. It simultaneously also…
Tangle structure trees, introduced in [3], offer a unified data structure that displays all the tangles of a graph or data set together with certificates for the non-existence of any other tangles, either locally or overall. In this paper…
We show a simple semidefinite program whose optimal value is equal to the maximum probability of perfectly distinguishing orthogonal maximally entangled states using any PPT measurement (a measurement whose operators are positive under…
We demonstrate a close connection between the classic planar Singer difference sets and certain norm equation systems arising from projective norm graphs. This, on the one hand leads to a novel description of planar Singer difference sets…
In this paper, we consider a set of similar triangles with parallel sides, along with a set of points in the plane. It turns out that the set $\mathbb{R}_2= \{\pm <x >=\pm (x^2,x,1); x\in\mathbb{R} \}$ describes this set of triangles quite…
Counting and finding triangles in graphs is often used in real-world analytics to characterize cohesiveness and identify communities in graphs. In this paper, we propose the novel concept of a cover-edge set that can be used to find…
We define a triangle design as a partition of the set of lines of a projective space into triangles, where a triangle consists of three pairwise intersecting lines with no common point. A triangle design is balanced if all points are…
The projective representation of groups was introduced in 1904 by Issai Schur. It differs from the normal representation of groups by a twisting factor. It starts with a group T and a scalar valued function f on T^2 satisfying the…
By introducing a finer version of the Kauffman bracket skein algebra, we show how to decompose the Kauffman bracket skein algebra of a surface into elementary blocks corresponding to the triangles in an ideal triangulation of the surface.…
We give several new positive finite presentations for the pure braid group that are easy to remember and simple in form. All of our presentations involve a metric on the punctured disc so that the punctures are arranged "convexly", which is…
We show that main results of rational trigonometry (as developed by NJ Wildberger, "Divine Proportions", 2005) can be succinctly expressed using projective geometric algebra (PGA). In fact, the PGA representation exhibits distinct…
A triangular partition is a partition whose Ferrers diagram can be separated from its complement (as a subset of $\mathbb{N}^2$) by a straight line. Having their origins in combinatorial number theory and computer vision, triangular…
This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, which are called irreducible triangulations. The structure has been introduced by Xin He under…
For fixed positive reals $t$ and $\alpha$, consider the sequence $S_t(\alpha) = (s_1, s_2, \ldots, )$ with $s_n = \left \lfloor t\alpha^n \right \rfloor$. In 1964, Graham managed to characterize those pairs $(t, \alpha)$ with $0 < t < 1$…
In this work, a tensor completion problem is studied, which aims to perfectly recover the tensor from partial observations. The existing theoretical guarantee requires the involved transform to be orthogonal, which hinders its applications.…
Recent advancements in Spatial Transcriptomics (ST) technology have facilitated detailed gene expression analysis within tissue contexts. However, the high costs and methodological limitations of ST necessitate a more robust predictive…
In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex…