Related papers: An easy (horizontal) walk through fake octagons
A graph $\Gamma$ of even order is a bicirculant if it admits an automorphism with two orbits of equal length. Symmetry properties of bicirculants, for which at least one of the induced subgraphs on the two orbits of the corresponding…
The rapid evolution of generative paradigms has enabled the creation of highly realistic imagery, which escalating the risks of identity fraud and the dissemination of disinformation. Most existing approaches frame face forgery detection as…
The notion of a pseudoknot is defined as an equivalence class of knot diagrams that may be missing some crossing information. We provide here a topological invariant schema for pseudoknots and their relatives, 4-valent rigid vertex spatial…
A longstanding open problem asks for an aperiodic monotile, also known as an "einstein": a shape that admits tilings of the plane, but never periodic tilings. We answer this problem for topological disk tiles by exhibiting a continuum of…
A graph $G$ is pseudo 2--factor isomorphic if the parity of the number of cycles in a 2--factor is the same for all 2--factors of $G$. In \cite{ADJLS} we proved that pseudo 2--factor isomorphic $k$--regular bipartite graphs exist only for…
We introduce the notion of iterated group extensions, which, roughly speaking, is what one obtains by forming a group extension of a group extension. We interpret iterated extensions in terms of group cohomology, in the same way as…
Jaeger's directed cycle double cover conjecture can be formulated as a problem of existence of special perfect matchings in a class of graphs that we call hexagon graphs. In this work, we explore the structure of hexagon graphs. We show…
We construct an infinite family of homologous, non-isotopic, symplectic surfaces of any genus greater than one in a certain class of closed, simply connected, symplectic four-manifolds. Our construction is the first example of this…
For small dimensional Lie algebra's there are many so-called accidental isomorphisms which give rise to double covers of special orthogonal groups - Spin groups - which happen to coincide with groups already belonging to another…
We recently described a specific type of attractors of two-dimensional discontinuous piecewise linear maps, characterized by two discontinuity lines dividing the phase plane into three partitions, related to economic applications. To our…
This study presents miscellaneous properties of pseudo-factorials, which are numbers whose recurrence relation is a twisted form of that of usual factorials. These numbers are associated with special elliptic functions, most notably, a…
We prove the existence of a complete, embedded, singly periodic minimal surface, whose quotient by vertical translations has genus one and two ends. The existence of this surface was announced in our paper in {\it Bulletin of the AMS},…
The Donald-Flanigan conjecture asserts that any group algebra of a finite group has a separable deformation. We apply an inductive method to deform group algebras from deformations of normal subgroup algebras, establishing an infinite…
To detect GAN generated images, conventional supervised machine learning algorithms require collection of a number of real and fake images from the targeted GAN model. However, the specific model used by the attacker is often unavailable.…
A drawing of a graph is fan-planar if the edges intersecting a common edge $a$ share a vertex $A$ on the same side of $a$. More precisely, orienting $e$ arbitrarily and the other edges towards $A$ results in a consistent orientation of the…
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…
A classical theorem of MacMahon states that the number of lozenge tilings of any centrally symmetric hexagon drawn on the triangular lattice is given by a beautifully simple product formula. In this paper we present a counterpart of this…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
Octilinear graph drawings are a standard paradigm extending the orthogonal graph drawing style by two additional slopes (+1 and -1). We are interested in two constrained drawing problems where the input specifies a so-called representation,…
We will announce two theorems. The first theorem will classify all topological types of degenerate fibers appearing in one-parameter families of Riemann surfaces, in terms of ``pseudoperiodic'' surface homeomorphisms. The second theorem…