相关论文: Separating Geometric Thickness from Book Thickness
We scrutinize congruence as one of the basic definitions of equality in geometry and pit it against physics of Special Relativity. We show that two non-rigid rods permanently kept congruent during their common expansion or compression may…
We give a short, self-contained, and easily verifiable proof that determining the outerthickness of a general graph is NP-hard. This resolves a long-standing open problem on the computational complexity of outerthickness. Moreover, our…
We initiate the computability-theoretic study of ringed spaces and schemes. In particular, we show that any Turing degree may occur as the least degree of an isomorphic copy of a structure of these kinds. We also show that these structures…
We analyse properties of geometric intersection graphs to show the strict containment between some natural classes of geometric intersection graphs. In particular, we show the following properties: - A graph $G$ is outerplanar if and only…
Socioeconomic segregation is considered one of the main factors behind the emergence of large-scale inequalities in urban areas, and its characterisation is an active area of research in urban studies. There are currently many available…
The correspondence between two geometrical descriptions of the KP-hierarchy, one by discrete surface and another by difference analogue of differential geometry, is given.
The traditional study of plane and space algebraic curves by looking at their tangent vectors, curvatures and torsions provides geometric, but unfortunately not sufficient information about individual curves in order to be able to…
In a connected graph G, the distance between two vertices of G is the length of a shortest path between these vertices. The eccentricity of a vertex u in G is the largest distance between u and any other vertex of G. The total-eccentricity…
In this series of papers, we study correspondence between the following: (1) large scale structure of the metric space bigsqcup_m {Cay(G(m))} consisting of Cayley graphs of finite groups with k generators; (2) structure of groups which…
A graph is {\it square-complementary} ({\it squco}, for short) if its square and complement are isomorphic. We prove that there is no squco graph of girth $6$, thus answersing a question asked by Milani\vc et al. [Discrete Math., 2014, to…
We use the method of maximum entropy to model physical space as a curved statistical manifold. It is then natural to use information geometry to explain the geometry of space. We find that the resultant information metric does not describe…
In this paper, we define the $4$-girth-thickness $\theta(4,G)$ of a graph $G$ as the minimum number of planar subgraphs of girth at least $4$ whose union is $G$. We obtain the $4$-girth-thickness of the arbitrary complete graph $K_n$…
Teleparallel gravity shares many qualitative features with general relativity, but differs from it in the following way: whereas in general relativity, gravitation is a manifestation of space-time curvature, in teleparallel gravity,…
We classify all division algebras that are principal Albert isotopes of a cyclic Galois field extension of degree $n>2$ up to isomorphisms. We achieve a ``tight'' classification when the cyclic Galois field extension is cubic. The…
Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…
Using a scanning electron microscope, we observed a reproducible, discrete distribution of secondary electron intensity stemming from an atomically thick graphene film on a thick insulating substrate. The discrete distribution made it…
The emergence of alternating twist multilayer graphene (ATMG) as a generalization of twisted bilayer graphene (TBG) raises the question - in what important ways do these systems differ? Here, we utilize ab-initio relaxation and…
A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any integer $n\ge 1$, there is a graph on $3^{n+O(\log^2 n)}$…
The results of this paper have been greatly superseded by those in the paper "Contact geometry and isosystolic inequalities" (arXiv:1109.4253) by the same authors.
The propagation of a light ray in thin layer (film) within geometrical optics is considered. It is assumed that the ray is captured inside the layer due to reflecting walls or total internal reflection (in the case of a dielectric layer).…