相关论文: A Note on Objects Built From Bricks without Corner…
A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on…
The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected plane graph is a 3-connected plane graph. Astonishingly, except for sufficiently large facewidth, not much is known about the connectivity…
An $r$-graph is an $r$-regular graph where every odd set of vertices is connected by at least $r$ edges to the rest of the graph. Seymour conjectured that any $r$-graph is $r+1$-edge-colorable, and also that any $r$-graph contains $2r$…
In this short note, we construct some nontrivial examples of topological biquandle. The key ingredient of the construction is the notion of skew brace.
We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call "trihexes". Trihexes are analogous to fullerenes, which are 3-regular planar…
A fuzzy version of the ordinary round 2-sphere has been constructed with an invariant curvature. We here consider linear connections on arbitrary fuzzy surfaces of genus zero. We shall find as before that they are more or less rigidly…
The existence of a nontrivial polynomially convex hull with every point a one-point Gleason part and with no nonzero bounded point derivations is established. This strengthens the \hbox{celebrated} result of Stolzenberg that there exists a…
In this article we discuss a connection between two famous constructions in mathematics: a Cayley graph of a group and a (rational) billiard surface. For each rational billiard surface, there is a natural way to draw a Cayley graph of a…
In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a *net*, a connected planar piece with no overlaps. A *grid unfolding* allows additional cuts along grid edges induced by coordinate planes…
Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…
We construct, for every integer $N\in\mathbb{N}^*$, a structure whose Grothendieck ring is isomorphic to $(\mathbb{Z}/N\mathbb{Z})[X]$, thus proving the existence of structures with a non-zero Grothendieck ring with non-zero characteristic.…
Polyhedra are generically rigid, but can be made to flex under certain symmetry conditions. We generalise Raoul Bricard's 1897 method for making flexible octahedra to construct an infinite family of flexible polyhedra with…
Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…
Given a curve of genus 3 with an unramified double cover, we give an explicit description of the associated Prym-variety. We also describe how an unramified double cover of a non-hyperelliptic genus 3 curve can be mapped into the Jacobian…
It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…
We prove a conjecture of the first and third named authors relating the Kauffman bracket skein algebra of a genus zero surface with boundary to a quantized $K$-theoretic Coulomb branch. As a consequence, we see that our skein algebra arises…
A 3-connected graph is a brick if the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of the matching decomposition procedure of…
The corner polyhedron is described by minimal valid inequalities from maximal lattice-free convex sets. For the Relaxed Corner Polyhedron (RCP) with two free integer variables and any number of non-negative continuous variables, it is known…
This note studies the quantized corner structure of four-dimensional $BF$ theory, classifies the associated free and physical corner algebras and constructs possible representations. In the abelian case, for arbitrary closed oriented…