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

We give upper bounds on the number of exceptional radial projections of arbitrary subsets of vector spaces over finite fields. Our bounds do not depend on the dimension of the ambient space. Let $\mathbb{F}_q^d$ be the $d$-dimensional…

We introduce a notion of integration defined from filters over families of finite sets. This procedure corresponds to determining the average value of functions whose range lies in any algebraic structure in which finite averages make…

The well-known Erdos-Ko-Rado Theorem states that if F is a family of k-element subsets of {1,2,...,n} (n>2k-1) such that every pair of elements in F has a nonempty intersection, then |F| is at most $\binom{n-1}{k-1}$. The theorem also…

A family $F$ of sets is said to satisfy the $(p,q)$-property if among any $p$ sets of $F$ some $q$ intersect. The celebrated $(p,q)$-theorem of Alon and Kleitman asserts that any family of compact convex sets in $\mathbb{R}^d$ that…

We present a novel feasibility criteria for the finite intersection of convex sets given by inequalities. This criteria allows us to easily assert the feasibility by analyzing the unconstrained minimum of a speci?fic convex function, that…

The concept of statistical depth extends the notions of the median and quantiles to other statistical models. These procedures aim to formalize the idea of identifying deeply embedded fits to a model that are less influenced by…

Mean estimation is a fundamental task in statistics and a focus within differentially private statistical estimation. While univariate methods based on the Gaussian mechanism are widely used in practice, more advanced techniques such as the…

The union-closed sets conjecture states that in any nonempty union-closed family $\mathcal{F}$ of subsets of a finite set, there exists an element contained in at least a proportion $1/2$ of the sets of $\mathcal{F}$. Using the…

We introduce a novel algorithm that converges to level-set convex viscosity solutions of high-dimensional Hamilton-Jacobi equations. The algorithm is applicable to a broad class of curvature motion PDEs, as well as a recently developed…

The task of this survey is to present various results on intersection patterns of convex sets. One of main tools for studying intersection patterns is a point of view via simplicial complexes. We recall the definitions of so called…

The article continues the study of the 'regular' arrangement of a collection of sets near a point in their intersection. Such regular intersection or, in other words, transversality properties are crucial for the validity of qualification…

A minimum depth d^I(S --> R) is assigned to a ring homomorphism S --> R and a R-R-bimodule I. The recent notion of depth of a subring d(S,R)in a paper by Boltje-Danz-Kuelshammer is recovered when I = R and S --> R is the inclusion mapping.…

Given an affine variety X and a finite dimensional vector space of regular functions L on X, we associate a convex body to (X, L) such that its volume is responsible for the number of solutions of a generic system of functions from L. This…

We define a notion of depth for an inclusion of multimatrix algebras B < A based on a comparison of powers of the induction-restriction table M (and its transpose matrix). This notion of depth coincides with the depth from [Kadison, 2008].…

Dimensions of level sets of generic continuous functions and generic H\"older functions defined on a fractal $F$ encode information about the geometry, ``the thickness" of $F$. While in the continuous case this quantity is related to a…

The families of $f$-divergences (e.g. the Kullback-Leibler divergence) and Integral Probability Metrics (e.g. total variation distance or maximum mean discrepancies) are widely used to quantify the similarity between probability…

Consider a domain D in R^3 which is convex (possibly all R^3) or which is smooth and bounded. Given any open surface M, we prove that there exists a complete, proper minimal immersion f : M --> D. Moreover, if D is smooth and bounded, then…

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…

Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean d-space that guarantees any such point set admits a…

We combine Freedman's topology with Eliashberg's holomorphic theory to construct Stein neighborhood systems in complex surfaces, and use these to study various notions of convexity and concavity. Every tame, topologically embedded 2-complex…