Related papers: Intersection probabilities and kinematic formulas …
We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
We present a simple sublinear time algorithm for testing the following geometric property. Let $P_1, ..., P_n$ be $n$ convex sets in $\mathbb{R}^d$ ($n \gg d$), such as polytopes, balls, etc. We assume that the complexity of each set…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
For any conical symplectic resolution, we give a conjecture relating the intersection cohomology of the singular cone to the quantum cohomology of its resolution. We prove this conjecture for hypertoric varieties, recovering the ring…
A $\sqrt{n}$ estimate in the hyperplane problem with arbitrary measures has recently been proved in \cite{K3}. In this note we present analogs of this result for sections of lower dimensions and in the complex case. We deduce these…
We count the number of conics through two general points in complete intersections when this number is finite and give an application in terms of quasi-lines.
In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…
We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.
By studying the group of rigid motions, $PSH(1)$, in the 3D-Heisenberg group $H_1$, we define the density and the measure for the sets of horizontal lines. We show that the volume of a convex domain $D\subset H_1$ is equal to the integral…
Suppose an interval is put on a horizontal line with random roughness. With probability one it is supported at two points, one from the left, and another from the right from its center. We compute probability distribution of support points…
Three events in a probability space form a conjunctive fork if they satisfy specific constraints on conditional independence and covariances. Patterns of conjunctive forks within collections of events are characterized by means of systems…
We study the asymptotic behaviour of the number of self-intersections of a trajectory of a periodic planar Lorentz process with strictly convex obstacles and finite horizon. We give precise estimates for its expectation and its variance. As…
Generalized circumcenters have been recently introduced and employed to speed up classical projection-type methods for solving feasibility problems. In this note, circumcenters are enforced in a new setting; they are proven to provide…
Consider two half-spaces $H_1^+$ and $H_2^+$ in $\mathbb{R}^{d+1}$ whose bounding hyperplanes $H_1$ and $H_2$ are orthogonal and pass through the origin. The intersection $\mathbb{S}_{2,+}^d:=\mathbb{S}^d\cap H_1^+\cap H_2^+$ is a spherical…
We determine the combinatorial types of all the 3-dimensional simple convex polytopes in R^3 that can be realized as mean curvature convex (or totally geodesic) Riemannian polyhedra with non-obtuse dihedral angles in Riemannian 3-manifolds…
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 simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions -- computing the size of projections of high dimensional polytopes…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…
In a previous work arXiv:physics/0611108v2, it was shown that the volume spanned by a molecular system in its conformational space can be effectively bounded by a polyhedral cone, this cone is described by means of a simple combinatorial…