Related papers: Constructions of k-regular maps using finite local…
We give the first polynomial-time approximation schemes (PTASs) for the following problems: (1) uniform facility location in edge-weighted planar graphs; (2) $k$-median and $k$-means in edge-weighted planar graphs; (3) $k$-means in…
We investigate conditions on a graph $C^*$-algebra for the existence of a faithful semifinite trace. Using such a trace and the natural gauge action of the circle on the graph algebra, we construct a smooth $(1,\infty)$-summable semfinite…
Bivariant (equivariant) K-theory is the standard setting for non-commutative topology. We may carry over various techniques from homotopy theory and homological algebra to this setting. Here we do this for some basic notions from…
By the Riemann-mapping theorem, one can bijectively map the interior of an $n$-gon $P$ to that of another $n$-gon $Q$ conformally. However, (the boundary extension of) this mapping need not necessarily map the vertices of $P$ to those $Q$.…
An edge-girth-regular graph $egr(n,k,g,\lambda)$ is a $k-$regular graph of order $n$, girth $g$ and with the property that each of its edges is contained in exactly $\lambda$ distinct $g-$cycles. We present new families of edge-girth…
In this article, we study Conformal pointwise-slant Riemannian maps (\textit{CPSRM}) from or to K\"{a}hler manifolds to or from Riemannian manifolds. To check the existence of such maps, we provide some non-trivial examples. We derive some…
As the first step in an approach to the solution of Hilbert's sixth problem, a general scheme of mechanics, called `supmech', is developed integrating noncommutative symplectic geometry and noncommutative probability theory in an algebraic…
We describe a procedure for constructing formal normal forms of holomorphic maps with a hypersurface of fixed points, and we apply it to obtain a complete list of formal normal forms for 2-dimensional holomorphic maps tangential to a curve…
A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many…
This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…
In this paper, we show that it is NP-hard to determine whether a given graph admits a min-1-planar drawing. A drawing of a graph is min-$k$-planar if, for every crossing in the drawing, at least one of the two crossing edges involves at…
Given a graph $\Gamma$, one may conside the set $X$ of its vertices as a metric space by assuming that all edges have length one. We consider two versions of homology theory of $\Gamma$ and their $K$-theory counterparts -- the $K$-theory of…
In a proximity region graph ${\cal G}$ in $\mathbb{R}^d$, two distinct points $x,y$ of a point process $\mu$ are connected when the 'forbidden region' $S(x,y)$ these points determine has empty intersection with $\mu$. The Gabriel graph,…
Polyharmonic maps of order k (briefly, k-harmonic maps) are a natural generalization of harmonic and biharmonic maps. These maps are defined as the critical points of suitable higher order functionals which extend the classical energy…
There are operations that transform a map M (an embedding of a graph on a surface) into another map in the same surface, modifying its structure and consequently its set of flags F(M). For instance, by truncating all the vertices of a map…
Conformal harmonic maps from a 4-dimensional conformal manifold to a Riemannian manifold are maps satisfying a certain conformally invariant fourth order equation. We prove a general existence result for conformal harmonic maps, analogous…
Bi-partite ribbon graphs arise in organising the large $N$ expansion of correlators in random matrix models and in the enumeration of observables in random tensor models. There is an algebra $\mathcal{K}(n)$, with basis given by bi-partite…
Generalising an example by Girondo and Wolfart, we use finite group theory to construct Riemann surfaces admitting two or more regular dessins (i.e. orientably regular hypermaps) with automorphism groups of the same order, and in many cases…
The smallest set of vertices needed to differentiate or categorize every other vertex in a graph is referred to as the graph's metric dimension. Finding the class of graphs for a particular given metric dimension is an NP-hard problem. This…
The purpose of this note is to study the Maulik-Okounkov $K-$theoretic stable basis for the Hilbert scheme of points on the plane, which depends on a "slope" $m \in \mathbb{R}$. When $m = \frac ab$ is rational, we study the change of stable…