Consider an oriented curve in a domain in the plane . Thinking of as a piece of paper, one can make a curved folding in the Euclidean space . This can be expressed as the image of an "origami map" such that is the singular set of , the word "…
On-device research index
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.
168,657 papers · 148 categories
Trend · papers per month
48 results for “Crease set”
Consider a curve in a domain in the plane . Thinking of as a piece of paper, one can make a curved folding in the Euclidean space . The singular set of as a space curve is called the crease of and the initially given plane curve is called the crease patt…
Classifies and analyzes the stability of black hole event horizon birth points using contact geometry.
problem Classifying and understanding the structural possibilities of black hole crease sets.
method Contact geometry approach, focusing on BigFronts and their Legendrian projections.
result Refined stability discussion of the event horizon birth component and identification of additional components.
Paper explores folding patterns of curved creases preserving their geometric properties.
problem Investigating rigid-ruling folding motions of curved crease-rule patterns.
method Deriving conditions for rigid-ruling foldability and analyzing combinations of creases.
result Constant fold-angle creases are only compatible with other constant fold-angle creases.
Researchers solved a geometry paradox for creased tubes.
problem Resolving the paradox of Gaussian curvature in creased tubes.
method Calculated Gaussian curvature in terms of rate of change of solid angle, dependent on fold angle and curvature.
result Gaussian curvature is zero overall despite the surface being doubly-curved.
Paper classifies pillow box isometric deformations preserving crease patterns.
problem Classifying pillow box isometric deformations preserving crease patterns.
method Continuous isometric deformations from pillow boxes to double rectangles, preserving crease patterns.
result Such deformations necessarily change pillow box topology.
We describe a general family of curved-crease folding tessellations consisting of a repeating "lens" motif formed by two convex curved arcs. The third author invented the first such design in 1992, when he made both a sketch of the crease pattern and a vinyl model (pictured below). Curve fitting suggests that this init…
The paper proves the existence of a folded annulus with multiple creases.
problem Existence of a folded annulus with multiple creases.
method Analyze developable surfaces, use normal curvature and relative torsion, compute geometric descriptors, prove propagation of folds.
result Proves the existence of a folded annulus with multiple creases.
This paper explores non-periodic folding of Spidron units, revealing nonlinear dynamics.
problem Understanding the kinematics and nonlinear phenomena of Spidron units.
method Analysis of single unit cell kinematics and recursive construction of multiple cells.
result Non-periodic folding restricts isotropic folding as the number of unit cells increases.
A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to reconfigure the creased paper from any configuration compatible with the metric, t…
Surface embeddings in math.GT
Classifies embeddings of surfaces in 3D space with product structure.
problem Classifying embeddings of surfaces in Euclidean 3-space with product structure.
method Investigates embeddings of a surface in , focusing on critical points and isotopy classes.
result Provides necessary and sufficient conditions for realizing certain configurations of curves as crease sets.
The Positive Mass Theorem for special singular initial data.
problem Proving the positive mass theorem for data with a codimension one singularity.
method Using asymptotically flat spin initial data sets with matching Bartnik data condition involving spacetime rotations.
result Established a spacetime positive mass theorem and rigidity statement.
How periodic surfaces bendmath.DG
Periodic surfaces have a limited number of bending modes, equal to their membrane modes.
problem Understanding the limitations of bending modes in periodic surfaces.
method Analyzing deformation modes of periodic, piecewise smooth, simply connected surfaces.
result Effective membrane modes and bending modes are orthogonal, limiting the total number of modes to 3.
A flat Klein bottle is visualized using origami.
problem Visualizing a Klein bottle's flatness and topology.
method Curved-crease origami with inelastic film.
result The sculpture illustrates both flatness and non-orientability.
Origami can create complex knots, with minimum creases defining a new knot invariant.
problem Creating complex knots using origami folds.
method Developed a new knot invariant called the fold number, defined as the minimum number of creases required to obtain an equivalent knot.
result No proper foldings can produce nontrivial knots, but improper foldings can.
New game defined on origami patterns, linking number introduced.
problem Defining a game on origami patterns.
method Introduced Region Select on origami crease patterns.
result Defined a new unlinking number.
The study explores isometric deformations of surfaces of translation.
problem Determine the ways surfaces of translation bend isometrically.
method Analyzes existence conditions and provides closed-form expressions for infinitesimal and finite bendings of surfaces of translation.
result Surfaces of translation admit various infinitesimal and finite bendings, including purely torsional and torsion-free.
Geometric Mechanics of Thin Periodic Surfacescond-mat.soft
New framework reveals limits of flexible, periodic thin surfaces.
problem Understanding the mechanical behavior of thin, periodic surfaces.
method Developed a duality between surface rotations and in-plane stresses.
result Exactly three out of six possible strain states are isometries.
Study finds how periodic surfaces can bend without stretching.
problem Understanding isometric deformations of periodic surfaces.
method Characterization of isometric deformations using a constraint derived from Gauss theorem.
result Relates surface stretching to bending and twisting.
Clinical decision support systems (CDSS) will play an in-creasing role in improving the quality of medical care for critically ill patients. However, due to limitations in current informatics infrastructure, CDSS do not always have com-plete information on state of supporting physiologic monitor-ing devices, which can …
Shells resist three out of six possible loads if simply connected.
problem Understanding the load resistance of shells.
method Formal mathematical analysis of shell strains and deflections.
result The space of strains is three-dimensional for simply-connected shells.
Proves Gromov's conjecture on total mean curvature using surgery and positive mass theorems.
problem Proving Gromov's conjecture on total mean curvature of fill-ins.
method Surgery to reduce to fill-ins of spheres, positive mass theorems, and quantitative surgery process.
result Proves Gromov's conjecture on total mean curvature in various cases.
Unified theory solves strain compatibility and elasticity of origami metamaterials.
problem Understanding and controlling the morphing paths of origami metamaterials.
method Unified theory for a wide array of origami tessellations, solving strain compatibility and elasticity.
result Origami metamaterials exhibit equal but opposite in-plane and out-of-plane Poisson's ratios and bending energy depends on strain gradient.
New solutions found for bending of flat surfaces and origami structures.
problem Understanding the energy-efficient bending modes of origami tessellations and corrugated shells.
method Direct construction of closed-form solutions for surfaces of translation.
result Three inextensional modes identified for surfaces of translation, including stretching, bending, and twisting.
New concept of effective isometries for compliant shells.
problem Inadequate classification of isometric deformations for compliant shells.
method Introduce effective isometric deformations defined by first-order isometry in a small scale separation parameter.
result Effective isometries are solutions to a quasilinear second-order PDE.
An immense class of physical counterexamples to the four dimensional strong cosmic censor conjecture---in its usual broad formulation---is exhibited. More precisely, out of any closed and simply connected 4-manifold an open Ricci-flat Lorentzian 4-manifold is constructed which is not globally hyperbolic and no perturba…
Study shows Julia sets and gasket limit sets are quasiconformally different.
problem Quasiconformal non-equivalence of Julia sets and gasket limit sets.
method Proved quasiconformal non-equivalence of Julia sets and gasket limit sets.
result Julia sets and gasket limit sets are quasiconformally different.
Study shows non-symmetric convex sets have full boundary limits.
problem Understanding boundaries of non-symmetric convex sets.
method Proved using proximal limit set analysis.
result Proximal limit set equals full projective boundary for non-symmetric irreducible divisible convex sets.
The paper analyzes set-to-set matching with neural networks, focusing on theoretical generalization.
problem Theoretical analysis of set-to-set matching with neural networks.
method Generalization error analysis of set-to-set matching with neural networks.
result Theoretical insights into the behavior of set-to-set matching models.
Generative model learns to autoencode and generate sets of images.
problem Learning to represent and generate sets of images with unknown number of sets.
method Set Distribution Networks (SDNs) learn set encoder, discriminator, generator, and prior.
result SDNs can reconstruct and generate sets of images with preserved attributes.
Study on cold and freezing sets in digital images.
problem Properties of cold sets in digital images.
method Analysis of properties and relationships between cold and freezing sets.
result Examined relationships between cold and freezing sets.
Paper solves whether zero sets are mapping degree sets.
problem Whether finite sets containing zero are mapping degree sets.
method Examined oriented closed connected manifolds of the same dimension.
result Affirmative answer given for both integer and rational settings.
Matching two different sets of items, called heterogeneous set-to-set matching problem, has recently received attention as a promising problem. The difficulties are to extract features to match a correct pair of different sets and also preserve two types of exchangeability required for set-to-set matching: the pair of …
New set-valued star-shaped risk measures introduced for better risk assessment.
problem Improving risk assessment in financial contexts.
method Developed new set-valued star-shaped risk measures and proved their representation theorems.
result Set-valued star-shaped risk measures can be represented as unions of set-valued convex risk measures.
We introduce the concept of hereditarily non uniformly perfect sets, compact sets for which no compact subset is uniformly perfect, and compare them with the following: Hausdorff dimension zero sets, logarithmic capacity zero sets, Lebesgue 2-dimensional measure zero sets, and porous sets. In particular, we give an exa…
Study dynamics and topology of flows near non-saddle sets or W-sets.
problem Understanding the dynamics and topology of flows near specific invariant sets.
method Cohomological relations and global properties analysis.
result Dynamical classification of surfaces and robustness of non-saddle-sets.
The study explores mapping degree sets and their properties for manifolds.
problem Understanding the structure and properties of mapping degree sets for manifolds.
method Analyzes the properties of mapping degree sets and their relationships with self-mapping degree sets.
result Not every multiplicative set containing 0,1 is a self-mapping degree set.
Current approaches for predicting sets from feature vectors ignore the unordered nature of sets and suffer from discontinuity issues as a result. We propose a general model for predicting sets that properly respects the structure of sets and avoids this problem. With a single feature vector as input, we show that our m…
This paper studies the geometry of minimum-volume confidence sets for multinomial parameters.
problem Determining if minimum-volume confidence sets for multinomial outcomes are disjoint.
method Enumerating and covering the continuous regions of the exact p-value function to study the geometry of minimum-volume confidence sets.
result The geometry of minimum-volume confidence sets for multinomial parameters is studied, providing insights into their structure and properties.
Consider a general machine learning setting where the output is a set of labels or sequences. This output set is unordered and its size varies with the input. Whereas multi-label classification methods seem a natural first resort, they are not readily applicable to set-valued outputs because of the growth rate of the o…
Deep Sets approximates functions on sets with high-dimensional latent space.
problem Modeling functions of sets (permutation-invariant functions).
method Deep Sets, a method known to be a universal approximator for continuous set functions.
result Deep Sets' universal approximation property is only guaranteed with a sufficiently high-dimensional latent space.
Study online learning with set-valued feedback, showing differences between deterministic and randomized approaches.
problem Online learning with set-valued feedback, where labels are sets rather than single labels.
method Introduced new combinatorial dimensions (Set Littlestone and Measure Shattering) to characterize learnability.
result Characterized deterministic and randomized online learnability, and established bounds for various learning settings.
A stability-based method selects the most desirable conformal prediction set.
problem Selecting the most desirable conformal prediction set from multiple valid sets invalidates coverage guarantees.
method A stability-based approach that ensures coverage for the selected prediction set.
result The stability-based approach maintains coverage guarantees for the selected prediction set.
The paper links set cuspidality to function regularity and flatness.
problem Linking set cuspidality to function regularity and flatness.
method Analyzes arc-smooth functions and their properties on various sets.
result Establishes a precise link between set cuspidality and function regularity.
This work establishes properties on diffeological structures for set-valued maps and measures.
problem Establish rigorous properties on diffeological structures for set-valued maps and measures.
method Using diffeologies, the authors link various structures including set-valued maps, relations, gradients, measures, and shape analysis.
result Established rigorous properties on sample diffeologies.
Causal Set Theory's Hauptvermutung is resolved in two ways, one of which is true.
problem Formulating and resolving the Hauptvermutung in Causal Set Theory.
method Two mathematically well-defined formulations of the Hauptvermutung, one of which is true.
result The Hauptvermutung is true when finite sets are replaced by countable sets.
This letter introduces an abstract learning problem called the "set embedding": The objective is to map sets into probability distributions so as to lose less information. We relate set union and intersection operations with corresponding interpolations of probability distributions. We also demonstrate a preliminary so…
Find limiting sets for digital cones and suspensions.
problem Digital topology cone and suspension constructions.
method Identify (m, n)-limiting sets, especially (0, 0)-freezing sets.
result Discover (0, 0)-limiting sets for digital cones and suspensions.