Related papers: Study guide for "On restricted projections to plan…
In this paper, we present a more detailed version of our previous work for three-particle correlations in quark and gluon jets [1]. We give theoretical results for this observable in the double logarithmic approximation and the modified…
The cutting plane approach to optimal matchings has been discussed by several authors over the past decades (e.g., Padberg and Rao '82, Grotschel and Holland '85, Lovasz and Plummer '86, Trick '87, Fischetti and Lodi '07) and its…
We apply contact homology to obtain new results in the problem of distinguishing immersed plane curves without dangerous self-tangencies.
Projected Gradient Descent denotes a class of iterative methods for solving optimization programs. Its applicability to convex optimization programs has gained significant popularity for its intuitive implementation that involves only…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and…
This paper discusses the construction of local bounded commuting projections for discrete subcomplexes of the gradgrad complexes in two and three dimensions, which play an important role in the finite element theory of elasticity (2D) and…
This work is a continuation of [1]. As in the previous article, here we will describe some interesting ideas and a lot of new theorems in plane geometry related to them.
An ordinary plane of a finite set of points in real 3-space with no three collinear is a plane intersecting the set in exactly three points. We prove a structure theorem for sets of points spanning few ordinary planes. Our proof relies on…
We study holomorphic curves $f:\C\longrightarrow \C^3$ avoiding four complex hyperplanes and a real subspace of real dimension four or five in $\C^3$. We show that the projection of $f$ into the complex projective space $\C P^2$ is not…
Decoupling is a recent development in Fourier analysis, which has applications in harmonic analysis, PDE, and number theory. We survey some applications of decoupling and some of the ideas in the proof. This survey is aimed at a general…
This thesis presents three results in geometric analysis. We first analyze the curve-shortening flow on figure eight curves in the plane. Afterwards, we examine the point-wise curvature preserving flow on space curves. Lastly, we present an…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
We consider the decoupling theory of a broad class of $C^5$ surfaces $\mathbb{M} \subset \mathbb{R}^3$ lacking planar points. In particular, our approach also applies to surfaces which are not graphed by mixed homogeneous polynomials. The…
This paper discusses some geometric ideas associated with knots in real projective 3-space $\mathbb{R}P^3$. These ideas are borrowed from classical knot theory. Since knots in $\mathbb{R}P^3$ are classified into three disjoint classes, -…
We provide first the functional analysis background required for reduced order modeling and present the underlying concepts of reduced basis model reduction. The projection-based model reduction framework under affinity assumptions,…
We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…
The restriction problem is better understood for hypersurfaces and recent progresses have been made by bilinear and multilinear approaches and most recently polynomial partitioning method which is combined with those estimates. However, for…
The theory of classical types of curves in normed planes is not strongly developed. In particular, the knowledge on existing concepts of curvatures of planar curves is widespread and not systematized in the literature. Giving a…
In this note we study and compare three graph invariants related to the 'compactness' of graph drawing in the plane: the dilation coefficient, defined as the smallest possible quotient between the longest and the shortest edge length; the…