Related papers: Constructions by ruler and compass, together with …
The Berge-Fulkerson conjecture states that every bridgeless cubic graph can be covered with six perfect matchings such that each edge is covered exactly twice. An equivalent reformulation is that it's possible to find a 6-cycle 4-cover. In…
It is well known that the set of origami constructible numbers is larger than the classical straight-edge and compass constructible numbers. However, the Huzita-Justin-Hatori origami constructible numbers remain algebraic so that the…
We give new examples of manifolds that appear as cross sections of tangent cones of non-collapsed Ricci limit spaces. It was shown by Colding-Naber that the homeomorphism types of the tangent cones of a fixed point of such a space do not…
We show a method in constructing algebraic cycles via intersection theory. It leads to a proof of the Lefschetz standard conjecture.
This is a simple way rigorously to construct Grassmann, Clifford and Geometric Algebras, allowing degenerate bilinear forms, infinite dimension, using fields or certain modules (characteristic 2 with limitation) - and characterize the…
Efficient methods to determine the relative position of two conics are of great interest for applications in robotics, computer animation, CAGD, computational physics, and other areas. We present a method to obtain the relative position of…
Ruled surfaces play an important role in various types of design, architecture, manufacturing, art, and sculpture. They can be created in a variety of ways, which is a topic that has been the subject of much discussion in mathematics and…
Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…
We construct models, by three-dimensional arrays of ccc posets, where many classical cardinal characteristics of the continuum are pairwise different.
A random jigsaw puzzle is constructed by arranging $n^2$ square pieces into an $n \times n$ grid and assigning to each edge of a piece one of $q$ available colours uniformly at random, with the restriction that touching edges receive the…
A graph is $n$-e.c. ($n$-existentially closed) if for every pair of subsets $A, B$ of vertex set $V$ of the graph such that $A \cap B = \emptyset$ and $|A| + |B| = n$, there is a vertex $z$ not in $A \cup B$ joined to each vertex of $A$ and…
We study the geometry of convex lattice $n$-gons with $n$ boundary lattice points and $k\geq 3$ collinear interior lattice points. We describe a process to construct a primitive lattice triangle from an edge of a convex lattice $n$-gon,…
I provide methods of constructing elliptic and hyperelliptic curves over global fields with interesting rational points over the given fields or over large field extensions. I also provide a elliptic curves defined over any given number…
We first introduce a configuration of arbitrary isogonal conjugates related to a known property concerning the spiral center of two pairs of isogonal conjugates. We then consider a special case where two conics are tangent at exactly two…
Problem 4.19 in Ziegler's "Lectures on Polytopes" asserts that every simple $3$-dimensional polytope has the property that its dual can be constructed as the convex hull of a subset of the vertices of the original simple polytope. In this…
We prove that over a Poncelet triangle family interscribed between two nested ellipses $\mathcal{E},\mathcal{E}_c$, (i) the locus of the orthocenter is not only a conic, but it is axis-aligned and homothetic to a $90^o$-rotated copy of…
For any pencil of conics or higher-dimensional quadrics over the rationals, with all degenerate fibres defined over the rationals, we show that the Brauer-Manin obstruction controls weak approximation. The proof is based on the Hasse…
This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.…
We show that every non-degenerate regular polytope can be used to construct a thin, residually-connected, chamber-transitive incidence geometry, i.e. a regular hypertope, with a tail-triangle Coxeter diagram. We discuss several interesting…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…