Paper proves linked simplices in odd dimensions and disjoint tuples in even dimensions.
problem Proving linked simplices and disjoint tuples in various dimensions.
method Algebraic proofs based on Radon theorem.
result Linear Conway--Gordon--Sachs and van Kampen--Flores theorems proved.
The study finds non-simple isotopy classes of links in 3-manifolds, including Legendrian and pseudo-Legendrian examples.
problem Characterizing isotopy classes of links in 3-manifolds, especially in contact structures.
method Developed theory of links transverse to a nowhere-zero vector field, constructing examples in both Legendrian and pseudo-Legendrian settings.
result Non-simple isotopy classes of links exist, including Legendrian and pseudo-Legendrian examples.
S. Parsa's theorems on embedding and linking are simplified and presented.
problem Embedding graphs and simplicial complexes into lower-dimensional spaces.
method Piecewise linear (PL) embeddings and combinatorial arguments.
result Graphs and complexes can be embedded into lower dimensions with specific properties.
Link condition for simplicial complexes to be CUB spaces.
problem Understanding when a simplicial complex is a CUB space.
method Establishing a link condition based on local lattice properties.
result The link condition generalizes Gromov's link condition for cube complexes.
The study proves negatively curved complexes can be glued together under specific conditions.
problem Proving the negatively curved property of complex structures.
method Proving a gluing theorem for negatively curved complexes.
result Compact graph of spaces with negatively curved 2-complexes are negatively curved.
The Milnor degree of a 3-manifold is an invariant that records the maximum simplicity, in terms of higher order linking, of any link in the 3-sphere that can be surgered to give the manifold. This invariant is investigated in the context of torsion linking forms, nilpotent quotients of the fundamental group, Massey pro…
Researchers prove conjecture about contractible subcomplexes in noncrossing partition link.
problem Understanding contractibility of subcomplexes in the noncrossing partition link.
method Combining contractibility of flag complexes' stars with noncrossing hypertrees theory.
result Proved conjecture about contractible subcomplexes in the noncrossing partition link.
We produce a facial state sum on plane diagrams of a knot or a link which admits an invariant specialization under Polyak's recent set of generating of 4 Reidemeister moves. Thus an isotopy invariant of framed links is obtained. Each state is a complete coloring of the faces of the diagram into white and black faces so…
Given a simplicial complex K, we consider several notions of geometric complexity of embeddings of K in a Euclidean space Rd: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL embedding). We show that any n-complex with N simplices which topologically…
In this final part of a 3-part paper we introduce the pair of "wings" of the abstract PL-colored complexes Hm⋆, described in the second paper. The wings, via a weight enhanced Tutte's barycentric embedding of a planar map, produce the unexpected reformutation of a 3-dimensionl problem into a 2-dimen…
A new method learns link prediction heuristics from local subgraphs using GNN.
problem Link prediction in network-structured data.
method Developed a novel γ-decaying heuristic theory and a GNN-based algorithm to learn heuristics from local subgraphs.
result Unprecedented performance in link prediction across various problems.
The paper develops formulas for hyperbolic simplices based on edge lengths.
problem Understanding the geometry of hyperbolic simplices using only edge lengths.
method Develops geometric formulas for hyperbolic simplices based on edge lengths.
result Distance and projection formulas in hyperbolic simplices.
Extends embedding models with literal information for better link prediction.
problem Lack of literal information in existing knowledge graph embeddings.
method LiteralE: merges entity embeddings with literal information using a learnable function.
result LiteralE improves link prediction performance on various datasets.
SimplE enhances tensor factorization for better link prediction in knowledge graphs.
problem Link prediction in knowledge graphs to discover new relationships.
method Proposes SimplE, a simple enhancement of CP decomposition to learn entity embeddings dependently.
result SimplE outperforms state-of-the-art tensor factorization techniques in link prediction.
A new method predicts higher-order interactions in evolving graphs using simplicial complexes.
problem Predicting higher-order interactions in dynamic graphs with theoretical guarantees.
method Capturing higher-order interactions as simplices, modeling neighborhoods with face-vectors, and developing a nonparametric kernel estimator.
result Our method outperforms existing higher-order prediction methods and is theoretically consistent.
Estimates dimensions of maximal simplices for rational and irrational trees in Outer space.
problem Understanding the structure of trees in Outer space.
method Associate simplices to R-trees and estimate their dimensions. result Estimates the dimensions of maximal simplices for both rational and irrational trees.
Minimal triangulations of circle bundles linked to circular permutations.
problem Which circle bundles can be triangulated over a given base triangulation?
method Minimal triangulations encoded by local systems of circular permutations of vertices.
result Classical Huntington transitivity axiom for cyclic orders expressed as a binary Chern cocycle.
The paper establishes conditions for Riemannian connections and semi-simplicity of Lie algebras using spray structures.
problem Conditions for Riemannian connections and semi-simplicity of Lie algebras.
method Using almost product structures and spray, the paper provides necessary and sufficient conditions for these properties.
result Equivalence of semi-simplicity of Lie algebras to derived ideal coincidence, interiority of derivations, and adjoint representation semi-simplicity.
We describe in this chapter (Chapter IX) the idea of building an algebraic topology based on knots (or more generally on the position of embedded objects). That is, our basic building blocks are considered up to ambient isotopy (not homotopy or homology). For example, one should start from knots in 3-manifolds, surface…
It is proved that the volume of spherical or hyperbolic simplices, when considered as a function of the dihedral angles, can be extended continuously to degenerated simplices.
New criteria judge combinatorial equivalence of polytopes to products of simplices.
problem Determining combinatorial equivalence of polytopes to products of simplices.
method Combination of combinatorial, geometric, and topological conditions inspired by toric topology.
result New criteria for judging combinatorial equivalence of polytopes to products of simplices.
Study floating bodies of polytopes, linking volume to flags.
problem Understanding floating bodies of polytopes in various spaces.
method Introducing flag simplices to connect metric and combinatorial structures.
result Weighted volume depends on complete flags of polytopes.
Geodesic simplices in pseudo-hyperbolic space get a cohomological treatment.
problem Understanding geodesic simplices in pseudo-hyperbolic space.
method Cohomological interpretation and necessary/sufficient condition formulation.
result Every ideal geodesic polytope in (2,2) pseudo-hyperbolic space has finite volume. Label noise SGD converges to a simple model with a single linear feature.
problem Understanding the simplicity bias in neural network training.
method Analyzing the convergence of label noise SGD on two-layer neural networks.
result Label noise SGD converges to a model with a single linear feature.
Unbounded primitivity index in free groups linked to Chebyshev function.
problem Analyzing primitivity and simplicity indices in free groups.
method Combining topological, group-theoretic, and number-theoretic approaches, including asymptotic properties of the second Chebyshev function.
result Proved the unboundedness of the primitivity index sequence and its asymptotic behavior.
Study PL bordism theories with quantitative bounds on filling simplices.
problem Understanding PL bordism theories with geometric constraints.
method Quantitative analysis of PL manifolds and exotic theories.
result Bounding the number of simplices in fillings of cycles.
Framework reduces simplicity bias in NNs, improving OOD generalization and robustness.
problem Simplicity bias in deep learning models leads to biased predictions and poor OOD generalization.
method Proposes a framework that regularizes conditional mutual information to encourage use of diverse features.
result Demonstrates effectiveness in various settings, enhancing OOD generalization and robustness.
This paper defines a unified homology theory for quandles that are unions of groups.
problem Developing a homology theory for quandles that incorporate group operations.
method Defining multiple conjugation quandles and a homology theory that considers both group and quandle operations.
result Characterization of the first homology group and cocycle invariants for handlebody-links.
New framework shows C∗-simplicity for groups without certain subalgebras.
problem Characterizing C∗-simplicity of groups. method Introducing confined subalgebras and Uniformly Recurrent States.
result A countable discrete group is C∗-simple if it has no non-trivial amenable confined subalgebras. In this article, we prove a theorem comparing the dihedral angles of simplices in the hyperbolic, spherical and Euclidean geometries.
We study a natural intrinsic definition of geometric simplices in Riemannian manifolds of arbitrary dimension n, and exploit these simplices to obtain criteria for triangulating compact Riemannian manifolds. These geometric simplices are defined using Karcher means. Given a finite set of vertices in a convex set on t…
The free factor complex of rank 4+ fails a combinatorial isoperimetric inequality.
problem Failure of combinatorial isoperimetric inequality in the free factor complex.
method Construction of a coarsely Lipschitz function from the upward link of a free factor to integers.
result A loop in the free factor complex requires linearly growing number of 2-simplices to fill.
Research reveals simplicity bias in random logistic map, impacting data analysis and forecasting.
problem Simplicity bias in dynamical systems and its impact on data analysis and prediction.
method Examined the logistic map and random logistic map, focusing on simplicity bias and noise effects.
result Simplicity bias is observable in the random logistic map, persisting even with small noise levels.
The Apollonius theorem is generalized for m-simplices, with applications in geometry and optimization.
problem Generalizing the Apollonius theorem for m-simplices.
method Direct generalization of the theorem to m-simplices in n-dimensional space.
result Applications in geometry and optimization, including minimal surface enclosures, simplex thickness, and root-finding methods.
Similar simplices can be inscribed in most smoothly embedded spheres.
problem Inscribing families of similar simplices in spheres.
method Diffeomorphic mapping and techniques from previous work on inscribing triangles.
result A dense family of spheres allows inscribing similar simplices of every pose.
We study prismatics sets analogously to simplical sets except that realization involves prisms, i.e., products of simplices rather than just simplices. Particular examples are the prismatic subdivision of a simplicial set S and the prismatic star of S. Both have the same homotopy type as S and in particular the latter …
Simplicial sets deformation retract onto transverse simplices.
problem Deformation retraction of simplicial sets.
method Showed deformation retraction of singular simplicial set onto transverse simplices.
result Singular simplicial set deformation retracts onto transverse simplices.
We generalize the very well known boundary operator of the ordinary singular homology theory, defined in many books about algebraic topology. We describe a variant of this ordinary simplicial boundary operator where the usual boundary (n-1)-simplices of each n-simplex are replaced by combinations of internal (n-1)- sim…
The paper explores how simplicity leads to better out-of-distribution generalization in models.
problem Understanding the theoretical principles behind out-of-distribution (OOD) generalization in modern models.
method Examining diffusion models in image generation to analyze compositional generalization abilities and develop a theoretical framework for simplicity-based OOD generalization.
result The true, generalizable model corresponds to the simplest among consistent models, and this simplicity can be quantified and used to establish sample complexity guarantees.
The study reveals simplicity bias in neural networks leading to better compositional mappings.
problem Understanding when and how to encourage neural networks to learn compositional mappings.
method Examined compositional mappings through coding length and gradient descent dynamics.
result Neural networks tend to learn the simplest bijections, explaining their good generalization.
Study on simplicity of Lie skew braces, proving new results for compact cases.
problem Simplicity of Lie skew braces, focusing on compact connected cases.
method Reviewing correspondence, investigating ideals and rigidity, proving main result for compact Lie skew braces.
result Compact connected simple Lie skew braces are either trivial or have simple underlying Lie groups.
Triangulations of R^n have at least tensor rank of determinant simplices.
problem Understanding the minimum number of simplices in periodic triangulations of R^n.
method Proving lower bounds on the number of simplices in periodic triangulations of R^n.
result Lower bounds on the number of simplices in periodic triangulations of R^n.
Paper introduces a data poisoning attack on unsupervised node embedding methods.
problem Robustness of unsupervised node embedding methods against adversarial attacks.
method Data poisoning attack on DeepWalk and LINE methods.
result Data poisoning can significantly affect link prediction results by altering graph structures slightly.
Two-layer networks favor simple features, especially in complex datasets.
problem Simplicity bias in neural networks over-reliing on simple features.
method Characterization of two-layer neural networks with small weights and gradient flow.
result Features learned in middle training stages are more useful for out-of-distribution transfer.
Adam avoids simplicity bias in neural networks, leading to better generalization.
problem Simplicity bias in neural networks trained with SGD.
method Comparison of Adam and GD on binary classification tasks with Gaussian data.
result Adam leads to richer and more diverse features, improving generalization.
Algorithm constructs trisection of 4-manifolds from simplices.
problem Decompose 4-manifolds into simpler pieces.
method Algorithm transforms manifold description into trisection using curves on a surface.
result First explicit complexity bounds for trisection genus in terms of simplices.
A knot type is exchange reducible if an arbitrary closed n-braid representative can be changed to a closed braid of minimum braid index by a finite sequence of braid isotopies, exchange moves and +/- destabilizations. In the manuscript [J Birman and NC Wrinkle, On transversally simple knots, preprint (1999)] a transver…
Neural nets learn simple distributions first, then more complex ones.
problem Understanding how neural networks generalize from simple to complex functions.
method Stochastic gradient descent training, synthetic data, CIFAR10, ImageNet pre-training.
result Neural networks initially use lower-order statistics, then higher-order ones.