Related papers: New Techniques for Computing Geometric Index
This paper presents a unified geometric framework for the statistical analysis of a general ill-posed linear inverse model which includes as special cases noisy compressed sensing, sign vector recovery, trace regression, orthogonal matrix…
Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…
We investigate resolutions of heterotic orbifolds using toric geometry. Our starting point is provided by the recently constructed heterotic models on explicit blowup of C^n/Z_n singularities. We show that the values of the relevant…
Geometric number systems, obtained by extending the real number system to include new anticommuting square roots of +1 and -1, provide a royal road to higher mathematics by largely sidestepping the tedious languages of tensor analysis and…
A hybrid imaging system consisting of a standard CT scanner and a low-profile photon-counting detector insert in contact with the patient's body has been used to produce ultrahigh-resolution images in a limited volume in chest scans of…
Seismic imaging is the numerical process of creating a volumetric representation of the subsurface geological structures from elastic waves recorded at the surface of the Earth. As such, it is widely utilized in the energy and construction…
The strong geodetic problem on a graph $G$ is to determine a smallest set of vertices such that by fixing one shortest path between each pair of its vertices, all vertices of $G$ are covered. To do this as efficiently as possible, strong…
In this manuscript, we study the interplay between symmetry and topology with a focus on the $Z_2$ topological index of 2D/3D topological insulators and high-order topological insulators. We show that in the presence of either a…
The index of a Riemannian symmetric space is the minimal codimension of a proper totally geodesic submanifold (Onishchik, 1980). There is a conjecture by the first two authors for how to calculate the index. In this paper we give an…
This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.…
The geometry of a graph $G$ embedded on a closed oriented surface $S$ can be probed by counting the intersections of $G$ with closed curves on $S$. Of special interest is the map $c \mapsto \mu_G(c)$ counting the minimum number of…
We address the problem of computing a single linkage dendrogram. A possible approach is to: (i) Form an edge weighted graph $G$ over the data, with edge weights reflecting dissimilarities. (ii) Calculate the MST $T$ of $G$. (iii) Break the…
A walk $W$ between vertices $u$ and $v$ of a graph $G$ is called a {\em tolled walk between $u$ and $v$} if $u$, as well as $v$, has exactly one neighbour in $W$. A set $S \subseteq V(G)$ is {\em toll convex} if the vertices contained in…
We present a new method for visualizing implicit real algebraic curves inside a bounding box in the $2$-D or $3$-D ambient space based on numerical continuation and critical point methods. The underlying techniques work also for tracing…
In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…
Slimness of a graph measures the local deviation of its metric from a tree metric. In a graph $G=(V,E)$, a geodesic triangle $\bigtriangleup(x,y,z)$ with $x, y, z\in V$ is the union $P(x,y) \cup P(x,z) \cup P(y,z)$ of three shortest paths…
Fitting concentric geometric objects to digitized data is an important problem in many areas such as iris detection, autonomous navigation, and industrial robotics operations. There are two common approaches to fitting geometric shapes to…
Given a hypergraph $\mathcal{H}$, we introduce a new class of evaluation toric codes called edge codes derived from $\mathcal{H}$. We analyze these codes, focusing on determining their basic parameters. We provide estimations for the…
The problem of finding an appropriate geometrical/physical index for measuring a degree of inhomogeneity for a given space-time manifold is posed. Interrelations with the problem of understanding the gravitational/informational entropy are…
Some projective wonderful models for the complement of a toric arrangement in a n-dimensional algebraic torus T were constructed in [3]. In this paper we describe their integer cohomology rings by generators and relations.