arXiv research

Proves a generalized Whitehead cut vertex lemma for tree groups.

The paper explores new phenomena in boundaries of relatively hyperbolic groups.

The level set of an elliptic function is a doubly periodic point set in C. To obtain a wider spectrum of point sets, we consider, more generally, a Riemann surface S immersed in C^2 and its sections (``cuts'') by C. We give S a crystallographic isometry in C^2 by defining a fundamental surface element as a conformal ma…

Suppose a finitely generated group $G$ is hyperbolic relative to $\mathcal P$ a set of proper finitely generated subgroups of $G$. Established results in the literature imply that a "visual" metric on $\partial (G,\mathcal P)$ is "linearly connected" if and only if the boundary $\partial (G,\mathcal P)$ has no cut poin…

In this paper it is shown that for any network there is a uniquely determined network based on a structure tree that provides a convenient way of determining a minimal cut separating a pair $s, t$ where each of $s, t$ is either a vertex or an end in the original network. A Max-Flow Min-Cut Theorem is proved for any net…

Algorithm determines spatial graph isomorphism with vertex, edge colorings and orientations.

We investigate Legendrian graphs in $(\R^3, ξ_{std})$. We extend the classical invariants, Thurston-Bennequin number and rotation number to Legendrian graphs. We prove that a graph can be Legendrian realized with all its cycles Legendrian unknots with $tb=-1$ and $rot=0$ if and only if it does not contain $K_4$ as a mi…

We provide an example in each rank of an ageometric fully irreducible outer automorphism whose ideal Whitehead graph has a cut vertex. Consequently, we show that there exist examples in each rank of Handel-Mosher axis bundles that are not just a single axis, as well as of "nongeneric" behavior in the sense of the "trai…

Study optimal adjustment sets for causal policies with hidden variables.

Let $P$ be a simple polytope of dimension $n$ with $m$ facets and $P_{v}$ be a polytope obtained from $P$ by cutting off one vertex $v$. Let $Z=Z(P)$ and $Z_{v}=Z(P_{v})$ be the corresponding moment-angle manifolds. In \cite{[GL]} S.Gitler and S.López conjectured that: $Z_{v}$ is diffeomorphic to $\partial[(Z-int(D^{n+…

Efficiently projects points onto polytopes, especially useful in web-scale applications.

We define ruling invariants for even-valence Legendrian graphs in standard contact three-space. We prove that rulings exist if and only if the DGA of the graph, introduced by the first two authors, has an augmentation. We set up the usual ruling polynomials for various notions of gradedness and prove that if the graph …

Geometrization says `` any closed oriented three-manifold which is prime (not a connected sum) carries one of the eight Thurston geometries OR it has incompressible torus walls whose complementary components each carry one of four particular Thurston geometries" (see Introduction and Figure 1). These geometric componen…

The problem of quasilocal energy has been extensively studied mainly in four dimensions. Here we report results regarding the quasilocal energy in spacetime dimension $n\geq 4$. After generalising three distinct quasilocal energy definitions to higher dimensions under appropriate assumptions, we evaluate their small sp…

Vertex distortion detects if a knot is unknot.

The study finds the bounds of vertex orbits in maps derived from specific lattices.

Paper studies metric ribbon graphs and provides a recursion for their volumes.

The paper proves ideal triangulations and disk unfolding for singular flat surfaces.

Given a vertex of interest in a network $G_1$, the vertex nomination problem seeks to find the corresponding vertex of interest (if it exists) in a second network $G_2$. A vertex nomination scheme produces a list of the vertices in $G_2$, ranked according to how likely they are judged to be the corresponding vertex of …

Learning representation on graph plays a crucial role in numerous tasks of pattern recognition. Different from grid-shaped images/videos, on which local convolution kernels can be lattices, however, graphs are fully coordinate-free on vertices and edges. In this work, we propose a Gaussian-induced convolution (GIC) fra…

634 vertex-transitive and over 10^103 non-vertex-transitive 27-vertex triangulations of octonionic projective plane.

NeuralCut learns to select cutting planes by looking ahead, outperforming traditional methods.

Differentiable cutting-plane layers solve parametric mixed-integer linear optimization problems.

This paper shows semi-equivelar toroidal maps are vertex-transitive covers.

NeVI-Cut uses neural networks to efficiently propagate uncertainty without feedback.

Defines formal vertex laws related to Lie conformal algebras.

Paper connects probability density cuts to graph theory eigenfunctions.

Study Riemannian metrics on lens spaces, find cut loci and diameters.

Study Riemannian metrics on lens spaces, find cut loci and diameters.

We consider a left invariant Riemannian metric on SO(3) with two equal eigenvalues. We find the cut locus and the equation for the cut time. We find the diameter of such metric and describe the set of all most distant points from the identity. Also we prove that the cut locus and the cut time converge to the cut locus …

Quasi-vertex-transitive maps are the homogeneous maps on the plane with finitely many vertex orbits under the action of their automorphism groups. We show that there exist quasi-vertex-transitive maps of types $[p^3, 3]$ for $p \equiv 1$ (mod $6$), but there doesn't exist vertex-transitive map of such types. In particu…

The study examines vertices in curves with singular points in the Euclidean plane.

Stability of cut locus under metric perturbations in compact Riemannian manifolds.

Vertex distortion measures how far lattice knots deviate from straight lines.

New equivalence relation for links using cut-diagrams.

For random graphs distributed according to stochastic blockmodels, a special case of latent position graphs, adjacency spectral embedding followed by appropriate vertex classification is asymptotically Bayes optimal; but this approach requires knowledge of and critically depends on the model dimension. In this paper, w…

The design of good heuristics or approximation algorithms for NP-hard combinatorial optimization problems often requires significant specialized knowledge and trial-and-error. Can we automate this challenging, tedious process, and learn the algorithms instead? In many real-world applications, it is typically the case t…

We prove that there exists a geodesic trajectory on the dodecahedron from a vertex to itself that does not pass through any other vertex.

Study shows convergence rates for Cheeger cuts on data clouds.

Unified framework for differentiable graph partitioning with probabilistic cuts.

New proof for global rigidity of vertex scaling on polyhedral surfaces.

Stochastic cutting planes improve data-driven optimization speed.

Study of Randers metrics on spheres with simple cut loci.

In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph $G$ with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreements: the number of all `+' edges within clusters plus all `-' edges cut across clusters. BCC is known to be NP-hard. We present a novel approx…

Solves Skopenkov's problem on graph embedding criteria.

A semi-regular tiling of the hyperbolic plane is a tessellation by regular geodesic polygons with the property that each vertex has the same vertex-type, which is a cyclic tuple of integers that determine the number of sides of the polygons surrounding the vertex. We determine combinatorial criteria for the existence, …

We define spin-c prequantization of a symplectic manifold to be a spin-c structure and a connection which are compatible with the symplectic form. We describe the cutting of an S^1-equivariant spin-c prequantization. The cutting process involves a choice of a spin-c prequantization for the complex plane. We prove that …

A symplectic cut of a manifold M with a Hamiltonian circle action is a symplectic quotient of M x C. If M is Kaehler then, since C is Kaehler, the cut space is Kaehler as well. The symplectic structure on the cut is well understood. In this paper we describe the complex structure (and hence the metric) on the cut. We t…