Related papers: 2013 Unit Vectors in the Plane
A graph is called 1-planar if it can be drawn in the plane so that each of its edges is crossed by at most one other edge. In this paper we decompose the set of all 1-planar graphs into three classes $\mathcal C_0, \mathcal C_1$ and…
Bounding sup-norms of modular forms in terms of the level has been the focus of much recent study. In this work the sup norm of a half integral weight cusp form is bounded in terms of the level.
The number of distinct maps (pre-maps) with a single vertex and valence $d$ is computed for any value of $d$. The types of maps (pre-maps) that we consider depend on whether the underlaying graph (pre-graph) is signed or unsigned and…
A classical statistical inequality is used to show that the distance covariance of two bounded random vectors is bounded from above by a simple function of the dimensionality and the bounds of the random vectors. Two special cases that…
In this paper the problem of finding a normal form of triangles and plane quadrilaterals up to similarity is considered. Several normal forms for triangles and a normal form for quadrilaterals of special case are described. Normal forms of…
We consider homogeneous random walks in the quarter-plane. The necessary conditions which characterize random walks of which the invariant measure is a sum of geometric terms are provided in [2,3]. Based on these results, we first develop…
We obtain sharp inequalities for the k-plane transform, the "j-plane to k-plane" transform, and the corresponding dual transforms, acting on $L^p$ spaces with a radial power weight. The operator norms are explicitly evaluated. Some…
In this paper, we prove some new inequalities. To facilitate this proof, we introduce the notion of the local product on a sheet and associated space.
Let $P$ be a finite set of points in the plane and $S$ a set of non-crossing line segments with endpoints in $P$. The visibility graph of $P$ with respect to $S$, denoted $Vis(P,S)$, has vertex set $P$ and an edge for each pair of vertices…
The unit disk graph (UDG) is a widely employed model for the study of wireless networks. In this model, wireless nodes are represented by points in the plane and there is an edge between two points if and only if their Euclidean distance is…
Angular equivalence is introduced and shown to be an equivalence relation among the norms on a fixed real vector space. It is a finer notion than the usual (topological) notion of norm equivalence. Angularly equivalent norms share certain…
Via circle pattern techniques, random planar triangulations (with angle variables) are mapped onto Delaunay triangulations in the complex plane. The uniform measure on triangulations is mapped onto a conformally invariant spatial point…
A calligraph is a graph that for almost all edge length assignments moves with one degree of freedom in the plane, if we fix an edge and consider the vertices as revolute joints. The trajectory of a distinguished vertex of the calligraph is…
Any arrangement of hyperplanes in general position in $P^n$ can be regarded as a divisor with normal crossing. We study the bundles of logarithmic 1-forms corresponding to such divisors` from the point of view of classification of vector…
In the short note, we describe a sampling construction that yields a sequence of graphons converging to a prescribed limit graphon in 1-norm. This convergence is stronger than the convergence in the cut norm, usually used to study graphon…
We study the plane automorphisms given by polynomials with certain degree decompositions.
Closed form expressions are given for computing the parameters and vectors that identify and define the $n-1$ dimensional conic section that results from the intersection of a hyperplane with an $n$-dimensional conic section: cone,…
A multidimensional Brownian motion with partial reflection on a hyperplane $S$ in the direction $qN+\alpha $, where $N$ is the conormal vector to the hyperplane and $q\in [-1,1], \alpha \in S$ are given parametres, is constructed and this…
We consider arrangements of n hyperplanes of codimension one in a real projective space of dimension d. Let us denote by F the maximal possible number f of connected components of the complement in the projective space of dimension d to the…
Three disjoint rays in euclidean 3-space form Borromean rays provided their union is knotted, but the union of any two components is unknotted. We construct infinitely many Borromean rays, uncountably many of which are pairwise…