Related papers: Self-affinity of discs under glass-cut dissections

A set of geometric graphs is {\em geometric-packable} if it can be asymptotically packed into every sequence of drawings of the complete graph $K_n$. For example, the set of geometric triangles is geometric-packable due to the existence of…

In this paper, we study the dimension of planar self-affine sets, of which generating iterated function system (IFS) contains non-invertible affine mappings. We show that under a certain separation condition, the dimension equals to the…

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…

An affine hypersurface is said to admit a pointwise symmetry, if there exists a subgroup of the automorphism group of the tangent space, which preserves (pointwise) the affine metric h, the difference tensor K and the affine shape operator…

We prove that the space of affine, transversal at infinity, non-singular real cubic surfaces has 15 connected components. We give a topological criterion to distinguish them and show also how these 15 components are adjacent to each other…

Let $G_{n}$ be the dicyclic group of order $4n$. We observe that, up to isomorphisms, (i) for $n \geq 2$ even there is exactly one regular dessin d'enfant with automorphism group $G_{n}$, and (ii) for $n \geq 3$ odd there are exactly two of…

Let $\textbf{a}_1,\dots, \textbf{a}_r$ be vectors in a half-space of $\mathbb{R}^n$. We call $$C=\textbf{a}_1\mathbb{R}^++\cdots+\textbf{a}_r \mathbb{R}^+$$ a convex polyhedral cone, and call $\{\textbf{a}_1,\dots, \textbf{a}_r\}$ a…

We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.

The viscous evolution of a thin disc around a central object is considered. Such discs are described by self-similar solutions in which either all or none of the inflowing mass accretes. An approximate solution for the partial accretion…

We introduce the notion of extended admissible dissections of a marked surface, building upon the notion of an admissible dissection of a marked surface by Amiot--Plamondon--Schroll. For each extended admissible dissection we construct a…

Let an affine space of dimension n over a field k. To each point correponds a section of the linear group G to the affine group. Generally, every section is like this, excpt in the case card(k)=2 and n=3, where G is the group of cardinality…

In this article we obtain a classification of strictly locally convex affine hypersurfaces in A^{n+1} for which the geometrical structure is pointwise invariant under the group SO(n-1) represented by rotations around a fixed axis in the…

Let $P$ be a set of $n$ points in the plane. A geometric graph $G$ on $P$ is said to be {\it locally Gabriel} if for every edge $(u,v)$ in $G$, the disk with $u$ and $v$ as diameter does not contain any points of $P$ that are neighbors of…

The classification, up to a center-affinity, of the homogeneous quadratic differential systems defined on $\mathbb{R}^{3}$ that have at least a semisimple derivation with one-dimensional kernel, is achieved. It is proved that there exist 35…

We applied a criterion of gravitational instability, valid for two-component and infinitesimally thin discs, to observational data along the major axis for 7 spiral galaxies of early types. Unlike most papers, the dispersion equation…

A question at the intersection of Barnette's Hamiltonicity and Neumann-Lara's dicoloring conjecture is: Can every Eulerian oriented planar graph be vertex-partitioned into two acyclic sets? A CAI-partition of an undirected/oriented graph is…

Gallai's path decomposition conjecture states that if $G$ is a connected graph on $n$ vertices, then the edges of $G$ can be decomposed into at most $\lceil \frac{n }{2} \rceil$ paths. A graph is said to be an odd semi-clique if it can be…

Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique…

A spherical n-gon is a bordered surface homeomorphic to a closed disk, with n distinguished boundary points called corners, equipped with a Riemannian metric of constant curvature 1, except at the corners, and such that the boundary arcs…