English
Related papers

Related papers: More on Decomposing Coverings by Octants

200 papers

In this paper we consider two above lower bound parameterizations of the Node Multiway Cut problem - above the maximum separating cut and above a natural LP-relaxation - and prove them to be fixed-parameter tractable. Our results imply…

Data Structures and Algorithms · Computer Science 2011-07-11 Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Onufry Wojtaszczyk

We prove that any two smooth h-cobordant simply-connected 4-manifolds can be obtained by taking two manifolds with boundary, one of which is contractible, and gluing them along the boundary via two different attaching maps.

dg-ga · Mathematics 2008-02-03 R. Matveyev

We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs.

Data Structures and Algorithms · Computer Science 2011-07-12 Marek Karpinski , Richard Schmied , Claus Viehmann

We generalize the concept of stack one dimension higher, introducing a notion of 2-stack suitable for a trihomomorphism from a 2-category equipped with a bitopology into the tricategory of bicategories. Moreover, we give a characterization…

Category Theory · Mathematics 2024-03-14 Elena Caviglia

Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…

Combinatorics · Mathematics 2007-05-23 Zoltan Furedi , Dhruv Mubayi , Douglas B. West

This paper develops new tools for understanding surfaces with more than one end (and usually, of infinite topology) which properly minimally embed into Euclidean three-space. On such a surface, the set of ends forms a compact Hausdorff…

Differential Geometry · Mathematics 2019-08-19 Pascal Collin , Robert Kusner , William H. Meeks , III , Harold Rosenberg

We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $\Omega(\sqrt{n})$. This improves on the…

Discrete Mathematics · Computer Science 2025-10-14 Pasin Manurangsi , Raghu Meka

A new parametric surface representation is proposed that interpolates the vertices of a given closed mesh of arbitrary topology. Smoothly connecting quadrilateral patches are created by blending local, multi-sided quadratic interpolants. In…

Computational Geometry · Computer Science 2026-01-28 Péter Salvi

A collection $S = \{D_1,\ldots, D_n\}$ of divisors in a smooth variety $X$ is an {\em arrangement} if intersections of all subsets of $S$ are smooth. We show that a double cover of $X$ ramified on an arrangement has a crepant resolution…

Algebraic Geometry · Mathematics 2020-07-16 Colin Ingalls , Adam Logan

We are interested in finite groups acting orientation-preservingly on 3-manifolds (arbitrary actions, ie not necessarily free actions). In particular we consider finite groups which contain an involution with nonempty connected fixed point…

Geometric Topology · Mathematics 2009-04-14 Mattia Mecchia

The explicit computation of higher-point conformal blocks in any dimension is usually a challenging task. For two-dimensional conformal field theories in Euclidean signature, the oscillator formalism proves to be very efficient. We…

High Energy Physics - Theory · Physics 2025-05-15 Martin Ammon , Jakob Hollweck , Tobias Hössel , Katharina Wölfl

The connection between the theory of permutation orbifolds, covering surfaces and uniformization is investigated, and the higher genus partition functions of an arbitrary permutation orbifold are expressed in terms of those of the original…

High Energy Physics - Theory · Physics 2007-05-23 Peter Bantay

Triangulation graph staining is sufficient for planar graph staining. This article will focus on triangulation and the nature of the color change channel of the staining tool. By construction, the four colors of the vertex are converted…

General Mathematics · Mathematics 2019-01-28 Rundong Gan

We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to $C_k$ for some $k$) instead of cycles (graphs with all degrees even). We give an…

Combinatorics · Mathematics 2024-09-12 Radek Hušek , Robert Šámal

In this paper we generalize previous work on decomposition in three-dimensional orbifolds by 2-groups realized as analogues of central extensions, to orbifolds by more general 2-groups. We describe the computation of such orbifolds in…

High Energy Physics - Theory · Physics 2023-08-23 Alonso Perez-Lona , Eric Sharpe

We prove the multiple cover formula conjecture for abelian surfaces for a large class of insertions, including all stationary invariants. The proof uses the reduced degeneration formula expressing the invariants in terms of the correlated…

Algebraic Geometry · Mathematics 2025-12-10 Thomas Blomme , Francesca Carocci

Eight different refinements of trapped surfaces are proposed, of three basic types, each intended as potential stability conditions. Minimal trapped surfaces are strictly minimal with respect to the dual expansion vector. Outer trapped…

General Relativity and Quantum Cosmology · Physics 2011-03-28 Sean A. Hayward

The entanglement properties of a class of topological stabilizer states, the so called \emph{topological color codes} defined on a two-dimensional lattice or \emph{2-colex}, are calculated. The topological entropy is used to measure the…

Quantum Physics · Physics 2009-11-13 Mehdi Kargarian

We describe a new method for constraining Laplacian spectra of hyperbolic surfaces and 2-orbifolds. The main ingredient is consistency of the spectral decomposition of integrals of products of four automorphic forms. Using a combination of…

High Energy Physics - Theory · Physics 2024-01-23 Petr Kravchuk , Dalimil Mazac , Sridip Pal

Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…

Combinatorics · Mathematics 2025-02-14 Hailong Dao , Manik Dhar , Izabella Łaba , Ben Lund