Related papers: Extracting squares from any quadrilateral
A surface with boundary is randomly generated by gluing polygons along some of their sides. We show that its genus and number of boundary components asymptotically follow a bivariate normal distribution.
We present mechanisms for generating conical singularities both in three and four-dimensions in the systems with copies of scalar or chiral multiplets coupled to $N=2$ or $N=1$ supergravity. Our mechanisms are useful for supersymmetry…
The square-peg problem asks if every Jordan curve in the plane has four points which are the vertices of a square. The problem is open for continuous Jordan curves, but it has been resolved for various regularity classes of curves between…
The purpose of this paper is to determine the ring structure of the graph equivariant cohomology of the GKM graph induced from the even-dimensional complex quadrics. We show that the graph equivariant cohomology is generated by two types of…
In this work we investigate the chordality of squares and line graph squares of graphs. We prove a sufficient condition for the chordality of squares of graphs not containing induced cycles of length at least five. Moreover, we characterize…
In this paper we determine all the bipartite graphs with the maximum sum of squares of degrees among the ones with a given number of vertices and edges.
Fractal surfaces ('patchwork quilts') are shown to arise under most general circumstances involving simple bitwise operations between real numbers. A theory is presented for all deterministic bitwise operations on a finite alphabet. It is…
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…
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a full square rhomboid that is an example of non-series-parallel graphs. Our intention is to simplify the expressions of full square…
To get another from a given latin square, we have to change at least 4 entries. We show how to find these entries and how to change them.
An algorithm is discussed for converting a class of recursive processes to a parallel system. It is argued that this algorithm can be superior to certain methods currently found in the literature for an important subset of problems. The…
We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…
In this paper we shall be looking at several results relating Schur rings to sufficient conditions for a graph to be a graphical regular representation (GRR) of a finite group, and then applying these specifically in the case of certain…
We describe procedures for generating all 2-cell embedded simple graphs with up to a fixed number of vertices on a given surface. We also modify these procedures to generate closed 2-cell embeddings and polyhedral embeddings. We give…
This paper considers the task of connecting points on a piece of paper by drawing a curve between each pair of them. Under mild assumptions, we prove that many pairwise disjoint curves are unavoidable if either of the following rules is…
Connect each vertex of a convex quadrilateral Q to the midpoint of the next (proceeding counterclockwise) side. The four connecting lines create an interior quadrilateral I. We study the ratio area(I)/area(Q). We also determine what happens…
We define cut-and-paste, a construction which, given a quadriculated disk obtains a disjoint union of quadriculated disks of smaller total area. We provide two examples of the use of this procedure as a recursive step. Tilings of a disk…
Strongly chordal graphs are a subclass of chordal graphs. The interest in this subclass stems from the fact that many problems which are NP-complete for chordal graphs are solvable in polynomial time for this subclass. However, we are not…
In any triangle, the perpendicular side bisectors meet the corresponding internal angle bisectors on the circumcircle. If we take those three points as the vertices of a new triangle and repeat the operation indefinitly, we end up in the…
We describe a procedure for generating families of cyclic cubic fields with explicit fundamental units. This method generates all known families and gives new ones.