Curves converge to circles under length constraints.
problem Understanding curve convergence under length constraints.
method Length-constrained curve diffusion to analyze curve behavior over time.
result Curves converge to circles in infinite time with exponential convergence.
The paper studies stability of discrete planar curves using variational methods.
problem Stability of discrete planar curves under area constraints.
method Unified interpretation of discrete curvatures, determination of equilibrium curves, stability analysis.
result Equilibrium curves for the length functional under area-constraint conditions are determined and their stability is studied.
New method simplifies ideal curve flow with length constraint.
problem Analyzing ideal curve flow with length constraint.
method Introduced length constraint to simplify sixth order curvature flow.
result Flow exists for all time and converges to a round circle.
Critical trajectories in a sphere are found for a specific bending functional.
problem Finding closed trajectories in a sphere for a specific bending functional.
method Existence of infinitely many closed trajectories shown for a given Lagrange multiplier.
result Existence of closed trajectories dependent on a pair of relatively prime natural numbers.
The paper studies how curves evolve under area constraints and converges to a critical point.
problem Evolution of plane curves with fixed area under elastic energy gradient.
method Local and global existence of the flow, simplicity assumption, Łojasiewicz--Simon inequality.
result The evolving curve's length remains bounded and converges to a critical point.
The paper provides a theoretical justification for using stable SSM blocks in deep sequential models.
problem Developing generalization bounds for deep sequential models with varying sequence lengths.
method Using Rademacher contraction and stability constraints, the paper derives a PAC bound that is independent of sequence length.
result The derived PAC bound decreases as the stability of SSM blocks increases, providing theoretical justification for their use.
Algorithm minimizes loss and constraint violations in online convex optimization with smooth penalties.
problem Minimizing loss and constraint violations in online convex optimization with smooth penalties.
method Projected gradient descent over a set around the current action.
result Both dynamic regret and constraint violation are bounded by the path-length.
The paper solves the isoperimetric problem in Riemannian optical geometry, proving circles minimize lengths with area constraints.
problem Optical geometry of static spherically symmetric spacetimes.
method Applying isoperimetric problem results to curves in Riemannian optical geometry.
result Length-minimizing curves with area constraints are circles, with implications for photon spheres.
Study of closed trajectories in hyperbolic plane with specific curvature constraints.
problem Critical trajectories in hyperbolic plane for a specific energy function.
method Classification of critical trajectories based on momentum causal character, proof of existence of closed trajectories.
result Existence of countably many closed trajectories with time-like momentum.
Analyticity of critical points for O'Hara's knot energies proved.
problem Analyzing the regularity of critical points for O'Hara's knot energies.
method Cauchy's method of majorants and a Möbius energy-inspired gradient decomposition.
result Smooth critical points of O'Hara's knot energies are analytic.
Critical nets in k-space have bounded edge lengths and vertices.
problem Understanding the structure and constraints of critical nets in k-dimensional space.
method Analyzing the properties of critical nets under fixed leaf positions and constraints.
result The total length of edges not incident with 1-valent vertices is bounded, and the degree and number of vertices are also bounded.
This paper constructs PH spline curves with prescribed arc lengths.
problem Interpolating points, tangent directions, and curvatures with prescribed arc-length.
method Local construction of G 2 G^2 G 2 planar PH biarc curves of degree 7. result Prescribed arc-length can be satisfied for any data and any chosen ratio between boundary tangents.
Study on buckling of cylindrical shells using elastic energy scaling.
problem Buckling behavior of cylindrical shells under compression.
method Scaling analysis and solution of an obstacle problem for minimal elastic energy.
result Explicit bifurcation point between compression and buckling determined.
New algorithm reduces costs and latency for large language model inference.
problem Optimizing inference costs and latency for large language models with GPU constraints.
method Formulated as an online scheduling problem with endogenous memory growth, introduced fluid model and WAIT algorithms.
result Reduced costs and latency, especially in near-overloaded and overloaded regimes.
Study finds knots with ideal length need not have smallest volume.
problem Tackles the conjecture that ideal knot length equals smallest volume.
method Measures convex hull volume of knots during length annealing.
result Identifies knots with non-ideal global minimum volume.
A new objective function for NMF reduces model complexity and improves accuracy.
problem NMF's error-based objective function can lead to overly complex models.
method MDL-NMF uses minimum description length to balance model complexity and accuracy.
result MDL-NMF outperforms traditional NMF on various datasets.
After having given the general variational formula for the functionals indicated in the title, the critical points of the integral of the equi-affine curvature under area constraint and the critical points of the full-affine arc-length are studied in greater detail.
Study shows curvature constraints force submanifolds to have specific topology or geometry.
problem Curvature constraints on submanifolds in nonnegative curvature spaces.
method Investigates submanifolds with lower bounds on sectional curvature and mean curvature.
result Curvature constraints force submanifolds to have specific topology or geometry.
Bayesian model predicts crack evolution on rails with uncertainties.
problem Predicting crack evolution on railways due to complex interactions and uncertainties.
method Robust Bayesian multi-horizon approach with constraints.
result Trade-off between prediction accuracy and constraint compliance.
Computes volumes of metric maps on surfaces, linking to Weil-Petersson volumes.
problem Computing volumes of specific metric maps on surfaces.
method Using recent results on discrete maps with irreducibility constraints, computes volumes as homogeneous polynomials.
result Identifies volumes as homogeneous polynomials and satisfies string and dilaton equations.
Study on elastic curves with variable stiffness, derived from bending energy.
problem Modeling elastic wires with varying thickness.
method Derive Euler-Lagrange equations for curves with variable bending stiffness.
result Characterizations of elastic curves with variable stiffness.
Paper approximates fractional harmonic maps with numerical methods.
problem Approximating fractional harmonic maps with constraints and nonlocality.
method Weak compactness results and numerical methods for various PDEs.
result Convergence of numerical approximations for fractional harmonic maps.
The paper establishes bounds on the lengths of geodesics on manifolds with curvature constraints.
problem Finding bounds on the lengths of geodesics on manifolds with curvature constraints.
method Using rational functions and homotopy theory, the paper establishes bounds on the lengths of geodesics.
result There exist at least m geodesics connecting p and q of length at most m*exp(c*exp(G(n,k,v,D))).
New algorithms optimize actions under time-varying constraints without projecting.
problem Optimizing actions under time-varying constraints without projecting.
method Projection-free algorithms using linear optimization oracle.
result Guaranteed i l d e O ( T 3 / 4 ) ilde{O}(T^{3/4}) i l d e O ( T 3/4 ) regret and O ( T 7 / 8 ) O(T^{7/8}) O ( T 7/8 ) constraints violation. Random groups prove length constraints on product of conjugates.
problem Quantify products of conjugates in random groups.
method Sharp van Kampen diagram argument and boundary block-counting.
result Prove a sharp inequality for products of conjugates in random groups.
New unknots with geometric constraints exist, proving a long-standing conjecture.
problem Existence of distinct isotopy classes of physical unknots with geometric constraints.
method Parametrised thickness and geometric thresholds to fragment isotopy classes.
result Existence of gordian unknots with prescribed geometric constraints.
The ropelength problem asks for the minimum-length configuration of a knotted diameter-one tube embedded in Euclidean three-space. The core curve of such a tube is called a tight knot, and its length is a knot invariant measuring complexity. In terms of the core curve, the thickness constraint has two parts: an upper b…
Representation learning of pedestrian trajectories transforms variable-length timestamp-coordinate tuples of a trajectory into a fixed-length vector representation that summarizes spatiotemporal characteristics. It is a crucial technique to connect feature-based data mining with trajectory data. Trajectory representati…
Symmetric TSP is structurally equivalent to a constrained Group Steiner Tree Problem.
problem Finding the shortest tour in a symmetric TSP.
method Structural equivalence between symmetric TSP and constrained Group Steiner Tree Problem.
result Maximizing net weight in the cGSTP is equivalent to minimizing the TSP tour length.
Exploiting a relationship between closed geodesics on a generic closed hyperbolic surface S and a certain unipotent flow on the product space T_1(S) x T_1(S), we obtain a local asymptotic equidistribution result for long closed geodesics on S. Applications include asymptotic estimates for the number of pants immersions…
Study explains Zipf's law using geometric mechanisms from a finite alphabet.
problem Explains Zipf's law in language without relying on linguistic elements.
method Uses the Full Combinatorial Word Model (FCWM) to generate geometric distributions of word lengths.
result Supports predictions of power-law rank-frequency curves, matching various languages.
Estimates KVol on surfaces with geometric constraints.
problem Determining the intersection of closed curves on translation surfaces.
method Geometric constraints on angles and indentifications of sides.
result Sharp estimate for KVol on Bouw-Möller surfaces with a unique singularity.
Curve diffusion flow straightens curves with endpoints on intersecting lines.
problem Straightening open curves with endpoints on intersecting lines.
method Curve diffusion flow with mixed boundary conditions.
result The curve converges to a circular arc of the same length.
We present new computations of approximately length-minimizing polygons with fixed thickness. These curves model the centerlines of "tight" knotted tubes with minimal length and fixed circular cross-section. Our curves approximately minimize the ropelength (or quotient of length and thickness) for polygons in their kno…
The width w w w of a curve γ γ γ in Euclidean space R n R^n R n is the infimum of the distances between all pairs of parallel hyperplanes which bound γ γ γ , while its inradius r r r is the supremum of the radii of all spheres which are contained in the convex hull of γ γ γ and are disjoint from γ γ γ . We use a mixture of topological and…
Dual decomposition provides a tractable framework for designing algorithms for finding the most probable (MAP) configuration in graphical models. However, for many real-world inference problems, the typical decomposition has a large integrality gap, due to frustrated cycles. One way to tighten the relaxation is to intr…
Recurrent Neural Networks (RNNS) are now widely used on sequence generation tasks due to their ability to learn long-range dependencies and to generate sequences of arbitrary length. However, their left-to-right generation procedure only allows a limited control from a potential user which makes them unsuitable for int…
Extended Möbius energy formula for generalized O'Hara's energies.
problem Maintaining Möbius invariance in O'Hara's energies.
method Extended cosine formula for generalized O'Hara's energies.
result Condition for right circle minimization under length-constraint.
New algorithm tackles dynamic assortment optimization with knapsack constraints.
problem Optimizing retailer's assortment decisions under resource constraints with multi-nomial choice modeling.
method Epoch-based re-solving algorithm that transforms MNL's fractional structure into a linear program with slack variables.
result Regret scales logarithmically with time horizon and resource capacities.
Lengths of simple closed geodesics on hyperbolic surfaces in prescribed homology classes
problem Estimating the number of simple closed geodesics of a fixed length and homology class on a hyperbolic surface
method Using asymptotic formulas and numerical evidence
result Proving an asymptotic lower bound for the number of such geodesics
Paper improves COCO problem, reducing constraint violation at the cost of slightly more regret.
problem Online Convex Optimization with adversarial constraints.
method Proposes new policies that trade off regret for reduced constraint violation.
result Achieves i l d e O ( d T + T β ) ilde{O}(\sqrt{dT}+ T^β) i l d e O ( d T + T β ) regret and i l d e O ( d T 1 − β ) ilde{O}(dT^{1-β}) i l d e O ( d T 1 − β ) CCV. Optimal control problems on Riemannian manifolds are solved by penalizing constraint violations.
problem Optimal control problems with velocity constraints on Riemannian manifolds.
method Penalizing constraint violations and showing convergence to hard-constrained solutions.
result Solutions to soft-constrained problems converge to solutions of hard-constrained problems as penalty parameter increases.
Fixed angles of convex polygons lead to combinatorially rich polytopes.
problem Understanding the structure of convex polygons with fixed vertex angles.
method Combining combinatorial and geometric approaches, including dual polytopes and Schwarz-Christoffel maps.
result Fixed-angles polytopes are dual to cyclic polytopes under certain conditions.
We study the problem of finding strain-minimising stream surfaces in a divergence-free vector field. These surfaces are generated by motions of seed curves that propagate through the field in a strain minimising manner, i.e., they move without stretching or shrinking, preserving the length of their arbitrary arc. In ge…
Stability of branched immersions with energy constraints.
problem Stability of branched Willmore immersions with bounded energy.
method Refined analysis of fourth-order differential operators with regular singularities.
result Sum of Morse index and nullity is lower semi-continuous.
BOSS optimizes string inputs using string kernels and genetic algorithms.
problem Optimizing string inputs with constraints.
method Bayesian optimization over string kernels and genetic algorithms.
result Significantly improved optimization across various string constraints.
The paper improves transformer generalization bounds using rank-dependent covering number bounds.
problem Improving generalization bounds for transformers.
method Introducing rank-dependent covering number bounds for linear function classes and applying them to transformers.
result Generalization error bounds for transformers decay as O ( 1 / n ) O(1/\sqrt{n}) O ( 1/ n ) and O ( log r w ) O(\log r_w) O ( log r w ) , improving existing bounds. The paper finds the unique minimizer of area for hyperbolic bodies with curvature constraints.
problem Finding the unique minimizer of area for hyperbolic bodies with curvature constraints.
method Introduced the concept of 'thick λ λ λ -sausage' bodies and used extra assumption of thickness to handle non-convex inner parallel bodies. result The thick λ λ λ -sausage body is the unique minimizer of area among all bodies with a given length and curvature constraints.