Related papers: Extracting squares from any quadrilateral
We prove that every $n$-vertex complete simple topological graph generates at least $\Omega(n)$ pairwise disjoint $4$-faces. This improves upon a recent result by Hubard and Suk. As an immediate corollary, every $n$-vertex complete simple…
We suggest a geometric visualization of the process of constructing a triangle with prescribed bisectors that makes the existence of such a triangle geometrically evident.
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many heuristics have been proposed to partition models into few…
The {\it largest angle bisection} procedure is the operation which partitions a given triangle, $T$, into two smaller triangles by constructing the angle bisector of the largest angle of $T$. Applying the procedure to each of these two…
We present methods for obtaining new solutions to the bispectral problem. We achieve this by giving its abstract algebraic version suitable for generalizations. All methods are illustrated by new classes of bispectral operators.
The following paper provides a protocol to physically generate a $2$-qutrit entangling gate in the Kauffman-Jones version of $SU(2)$ Chern-Simons theory at level $4$. The protocol uses elementary operations on anyons consisting of braids,…
A graph drawn in a surface is a near-quadrangulation if the sum of the lengths of the faces different from 4-faces is bounded by a fixed constant. We leverage duality between colorings and flows to design an efficient algorithm for…
We prove here that when all planes transverse and nearly perpendicular to the axis of a surface of revolution intersect it in loops having central symmetry, the surface must be quadric. It follows that the quadrics are the only surfaces of…
In this note we investigate the connection between polylogarithms on curves and abelian schemes. The main result shows that the polylogarithm on the abelian scheme can be obtained as the push-forward of the polylogarithm on a suitable…
We present three non-equivalent procedures to obtain entwining (non-constant) tetrahedron maps. Given a tetrahedron map, the first procedure incorporates its underlying symmetry group. With the second procedure we obtain several classes of…
A collection of subroutines and examples of their uses, as well as the underlying numerical methods, are described for generating orthogonal polynomials relative to arbitrary weight functions. The object of these routines is to produce the…
We present a geometric theorem on a porism about cyclic quadrilaterals, namely the existence of an infinite number of cyclic quadrilaterals through four fixed collinear points once one exists. Also, a technique of proving such properties…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
We show that every source connected Lie groupoid always has global bisections through any given point. This bisection can be chosen to be the multiplication of some exponentials as close as possible to a prescribed curve. The existence of…
Scientific calculations involving multiplication, division, exponents, inverse exponents of real numbers, geometric mean, reciprocal, Euler number, logarithm, and antilogarithm are generally carried out using battery operated electronic…
A fake quadric is a smooth minimal surface of general type with the same invariants as the quadric in P^3, i.e. K^2=2c_2=8 and q=p_g=0. We study here quaternionic fake quadrics i.e. fake quadrics constructed arithmetically by using some…
We prove a formula which compares intersection numbers of conormal varieties of two projective varieties and their dual varieties. When one of them is linear, we can recover the usual Plucker formula for the degree of the dual variety. The…
Two distinct algorithms are presented to extract (schemata of) resolution proofs from closed tableaux for propositional schemata. The first one handles the most efficient version of the tableau calculus but generates very complex…
Obtaining complete information about the shape of an object by looking at it from a single direction is impossible in general. In this paper, we theoretically study obtaining differential geometric information of an object from orthogonal…
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…