Related papers: Symmetric binary Steinhaus triangles and parity-re…

The classical uniformization theorem states that any simply connected Riemann surface is conformally equivalent to the disk, the plane, or the sphere, each equipped with a standard conformal structure. We give a similar uniformization for…

The \emph{thinness} of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Graphs with thinness at most two include, for example, bipartite convex graphs. Many…

Let W be a planar 3-web defined on a neighborhood of a point M. We call "symmetry of W around M" any local diffeomorphism which fixes M and maps each foliation of W to a (not necessarily the same) foliation of W. We say that it is a simple…

In this paper we characterize Birkhoff-James orthogonality of linear operators defined on a finite dimensional real Banach space $ \mathbb{X}. $ We also explore the symmetry of Birkhoff-James orthogonality of linear operators defined on $…

A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are…

This paper considers matrix convex sets invariant under several types of rotations. It is known that matrix convex sets that are free semialgebraic are solution sets of Linear Matrix Inequalities (LMIs); they are called free spectrahedra.…

A binary Cayley graph is a Cayley graph based on a binary group. In 1982, Payan proved that any non-bipartite binary Cayley graph must contain a generalized Mycielski graph of an odd-cycle, implying that such a graph cannot have chromatic…

A vertex of a plane digraph is bimodal if all its incoming edges (and hence all its outgoing edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all its vertices are bimodal. Bimodality is at the heart of…

We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particular case we wish to recognize a graph which corresponds to…

The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…

The following results are proved: Theorem 1. A totally real semiparallel submanifold of constant curvature with parallel f-structure in the normal bundle of a K\"ahler manifold N is flat or a totally geodesic submanifold of N. Theorem 2. A…

A cut $C:=\partial(X)$ of a matching covered graph $G$ is a separating cut if both its $C$-contractions $G/X$ and $G/\overline{X}$ are also matching covered. A brick is solid if it is free of nontrivial separating cuts. In 2004, we…

In reversible dynamical systems, it is frequently of importance to understand symmetric features. The aim of this paper is to explore symmetric periodic points of reversible maps on planar domains invariant under a reflection. We extend…

A {\em $k$-trinitary algebra} is any subalgebra of the space of smooth functions $f: M \to {\mathbb R}$ that is distinguished in this space by $k$ independent conditions of the form $f(x_i) = f(\tilde x_i) = f(\hat x_i)$, where $x_i, \tilde…

Curvature properties of a metric connection with totally skew-symmetric torsion are investigated. It is shown that if either the 3-form $T$ is harmonic, $dT=\delta T=0$ or the curvature of the torsion connection $R\in S^2\Lambda^2$ then the…

A diagonal base of a Sylow 2-subgroup $P_n(2)$ of symmetric group $S_{2^n}$ is a minimal generating set of this subgroup consisting of elements with only one non-zero coordinate in the polynomial representation. For different diagonal bases…

A connected combinatorial 2-manifold is called degree-regular if each of its vertices have the same degree. A connected combinatorial 2-manifold is called weakly regular if it has a vertex-transitive automorphism group. Clearly, a weakly…

A geometric graph is angle-monotone if every pair of vertices has a path between them that---after some rotation---is $x$- and $y$-monotone. Angle-monotone graphs are $\sqrt 2$-spanners and they are increasing-chord graphs. Dehkordi, Frati,…

Let $G$ be a finite group and let $S$ be an inverse-closed subset of $G$ not containing the identity. The Cayley graph $\mathrm{Cay}(G,S)$ has vertex set $G$, where two vertices $x$ and $y$ are adjacent if and only if $x^{-1}y \in S$.…

We study two notions of approximate Birkhoff-James orthogonality in a normed space, from a geometric point of view, and characterize them in terms of normal cones. We further explore the interconnection between normal cones and approximate…