English
Related papers

Related papers: Eliminating Higher-Multiplicity Intersections, I. …

200 papers

In this study, we construct four-dimensional F-theory models with 3 to 8 U(1) factors on products of K3 surfaces. We provide explicit Weierstrass equations of elliptic K3 surfaces with Mordell-Weil ranks of 3 to 8. We utilize the method of…

High Energy Physics - Theory · Physics 2021-06-30 Yusuke Kimura

In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of $k$ terminal nodes, and the goal is to partition the node set of the graph into $k$ non-empty parts each containing exactly one…

Data Structures and Algorithms · Computer Science 2018-11-22 Kristóf Bérczi , Karthekeyan Chandrasekaran , Tamás Király , Vivek Madan

The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…

Let $D$ be a digraph. We define the minimum semi-degree of $D$ as $\delta^{0}(D) := \min \{\delta^{+}(D), \delta^{-}(D)\}$. Let $k$ be a positive integer, and let $S = \{s\}$ and $T = \{t_{1}, \dots ,t_{k}\}$ be any two disjoint subsets of…

Combinatorics · Mathematics 2022-08-22 Ansong Ma , Yuefang Sun , Xiaoyan Zhang

In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalization of Line Cover, the task is to cover the points using…

Computational Geometry · Computer Science 2016-03-24 Peyman Afshani , Edvin Berglin , Ingo van Duijn , Jesper Sindahl Nielsen

We construct a one dimensional, second countable, simply connected manifold that exhibits a single non Hausdorff fiber, sufficient to destroy the fundamental properties of classical covering space theory. The space, called the line with k…

General Topology · Mathematics 2025-07-01 Abhiram Sripat

Given a bipartite graph $G=(V_b,V_r,E)$, the $2$-Level Quasi-Planarity problem asks for the existence of a drawing of $G$ in the plane such that the vertices in $V_b$ and in $V_r$ lie along two parallel lines $\ell_b$ and $\ell_r$,…

Data Structures and Algorithms · Computer Science 2020-11-05 Patrizio Angelini , Giordano Da Lozzo , Giuseppe Di Battista , Fabrizio Frati , Maurizio Patrignani

We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s…

Geometric Topology · Mathematics 2019-07-16 Mikhail Skopenkov

Let f be a map-germ of corank 1 from complex n-space to complex (n+1)-space, and, for k less than or equal to the multiplicity of f, let $D^k(f)$ be its k'th multiple-point scheme -- the closure of the set of ordered k-tuples of pairwise…

Algebraic Geometry · Mathematics 2014-03-28 Ayse Altintas , David Mond

We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…

Algebraic Topology · Mathematics 2007-05-23 Pavle V. M. Blagojevic , Sinisa T. Vrecica , Rade T. Zivaljevic

We study the structure of solutions to linear programming formulations for the traveling salesperson problem (TSP). We perform a detailed analysis of the support of the subtour elimination linear programming relaxation, which leads to…

Data Structures and Algorithms · Computer Science 2015-03-27 Matthias Mnich , Tobias Mömke

Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL…

Metric Geometry · Mathematics 2014-09-30 Michael Freedman , Vyacheslav Krushkal

In the d-Euclidean Distance Matrix Completion (d-EDMC) problem, one aims to determine whether a given partial matrix of pairwise distances can be extended to a full Euclidean distance matrix in d dimensions. This problem is a cornerstone of…

Data Structures and Algorithms · Computer Science 2026-03-23 Fedor V. Fomin , Petr A. Golovach , M. S. Ramanujan , Saket Saurabh

Assume that there exists a smooth map between two closed manifolds $M^m\to N^k$ with only finitely many cone-like singular points, where $2\leq k\leq m\leq 2k-1$. If $(m,k)\not\in\{(2,2), (4,3), (5,3), (8,5), (16,9)\}$, then $M^m$ admits a…

Geometric Topology · Mathematics 2021-05-21 Louis Funar

Consider the following parameterized counting variation of the classic subset sum problem, which arises notably in the context of higher homotopy groups of topological spaces: Let $\mathbf{v} \in \mathbb{Q}^d$ be a rational vector, $(T_{1},…

Computational Complexity · Computer Science 2023-10-05 Cornelius Brand , Viktoriia Korchemna , Michael Skotnica , Kirill Simonov

Thurston maps are branched self-coverings of the sphere whose critical points have finite forward orbits. We give combinatorial and algebraic characterizations of Thurston maps that are isotopic to expanding maps as "Levy-free" maps and as…

Dynamical Systems · Mathematics 2016-10-11 Laurent Bartholdi , Dzmitry Dudko

This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…

Number Theory · Mathematics 2016-04-01 Victor Beresnevich

Our main result is that the Steiner Point Removal (SPR) problem can always be solved with polylogarithmic distortion, which answers in the affirmative a question posed by Chan, Xia, Konjevod, and Richa (2006). Specifically, we prove that…

Data Structures and Algorithms · Computer Science 2015-08-21 Lior Kamma , Robert Krauthgamer , Huy L. Nguyen

Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…

Metric Geometry · Mathematics 2019-10-28 Jin-ichi Itoh , Costin Vîlcu , Liping Yuan , Tudor Zamfirescu

In this paper, we obtain some sufficient conditions to guarantee the existence of multiple points of maps from $S^m$ to $\mathbb{R}^d$. Our main tool is the ideal-valued index of $G$-space defined by E. Fadell and S. Husseini. We obtain…

Algebraic Topology · Mathematics 2025-12-23 Jun Wang , Xuezhi Zhao
‹ Prev 1 3 4 5 6 7 10 Next ›