Paper generalizes wrinkled embedding concept to jet spaces.
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
A {\it wrinkled embedding} is a topological embedding which is a smooth embedding everywhere on except a set of -dimensional spheres, where has cuspidal corners. In this paper we prove that any rotation of the tangent plane field of a {\it smoothly embedded} submanifold $V\s…
This paper generalizes wrinkling techniques to Haefliger structures, linking them to foliations.
We are concerned with underlying connections between fluids, elasticity, isometric embedding of Riemannian manifolds, and the existence of wrinkled solutions of the associated nonlinear partial differential equations. In this paper, we develop such connections for the case of two spatial dimensions, and demonstrate tha…
We show that generalized broken fibrations in arbitrary dimensions admit rank-2 Poisson structures compatible with the fibration structure. After extending the notion of wrinkled fibration to dimension 6 we prove that these wrinkled fibrations also admit compatible rank-2 Poisson structures. In the cases with indefinit…
Local formulas for Poisson structures on wrinkled fibrations are derived.
We consider a disk-shaped thin elastic sheet bonded to a compliant sphere. (Our sheet can slip along the sphere; the bonding controls only its normal displacement.) If the bonding is stiff (but not too stiff), the geometry of the sphere makes the sheet wrinkle to avoid azimuthal compression. The total energy of this sy…
We study simple wrinkled fibrations, a variation of the simplified purely wrinkled fibrations introduced by Williams, and their combinatorial description in terms of surface diagrams. We show that simple wrinkled fibrations induce handle decompositions on their total spaces which are very similar to those obtained from…
According to Kiyoshi Igusa a generalized Morse function on an n-dimensional manifold M is a smooth function with only Morse and birth-death singularities and a framed function is a generalized Morse function with an additional structure: a framing of the negative eigenspace at each critical point of the function f. In …
We use the wrinkling theorem proven in Y. Eliashberg and N. Mishachev, "Wrinkling of smooth mappings and its applications - I", Invent. Math., 130(1997), 345-369, to fully describe the homotopy type of the space of S-immersions, i.e. equidimensional folded maps with prescribed folds.
Motivated by the programmes initiated by Taubes and Perutz, we study the geometry of near-symplectic 4-manifolds, i.e., manifolds equipped with a closed 2-form which is symplectic outside a union of embedded 1-dimensional submanifolds, and broken Lefschetz fibrations on them. We present a set of four moves which allow …
Novel defects in hyperbolic sheets explain complex wrinkling patterns in nature.
An R_2-move is a homotopy of wrinkled fibrations which deforms images of indefinite fold singularities like Reidemeister move of type II. Variants of this move are contained in several important deformations of wrinkled fibrations, flip and slip for example. In this paper, we first investigate how monodromies are chang…
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…
The paper recovers contact forms from boundary data using vector fields and Lyapunov functions.
We give a new proof of Markov's classical theorem relating any two closed braid representations of the same knot or link. The proof is based upon ideas in a forthcoming paper by the authors, "Stabilization in the braid groups". The new proof of the classical Markov theorem is used by Nancy Wrinkle in her forthcoming ma…
The edges of torn plastic sheets and growing leaves often display hierarchical buckling patterns. We show that this complex morphology (i) emerges even in zero strain configurations, and (ii) is driven by a competition between the two principal curvatures, rather than between bending and stretching. We identify the key…
Shells resist three out of six possible loads if simply connected.
The edge of torn elastic sheets and growing leaves often form a hierarchical buckling pattern. Within non-Euclidean plate theory this complex morphology can be understood as low bending energy isometric immersions of hyperbolic Riemannian metrics. With this motivation we study the isometric immersion problem in strip a…
Paper develops a framework for hyperbolic Monge-Ampère equation on strips, proving well-posedness and stability.
Automatic facial behavior analysis has a long history of studies in the intersection of computer vision, physiology and psychology. However it is only recently, with the collection of large-scale datasets and powerful machine learning methods such as deep neural networks, that automatic facial behavior analysis started…
Estimates yearly improvement rates for nearly all technologies using US patent data.
Embeddings are ubiquitous in machine learning, appearing in recommender systems, NLP, and many other applications. Researchers and developers often need to explore the properties of a specific embedding, and one way to analyze embeddings is to visualize them. We present the Embedding Projector, a tool for interactive v…
Proposes QQE for transforming and embedding data distributions.
Maps can be embedded in higher dimensions if they lift to embeddings in product spaces.
New embeddings for manifolds using heat kernels.
Introduces PELP for graph-enhanced word embeddings.
Curvature regularization prevents distortion in graph embeddings.
Word embeddings are a powerful approach for unsupervised analysis of language. Recently, Rudolph et al. (2016) developed exponential family embeddings, which cast word embeddings in a probabilistic framework. Here, we develop dynamic embeddings, building on exponential family embeddings to capture how the meanings of w…
Proposes cone embedding for better graph hierarchical structure representation.
Classifies linear embeddings of grassmannians and ind-grassmannians.
BC-Aligner maintains backward compatibility of embeddings after frequent updates.
Embedding calculus proves convergence for surfaces.
Unified framework for word embedding models using noise examples.
Models use embeddings and attention for better claim severity prediction.
A fast graph embedding method for large graphs.
Paper proves impossibility of three desirable properties in node embedding.
The study characterizes and verifies equivariant embeddings of symmetric Kählerian manifolds.
Proves uniqueness of embedding complex manifold into infinite-dimensional space.
The paper defines invariants for almost graph embeddings and explores their properties.
Recently, click-through rate (CTR) prediction models have evolved from shallow methods to deep neural networks. Most deep CTR models follow an Embedding\&MLP paradigm, that is, first mapping discrete id features, e.g. user visited items, into low dimensional vectors with an embedding module, then learn a multi-layer pe…
This work analyzes PPR-based node embeddings and their topological information.
Network representation learning in low dimensional vector space has attracted considerable attention in both academic and industrial domains. Most real-world networks are dynamic with addition/deletion of nodes and edges. The existing graph embedding methods are designed for static networks and they cannot capture evol…
For leveled spatial graphs, we find a surface embedding that allows cellular embedding.
Long spacelike embeddings can be approximated by isometric ones.
Graph embeddings have become a key and widely used technique within the field of graph mining, proving to be successful across a broad range of domains including social, citation, transportation and biological. Graph embedding techniques aim to automatically create a low-dimensional representation of a given graph, whi…
Graphs embeddable on torus and linklessly in 3D can be embedded linklessly in standard torus.
Geometrically transforms word embeddings into a common space for better comparison.