English
Related papers

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

200 papers

The complexity of bilinear maps (equivalently, of $3$-mode tensors) has been studied extensively, most notably in the context of matrix multiplication. While circuit complexity and tensor rank coincide asymptotically for $3$-mode tensors,…

Computational Complexity · Computer Science 2026-02-13 Cornelius Brand , Radu Curticapean , Petteri Kaski , Baitian Li , Ian Orzel , Tim Seppelt , Jiaheng Wang

In a Note added in proof to a 1984 paper, Daniel A. Marcus claimed to have a counterexample to his conjecture that a minimal positively k-spanning vector configuration in R^m has size at most 2km. However, the counterexample was never…

Metric Geometry · Mathematics 2009-08-13 Ronald F. Wotzlaw , Günter M. Ziegler

We investigate the minimization of a quadratic function over Stiefel manifolds (the set of all orthogonal $r$- frames in $\mathbf{R}^n$), which has applications in high-dimensional semi-supervised classification tasks. To reduce the…

Optimization and Control · Mathematics 2025-08-15 Pengwen Chen , Chung-Kuan Cheng , Chester Holtz

Let $M$ be an open Riemann surface and let $\Lambda\subset M$ be a closed discrete subset. In this paper, we prove the existence of complete conformal minimal immersions $M\to\mathbb{R}^n$, $n\ge 3$, with prescribed values on $\Lambda$ and…

Differential Geometry · Mathematics 2020-07-30 Ildefonso Castro-Infantes

We propose a hybrid image-space/object-space solution to the classical hidden surface removal problem: Given n disjoint triangles in Real^3 and p sample points (``pixels'') in the xy-plane, determine the first triangle directly behind each…

Computational Geometry · Computer Science 2007-05-23 Jeff Erickson

Suppose that $f\colon X\to\mathrm{Spec}\, R$ is a minimal model of a complete local Gorenstein 3-fold, where the fibres of $f$ are at most one dimensional, so by [VdB1d] there is a noncommutative ring $\Lambda$ derived equivalent to $X$.…

Algebraic Geometry · Mathematics 2017-09-25 M. Wemyss

We compute the group of link homotopy classes of link maps of two 2-spheres into 4-space. It turns out to be free abelian, generated by geometric constructions applied to the Fenn-Rolfsen link map and detected by two self-intersection…

Geometric Topology · Mathematics 2019-08-15 Rob Schneiderman , Peter Teichner

For a topological space $X$ we study continuous maps $f : X\to \mathbb R^m$ such that images of every pairwise distinct $k$ points are affinely (linearly) independent. Such maps are called affinely (linearly) $k$-regular embeddings. We…

Algebraic Topology · Mathematics 2011-06-29 R. N. Karasev

In this paper we consider reduction maps $r_{v} : K_{2n+1}(F)/C_{F} \to K_{2n+1}(\kappa_{v})_{l}$ where $F$ is a number field and $C_{F}$ denotes the subgroup of $K_{2n+1}(F)$ generated by $l$-parts (for all primes $l$) of kernels of the…

Number Theory · Mathematics 2016-09-07 Stefan Baranczuk

We study the log-rank conjecture from the perspective of point-hyperplane incidence geometry. We formulate the following conjecture: Given a point set in $\mathbb{R}^d$ that is covered by constant-sized sets of parallel hyperplanes, there…

Combinatorics · Mathematics 2023-04-14 Noah Singer , Madhu Sudan

We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is $D$-equivalent to an ultrametric, where $D\in (2,\infty)$ is a prescribed target…

Metric Geometry · Mathematics 2010-03-23 Assaf Naor , Terence Tao

We discuss the existence of vertex disjoint path coverings with prescribed ends for the $n$-dimensional hypercube with or without deleted vertices. Depending on the type of the set of deleted vertices and desired properties of the path…

Combinatorics · Mathematics 2013-12-09 Nelson Castañeda , Ivan S. Gotchev

This paper is the fifth and final in a series on embedded minimal surfaces. Following our earlier papers on disks, we prove here two main structure theorems for non-simply connected embedded minimal surfaces of any given fixed genus. The…

Differential Geometry · Mathematics 2012-11-21 Tobias H. Colding , William P. Minicozzi

For K a field of characteristic 0 and d any integer number greater than or equal to 2, we prove the invertibility of polynomial endomorphisms of the affine space of dimension d over K of the form F=Id+H, where each coordinate of H is the…

Algebraic Geometry · Mathematics 2015-08-11 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

Using the authors' 2014 "constraints method," we give a short proof for a 2015 result of Dobbins on representations of a point in a polytope as the barycenter of points in a skeleton, and show that the "r-fold Whitney trick" of Mabillard…

Combinatorics · Mathematics 2020-06-02 Pavle V. M. Blagojević , Florian Frick , Günter M. Ziegler

In this paper, we propose constructing self-referential instances to reveal the inherent algorithmic hardness of the clique problem. First, we prove the existence of a phase transition phenomenon for the clique problem in the…

Computational Complexity · Computer Science 2026-02-06 Jiaqi Li , Shuli Hu , Xianxian Li , Minghao Yin

Given a compact set K in the plane, which contains no triple of points forming a vertical and a horizontal segment, and a continuous real-valued map f on K, we give a construction of real-valued continuous maps of one variable g,h such that…

General Topology · Mathematics 2007-05-23 Eva Trenklerova

Let $K$ be a nontrivial knot. For each $n\in \mathbb{N}$, we prove that the rank of its $n$th iterated Whitehead doubled knot group $\pi_1(S^3 \setminus \operatorname{WD}^n(K))$ is bounded below by $n+1$. As an application, we show that…

Geometric Topology · Mathematics 2025-10-09 Shijie Gu , Jian Wang , Yanqing Zou

We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…

Geometric Topology · Mathematics 2017-03-06 Anders Björner , Afshin Goodarzi

Until recently, techniques for obtaining lower bounds for kernelization were one of the most sought after tools in the field of parameterized complexity. Now, after a strong influx of techniques, we are in the fortunate situation of having…

Data Structures and Algorithms · Computer Science 2015-03-19 Stefan Kratsch
‹ Prev 1 4 5 6 7 8 10 Next ›