中文
相关论文

相关论文: Line transversals to disjoint balls

200 篇论文

We prove the joints conjecture, showing that for any $N$ lines in ${\Bbb R}^3$, there are at most $O(N^{{3 \over 2}})$ points at which 3 lines intersect non-coplanarly. We also prove a conjecture of Bourgain showing that given $N^2$ lines…

组合数学 · 数学 2008-12-08 Larry Guth , Nets Hawk Katz

The classical Kneser-Milnor theorem says that every closed oriented connected 3-dimensional manifold admits a unique connected sum decomposition into manifolds that cannot be decomposed any further. We discuss to what degree such…

We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…

代数几何 · 数学 2024-10-01 Samuel Lidz , Zachary Lihn , Adam Melrod

We study colorful no-dimensional Tverberg-type problems and obtain several optimal results. A colorful no-dimensional Tverberg-type theorem provides a bound on a radius $R$ such that, for any pairwise disjoint $k$-element subsets…

度量几何 · 数学 2025-09-29 Polina Barabanshchikova , Grigory Ivanov , Alexander Polyanskii

We prove that for all positive integers $n$ and $k$, there exists an integer $N = N(n,k)$ satisfying the following. If $U$ is a set of $k$ direction vectors in the plane and $\mathcal{J}_U$ is the set of all line segments in direction $u$…

组合数学 · 数学 2021-01-11 Jinha Kim , Minki Kim , O-Joung Kwon

We construct for all $ k\in \mathbb{N} $ a $ k $-edge-connected digraph $ D $ with $ s,t\in V(D) $ such that there are no edge-disjoint $ s \rightarrow t $ and $t\rightarrow s $ paths. We use in our construction "self-similar" graphs which…

组合数学 · 数学 2017-05-02 Attila Joó

An $N$-dimensional parallelepiped will be called a bar if and only if there are no more than $k$ different numbers among the lengths of its sides (the definition of bar depends on $k$). We prove that a parallelepiped can be dissected into…

组合数学 · 数学 2008-09-12 Ivan Feshchenko , Danylo Radchenko , Lev Radzivilovsky , Maksym Tantsiura

Let $H$ be a complete $r$-uniform hypergraph such that two vertices are marked in each edge as its `boundary' vertices. A linear ordering of the vertex set of $H$ is called an {\em agreeing linear order}, provided all vertices of each edge…

组合数学 · 数学 2023-01-19 Csaba Biró , Jenő Lehel , Géza Tóth

Given a point set $S$ in $\mathbb{R}^d$, a family of sets is $S$-intersecting if its members have a point in common in $S$. Recently, Edwards and Sober\'{o}n proved a fractional version of Halman's theorem for axis-parallel boxes, showing…

组合数学 · 数学 2025-03-18 Taehyun Eom , Minki Kim , Eon Lee

This paper introduces a new approach to finding knots and links with hidden symmetries using "hidden extensions", a class of hidden symmetries defined here. We exhibit a family of tangle complements in the ball whose boundaries have…

几何拓扑 · 数学 2016-09-20 Eric Chesebro , Jason DeBlois

Suppose that $nk$ points in general position in the plane are colored red and blue, with at least $n$ points of each color. We show that then there exist $n$ pairwise disjoint convex sets, each of them containing $k$ of the points, and each…

组合数学 · 数学 2017-06-08 Andreas F. Holmsen , Jan Kynčl , Claudiu Valculescu

Given $n$ pairwise disjoint sets $X_1,\ldots, X_n$, we call the elements of $S=X_1\times\ldots\times X_n$ strings. A nonempty set of strings $W\subseteq S$ is said to be well-connected if for every $v\in W$ and for every $i\, (1\le i\le…

组合数学 · 数学 2021-12-22 Peter Frankl , Janos Pach

We give positive answer to a conjecture by Agranovsky. A continuous function on the sphere which has separate holomorphic extension along the set of complex lines passing through three non aligned interior points, is the trace of a…

复变函数 · 数学 2011-01-04 L. Baracco

A family $\mathcal{F}$ of subsets of a set $X$ is $t$-intersecting if $\vert A_i \cap A_j \vert \geq t$ for every $A_i, \; A_j \in \mathcal{F}$. We study intersecting families in the Hamming geometry. Given $X=\mathbb{F}_q^3$ a vector space…

组合数学 · 数学 2014-04-02 Anderson N. Martinhão , Emerson L. Monte Carmelo

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

离散数学 · 计算机科学 2013-08-29 Alexander Grigoriev , Athanassios Koutsonas , Dimitrios M. Thilikos

We consider the Dirichlet problem for semilinear elliptic equations on a bounded domain which is diffeomorphic to a ball and investigate bifurcation from a given (trivial) branch of solutions, where the radius of the ball serves as…

偏微分方程分析 · 数学 2017-02-07 Nils Waterstraat

Let $S\subset \mathbb{R}^d$ $(d\geq 2)$. A set $S$ is said to be $m$-point convex, if for every $m$ distinct points in $S$, at least one of the line-segments determined by them lies in $S$. We also say that $S$ has property $P_m$. Let…

组合数学 · 数学 2026-04-17 Wenzhi Liu , Wei Wang , Liping Yuan , Tudor Zamfirescu

Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.

计算几何 · 计算机科学 2021-09-03 Rain Jiang , Kai Jiang , Minghui Jiang

Let a $R$-body be a closed set, complement of union of open balls of radius $R$ in the Euclidean space. Properties generalizing similar ones for convex sets are proved for the family of $R$-bodies; properties for the family of sets…

度量几何 · 数学 2024-06-25 Marco Longinetti , Paolo Manselli , Adriana Venturi

Several authors have recently attempted to show that the intersection of three simply connected subcontinua of the plane is simply connected provided it is non-empty and the intersection of each two of the continua is path connected. In…

一般拓扑 · 数学 2007-05-23 E. D. Tymchatyn , V. Valov