Hexagonal tilings minimize perimeter with unequal volumes.
problem Finding optimal tessellations with unequal cell volumes.
method Minimizing perimeter functionals for different classes of problems.
result Hexagonal tilings are optimal among partitions with almost equal areas.
A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the weighted number of convex tilings with a given number of tiles. To prove these for…
There is a natural generalization of domino tilings to tilings of a polygon by hexagons, or, dually, configurations of oriented curves that meet in triples. We show exactly when two such tilings can be connected by a series of moves analogous to the domino flip move. The triple diagrams that result have connections to …
The study examines polyhedra with hexagonal and triangular faces, focusing on their 3-regular planar graphs.
problem Analyzing polyhedra with hexagonal and triangular faces and three faces around each vertex.
method Representing polyhedra as quotients of hexagonal tilings under isometries, using signatures to describe the arrangement of rotations, and establishing a bijection between trihexes and equivalence classes of signatures.
result A bijection between trihexes and equivalence classes of signatures, allowing bounds on the number of trihexes for a given number of vertices.
The effectiveness of Convolutional Neural Networks stems in large part from their ability to exploit the translation invariance that is inherent in many learning problems. Recently, it was shown that CNNs can exploit other invariances, such as rotation invariance, by using group convolutions instead of planar convoluti…
Hexagonal diagrams link complex curves in CP2 to minimal genus surfaces.
problem Understanding the relationship between complex curves and surfaces in CP2. method Hexagonal lattice diagrams and trisection of CP2. result Positive genus surfaces in CP2 are isotopic to complex curves if they admit hexagonal lattice diagrams. An edge tessellation is a tiling of the plane generated by reflecting a polygon in its edges. We prove that a polygon generating an edge tessellation is one the following eight types: a rectangle; an equilateral, 60-right, isosceles right, or 120-isosceles triangle; a 120-rhombus; a 60-90-120 kite; or a regular hexagon…
Hexnet framework enhances image processing with hexagonal structures.
problem Improve image processing systems with biological-inspired hexagonal structures.
method Develops a hexagonal deep learning framework (Hexnet) for image processing.
result Hexnet surpasses current hexagonal image processing systems and artificial neural networks.
New hexagonal circular 3-webs with reducible curves classified.
problem Classifying hexagonal circular 3-webs with reducible polar curves of degree 3.
method New examples and classifications presented.
result Classification of hexagonal circular 3-webs with reducible polar curves of degree 3.
Classifies hexagonal circular 3-webs with cubic polar curves.
problem Classifying hexagonal circular 3-webs with algebraic polar curves of degree three.
method Analyzes hexagonal circular 3-webs on unit sphere with polar points on a twisted cubic.
result Completes the classification of hexagonal circular 3-webs with algebraic polar curves of degree three.
We present a method for scalable and fully 3D magnetic field simultaneous localisation and mapping (SLAM) using local anomalies in the magnetic field as a source of position information. These anomalies are due to the presence of ferromagnetic material in the structure of buildings and in objects such as furniture. We …
Study of graphs from hexagon decompositions of surfaces.
problem Understanding geometric properties of hexagon decompositions.
method Define and analyze graphs associated with hexagon decompositions of surfaces.
result Quasi-isometric relationships between studied graphs and known groups.
In the paper, we consider the rigidity problem of the infinite hexagonal triangulation of the plane under the piecewise linear conformal changes introduced by Luo in [5]. Our result shows that if a geometric hexagonal triangulation of the plane is PL conformal to the regular hexagonal triangulation and all inner angles…
Paper proves rigidity of Doyle spirals in hexagonal lattice circle packings.
problem Proving Doyle conjecture for hexagonal lattice circle packings.
method Using Liouville theorem of discrete harmonic functions based on logarithmic radii ratio observation.
result Proves rigidity of Doyle spirals in hexagonal lattice circle packings with bounded radii ratios.
We study the geometry of oriented right-angled hexagons in H^4, the hyperbolic 4-space, via Clifford numbers or quaternions. We show how to augment alternate sides of such a hexagon so that for the non-augmented sides, we can define quaternion half side-lengths whose angular parts are obtained from half the Euler angle…
Study hexagonal network evolution under curvature flow.
problem Understanding hexagonal network evolution under curvature flow.
method Proved local existence of classical solutions and classified homothetically shrinking solutions.
result Provided an example of network shrinking to a segment with multiplicity two.
Hexagonal norm double bubble problem solved with minimal configurations.
problem Finding the optimal shapes for minimizing perimeter in hexagonal geometry.
method Elementary proof and geometric exclusions to simplify minimizer search.
result Existence of minimizing sets for volume ratio parameter α in (0,1].
The theory of geometric structures on a surface with nonempty boundary can be developed by using a decomposition of such a surface into hexagons, in the same way as the theory of geometric structures on a surface without boundary is developed using the decomposition of such a surface into pairs of pants. The basic elem…
Improved bounds for knot crossings in different mosaic patterns.
problem Finding tighter bounds for knot crossings in rectangular and hexagonal mosaics.
method Extended Howard and Kobin's proof to hexagonal mosaics and shortened the rectangular proof.
result New bounds for hexagonal mosaics with improved efficiency in rectangular mosaics.
We provide a complete classification of hexagonal singular 3-web germs in the complex plane, satisfying the following two conditions: 1) the Chern connection remains holomorphic at the singular point, 2) the web admits at least one infinitesimal symmetry at this point. As a by-product, a classification of hexagonal wei…
For a positive integer n≥3, the collection of n-sided polygons embedded in 3-space defines the space of geometric knots. We will consider the subspace of equilateral knots, consisting of embedded n-sided polygons with unit length edges. Paths in this space determine isotopies of polygons, so path-components …
This note characterizes monohedral tilings of regular polygons with up to three tiles.
problem Characterizing monohedral tilings of regular polygons with up to three tiles.
method Connecting the results for squares and circles to generalize for any regular n-gon. result Characterization of monohedral tilings of any regular n-gon with up to three tiles. The study of tiling homology on flat surfaces, proving impossibility of certain tilings.
problem Proving the non-existence of polyomino tilings on specific square-tiled surfaces.
method Study of homology groups for topological tilings, using coloring proofs.
result Several results about the non-existence of polyomino tilings on certain square-tiled surfaces.
Research finds bounds for knots in hexagonal lattice and classifies 11-stick knots.
problem Determining the stick number and edge length of knots in a hexagonal lattice.
method Introducing a linear transformation between lattices to prove strict inequalities and classifying knots.
result Only trefoil and figure-eight knots are 11-stick knots in the hexagonal lattice.
We show the rigidity of the hexagonal Delaunay triangulated plane under Luo's PL conformality. As a consequence, we obtain a rigidity theorem for a particular type of locally finite convex ideal hyperbolic polyhedra.
New tiles allow efficient knot mosaics for small knots.
problem Efficient representation of small knots on a grid.
method Introducing corner connection tiles for knot mosaics.
result Efficient knot mosaics for knots with crossing number 8 or less.
Rep-tiles fill cubes in any dimension.
problem Finding compact submanifolds that can tile cubes.
method Classifying and constructing rep-tiles for any finite CW complex.
result Every smooth compact submanifold with connected boundary is topologically isotopic to a rep-tile.
Study tiling spaces over irrational tori using diffeological classification.
problem Understanding the structure of tiling spaces over irrational tori.
method Diffeological classification of irrational tori and analysis of fiber bundle structures.
result Inherited diffeological equivalence of one-dimensional tiling spaces over irrational tori.
Shellable tilings on simplicial complexes help understand their structure.
problem Understanding the structure of simplicial complexes through tilings.
method Proving the existence of shellable h-tilings on finite simplicial complexes after stellar subdivisions.
result The h-vector of a tiling is determined by the critical vector, with palindromic properties for closed triangulated manifolds.
In this article we study Ammann tilings from the perspective of symplectic geometry. Ammann tilings are nonperiodic tilings that are related to quasicrystals with icosahedral symmetry. We associate to each Ammann tiling two explicitly constructed highly singular symplectic spaces and we show that they are diffeomorphic…
The study classifies tilings of the sphere by congruent quadrilaterals.
problem Classifying edge-to-edge tilings of the sphere by congruent quadrilaterals.
method Classification of tilings into three classes based on geometric data and parameters.
result Three classes of tilings are identified: 2-layer earth map tilings, quadrilateral subdivisions of the octahedron, and 3-layer earth map tilings.
New method constructs tilings of the plane using directed edges and alignments.
problem Modeling tilings of the Euclidean or hyperbolic plane as presheaves over categories.
method Introducing finite categories for polygons with labeled directed edges, constructing reflective alignments.
result Characterizing alignments of tilings by comparing edge directions and generating families with elegant symmetry.
New tile types for knots and links reduce complexity.
problem Determining the minimum number of tiles needed for knot representations.
method Introduced new tile types and analyzed their impact on knot complexity.
result Corner tile number lies between tile number and 3 times tile number.
Study on tilings of the plane with two types of tiles of varying areas.
problem Classifying tilings with minimal interface length.
method Analysis of isoperimetric configurations for different lattice types and tile areas.
result Three distinct tilings configurations found based on tile area ratio.
Proves rigidity of circle packings in the plane, generalizing previous work.
problem Rigidity of infinite inversive distance circle packings in the plane.
method Maximal principle for generic weighted Delaunay inversive distance circle packings and ring lemma for inversive distance circle packings in hexagonal triangulated plane.
result Proves Bowers-Stephenson's conjecture for inversive distance circle packings.
New spectral sequences derived from shellable tilings.
problem Discrete Morse theory and shellable complexes.
method Introduced tilings and quivers to support spectral sequences.
result Spectral sequences converge to relative (co)homology.
The Phi- relationship also known as Phi-factor appears in a number of lattice structures, mostly considering the lines within several separate circles or polygons. The paper considers a regular hexagonal tessellation as a lattice with the highest specific mechanical stiffness.
New geometric perspective for optimal learning on hexagonal structures.
problem Optimal learning process on hexagonal structures.
method Local trivial fibrations and Ceva's theorem.
result Learning can be defined on hexagonal structures.
The main goal of this paper is to define a 1-1 correspondence between between substitution tilings constructed by inflation and the arithmetic of positional representation in the underlying real vector space. It introduces a generalization of inflationary tessellations to equivalence classes of tiles. Two tiles belong …
We study square-tiled tori, that is, tori obtained from a finite collection of unit squares by parallel side identifications. Square-tiled tori can be parametrized in a natural way that allows to count the number of square-tiled tori tiled by a given number of square tiles. There is a natural $\mathrm{SL}(2,\mathbf{Z})…
We determine the topology of the moduli space of periodic tilings of the plane by parallelograms. To each such tiling, we associate combinatorial data via the zone curves of the tiling. We show that all tilings with the same combinatorial data form an open subset in a suitable Euclidean space that is homotopy equivalen…
Soft cells fill space without gaps, derived from minimal surfaces and deformed using edge bending.
problem Creating space-filling shapes without sharp corners.
method Edge bending algorithm to deform polyhedral tilings into soft tilings.
result Soft tilings derived from minimal surfaces can be continuously transformed into one another.
Softens tilings in 3D space, proving conjectures about polyhedral tilings.
problem Proving that all locally polyhedral tilings in 3D space can be softened.
method Developed a new edge-bending algorithm to prove the statement.
result Proved conjectures about polyhedral tilings in 3D space and the plane.
Paper proves corner connection tiles can represent knots with fewer tiles.
problem Finding the minimum number of tiles for knot representation.
method Developed corner connection tiles and proved their efficiency.
result Corner connection tiles can represent knots with fewer tiles than traditional tiles.
This paper classifies all 3D rep-tiles up to homeomorphism.
problem Identifying compact 3D shapes that can be tiled into smaller copies of themselves.
method Examined all 3D rep-tiles up to homeomorphism, showing equivalence to the exterior of a connected graph in S3. result A 3-manifold is a 3D rep-tile if and only if it is the exterior of a connected graph in S3. In this note we prove that any monohedral tiling of the closed circular unit disc with k≤3 topological discs as tiles has a k-fold rotational symmetry. This result yields the first nontrivial estimate about the minimum number of tiles in a monohedral tiling of the circular disc in which not all tiles contain t…
This paper proposes grid cells encode position via a conformal isometric embedding of 2D physical space.
problem Hexagonal grid firing patterns in grid cells.
method Learning a distance-preserving position embedding in neural space using a recurrent neural network.
result The conformal isometric embedding of 2D physical space into neural space explains hexagonal grid firing patterns.
4-ball can be tiled with knotted surfaces.
problem Tiling the 4-ball with knotted surfaces.
method Using congruent knotted surfaces isotopic to the original surface.
result Tiling of the 4-ball with knotted surfaces.