相关论文: Cyclic pseudo-{L}oupekine snarks

It is known that cyclic arrangements are the only {\em unavoidable} simple arrangements of pseudolines: for each fixed $m\ge 1$, every sufficiently large simple arrangement of pseudolines has a cyclic subarrangement of size $m$. In the same…

An edge e is normal in a proper edge-coloring of a cubic graph G if the number of distinct colors on four edges incident to e is 2 or 4: A normal edge-coloring of G is a proper edge-coloring in which every edge of G is normal. The Petersen…

We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…

This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…

Supercyclides are surfaces with a characteristic conjugate parametrization consisting of two families of conics. Patches of supercyclides can be adapted to a Q-net (a discrete quadrilateral net with planar faces) such that neighboring…

In this article we use the technique of Luttinger surgery to produce small examples of simply connected and non-simply connected minimal symplectic 4-manifolds. In particular, we construct: (1) An example of a minimal symplectic 4-manifold…

We introduce a general procedure called `reverse engineering' that can be used to construct infinite families of smooth 4-manifolds in a given homeomorphism type. As one of the applications of this technique, we produce an infinite family…

Let $M$ be $\CP#2\CPb$, $3\CP#4\CPb$ or $(2n-1)\CP#2n\CPb$ for any integer $n\geq 3$. We construct an irreducible symplectic 4-manifold homeomorphic to $M$ and also an infinite family of pairwise non-diffeomorphic irreducible non-symplectic…

The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…

We construct, for $m\geq 6$ and $2n\leq m$, closed manifolds $M^{m}$ with finite nonzero $\varphi(M^{m},S^{n}$), where $\varphi(M,N)$ denotes the minimum number of critical points of a smooth map $M\to N$. We also give some explicit…

A bridgeless cubic graph $G$ is said to have a 2-bisection if there exists a 2-vertex-colouring of $G$ (not necessarily proper) such that: (i) the colour classes have the same cardinality, and (ii) the monochromatic components are either an…

We construct a new infinite family of 4-dimensional isolated symplectic singularities with trivial local fundamental group, answering a question of Beauville raised in 2000. Three constructions are presented for this family: (1) as…

Pseudo-splines of integer order $(m,\ell)$ were introduced by Daubechies, Han, Ron, and Shen as a family which allows interpolation between the classical B-splines and the Daubechies' scaling functions. The purpose of this paper is to…

Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…

Three new examples of 4-dimensional irreducible symplectic V-manifolds are constructed. Two of them are relative compactified Prymians of a family of genus-3 curves with involution, and the third one is obtained from a Prymian by Mukai's…

We construct a multiplicative spectral sequence converging to the symplectic cohomology ring of any affine variety $X$, with first page built out of topological invariants associated to strata of any fixed normal crossings compactification…

We construct a family of Riemannian 3-spheres that cannot be "swept out" by short closed curves. More precisely, for each $L > 0$ we construct a Riemannian 3-sphere $M$ with diameter and volume less than 1, so that every 2-parameter family…

A normal 5-edge-coloring of a cubic graph is a coloring such that for every edge the number of distinct colors incident to its end-vertices is 3 or 5 (and not 4). The well known Petersen Coloring Conjecture is equivalent to the statement…

A permutation snark is a snark which has a 2-factor $F_2$ consisting of two chordless circuits; $F_2$ is called the permutation 2-factor of $G$. We construct an infinite family $\mathcal H$ of cyclically 5-edge connected permutation snarks.…

In an orientation $O$ of the graph $G$, the edge $e$ is deletable if and only if $O-e$ is strongly connected. For a $3$-edge-connected graph $G$, H\"orsch and Szigeti defined the Frank number as the minimum $k$ for which $G$ admits $k$…