arXiv research

A graph's winding numbers around two non-adjacent vertices differ by ±1.

The paper explores winding numbers of almost embeddings of a 4-vertex graph in the plane.

The paper defines invariants for almost graph embeddings and explores their properties.

The paper explores invariants of graph drawings in the plane.

New framework relaxes independence assumption for graph-mixing dependencies.

Enhanced survival trees improve computational efficiency and inference.

Criteria for embedding simplicial complexes into manifolds, reducing a topological problem to algebra.

A geodesic net with 4 boundary vertices and 25 balanced vertices is constructed.

The paper introduces an adjacency constraint to improve goal-conditioned HRL.

Study designs experiments to identify causal graph structure with cycles and latent confounders.

We give a complete enumeration of all combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product $S^2\times S^1$ and 615 triangulations of the twisted sphere product $S^2_\times_S^1$. All the 3-spheres…

The string vertices of closed string field theory are subsets of the moduli spaces of punctured Riemann surfaces that satisfy a geometric version of the Batalin-Vilkovisky master equation. We present a homological proof of existence of string vertices and their uniqueness up to canonical transformations. Using hyperbol…

We prove the existence of a complete, embedded, singly periodic minimal surface, whose quotient by vertical translations has genus one and two ends. The existence of this surface was announced in our paper in {\it Bulletin of the AMS}, 29(1):77--84, 1993. Its ends in the quotient are asymptotic to one full turn of the …

We prove that any complete surface with constant mean curvature in a homogeneous space E(κ,τ) which is transversal to the vertical Killing vector field is, in fact, a vertical graph. As a consequence we get that any orientable, parabolic, complete, immersed surface with constant mean curvature H in E(κ,τ) (different fr…

SplitNN-driven Vertical Partitioning enables distributed learning from diverse data sources.

Develops a method to disaggregate aerosol optical depth into vertical extinction profiles.

Consider two networks on overlapping, non-identical vertex sets. Given vertices of interest in the first network, we seek to identify the corresponding vertices, if any exist, in the second network. While in moderately sized networks graph matching methods can be applied directly to recover the missing correspondences,…

Classifies 3-manifolds from simplified (2,0)-trisections of 4-manifolds.

Improved bounds on ideal vertices in right-angled hyperbolic polyhedra.

The paper examines vertical curves and fibers in the Heisenberg group, proving properties and constructing counterexamples.

P. Arnoux and A. Marin showed that any triangulation of $\mathbb{RP}^n$ contains more than $\frac{(n+1)(n+2)}{2}$ vertices if $n \geq 3$. We construct some natural triangulation of $\mathbb{RP}^n$ with $\frac{n(n+5)}{2}-1$ vertices for all $n \geq 3$. Previously, it was known that $\mathbb{RP}^n$ has $\mathbb{Z}_2^n$-e…

In this paper we study some problems related to a vertical Liouville distribution (called vertical Liouville-Hamilton distribution) on the cotangent bundle of a Cartan space. We study the existence of some linear connections of Vrănceanu type on Cartan spaces related to some foliated structures. Also, we identify a cer…

Paper shows minimum 10 vertices for hyperbolic origami 2-torus.

Only vertical planes are asymptotic to other planes in 3D space.

Asynchronous federated learning for vertically partitioned data improves efficiency and privacy.

We prove that a geodesic net with three boundary (= unbalanced) vertices on a non-positively curved plane has at most one balanced vertex. We do not assume any a priori bound for the degrees of unbalanced vertices. The result seems to be new even in the Euclidean case. We demonstrate by examples that the result is not …

We uncover some connections between the topology of a complete Riemannian surface M and the minimum number of vertices, i.e., critical points of geodesic curvature, of closed curves in M. In particular we show that the space forms with finite fundamental group are the only surfaces in which every simple closed curve ha…

An unknotting tunnel in a 3-manifold with boundary is a properly embedded arc, the complement of an open neighborhood of which is a handlebody. A geodesic with endpoints on the cusp boundary of a hyperbolic 3-manifold and perpendicular to the cusp boundary is called a vertical geodesic. Given a vertical geodesic in a h…

The study shows how to construct $d$-spheres from $(d-1)$-spheres and $d$-balls without additional vertices.

This paper introduces a novel technique to track structures in time varying graphs. The method uses a maximum a posteriori approach for adjusting a three-dimensional co-clustering of the source vertices, the destination vertices and the time, to the data under study, in a way that does not require any hyper-parameter t…

In arrangements of pseudocircles (Jordan curves) the weight of a vertex (intersection point) is the number of pseudocircles that contain the vertex in its interior. We give improved upper bounds on the number of vertices of weight <=k in certain arrangements of pseudocircles in the plane. In particular, forbidding cert…

We construct a geodesic net in the plane with four unbalanced (boundary) vertices that has 16 balanced vertices and does not contain proper geodesic subnets. This is the first example of an irreducible geodesic net in the Euclidean plane with 4 boundary vertices that is not a tree.

New bounds found for vertices of hyperbolic polyhedra in dimensions 5 to 12.

We prove that a minimal oriented stable annular end in H^2 x R whose asymptotic boundary is contained in two vertical lines has finite total curvature and converges to a vertical plane. Furthermore, if the end is embedded then it is a horizontal graph.

Connected domination numbers found for plane triangulations up to 13 vertices.

No minimal charts with exactly seven white vertices found.

In 1983, Banchoff and Kuhnel constructed a minimal triangulation of $\CP^2$ with 9 vertices. $\CP^3$ was first triangulated by Bagchi and Datta in 2012 with 18 vertices. Known lower bound on number of vertices of a triangulation of $\CP^n$ is $1 + \frac{(n + 1)^2}{2}$ for $n \geq 3$. We give explicit construction of so…

We investigate the behaviour of vertices and inflexions on 1-parameter families of curves on smooth surfaces in the 3-space, which include a singular member. In particular, we discuss the context where the curves evolve as sections of a smooth surface by parallel planes. More precisely we will trace the patterns of inf…

A new framework for federated learning tackles challenges with horizontally partitioned labels and stragglers.

We introduce a notion of genus range as a set of values of genera over all surfaces into which a graph is embedded cellularly, and we study the genus ranges of a special family of four-regular graphs with rigid vertices that has been used in modeling homologous DNA recombination. We show that the genus ranges are sets …

Unique vertical isomorphisms between Fedosov dg manifolds are proven for Lie pairs.

In this paper, we define almost paracontact and normal almost paracontact Finsler structures on a vector bundle and find some conditions for integrability of these structures. We define paracontact metric, para- Sasakian and K-paracontact Finsler structures and study some properties of these structures. For a K-paracon…

We present evidence in support of a conjecture that a bipartite graph with at least five vertices in each part and |E(G)| \geq 4 |V(G)| - 17 is intrinsically knotted. We prove the conjecture for graphs that have exactly five or exactly six vertices in one part. We also show that there is a constant C_n such that a bipa…

We describe an algorithm for the enumeration of (candidates of) vertex-transitive combinatorial $d$-manifolds. With an implementation of our algorithm, we determine, up to combinatorial equivalence, all combinatorial manifolds with a vertex-transitive automorphism group on $n\leq 13$ vertices. With the exception of act…

New algorithm finds corrupted vertices in graphs with few queries.

Study of Poincaré-Reeb graphs for algebraic domains.

We discuss the relations between the $e_0$ invariants of a small Seifert space and the twisting numbers of Legendrian vertical circles in it.

The study classifies discrete pseudomanifolds with up to 2d+7 vertices.