English
Related papers

Related papers: Unfolding Polycube Trees with Constant Refinement

200 papers

We define a notion for unfolding smooth, ruled surfaces, and prove that every smooth prismatoid (the convex hull of two smooth curves lying in parallel planes), has a nonoverlapping "volcano unfolding." These unfoldings keep the base…

Computational Geometry · Computer Science 2015-03-12 Nadia Benbernou , Patricia Cahn , Joseph O'Rourke

Hoffmann-Ostenhof's Conjecture states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a $2$-regular subgraph. In this paper, we show that the conjecture holds for claw-free subcubic…

Combinatorics · Mathematics 2020-02-03 Elham Aboomahigir , Milad Ahanjideh , Saieed Akbari

We prove the following result: Let $(X,g_0)$ be a complete, connected 4-manifold with uniformly positive isotropic curvature and with bounded geometry. Then there is a finite collection $\mathcal{F}$ of manifolds of the form $\mathbb{S}^3…

Differential Geometry · Mathematics 2016-02-03 Hong Huang

We investigate the graphs formed from the vertices and creases of an origami pattern that can be folded flat along all of its creases. As we show, this is possible for a tree if and only if the internal vertices of the tree all have even…

Computational Geometry · Computer Science 2019-07-16 David Eppstein

A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…

Combinatorics · Mathematics 2014-12-23 Sven Herrmann , Michael Joswig

We prove that every graph has a canonical tree of tree-decompositions that distinguishes all principal tangles (these include the ends and various kinds of large finite dense structures) efficiently. Here `trees of tree-decompositions' are…

Combinatorics · Mathematics 2020-04-08 Johannes Carmesin , Matthias Hamann , Babak Miraftab

We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…

Numerical Analysis · Mathematics 2022-05-11 Pablo Antolin , Xiaodong Wei , Annalisa Buffa

In the longest plane spanning tree problem, we are given a finite planar point set $\mathcal{P}$, and our task is to find a plane (i.e., noncrossing) spanning tree for $\mathcal{P}$ with maximum total Euclidean edge length. Despite more…

Computational Geometry · Computer Science 2024-05-02 Sergio Cabello , Michael Hoffmann , Katharina Klost , Wolfgang Mulzer , Josef Tkadlec

In this paper we study the theories of the infinite-branching tree and the $r$-regular tree, and show that both of them are pseudofinite. Moreover, we show that they can be realized by infinite ultraproducts of polynomial exact classes of…

Logic · Mathematics 2026-01-14 Darío García , Melissa Robles

We determine the tropicalizations of very affine surfaces over a valued field that are obtained from del Pezzo surfaces of degree 5, 4 and 3 by removing their (-1)-curves. On these tropical surfaces, the boundary divisors are represented by…

Algebraic Geometry · Mathematics 2015-01-13 Qingchun Ren , Kristin Shaw , Bernd Sturmfels

We describe a new type of polycyclic presentations, that we will call refined solvable presentations, for polycyclic groups. These presentations are obtained by refining a series of normal subgroups with abelian sections. These…

Group Theory · Mathematics 2011-02-10 René Hartung , Gunnar Traustason

Bicubic maps are in bijection with \beta(0,1)-trees. We introduce two new ways of decomposing \beta(0,1)-trees. Using this we define an endofunction on \beta(0,1)-trees, and thus also on bicubic maps. We show that this endofunction is in…

Combinatorics · Mathematics 2013-06-25 Anders Claesson , Sergey Kitaev , Anna de Mier

We give an explicit formula for all tree amplitudes in N=4 SYM, derived by solving the recently presented supersymmetric tree-level recursion relations. The result is given in a compact, manifestly supersymmetric form and we show how to…

High Energy Physics - Theory · Physics 2009-04-17 J. M. Drummond , J. M. Henn

We prove that any compact surface with constant positive curvature and conical singularities can be decomposed into irreducible components of standard shape, glued along geodesic arcs connecting conical singularities. This is a spherical…

Geometric Topology · Mathematics 2022-01-05 Guillaume Tahar

In this paper we study polycubes: orthogonal polyhedra with axis-aligned quadrilateral faces. We present a complete characterization of polycubes of any genus based on their dual structure: a collection of oriented loops which run in each…

Computational Geometry · Computer Science 2025-06-11 Maxim Snoep , Bettina Speckmann , Kevin Verbeek

Invariants for complicated objects such as those arising in phylogenetics, whether they are invariants as matrices, polynomials, or other mathematical structures, are important tools for distinguishing and working with such objects. In this…

Populations and Evolution · Quantitative Biology 2022-04-06 Joan Carles Pons , Tomás M. Coronado , Michael Hendriksen , Andrew Francis

In order to have a multiresolution analysis, the scaling function must be refinable. That is, it must be the linear combination of 2-dilation, $\mathbb{Z}$-translates of itself. Refinable functions used in connection with wavelets are…

Information Theory · Computer Science 2011-11-02 Emily J. King

We classify all cubic systems possessing the maximum number of invariant straight lines (real or complex) taking into account their multiplicities. We prove that there are exactly 23 topological different classes of such systems. For every…

Dynamical Systems · Mathematics 2007-05-23 Jaume Llibre , Nicolae Vulpe

Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…

Discrete Mathematics · Computer Science 2021-08-27 Laura Monroe

In this note we consider the Steiner tree problem under Bilu-Linial stability. We give strong geometric structural properties that need to be satisfied by stable instances. We then make use of, and strengthen, these geometric properties to…

Data Structures and Algorithms · Computer Science 2021-09-29 James Freitag , Neshat Mohammadi , Aditya Potukuchi , Lev Reyzin