A geodesic net with 4 boundary vertices and 25 balanced vertices is constructed.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
The existence of a balanced vertex is proven for geodesic nets with three boundary vertices.
We determine the minimum number of vertices needed to provide balanced triangulations of -bundles over . If is odd and the bundle is orientable, or is even and the bundle is non-orientable, the minimum number of vertices is ; otherwise, it is . Similar results apply to al…
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.
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 …
In this work we show that the systems of balance equations (balance systems) of continuum thermodynamics occupy a natural place in the variational bicomplex formalism. We apply the vertical homotopy decomposition to get a local splitting (in a convenient domain) of a general balance system as the sum of a Lagrangian pa…
Using Traizet's regeneration method, we prove the existence of many new 3-dimensional families of embedded, doubly periodic minimal surfaces. All these families have a foliation of 3-dimensional Euclidean space by vertical planes as a limit. In the quotient, these limits can be realized conformally as noded Riemann sur…
Closed geodesic nets on surfaces have limited branch points
Researchers create new triply periodic minimal surfaces by gluing saddle towers.
Study exact community recovery in noisy SBM with limited queries.
Geodesic nets on Riemannian manifolds form a natural class of stationary objects generalizing geodesics. Yet almost nothing is known about their classification or general properties even when the ambient Riemannian manifold is the Euclidean plane or the round -sphere. In the first half of this paper we survey some r…
Federated Learning is introduced to protect privacy by distributing training data into multiple parties. Each party trains its own model and a meta-model is constructed from the sub models. In this way the details of the data are not disclosed in between each party. In this paper we investigate the model interpretation…
New method predicts graph structure changes over time.
We start with a disk with vertices along its boundary where pairs of vertices are connected with strips with certain restrictions. This forms a {\it pairing}. To relate two pairings, we define an operator called a cut-and-glue operation. We show that this operation does not change an invariant of pairings know…
A new framework for clustering high-dimensional data using vertical shards.
New study shows limits of low-degree algorithms in finding large independent sets in sparse hypergraphs.
DeepSphere improves spherical CNNs by balancing efficiency and rotation equivariance.
In this note, we derive an approximation for the mean curvature normal vector on vertices of triangulated surface meshes from the Young-Laplace equation and the force balance principle. We then demonstrate that the approximation expression from our physics-based derivation is equivalent to the discrete Laplace-Beltrami…
There is a recent surge of interest in identifying the sharp recovery thresholds for cluster recovery under the stochastic block model. In this paper, we address the more refined question of how many vertices that will be misclassified on average. We consider the binary form of the stochastic block model, where ver…
To each oriented closed combinatorial manifold we assign the set (with repetitions) of isomorphism classes of links of its vertices. The obtained transformation L is the main object of study of the present paper. We pose a problem on the inversion of the transformation L. We shall show that this problem is closely rela…
We employ a solution of the Yang-Baxter equation to construct invariants for knot-like objects. Specifically, we consider a Yang-Baxter state model for the sl(n) polynomial of classical links and extend it to oriented singular links and balanced oriented 4-valent knotted graphs with rigid vertices. We also define a rep…
In this paper, we characterize Riemannian 4-manifold in terms of its almost Hermitian twistor spaces . Some special metric conditions (including Balanced metric condition, first Gauduchon metric condition) on are studied. For the first Chern form of a natural unitary…
New algorithm detects cores in graphs with community structure, improving vertex selection for better clustering.
Discrete Green's functions are the inverses or pseudo-inverses of combinatorial Laplacians. We present compact formulas for discrete Green's functions, in terms of the eigensystems of corresponding Laplacians, for products of regular graphs with or without boundary. Explicit formulas are derived for the cycle, torus, a…
Researchers create minimal surfaces with Scherk ends and find catenoid limits.
Study on relativistic nonholonomic mechanics with time-dependent constraints.
Efficient algorithm for graph matching in correlated stochastic block models.
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 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.
Most state-of-the-art graph kernels only take local graph properties into account, i.e., the kernel is computed with regard to properties of the neighborhood of vertices or other small substructures. On the other hand, kernels that do take global graph propertiesinto account may not scale well to large graph databases.…
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,…
We prove a number of new restrictions on the enumerative properties of homology manifolds and semi-Eulerian complexes and posets. These include a determination of the affine span of the fine -vector of balanced semi-Eulerian complexes and the toric -vector of semi-Eulerian posets. The lower bounds on simplicial h…
Classifies 3-manifolds from simplified (2,0)-trisections of 4-manifolds.
Deep linear networks exhibit collapsing features and classifiers across datasets.
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 contains more than vertices if . We construct some natural triangulation of with vertices for all . Previously, it was known that has -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 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 -spheres from -spheres and -balls without additional vertices.