In this paper we show that there are two symplectic surfaces in the 4-ball which bound the same transverse knot, have the same topology (as abstract surfaces), and are distinguished by the fundamental groups of their complements.
The paper studies Sasaki-Ricci solitons on Sasakian manifolds up to seven dimensions.
problem Characterizing Sasaki-Ricci solitons on Sasakian manifolds of up to seven dimensions.
method Analysis of the Sasaki-Ricci flow and convergence to solitons.
result Existence and classification of Sasaki-Ricci solitons on Sasakian manifolds up to seven dimensions.
Every 4-dimensional infrasolvmanifold M with β1(M;Q)>0 or which is flat or has one of the geometries Nil4, Solm,n4, or Sol04 bounds. However there are non-orientable Sol14-manifolds which do not bound. The question remains open for $\mathbb{N}il^3\times…
We show that if K is a fibered ribbon knot in S3=∂B4 bounding a ribbon disk D, then given an extra transversality condition the fibration on S3∖ν(K) extends to a fibration of B4∖ν(D). This partially answers a question of Casson and Gordon. In particular, we show the fibration alway…
Researchers compute bounds and formulas for non-orientable 4-genus of torus knots.
problem Measuring the minimum genus of non-orientable surfaces bounded by torus knots.
method Computed bounds and provided a generalized formula for non-orientable 4-genus of torus knots.
result Computed bounds and a generalized formula for non-orientable 4-genus of torus knots.
The paper explores the genus of surfaces in complex projective spaces and improves minimal genus bounds.
problem Investigating the genus of surfaces in complex projective spaces.
method Analyzing knots and torus knots in CP2 and CP2#CP2. result The CP2-genus of knots is unbounded, unlike its topological counterpart. The nonorientable four-ball genus of a knot K is the smallest first Betti number of any smoothly embedded, nonorientable surface F in B^4 bounding K. In contrast to the orientable four-ball genus, which is bounded below by the Murasugi signature, the Ozsvath-Szabo tau-invariant, the Rasmussen s-invariant, the best lowe…
SGD achieves a O(ε−4) bound for minimizing gradient norm of smooth functions.
problem Finding stationary points with SGD for gradient norm minimization.
method Stochastic Gradient Descent (SGD) for smooth, possibly nonconvex functions.
result The O(ε−4) bound for gradient norm minimization cannot be improved upon. It is known that for coprime integers p>q≥1, the lens space L(p2,pq−1) bounds a rational ball, Bp,q, arising as the 2-fold branched cover of a (smooth) slice disk in B4 bounding the associated 2-bridge knot. Lekilli and Maydanskiy give handle decompositions for each Bp,q. Whereas, Yamada gives an …
Suppose k centers are fit to m points by heuristically minimizing the k-means cost; what is the corresponding fit over the source distribution? This question is resolved here for distributions with p≥4 bounded moments; in particular, the difference between the sample cost and distribution cost decays with $…
New bounds on nonorientable four-ball genus for torus knots.
problem Finding bounds on the nonorientable four-ball genus of torus knots.
method Combining knot Floer homology techniques to derive lower bounds.
result Sharp bounds for several families of torus knots, including T4n,(2n±1)2. The paper shows convergence of Sasaki-Ricci flow on Sasakian 5-manifolds.
problem Analyzing convergence of Sasaki-Ricci flow on Sasakian manifolds.
method Uniform L^4-bound of transverse Ricci curvature, application of normalized Sasaki-Ricci flow.
result Solutions converge to unique singular Sasaki η-Einstein metric.
Rectified flows achieve optimal sample complexity for generating data.
problem Generating high-quality data samples efficiently.
method Rectified flows constrain transport trajectories to be linear, enabling efficient sampling.
result Achieve sample complexity of ildeO(ε−2), matching optimal rate for mean estimation. Combining diffusion models with Langevin dynamics improves posterior sampling efficiency.
problem Sampling from noisy posterior distributions efficiently.
method Annealed Langevin dynamics combined with diffusion models.
result Achieves posterior sampling in polynomial time with a weaker score error bound.
Paper formalizes Simon's satisficing through FFSD, proving its equivalence to expected utility theory.
problem Formalizing Herbert Simon's bounded rationality concept in economic decision-making.
method Developed FFSD framework using Lean 4 theorem prover, proving equivalence to expected utility theory.
result Equivalence theorem linking FFSD to expected utility maximization for approximate indicator functions.
Ribbon tangles are proper embeddings of tori and cylinders in the 4-ball~B4, "bounding" 3-manifolds with only ribbon disks as singularities. We construct an Alexander invariant A of ribbon tangles equipped with a representation of the fundamental group of their exterior in a free abelian group G. Th…
The paper proves the existence of Sasaki-Einstein metrics on specific Sasakian manifolds.
problem Proving the existence of conic Sasaki-Einstein metrics on log Fano Sasakian manifolds of dimension five.
method Deriving uniform L^{4}-bounds and analyzing the conic Sasaki-Ricci flow.
result Existence of conic Sasaki-Einstein metrics on log Fano Sasakian manifolds of dimension five.
Let (M,g) be a two-dimensional compact boundaryless Riemannian manifold with nonpostive curvature, then we shall give improved estimates for the L2-norms of the restrictions of eigenfunctions to unit-length geodesics, compared to the general results of Burq, Gérard and Tzvetkov \cite{burq}. By earlier results of B…
The study bounds the excess of disjoint nonorientable surfaces in a 4-manifold.
problem Bounding the excess of disjoint nonorientable surfaces in a 4-manifold.
method Combining tubing construction with signature and Euler-characteristic formulas for 2-fold branched covers.
result The normal-Euler excess is bounded by a constant depending only on the ambient 4-manifold.
Study shows offline RL under Q⋆-approximation and partial coverage is harder than previously thought.
problem Theoretical limits of offline reinforcement learning under Q⋆-approximation and partial coverage. method Introduced a decision-estimation framework to decompose offline RL complexity into decision and value estimation errors.
result Answered the open question by proving sample inefficiency under partial coverage is not guaranteed by Q⋆-realizability and Bellman completeness.