The radar experiment connects the geometry of spacetime with an observers measurement of spatial length. We investigate the radar experiment on Finsler spacetimes which leads to a general definition of radar orthogonality and radar length. The directions radar orthogonal to an observer form the spatial equal time surfa…
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,695 papers · 148 categories
Trend · papers per month
48 results for “orthogonal lengths”
Study geodesics on flat tori, focusing on orthogonal lengths and their distribution.
problem Properties of geodesics on flat tori and their lengths.
method Fine study of dynamical correlation function and anisotropic Sobolev spaces.
result Properties of the length distribution and singularities of its Fourier transform.
The paper finds an upper limit for the length of geodesic chords on Riemannian manifolds.
problem Finding the maximum length of geodesic chords on Riemannian manifolds.
method Establishing an upper bound for geodesic chord length using geometric bounds on the manifold.
result An upper bound for the length of geodesic chords is derived, with a specific example for 2-dimensional spheres.
3D spheres can't be swept by short curves, complicating geodesic length estimates.
problem Obstructing geodesic length estimates in 3D spheres.
method Constructing specific 3D spheres with controlled diameter and volume.
result Min-max methods for geodesic lengths fail for certain 3D spheres.
The study finds at least two short, simple geodesic chords on a disk with convex boundary.
problem Existence of short, simple geodesic chords on a 2-disk with convex boundary.
method Proof of existence using Riemannian geometry and bounds on lengths.
result Existence of at least two short, simple orthogonal geodesic chords on a 2-disk with convex boundary.
Transformers learn to recall with non-orthogonal embeddings in realistic settings.
problem Understanding how transformers store and retrieve knowledge in practical scenarios.
method Analyzing a single-layer transformer with random embeddings trained on a token-retrieval task.
result Explicit formulas for the model's storage capacity reveal a multiplicative dependence on sample size, embedding dimension, and sequence length.
Study shows how lengths of geodesic arcs determine linking number of Legendrian knots.
problem Linking number of Legendrian knots on negatively curved surfaces.
method Analyzes Poincaré series on negatively curved surfaces.
result Explicit rational value of Poincaré series at 0 interprets linking number of Legendrian knots.
Optimizes embedding accuracy for data variance and error.
problem Efficiently embedding data while minimizing distortion.
method Uses Johnson-Lindenstrauss embeddings with orthogonal matrices and singular-value latent variables.
result Achieves best accuracy in variance, mean-squared error, and length distortion.
Lectures on Minimal Surfacesmath.DG
Some elementary considerations are presented concerning Catenoids and their stability, separable minimal hypersurfaces, minimal surfaces obtainable by rotating shapes, determinantal varieties, minimal tori in S3, the minimality in Rnk of the ordered set of k orthogonal equal-length n-vectors, and U(1)-invariant minimal…
The study constructs a Lorentzian length space and explores its properties and relationships with metric and causal geometry.
problem Understanding the relationship between metric and causal geometry in Lorentzian spaces.
method Constructing a Lorentzian length space with an orthogonal splitting on a product of an interval and a metric space, and using synthetic time-like Ricci curvature bounds.
result Established sufficient conditions for global hyperbolicity and formulated time-like Ricci curvature bounds without push-up and regularity assumptions.
Harmonic functions of two variables are exactly those that admit a conjugate, namely a function whose gradient has the same length and is everywhere orthogonal to the gradient of the original function. We show that there are also partial differential equations controlling the functions of three variables that admit a c…
We introduce a new geometric flow called the chord shortening flow which is the negative gradient flow for the length functional on the space of chords with end points lying on a fixed submanifold in Euclidean space. As an application, we give a simplified proof of a classical theorem of Lusternik and Schnirelmann (and…
Study shows RFRR's effectiveness with nearly orthogonal data in overparameterized settings.
problem Understanding the effectiveness of random feature regression with nearly orthogonal data.
method Investigates RFRR with nearly orthogonal deterministic unit-length input data vectors in the overparameterized regime.
result Shows high-probability non-asymptotic concentration results for RFRR's training, cross-validation, and generalization errors.
OSA overcomes instability in skipless Transformers.
problem Instability in skipless Transformers using Softmax Self-Attention.
method OSA parametrizes attention matrix to be orthogonal via skew-symmetric matrix exponential.
result OSA allows for training non-causal Transformers without skip connections and normalisation layers.
The --modulus of a foliation on a Riemannian manifold is a generalization of extremal length of plane curves introduced by L. Ahlfors. We study the variation of the modulus. In particular, we consider product of moduli of orthogonal fo…
We adapt the Newman-Penrose formalism in general relativity to the setting of three-dimensional Riemannian geometry, and prove the following results. Given a Riemannian 3-manifold without boundary and a smooth unit vector field with geodesic flow, if an integral curve of is hypersurf…
Study geodesics on flat tori, focusing on convex bodies.
problem Analyze geodesics orthogonal to convex subsets on flat tori.
method Define anisotropic Sobolev spaces and study properties of geodesics.
result Compute residues of geometric Epstein function in terms of intrinsic volumes.
Given a compact boundaryless Riemannian manifold on which a compact Lie group acts, there is always a metric on such that the action is by isometries. Assuming is equipped with such a metric, recall that the -invariant Laplacian is the restriction of the ordinary Laplacian to the space of functions w…
The study finds resonance points in polarised curves with polynomial conserved quantities.
problem Finding resonance points in polarised curves with polynomial conserved quantities.
method Using the non-orthogonality assumption on the conserved quantity, the study deduces the existence of resonance points.
result Every finite type polarised curve in the conformal 2-sphere with a polynomial conserved quantity admits a resonance point.
We study a relative trace formula for a compact Riemann surface with respect to a closed geodesic . This can be expressed as a relation between the period spectrum and the ortholength spectrum of . This provides a new proof of asymptotic results for both the periods of Laplacian eigenforms along as well estim…
For positive integers and let be the projective indefinite special-orthogonal group of signature . We study counting problems in the Riemannian symmetric space of and in the pseudo-Riemannian hyperbolic space . Let be a totally geodesic …
New algorithm finds sparse matrices on Stiefel manifold for optimisation.
problem Finding sparse matrices on Stiefel manifold for optimisation.
method Modified Orthogonal Iteration algorithm for sparse global optimality.
result Proposed method finds globally optimal sparse Stiefel matrices.
Study finds geodesic networks for surfaces with convex boundary.
problem Finding geodesic networks for surfaces with convex boundary.
method Investigates free boundary geodesic networks in surfaces with non-negative sectional curvature and convex boundary.
result Existence of a geodesic network realizing the first width of a surface with non-negative sectional curvature and strictly convex boundary.
Given a complex structure on a real (finite or infinite dimensional) Hilbert space , we study the geometry of the Lagrangian Grassmannian of , i.e. the set of closed linear subspaces such that The complex unitary group , consisting of the elements of the orthogona…
In this paper results from the differential geometry of curves are extended from normed planes to gauge planes which are obtained by neglecting the symmetry axiom. Based on the gauge analogue of the notion of Birkhoff orthogonality from Banach space theory, we study all curvature types of curves in gauge planes, thus g…
New proof finds three divergence-free vector fields for any 3D manifold.
problem Proving the existence of divergence-free vector fields on 3D manifolds.
method Using geometric properties of eigenspinors in three dimensions.
result Found three divergence-free vector fields that are orthogonal and have the same length at every point.
Study smooth linear statistics on random covers of hyperbolic surfaces, showing central limit and variance results.
problem Analyzing fluctuations and energy variance of random covers of compact hyperbolic surfaces.
method Examining fluctuations in a small energy window around a fixed energy level, considering the variance of a typical surface, using a double limit where and go to infinity.
result Distribution of fluctuations tends to a Gaussian with variance of GOE/GUE, and energy variance of a typical random -cover is that of GOE/GUE.
The study extends Jacobi-orthogonality to indefinite scalar product spaces.
problem Generalizing Jacobi-orthogonality to indefinite scalar product spaces.
method Comparing principles, investigating tensor relations, proving properties.
result Every quasi-Clifford tensor is Jacobi-orthogonal; certain tensors are Jacobi-dual or Osserman.
New characterization of Osserman tensors using Jacobi-orthogonality.
problem Characterizing Osserman tensors.
method Introducing Jacobi-orthogonality as a new potential characterization.
result Jacobi-orthogonal tensors are Osserman, and all known Osserman tensors are Jacobi-orthogonal.
Study isotropy groups for complex orthogonal and skew-symmetric matrices.
problem Understanding isotropy subgroups of orthogonal similarity transformations.
method Analysis of group structure of nonsingular block matrices.
result Group structure of isotropy subgroups related to block Toeplitz matrices.
Zoll manifolds with boundarymath.DG
Study Zoll manifolds with boundary, showing unique geodesic properties.
problem Characterize Zoll manifolds with boundary.
method Analyzing geodesics, boundary conditions, and manifold structure.
result All free boundary geodesics have the same length and Morse index.
New findings on Kähler manifolds restrict orthogonal coordinates existence.
problem Existence of orthogonal coordinates on Kähler manifolds.
method Algebraic and geometric techniques applied to Kähler manifolds.
result No nontrivial self-dual Kähler 4-manifolds or Ricci-flat Kähler 4-manifolds support orthogonal coordinates.
Constructs orthogonal coordinates in curved spaces.
problem Separating variables in curved spaces.
method Explicit construction of orthogonal coordinates and transformations.
result Explicit formulas for Killing tensors and Stäckel matrices.
OPT framework improves neural network generalization by learning an orthogonal transformation.
problem Improving neural network generalization.
method Orthogonal over-parameterized training (OPT) framework that minimizes hyperspherical energy.
result OPT framework provably minimizes hyperspherical energy and improves empirical generalization.
The paper studies surfaces in a bounded domain with orthogonal boundaries and proves curvature estimates.
problem Estimating the area of surfaces with orthogonal boundaries in a bounded domain.
method Weak formulation of orthogonality for curvature varifolds, classification of vanishing curvature varifolds.
result Existence of an orthogonal 2-varifold that minimizes curvature in the integer rectifiable class.
Non-transitive subgroups of the orthogonal group play an important role in the non-Euclidean geometry. If is a closed subgroup in the orthogonal group such that the orbit of a single Euclidean unit vector does not cover the (Euclidean) unit sphere centered at the origin then there always exists a non-Euclidean Mink…
Orthogonal random features approximate a Bessel kernel, offering sharper bounds than random Fourier features.
problem Approximating Gaussian kernel efficiently for large datasets.
method Use of Haar orthogonal matrices to construct orthogonal random features and analyze their bias and variance.
result Orthogonal random features approximate a Bessel kernel, not the Gaussian kernel, with sharper bounds.
Injectivity radius on Stiefel manifold is π.
problem Determining the injectivity radius of the compact Stiefel manifold.
method Utilized the property of geodesics being space curves of constant Frenet curvatures.
result The injectivity radius on the Stiefel manifold under the Euclidean metric is π.
Proposes FOAGP for efficient orthogonal effect decomposition of black-box computer experiments.
problem Challenges in sensitivity analysis of black-box computer experiments with complex, nonlinear functional outputs.
method Functional-output orthogonal additive Gaussian process (FOAGP) with conditional orthogonality constraint.
result Demonstrates effectiveness in orthogonal effect decomposition and variance decomposition through simulations and real-world application.
Novel prior for orthogonal functions improves functional component estimation.
problem Improving orthogonality in functional principal component analysis.
method Sequential adaptive priors for orthogonal functions using hierarchical conditionally normal distributions.
result Proposed prior leads to nearly orthogonal posterior estimates.
New model explains how concepts grow based on experience.
problem Existing models assume fixed representation; new model allows for growth.
method Geometric framework with MDL criterion for basis extension.
result Conceptual growth is selective and conservative, exposing or amplifying residual error.
Stabilization technique applied to curve shortening flow in 3D space.
problem Stabilizing curve shortening flow in 3D space.
method Applying stabilization technique developed by T. Zelenyak to curve shortening flow in .
result Derivation of several new monotonicity formulas for curve shortening flow.
Method constructs orthogonal curvilinear coordinates in constant curvature spaces.
problem Creating orthogonal coordinates in spaces of constant curvature.
method Modification of Krichever's method for Euclidean space, applied to constant curvature spaces.
result Examples of orthogonal coordinate systems on the sphere and hyperbolic plane constructed.
We study the Chern-Simons partition function of orthogonal quantum group invariants, and propose a new orthogonal Labastida-Mariño-Ooguri-Vafa conjecture as well as degree conjecture for free energy associated to the orthogonal Chern-Simons partition function. We prove the degree conjecture and some interesting cases o…
A Clifford algebra model for M"obius geometry is presented. The notion of Ribaucour pairs of orthogonal systems in arbitrary dimensions is introduced, and the structure equations for adapted frames are derived. These equations are discretized and the geometry of the occuring discrete nets and sphere congruences is disc…
DONUT improves treatment effect estimation by enforcing orthogonality constraints.
problem Estimating treatment effects from observational data is challenging due to unobserved outcomes.
method DONUT uses a regularization framework that formalizes unconfoundedness as orthogonality, leading to deep orthogonal networks.
result DONUT outperforms state-of-the-art methods in estimating average treatment effects.
New convergence guarantees for learning with unknown nuisance parameters.
problem Learning problems with unknown nuisance parameters.
method Stochastic gradient optimization with Neyman orthogonality and approximately orthogonalized updates.
result Stochastic gradient algorithms can converge under conditions of nuisance parameters.
MuonEq improves training of matrix-valued parameters by rebalancing momentum before orthogonalization.
problem Training matrix-valued parameters with orthogonalized-update optimizers like Muon.
method MuonEq introduces three lightweight pre-orthogonalization equilibration schemes: two-sided row/column normalization (RC), row normalization (R), and column normalization (C).
result Row/column normalization acts as a zeroth-order surrogate for whitening and improves the geometry seen by orthogonalization.