中文
相关论文

相关论文: Depth with respect to a family of convex sets

200 篇论文

One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume of an o-symmetric convex body whose only interior lattice…

组合数学 · 数学 2016-03-09 Bernardo González Merino , Matthias Henze

We solve a long-standing open problem posed by Goodman \& Pollack in 1988 by establishing a necessary and sufficient condition for a family of convex sets in $\mathbb{R}^d$ to admit a $k$-transversal for any $0 \le k \le d-1$. This result…

组合数学 · 数学 2026-01-26 Daniel McGinnis , Nikola Sadovek

This paper is the fourth and the last part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the Geometric…

数论 · 数学 2024-07-29 Wenbo Sun

In this paper, we derive a number of interesting properties and extensions of the convex flow problem from the perspective of convex geometry. We show that the sets of allowable flows always can be imbued with a downward closure property,…

最优化与控制 · 数学 2024-08-26 Theo Diamandis , Guillermo Angeris

Let $G$ be a group, $\mathcal{P}_G$ be the family of all subsets of $G$. For a subset $A\subseteq G$, we put $\Delta(A)=\{g\in G:|gA\cap A|=\infty\}$. The mapping $\Delta:\mathcal{P}_G\rightarrow\mathcal{P}_G$, $A\mapsto\Delta(A)$, is…

组合数学 · 数学 2012-10-03 Igor V. Protasov

For positive integers $n>k>t$ let $\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\{1,\ldots,n\}$. Subsets of $\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\mathcal{F}$ is called…

组合数学 · 数学 2022-10-21 Peter Frankl , Jian Wang

A family of $k$-subsets $A_1, A_2, ..., A_d$ on $[n]=\{1,2,..., n\}$ is called a $(d, c)$-cluster if the union $A_1\cup A_2 \cup ... \cup A_d$ contains at most $ck$ elements with $c<d$. Let $\mathcal{F}$ be a family of $k$-subsets of an…

组合数学 · 数学 2009-04-24 William Y. C. Chen , Jiuqiang Liu , Larry X. W. Wang

We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…

复变函数 · 数学 2007-05-23 Marshall A. Whittlesey

Let $\{C_{\alpha}\}_{\alpha\in \Omega}$ be a family of closed and convex sets in a Hilbert space $H$, having a nonempty intersection $C$. We consider a sequence $\{x_n\}$ of remote projections onto them. This means, $x_0\in H$, and…

泛函分析 · 数学 2024-01-01 Petr A. Borodin , Eva Kopecká

Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…

数值分析 · 数学 2008-04-11 Néstor E. Aguilera , Pedro Morin

Let $\mathcal{F}\subseteq{[n]\choose k}$ be a $t$-intersecting family. Define the $t$-covering number $\tau_t(\mathcal{F})$ of $\mathcal{F}$ as the minimum size of a subset $S$ of $[n]$ with $|S\cap F|\geqslant t$ for each…

组合数学 · 数学 2026-03-12 Tian Yao , Dehai Liu , Kaishun Wang

Many problems of theoretical and practical interest involve finding a convex or concave function. For instance, optimization problems such as finding the projection on the convex functions in $H^k(\Omega)$, or some problems in economics. In…

数值分析 · 数学 2008-04-11 Néstor Aguilera , Pedro Morin

In this paper we consider families of compact convex sets in $\mathbb R^d$ such that any subfamily of size at most $d$ has a nonempty intersection. We prove some analogues of the central point theorem and Tverberg's theorem for such…

度量几何 · 数学 2013-08-23 R. N. Karasev

We study the approximability of general convex sets in $\mathbb{R}^n$ by intersections of halfspaces, where the approximation quality is measured with respect to the standard Gaussian distribution $N(0,I_n)$ and the complexity of an…

计算复杂性 · 计算机科学 2023-11-16 Anindya De , Shivam Nadimpalli , Rocco A. Servedio

Though there exists a reasonable forward model for blur based on optical physics, recovering depth from a collection of defocused images remains a computationally challenging optimization problem. In this paper, we show that with…

计算机视觉与模式识别 · 计算机科学 2026-02-27 Holly Jackson , Caleb Adams , Ignacio Lopez-Francos , Benjamin Recht

For a $d$-dimensional random vector $X$, let $p_{n, X}(\theta)$ be the probability that the convex hull of $n$ independent copies of $X$ contains a given point $\theta$. We provide several sharp inequalities regarding $p_{n, X}(\theta)$ and…

概率论 · 数学 2023-01-11 Satoshi Hayakawa , Terry Lyons , Harald Oberhauser

Assume that $k \le d$ is a positive integer and $\C$ is a finite collection of convex bodies in $\R^d$. We prove a Helly type theorem: If for every subfamily $\C^*\subset \C$ of size at most $\max \{d+1,2(d-k+1)\}$ the set $\bigcap \C^*$…

度量几何 · 数学 2023-08-22 Imre Barany

It is a well-known fact that although the poset of open sets of a topological space is a Heyting algebra, its Heyting implication is not necessarily stable under the inverse image of continuous functions and hence is not a geometric…

逻辑 · 数学 2024-05-09 Amirhossein Akbar Tabatabai

We continue the study of ideal convergence for sequences $(x_n)$ with values in a topological space $X$ with respect to a family $\{F_\eta:\eta\in X\}$ of subsets of $X$ with $\eta\in F_\eta$, where each $F_\eta$ measures the allowed…

一般拓扑 · 数学 2026-01-21 Paolo Leonetti

Depth of the Tukey median is investigated for empirical distributions. A sharper upper bound is provided for this value for data sets in general position. This bound is lower than the existing one in the literature, and more importantly…

统计理论 · 数学 2016-04-21 Xiaohui Liu , Shihua Luo , Yijun Zuo