arXiv research

Proof of Tait-Kneser theorem and related variations using Lorentzian geometry.

The Tait-Kneser theorem states that the osculating circles of a plane curve with monotonic curvature are pairwise disjoint and nested. We discuss this theorem and a number of its variations.

This work improves graph inference using the degree-4 sum-of-squares hierarchy.

The Kneser-Poulsen conjecture says that if a finite collection of balls in a Euclidean (spherical or hyperbolic) space is rearranged so that the distance between each pair of centers does not increase, then the volume of the union of these balls does not increase as well. We give new results about central sets of subse…

We study the chromatic number of the curve graph of a surface. We show that the chromatic number grows like k log k for the graph of separating curves on a surface of Euler characteristic -k. We also show that the graph of curves that represent a fixed non-zero homology class is uniquely t-colorable, where t denotes it…

The study constructs symplectic solvmanifolds satisfying the hard-Lefschetz condition.

The classical Tait-Kneser theorem states that the osculating circles of a smooth plane curve, free from curvature extrema, are pairwise disjoint. We prove a number of analogs of this theorem, e.g., for ovals of osculating cubics, osculating polynomials and trigonometric polynomials; in each case, we will obtain a non-d…

Kneser-Haken Finiteness asserts that for each compact 3-manifold M there is an integer c(M) such that any collection of k>c(M) closed, essential, 2-sided surfaces in M must contain parallel elements. We show here that if M is closed then twice the number of tetrahedra in a (pseudo)-triangulation of M suffices for c(M).

Associated to an embedded surface in the $3$-sphere, we construct a diagram of fundamental groups, and prove that it is a complete invariant, wherefrom we deduce complete invariants of handlebody links, tunnels of handlebody links, and spatial graphs.The main ingredients in the proof of the completeness are a generaliz…

Maps between surfaces have degree constraints based on their Euler characteristics.

Study open 3-manifolds as sums of closed ones, finding a classification.

Let C be some class of objects equipped with a set of simplifying moves. When we apply these to a given object M in C as long as possible, we get a root of M. Our main result is that under certain conditions the root of any object exists and is unique. We apply this result to different situations and get several new re…

We present power low rank ensembles (PLRE), a flexible framework for n-gram language modeling where ensembles of low rank matrices and tensors are used to obtain smoothed probability estimates of words in context. Our method can be understood as a generalization of n-gram modeling to non-integer n, and includes standar…

A new simple proof for surface map degree inequality.

The profinite completion of the fundamental group of a closed, orientable $3$-manifold determines the Kneser--Milnor decomposition. If $M$ is irreducible, then the profinite completion determines the Jaco--Shalen--Johannson decomposition of $M$.

The classical Kneser-Milnor theorem says that every closed oriented connected 3-dimensional manifold admits a unique connected sum decomposition into manifolds that cannot be decomposed any further. We discuss to what degree such decompositions exist in higher dimensions and we show that in many settings uniqueness fai…

Simplified proof classifies surfaces using normal curves.

We show that in any triangulated 3-manifold, every index n topologically minimal surface can be transformed to a surface which has local indices (as computed in each tetrahedron) that sum to at most n. This generalizes classical theorems of Kneser and Haken, and more recent theorems of Rubinstein and Stocking, and is t…

Two groups are virtually isomorphic if they can be obtained one from the other via a finite number of steps, where each step consists in taking a finite extension or a finite index subgroup (or viceversa). Virtually isomorphic groups are always quasi-isometric, and a group G is quasi-isometrically rigid if every group …

Proves projectability of $H$-surfaces in non-perpendicular boundary conditions.

The famous Haken-Kneser-Milnor theorem states that every 3-manifold can be expressed in a unique way as a connected sum of prime 3-manifolds. The analogous statement for 3-orbifolds has been part of the folklore for several years, and it was commonly believed that slight variations on the argument used for manifolds wo…

Extends Borsuk-Ulam theorem with applications in sphere coverings and colorings.

In his paper "On the Schlafli differential equality", J. Milnor conjectured that the volume of n-dimensional hyperbolic and spherical simplices, as a function of the dihedral angles, extends continuously to the closure of the space of allowable angles (``The continuity conjecture''), and furthermore, the limit at a bou…

We investigate contrasting behaviours emerging when studying foliations on non-metrisable manifolds. It is shown that Kneser's pathology of a manifold foliated by a single leaf cannot occur with foliations of dimension-one. On the other hand, there are open surfaces admitting no foliations. This is derived from a quali…

Suppose that $n\neq p^k$ and $n\neq 2p^k$ for all $k$ and all primes $p$. We prove that for any Hausdorff compactum $X$ with a free action of the symmetric group $\mathfrak S_n$ there exists an $\mathfrak S_n$-equivariant map $X \to {\mathbb R}^n$ whose image avoids the diagonal $\{(x,x\dots,x)\in {\mathbb R}^n|x\in {\…

The Four Vertex Theorem, one of the earliest results in global differential geometry, says that a simple closed curve in the plane, other than a circle, must have at least four "vertices", that is, at least four points where the curvature has a local maximum or local minimum. In 1909 Syamadas Mukhopadhyaya proved this …

Users form information trails as they browse the web, checkin with a geolocation, rate items, or consume media. A common problem is to predict what a user might do next for the purposes of guidance, recommendation, or prefetching. First-order and higher-order Markov chains have been widely used methods to study such se…

Line graph transformation aids graph isomorphism tests by excluding challenging graph properties.

Proposes MGMN for end-to-end graph similarity learning.

The paper explores graphons of line graphs from sparse finite graphs.

MxPool learns graph features from diverse graphs using a hierarchical structure.

Study the geometry of graph product extension graphs.

Graph neural network learns graph distances effectively.

Quasi-transitive graphs quasi-isometric to planar graphs can be upgraded to Cayley graphs.

Customized-GNN generates model-specific for each graph.

Graph embedding leaks sensitive graph properties and subgraphs.

Characterizes graphs with leveled embeddings and introduces new graph invariants.

The paper shows conflict graphs of Petersen family graphs are mostly unbalanced.

Two new methods improve graph embedding without needing a complete graph structure.

We define a pseudo-inverse for line graphs using linear integer programming.

Develops method to create non-Abelian Ricci-flat graphs via bundles.

New method uses graph generative models for graph classification.

MathNet uses wavelets for graph representation and learning.

Unified framework for graph coarsening using node features and graph matrices.

A fast graph embedding method for large graphs.

Quadratic bounds found for graph dimensions.

Study classifies Halin graphs with positive curvature.

PSimGNN partitions graphs into subgraphs for efficient graph similarity computation.