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.
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.
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.
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.
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.
Square inscribed in a curve made of two graph functions.
problem Finding inscribed squares in curves formed by graph functions.
method Analysis of spectral invariants of Jordan Floer homology under curve perturbations.
result Existence of inscribed squares in curves with specific Lipschitz constants.
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…
A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in any given convex surface which is sufficiently close to the sphere, then we call …
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.
Extends sphere-rhomb inscribing to more directions.
problem Bounding strictly-convex regions with rhombs inscribed in spheres.
method Combines recent work with earlier results on sphere-rhomb inscribing.
result Extends class of inscribing spheres to more directions.
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.
Study examines Hilbert area of inscribed polygons in projective geometry.
problem Understanding Hilbert area of inscribed polygons in projective geometry.
method Examined correspondence between Fock-Goncharov and Cartesian coordinates, analyzed degeneration and Hilbert area of inscribed quadrilaterals, developed microlocal condition.
result Sequence of strictly convex domains with bounded Hilbert area and divergent Goldman parameters.
Every curve can fit countless rhombuses.
problem Finding many rhombi within any curve.
method No curve regularity assumed.
result Uncountably many rhombi fit every curve.
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 …
A regular n-gon inscribing a knot is a sequence of n points on a knot, such that the distances between adjacent points are all the same. It is shown that any smooth knot is inscribed by a regular n-gon for any n.
Study of discrete Koenigs nets and their properties.
problem Characterization and properties of discrete Koenigs nets.
method Generalization of inscribed conics to inscribed quadrics and study of Koenigs d-grids.
result Established a bijection between Koenigs d-grids and pairs of discrete autoconjugate curves.
New bounds on inscribed triangles in arbitrary planar domains.
problem Finding inscribed triangles in arbitrary planar domains with specific angle constraints.
method Proving the existence of uniformly fat triangles and not-too-fat triangles in bounded open sets.
result Existence of a maximal number Θ (between 0 and 60) for inscribed triangles with angles ≥ Θ degrees.
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.
Derives conformal parameters of curves using inscribed circular polygons.
problem Characterizing conformal invariants of smooth curves in 3D.
method Limiting process with inscribed circular polygons, based on elementary geometry.
result Derives conformal length, curvature, and torsion via a novel method.
Paper generalizes inscribed radius estimate to hyperbolic Einstein manifolds.
problem Bounding inscribed radius in asymptotically hyperbolic Einstein manifolds.
method Generalized inscribed radius estimate to AH Einstein manifolds, combining recent work.
result Rigidity result achieved for upper bound of relative volume.
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.
We prove a sharp estimate for the inscribed radius under certain fully nonlinear curvature flows. This estimate is asymptotically sharp on cylinders.
Smooth knots with odd Conway polynomial terms have inscribed trefoils.
problem Finding inscribed trefoils for smooth knots with specific polynomial terms.
method Using a perturbation of the double-cover of the orientation class and analyzing planar configurations.
result Smooth knots with odd quadratic terms of the Conway polynomial have inscribed trefoils.
Study on volumes of random inscribed polytopes in projective geometries.
problem Estimating volumes of random inscribed polytopes in projective geometries.
method Central limit theorems and normal approximation for volumes and dual volumes of random inscribed polytopes.
result Established central limit theorems and normal approximation for volumes and dual volumes of random inscribed polytopes.
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 convex polyhedra in RP3 with all their vertices on a sphere. We do not require, in particular, that the polyhedra lie in the interior of the sphere, hence the term "weakly inscribed". Such polyhedra can be interpreted as ideal polyhedra, if we regard RP3 as a combinati…
We study convex polyhedra in three-space that are inscribed in a quadric surface. Up to projective transformations, there are three such surfaces: the sphere, the hyperboloid, and the cylinder. Our main result is that a planar graph Γ is realized as the 1-skeleton of a polyhedron inscribed in the hyperboloid or cyl…
Sharp upper bounds on inscribed radius for metric spaces with convex boundary.
problem Bounding inscribed radius in metric measure spaces with convex boundary.
method Proves sharp upper bounds on inscribed radius for subsets with convex boundary.
result Sharp upper bounds on inscribed radius for subsets with convex boundary.
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.
We show that for every positive integer n there is a simple closed curve in the plane (which can be taken infinitely differentiable and convex) which has exactly n inscribed squares.
We consider a family of embedded, mean convex hypersurfaces which evolve by the mean curvature flow. It follows from general results of White that the inscribed radius at each point on the surface is at least Hc, where c is a constant that depends only on the initial data. Andrews recently gave a new proof…
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.
Square can fit inside curves close to smooth ones.
problem Finding inscribed squares in nearly smooth curves.
method Using curvature and a map to relate curves, proving existence of inscribed squares.
result Curves close to smooth ones contain inscribed squares.
Square-like quadrilaterals inscribed in space curves proven for finite total curvature.
problem Square-peg problem in space curves.
method Local curvature analysis and limiting argument on approximating curves.
result Every embedded curve with finite total curvature has an inscribed square-like quadrilateral.
The abstract proves polygon inscriptions in curves with specific edge ratios.
problem Proving the existence of polygons inscribed in Jordan curves with prescribed edge ratios.
method Using the properties of differentiable curves and proportional side lengths.
result Existence of polygons inscribed in Jordan curves with prescribed edge ratios.
The abstract shows how embeddings inscribe trapezoids or map three points to a line, proving nonexistence of certain maps.
problem Proving the nonexistence of affinely 3-regular maps in infinitely many dimensions.
method Elementary proof using embeddings and nonsingular bilinear maps.
result Recovery of nonexistence results for affinely 3-regular maps without complex algebraic techniques.
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.
We find bounds on the difference between the writhing number of a smooth curve, and the writhing number of a polygon inscribed within. The proof is based on an extension of Fuller's difference of writhe formula to the case of polygonal curves. The results establish error bounds useful in the computation of writhe.
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 a recent paper, Brendle proved that the inscribed radius of closed embedded mean convex hypersurfaces moving by mean curvature flow is at least 1/((1+δ)H) at all points with H > C(δ,M_0). In this note, we give a shorter proof of Brendle's estimate, and of a more general result for alpha-Andrews flows, based on our r…
Continuous curves inscribe isosceles trapezoids in complex plane.
problem Proving periodic curves inscribe isosceles trapezoids.
method Lagrangian intersection problem and convergence argument.
result Continuous curves inscribe trapezoids with any similarity type.
Paper studies inscribed sphere and lines through centers of Apollonius spheres in n dimensions.
problem Tangency of spheres and lines through their centers.
method Lie sphere geometry and two-step construction of Apollonius spheres.
result Center of inscribed sphere coincides with point PX. 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…
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.