中文
相关论文

相关论文: Piercing convex sets

200 篇论文

An untouchable set in a projective plane is a set of points such that no line of the plane meets the set in exactly one point. Recently, H\'eger and Nagy (Avoiding Secants of Given Size in Finite Projective Planes, J. Combin. Des.…

组合数学 · 数学 2025-05-14 Jeremy M. Dover

Let ${\bf A} = (A_1, \dots, A_m)$ be an $m$-tuple of bounded linear operators acting on a Hilbert space ${\cal H}$. Their joint $(p,q)$-matricial range $\Lambda_{p,q}({\bf A})$ is the collection of $(B_1, \dots, B_m) \in {\bf M}_q^m$, where…

泛函分析 · 数学 2018-04-05 Pan-Shun Lau , Chi-Kwong Li , Yiu-Tung Poon , Nung-Sing Sze

We prove general topological Radon-type theorems for sets in $\mathbb R^d$ or on a surface. Combined with a recent result of Holmsen and Lee, we also obtain fractional Helly theorem, and consequently the existence of weak $\varepsilon$-nets…

组合数学 · 数学 2024-12-04 Zuzana Patáková

A family of perfect matchings of $K_{2n}$ is $t$-$intersecting$ if any two members share $t$ or more edges. We prove for any $t \in \mathbb{N}$ that every $t$-intersecting family of perfect matchings has size no greater than $(2(n-t) -…

组合数学 · 数学 2018-11-16 Nathan Lindzey

For $p, q\in \mathbb{N}$, a finite nonempty set $F$ is said to be $(p,q)$-Schreier (or maximal $(p,q)$-Schreier, respectively) if $q\min F\ge p|F|$ (or $q\min F = p|F|$, respectively). For $n\in \mathbb{N}$, let $$\mathcal{S}^{p/q}_{n}\ :=\…

组合数学 · 数学 2026-02-17 Hung Viet Chu , Zachary Louis Vasseur

We study families of rational curves on an algebraic variety satisfying incidence conditions. We prove an analogue of bend-and-break: that is, we show that under suitable conditions, such a family must contain reducibles. In the case of…

代数几何 · 数学 2020-06-26 Ziv Ran

In this article, a combinatorial characterization of the family of planes of $\PG(3,q)$ which meet a hyperbolic quadric in an irreducible conic, using their intersection properties with the points and lines of $\PG(3,q)$, is given.

组合数学 · 数学 2021-02-09 Bikramaditya Sahu

The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…

组合数学 · 数学 2025-10-02 Nived J M

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical and hyperbolic planes.…

度量几何 · 数学 2016-01-19 J. Jerónimo-Castro , E. Makai

Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular"…

数论 · 数学 2007-05-23 Ernie Croot , Christian Elsholtz

Let $q$ be a prime power and $k$ be a natural number. What are the possible cardinalities of point sets ${S}$ in a projective plane of order $q$, which do not intersect any line at exactly $k$ points? This problem and its variants have been…

组合数学 · 数学 2024-09-24 Tamás Héger , Zoltán Lóránt Nagy

Let $\mathcal{F}$ and $\mathcal{G}$ be two $t$-uniform families of subsets over $[k] = \{1,2,...,k\}$, where $|\mathcal{F}| = |\mathcal{G}|$, and let $C$ be the adjacency matrix of the bipartite graph whose vertices are the subsets in…

组合数学 · 数学 2020-05-19 Michal Parnas

Consider the binomial model $G^{d+1}(n,p)$ of the random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge is present, independently of one another, with probability $p:\mathbb{N}\to[0,1]$. We prove that, for all…

组合数学 · 数学 2016-02-23 Nicolau C. Saldanha , Márcio Telles

We present an alternate proof of a result of F\'eray and Reiner characterizing posets whose $P$-partition rings are complete intersections. This shortened proof relates the complete intersection property to a simple structural property of a…

组合数学 · 数学 2018-02-26 Brian Davis

We prove the following the generalized Tur\'an type result. A collection $\mathcal{T}$ of $r$ sets is an $r$-triangle if for every $T_1,T_2,\dots,T_{r-1}\in \mathcal{T}$ we have $\cap_{i=1}^{r-1}T_i\neq\emptyset$, but $\cap_{T\in…

组合数学 · 数学 2022-01-12 Dániel T. Nagy , Balázs Patkós

We study two combinatorial parameters, which we denote by f(S) and h(S), associated to an arbitrary set S \subseteq R^d, where d \in N. In the nondegenerate situation, f(S) is the largest possible number of facets of a d-dimensional…

最优化与控制 · 数学 2013-07-08 Gennadiy Averkov

Let $\xi$ be an irrational algebraic real number and $(p_k / q_k)_{k \ge 1}$ denote the sequence of its convergents. Let $(u_n)_{n \geq 1}$ be a non-degenerate linear recurrence sequence of integers, which is not a polynomial sequence. We…

数论 · 数学 2023-12-20 Yann Bugeaud , Khoa D. Nguyen

Let $2^{[n]}$ and $\binom{[n]}{i}$ be the power set and the class of all $i$-subsets of $\{1,2,\cdots,n\}$, respectively. We call two families $\mathscr{A}$ and $\mathscr{B}$ cross-intersecting if $A\cap B\neq \emptyset$ for any $A\in…

组合数学 · 数学 2020-10-08 Chao Shi , Peter Frankl , Jianguo Qian

Let $k\ge d\ge 3$ be fixed. Let $\mathcal{F}$ be a $k$-uniform family on $[n]$. Then $\mathcal{F}$ is $(d,s)$-conditionally intersecting if it does not contain $d$ sets with union of size at most $s$ and empty intersection. Answering a…

组合数学 · 数学 2020-05-18 Xizhi Liu

We prove Helly-type theorems for line transversals to disjoint unit balls in $\R^{d}$. In particular, we show that a family of $n \geq 2d$ disjoint unit balls in $\R^d$ has a line transversal if, for some ordering $\prec$ of the balls, any…

计算几何 · 计算机科学 2007-05-23 Otfried Cheong , Xavier Goaoc , Andreas Holmsen , Sylvain Petitjean