Formula for interleaving distance of rectangle persistence modules.
problem Calculating distances between rectangle persistence modules.
method Formulas based on rectangle geometry, extended to decomposable modules.
result Closed formulas for interleaving and bottleneck distances.
Paper finds a counterexample showing rectangle condition doesn't detect strong irreducibility.
problem Detecting strong irreducibility from the rectangle condition.
method Constructing a double branched cover of a knot in S^3.
result Found a genus 2 Heegaard splitting that is strongly irreducible but fails rectangle condition.
In this paper, we define the rectangle condition on the bridge sphere for a n-bridge decomposition of a knot whose definition is analogous to the definition of the rectangle condition for Heegaard splittings of 3-manifolds. We show that the satisfaction of the rectangle condition for a n-bridge decomposition can …
Optimal weight windows are symmetric rectangles centered at peak.
problem Finding the best weight windows for weighted least squares.
method Investigated symmetric and tapered rectangle window weights, showing the best rectangle window is optimal.
result The best rectangle window is optimal for all tapered rectangle window definitions.
Curves inscribe rectangles with positive area.
problem Finding angles for inscribing rectangles within Jordan curves.
method Proving existence of a subset of angles with measure at least A/R^2.
result Angles inscribing rectangles have measure at least A/R^2.
Floer homology applied to inscribing rectangles into curves.
problem Determining if a Jordan curve can inscribe a square.
method Constructing Floer homology from inscribed rectangles and using spectral invariants.
result A Jordan curve inscribes a square if its enclosed area exceeds half a circle's area.
The study describes a cell structure for multisets in a rectangle.
problem Understanding the space of multisets in a rectangle.
method Developed a piecewise Euclidean bi-simplicial cell structure.
result Connected to spaces of complex polynomials and permutahedra.
The paper improves bounds on how many squares can fit in a rectangle and still have stable homology.
problem Homological stability in the space direction of square configurations.
method Analyzing the ordered configuration space of squares in a rectangle.
result Most rectangles can be almost entirely filled with squares and still have stable homology.
Rectangles can fit on smooth curves, proving a theorem about Klein bottles.
problem Fitting rectangles on smooth curves.
method Shevchishin's theorem about Klein bottle embeddings.
result Similar rectangles can be placed on smooth Jordan curves.
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 estimate whether there is an embedding from one n-dimensional rectangle into another which expands every k-dimensional area. Our estimate is sharp up to a constant factor in each dimension.
A new ensemble model uses simple hyper-rectangles to improve gradient boosting machine performance.
problem Improving gradient boosting machine performance and avoiding overfitting.
method Proposes a new ensemble model with axis-parallel hyper-rectangles as base models, integrates into GBM, and uses SHAP for interpretation.
result GBM with HRBMs can be an effective and interpretable model for regression and classification problems.
Study on non-orientable surfaces and inscribed rectangles in 4-manifolds.
problem Understanding non-orientable surfaces and their inscribed rectangles.
method Analyzing smooth and locally-flat non-orientable surfaces in 4-ball with specific knots, comparing results.
result Established differences between smooth and locally-flat non-orientable 4-genus of torus knots.
Equal diagonal energies proven on Liouville surfaces.
problem Diagonal energies on Liouville surfaces.
method Analyzing parameter curves and rectangles on Liouville surfaces.
result Diagonal energies are equal in n-dimensional Liouville manifolds.
The paper proves geometric properties of square tables and saddle surfaces.
problem The mathematical table problem from a geometric-topological perspective.
method Geometric-topological proofs on cylinder, saddle surfaces, and level sets of Fenn graphs.
result Zero-existence theorem on a cylinder, proving Fenn's square-table theorem under different boundary conditions.
In this paper we show that for a given 3-manifold and a given Heegaard splitting there are finitely many preferred decomposing systems of 3g−3 disjoint essential disks. These are characterized by a combinatorial criterion which is a slight strengthening of Casson-Gordon's rectangle condition. This is in contrast to…
We give the rectangle condition for strong irreducibility of Heegaard splittings of 3-manifolds with non-empty boundary. We apply this to a generalized Heegaard splitting of a 2-fold covering of S3 branched along a link. The condition implies that any thin meridional level surface in the link complement is incom…
The paper proves that any smooth curve can have two similar inscribed rectangles.
problem Finding two similar inscribed rectangles in a smooth Jordan curve.
method Lagrangian Floer homology and differential topological computation.
result Generic doubling of inscribed rectangles in smooth Jordan curves.
This thesis classifies pseudo-Anosov homeomorphisms using geometric Markov partitions.
problem Classifying pseudo-Anosov homeomorphisms up to topological conjugacy.
method Algorithmic approach using geometric Markov partitions.
result Geometric type is a complete invariant of conjugation.
Study finds a limiting distribution for free path lengths on flat surfaces with circular obstacles.
problem Understanding free path lengths on flat surfaces with circular obstacles.
method Proved the existence of a limiting distribution using radius of obstacles as a parameter.
result Relates the limiting distribution to heights of zippered rectangle decompositions.
We prove that a bounded open set U in Euclidean n-space has k-width less than C(n) Volume(U)^{k/n}. Using this estimate, we give lower bounds for the k-dilation of degree 1 maps between certain domains in Euclidean space. In particular, we estimate the smallest (n-1)-dilation of any degree 1 map between two n-dimension…
We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations, as analyzed by Reading in [5]. Our computations agree with [5] as far as was ca…
We investigate the common underlying discrete structures for various smooth and discrete nets. The main idea is to impose the characteristic properties of the nets not only on elementary quadrilaterals but also on larger parameter rectangles. For discrete planar quadrilateral nets, circular nets, Q∗-nets and conical…
Fast BATLLNN speeds up verification of TLL NNs by 400x.
problem Verifying output constraints for TLL NNs.
method Uses TLL architecture and decoupled box constraints to improve verification performance.
result 400x faster than state-of-the-art verifiers.
Given i.i.d samples from some unknown continuous density on hyper-rectangle [0,1]d, we attempt to learn a piecewise constant function that approximates this underlying density non-parametrically. Our density estimate is defined on a binary split of [0,1]d and built up sequentially according to discrepancy crite…
The paper studies geometric structures of polynomial spaces.
problem Understanding the geometric and combinatorial structures of polynomial spaces.
method Introducing and analyzing finite piecewise Euclidean cell complexes.
result The branched rectangle and annulus complexes are homeomorphic to specific polynomial spaces.
Classifies L-space surgeries on all two-bridge links
problem Classifying L-space surgeries on two-bridge links method Introduces a sufficient diagrammatic condition for links in S3 to be persistently foliar, defines a simplified model for Heegaard Floer homology, and uses Turaev torsions for computations result Determines L-space surgeries in the case of generalised L-space links We prove that any cyclic quadrilateral can be inscribed in any closed convex C1-curve. The smoothness condition is not required if the quadrilateral is a rectangle.
Classifies essential annuli in genus two handlebody-knots, determining hyperbolicity and constructing obstructions.
problem Classifying essential annuli in genus two handlebody-knots.
method Introducing τ- and ρ-tangles and good rectangles, classifying these structures.
result Categorization of atoroidal 3-decomposable genus two handlebody-knots based on essential annuli.
Casson and Gordon gave the rectangle condition for strong irreducibility of Heegaard splittings [1]. We give a parity condition for irreducibility of Heegaard splittings of irreducible manifolds. As an application, we give examples of non-stabilized Heegaard splittings by doing a single Dehn twist.
We prove that for every smooth Jordan curve γ, if X is the set of all r∈[0,1] so that there is an inscribed rectangle in γ of aspect ratio tan(r⋅π/4), then the Lebesgue measure of X is at least 1/3. To do this, we study sets of disjoint homologically nontrivial projective planes smoothly embedde…
ARGEN method improves variable selection and regularization in high-dimensional sparse models.
problem Constrained variable selection and regularization in high-dimensional sparse linear models.
method ARGEN penalty method, variable selection and regularization.
result ARGEN method has variable selection and estimation consistency under certain conditions.
Let R be a compact, connected, orientable surface of genus g with n boundary components with g≥2, n≥0. Let N(R) be the nonseparating curve graph, C(R) be the curve graph and HT(R) be the Hatcher-Thurston graph of R. We prove that if $λ: \mathcal{N}(R) \rightarro…
Approaches for approximating persistent homology for large datasets.
problem Inability to compute persistent homology for large datasets.
method Multiple subsampling framework for statistical approximation of persistent homology.
result Derivation of finite sample convergence rates for empirical means of persistent homology.
Persistence landscapes map persistence diagrams into a function space, which may often be taken to be a Banach space or even a Hilbert space. In the latter case, it is a feature map and there is an associated kernel. The main advantage of this summary is that it allows one to apply tools from statistics and machine lea…
Proposes adaptive ridge regression for functional linear models with piecewise shapes.
problem Functional linear regression with unknown coefficient function.
method Adaptive piecewise function template with L2 penalization. result Improves predictive power and interpretability compared to standard methods.
Proposes deep graph persistence to address neural persistence issues in deep learning.
problem Variance of weights and lack of spatial structure in deep neural networks impact neural persistence.
method Extends neural persistence to the whole network, considering interactions between layers.
result Deep graph persistence alleviates variance-related issues and captures persistent paths through the network.
Paper proves k-means clustering works on persistence diagrams.
problem Complex geometry of persistence diagram space.
method Proves convergence of k-means on persistence diagram space. result Performance of k-means on persistence diagrams and measures is superior. Using zippered rectangle coordinates we parametrize a Poincaré section for horocycle flow on the space of genus 2 translation surfaces with one singular cone point of angle 6π. In addition, we bound the return time under horocycle flow to this Poincaré section by examining a subset of surfaces where a certain sum of …
This paper demonstrates the flaws of co-persistence theory proposed by Bollerslev and Engle (1993) which cause the theory can hardly be applied. With the introduction of the half-life of decay coefficient as the measure of the persistence, and both the weak definition of persistence and co-persistence in variance, this…
Optimizes wavelets for graph classification using spectral wavelet signatures and persistence diagrams.
problem Graph classification with geometric properties encoded in persistence diagrams.
method Optimizes spectral wavelets for graph datasets to capture best-suited features for classification.
result Competitive performance in graph classification problems compared to other persistence-based architectures.
New method for analyzing multiparameter persistence modules from smooth functions.
problem Analyzing multiparameter persistence modules from smooth functions.
method Generalized Morse theory applied to cobordism and Cerf theory.
result Complete description of persistence modules as direct sums of indecomposables.
Develops robust persistence diagrams using kernel methods.
problem Persistence diagrams are sensitive to data perturbations.
method Constructs robust persistence diagrams from superlevel filtrations of robust density estimators using reproducing kernels.
result Robust persistence diagrams are consistent estimators in bottleneck distance.
This paper interprets critical scales in persistent homology for compact metric spaces.
problem Understanding critical scales in persistent homology for general compact metric spaces.
method Analyzing local minima of the distance function and their impact on persistence.
result Each decrease in zero-dimensional persistence and increase in one-dimensional persistence is induced by local minima of the distance function.
We consider the problem of learning a sparse rule model, a prediction model in the form of a sparse linear combination of rules, where a rule is an indicator function defined over a hyper-rectangle in the input space. Since the number of all possible such rules is extremely large, it has been computationally intractabl…
MuRiT efficiently computes multi-parameter persistence barcodes.
problem Efficient computation of multi-parameter persistent homology.
method Vietoris-Rips transformation to reduce multi-parameter to single-parameter computation.
result MuRiT computes pathwise persistence barcodes for multi-filtered flag complexes.
Persistent homology can recognize knotting in curves.
problem Recognizing knotting in curves
method Compute one-dimensional persistent homology, extract cycle representatives, and assign a hypergraph curvature-based score.
result Systematic differences between knotted and unknotted structures are revealed.
This article analyzes the relationship between co-persistence and hedging which indicates co-persistence ratio is just the long-term hedging ratio. The new method of exhaustive search algorithm for deriving co-persistence ratio is derived in the article. And we also develop a new hedging strategy of combining co-persis…