English
Related papers

Related papers: Octahedral decomposition of alternating links in t…

200 papers

Over 50 years ago, Erd\H{o}s and Gallai conjectured that the edges of every graph on $n$ vertices can be decomposed into $O(n)$ cycles and edges. Among other results, Conlon, Fox and Sudakov recently proved that this holds for the random…

Combinatorics · Mathematics 2019-02-20 Dániel Korándi , Michael Krivelevich , Benny Sudakov

We propose a conjectural semiorthogonal decomposition for the derived category of the moduli space of stable rank 2 bundles with fixed determinant of odd degree, independently formulated by Narasimhan. We discuss some evidence for, and…

Algebraic Geometry · Mathematics 2023-03-14 Pieter Belmans , Sergey Galkin , Swarnava Mukhopadhyay

We enhance the quandle counting invariants of oriented classical and virtual knots and links using a construction similar to quandle modules but inspired by symplectic quandle operations rather than Alexander quandle operations. Given a…

Geometric Topology · Mathematics 2023-04-18 Will Gilroy , Sam Nelson

Our main results concern changing an arbitrary plat presentation of a split or composite link to one which is obviously recognizable as being split or composite. Pocket moves, first described in \cite{unlinkviaplats}, are utilized -- a…

Geometric Topology · Mathematics 2024-02-16 William W. Menasco , Deepisha Solanki

Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in $d$-space into constant-complexity subcells. In this paper, we settle in the affirmative a few long-standing open…

Computational Geometry · Computer Science 2023-11-06 Pankaj K. Agarwal , Esther Ezra , Micha Sharir

Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…

Discrete Mathematics · Computer Science 2009-02-10 N. S. Narayanaswamy , N. Sadagopan , Apoorve Dubey

If a finite element mesh contains concave elements, it is said to tangled. Tangled meshes can occur during mesh generation, mesh optimization, and large deformation simulations, and will lead to erroneous results during finite element…

Numerical Analysis · Mathematics 2022-07-11 Bhagyashree Prabhune , Krishnan Suresh

We show that any smooth one-dimensional link in the real projective three-plane is the fixed-point locus of a smooth symplectic surface in the complex projective three-plane which is invariant under complex conjugation. The degree of the…

Symplectic Geometry · Mathematics 2025-05-06 Johan Björklund , Georgios Dimitroglou Rizell

Hexahedral (hex) meshing is a long studied topic in geometry processing with many fascinating and challenging associated problems. Hex meshes vary in complexity from structured to unstructured depending on application or domain of interest.…

Computational Geometry · Computer Science 2024-09-11 Paul Zhang , Judy Hsin-Hui Chiang , Xinyi , Fan , Klara Mundilova

The main result is the identification of the orthogonal complement of the subalgebra of conformal vector field inside the algebra of all vector fields of a compact flat 2-manifold. As a fundamental tool, the complete Hodge decomposition for…

Differential Geometry · Mathematics 2016-09-05 Stephen Marsland , Robert McLachlan , Klas Modin , Matthew Perlmutter

Edge polytopes is a class of interesting polytope with rich algebraic and combinatorial properties, which was introduced by Ohsugi and Hibi. In this papar, we follow a previous study on cutting edge polytopes by Hibi, Li and Zhang. Instead…

Combinatorics · Mathematics 2014-12-17 Atsushi Funato , Nan Li , Akihiro Shikama

We present explicit geometric decompositions of the complement of tiling links, which are alternating links whose projection graphs are uniform tilings of the 2-sphere, the Euclidean plane or the hyperbolic plane. This requires generalizing…

Geometric Topology · Mathematics 2017-10-06 Colin Adams , Aaron Calderon , Xinyi Jiang , Alexander Kastner , Gregory Kehne , Nathaniel Mayer , Mia Smith

Linked-twist maps are area-preserving, piece-wise diffeomorphisms, defined on a subset of the torus. They are non-uniformly hyperbolic generalisations of the well-known Arnold Cat Map. We show that a class of canonical examples have…

Dynamical Systems · Mathematics 2019-02-20 J. Springham , R. Sturman

Recently $C^m$-conforming finite elements on simplexes in arbitrary dimension are constructed by Hu, Lin and Wu. The key in the construction is a non-overlapping decomposition of the simplicial lattice in which each component will be used…

Numerical Analysis · Mathematics 2021-11-23 Long Chen , Xuehai Huang

Symbolic and graphical tools, such as Mathematica, enable precise visualization and analysis of void spaces in sphere packings. In the cubic close packing (CCP, or face-centred cubic packing; FCC) arrangement these voids can be partitioned…

Computational Geometry · Computer Science 2025-08-19 Philip W. Kuchel

A virtual link can be understood as a link in a trivial I-bundle over an orientable compact surface with genus. A twisted virtual link is a link in a trivial I-bundle over a not-necessarily orientable compact surface. A twisted virtual…

Geometric Topology · Mathematics 2012-12-03 Jessica Ceniceros , Sam Nelson

A new Combinatorial Ricci curvature and Laplacian operators for grayscale images are introduced and tested on 2D synthetic, natural and medical images. Analogue formulae for voxels are also obtained. These notions are based upon more…

Computer Vision and Pattern Recognition · Computer Science 2010-05-12 Emil Saucan , Eli Appleboilm , Gershon Wolansky , Yehoshua Y. Zeevi

We propose to employ scale spaces of mathematical morphology to hierarchically simplify fracture surfaces of complementarity fitting archaeological fragments. This representation preserves complementarity and is insensitive to different…

Computational Geometry · Computer Science 2019-03-26 Hanan ElNaghy , Leo Dorst

We consider orthogonal decompositions of invariant subspaces of Hardy spaces, these relate to the Blaschke based phase unwinding decompositions. We prove convergence in Lp. In particular we build an explicit multiscale wavelet basis. We…

Classical Analysis and ODEs · Mathematics 2018-05-10 Ronald R. Coifman , Jacques Peyrière

A transitive decomposition of a graph is a partition of the edge or arc set giving a set of subgraphs which are preserved and permuted transitively by a group of automorphisms of the graph. In this paper we give some background to the study…

Combinatorics · Mathematics 2007-06-19 Geoffrey Pearce