相关论文: A simpler $\mathbb R^3$ realization of the M\"obiu…
We introduce M\"obius strip diagram algebras (and their monoid and categorical versions) as subalgebras of a partition-style diagram calculus in which strands may carry handles and M\"obius strip features. We identify the resulting diagram…
By using exclusively real analysis, we give explicit estimates of some classical summatory functions involving the M\"obius function.
We introduce fractional realizations of a graph degree sequence and a closely associated convex polytope. Simple graph realizations correspond to a subset of the vertices of this polytope. We describe properties of the polytope vertices and…
Consider a M\"obius strip with $n$ chosen points on its edge. A triangulation is a maximal collection of arcs among these points and cuts the strip into triangles. In this paper, we proved the number of all triangulations that one can…
The purpose of this note is to prove an Euler-type formula for partitions of the M\"obius strip. This formula was introduced in our joint paper with R.~Kiwan, "Courant-sharp property for Dirichlet eigenfunctions on the M\"obius strip"…
We prove that the asymptotic completion of a developable M\"obius strip in Euclidean three-space must have at least one singular point other than cuspidal edge singularities. Moreover, if the strip contains a closed geodesic, then the…
For the quaternionic unit ball $\mathbb{B}$, let us denote by $\mathcal{M}(\mathbb{B})$ the set of slice regular M\"obius transformations mapping $\mathbb{B}$ onto itself. We introduce a smooth manifold structure on…
M\"obius transformations of the extended complex plane are at the crossroads of many interesting topics, e.g., they form a group under composition, are the simplest form of rational function, and are a path to Lie theory. Quaternionic…
The paper presents some results for reducing the computation of the M\"obius functon of a M\"obius category that arises from a combinatorial inverse semigroup to that of locally finite partially ordered sets. We illustrate the computation…
We construct real analytic flat Moebius strips of arbitrary isotopy types, whose centerlines are geodesics or lines of curvature.
It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8…
This paper studies the M\"obius function and related questions about the finiteness of the poset of submodules of semisimple and general modules. We show how to calculate the M\"obius function for semisimple modules based on endomorphism…
An abstract topological graph (briefly an AT-graph) is a pair $A=(G,\mathcal{X})$ where $G=(V,E)$ is a graph and $\mathcal{X}\subseteq {E \choose 2}$ is a set of pairs of its edges. The AT-graph $A$ is simply realizable if $G$ can be drawn…
We establish nontrivial bounds for bilinear sums involving the M\"obius function evaluated over solutions to a broad class of equations. Several of our results may be regarded as M\"obius-function analogues of the ternary Goldbach problem.…
The strip map is a natural map from the arc complex of a bordered hyperbolic surface $S$ to the vector space of infinitesimal deformations of $S$. We prove that the image of the strip map is a convex hypersurface when $S$ is a surface of…
The Laplace-Beltrami operator in the curved M\"obius strip is investigated in the limit when the width of the strip tends to zero. By establishing a norm-resolvent convergence, it is shown that spectral properties of the operator are…
In algebraic topology, we usually represent surfaces by mean of cellular complexes. This representation is intrinsic, but requires to identify some points through an equivalence relation. On the other hand, embedding a surface in a…
An hieroglyph on n letters is a cyclic sequence of the letters 1,2, . . . , n of length 2n such that each letter appears in the sequence twice.Take an hieroglyph H. Take a convex polygon with 2n sides. Put the letters in the sequence of…
Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function.…
The visual complexity of a graph drawing can be measured by the number of geometric objects used for the representation of its elements. In this paper, we study planar graph drawings where edges are represented by few segments. In such a…