Related papers: Lattice Equable Quadrilaterals I -- Parallelograms
We consider walks on the edges of the square lattice $\mathbb Z^2$ which obey \emph{two-step rules,} which allow (or forbid) steps in a given direction to be followed by steps in another direction. We classify these rules according to a…
An {\it overlap representation} of a graph $G$ assigns sets to vertices so that vertices are adjacent if and only if their assigned sets intersect with neither containing the other. The {\it overlap number} $\ol(G)$ (introduced by Rosgen)…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…
A star of n (n greater than or equal to 2) line segments (needles) of equal length with common endpoint and constant angular spacing is randomly placed onto a lattice which is the union of two families of equidistant lines in the plane with…
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median…
A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…
We classify edge-to-edge tilings of the sphere by congruent almost equilateral pentagons, in which four edges have the same length. Together with our earlier classifications of edge-to-edge tilings of the sphere by congruent equilateral…
In this paper, we prove two results. First, there is a family of sequences of embedded quarters of the hyperbolic plane such that any sequence converges to a limit which is an end of the hyperbolic plane. Second, there is no algorithm which…
For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components. A vertex separator $S$ is minimal if it contains no other separator as a strict subset and a minimum vertex separator is a minimal…
We show that for any pair of long enough parallel geodesics in a random group $G_\ell(m,d)$ with $m$ generators at density $d<1/6$, there is a van Kampen diagram having only one layer of faces. Using this result, we give an upper bound,…
Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…
Considering all possible paths that a natural number can take following the rules of the algorithm proposed in the Collatz conjecture we construct a graph that can be interpreted as an infinite network that contemplates all possible paths…
A graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of…
Using the theory of extensors developed in a previous paper we present a theory of the parallelism structure on arbitrary smooth manifold. Two kinds of Cartan connection operators are introduced and both appear in intrinsic versions (i.e.,…
The problem of establishing the number of perfect matchings necessary to cover the edge-set of a cubic bridgeless graph is strictly related to a famous conjecture of Berge and Fulkerson. In this paper we prove that deciding whether this…
In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…
If E is any ellipse inscribed in a convex quadrilateral, D, then we prove that Area(E)/Area(D) is less than or equal to pi/4, and equality holds if and only if D is a parallelogram and E is tangent to the sides of D at the midpoints. This…
We compute the second and third levels of the Lasserre hierarchy for the spherical finite distance problem. A connection is used between invariants in representations of the orthogonal group and representations of the general linear group,…
Given a planar graph $G$ and a partition of the neighbors of each vertex $v$ in four sets $UR(v)$, $UL(v)$, $DL(v)$, and $DR(v)$, the problem Windrose Planarity asks to decide whether $G$ admits a windrose-planar drawing, that is, a planar…
A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…