Related papers: Rectangular Spiral Galaxies are Still Hard
We study the algorithmic problem of computing drawings of graphs in which $(i)$ each vertex is a disk with fixed radius $\rho$, $(ii)$ each edge is a straight-line segment connecting the centers of the two disks representing its…
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configuration of filled squares; any completely filled row of the…
An exact, axially symmetric solution to the Einstein-Klein-Gordon field equations is employed to model the dark matter in spiral galaxies. The extended rotation curves from a previous analysis are used to fit the model and a very good…
Polar ring galaxies (PRG) are unique to give insight on the 3D-shape of dark matter haloes. Some caveats have prevented to draw clear conclusions in previous works. Also the formation mechanisms need to be well known. All available…
A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…
It is discussed that the formation of the spiral galaxies is driven by the cosmic background rotation, not a result of an isolated evolution proposed by the density wave theory. To analyze the motions of the galaxies, a simple double…
We propose a novel class of spirals that are based on perfect polygonal formations. The spirals are defined by a fractal of right triangles that delineate their geometry and determine their progression rates and modes. We show how these…
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…
We derive, in order of magnitude, the observed astrophysical and cosmological scales in the Universe, from neutron stars to superclusters of galaxies, up to, asymptotically, the observed radius of the Universe. This result is obtained by…
We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in…
The classification of galaxies as spirals or ellipticals is a crucial task in understanding their formation and evolution. With the arrival of large-scale astronomical surveys, such as the Sloan Digital Sky Survey (SDSS), astronomers now…
Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…
This work investigates dense packings of congruent hard infinitesimally--thin circular arcs in the two-dimensional Euclidean space. It focuses on those denotable as major whose subtended angle $\theta \in \left ( \pi, 2\pi \right ]$.…
Spin patterns of spiral galaxies can be broadly separated into galaxies with clockwise (Z-wise) patterns and galaxies with counterclockwise (S-wise) spin patterns. While the differences between these patterns are visually noticeable, they…
We consider the problem of determining the geometric parameters of a Galactic spiral arm from its segment by including the distance to the spiral pole, i.e., the distance to the Galactic center ($R_0$). The question about the number of…
We prove NP-completeness of Yin-Yang / Shiromaru-Kuromaru pencil-and-paper puzzles. Viewed as a graph partitioning problem, we prove NP-completeness of partitioning a rectangular grid graph into two induced trees (normal Yin-Yang), or into…
Working in univalent foundations, we investigate the symmetries of spheres, i.e., the types of the form $\mathbb{S}^n = \mathbb{S}^n$. The case of the circle has a slick answer: the symmetries of the circle form two copies of the circle.…
Shellings of simplicial complexes have long been a useful tool in topological and algebraic combinatorics. Shellings of a complex expose a large amount of information in a helpful way, but are not easy to construct, often requiring deep…
We analyze the problem of folding one polyhedron, viewed as a metric graph of its edges, into the shape of another, similar to 1D origami. We find such foldings between all pairs of Platonic solids and prove corresponding lower bounds,…
We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…