Locus in Research: Definitions & Applications

• Locus is a term describing condition-defined sets or points in diverse fields such as geometry, algebraic geometry, and chromatin mechanics.
• Its applications span equilibrium analysis in dynamical systems, moduli space characterizations, and precise localization in robotics and computer vision.
• Research on locus integrates methods from analytic equations, Jacobi fields, neural descriptor learning, and parameter-space analysis to address complex, multidisciplinary challenges.

“Locus” denotes several distinct technical objects across contemporary research. In geometry and dynamical systems it denotes a set of points or parameters singled out by a defining condition, such as a conjugate locus, a hyperbolic locus, or a locus configuration; in algebraic geometry it denotes closed or locally closed subvarieties in moduli or parameter spaces; in chromatin mechanics it denotes a fixed-size genomic segment; and in several recent systems papers it appears as an acronymic method name, including LoCUS, LOCUS, and Locus (Waters et al., 2022, Terenzi, 23 Mar 2026, Shi et al., 28 Dec 2025, Kloepfer et al., 2023).

1. Geometric and analytic meanings

In the theory of hyperplane arrangements, a central hyperplane arrangement in $\mathbb{C}^2$ with multiplicities is a “locus configuration” when it satisfies a family of locus equations on each hyperplane. Greg Muller showed that the first locus equation is exactly a force-balance equation for a charged trigonometric Calogero–Moser system on $\mathbb{C}^*$, with charges $q_i=m_i(m_i+1)$. When the particles lie on $S^1\subset \mathbb{C}^*$, there is a unique equilibrium up to rotation; for coarsely symmetric multiplicity lists this yields explicit real 2D locus configurations and hence new Schrödinger operators $L=\Delta+u(x)$ with Baker–Akhiezer functions (Muller, 2010).

In Poncelet geometry, the locus is the traced set of a triangle center over a 1-parameter family of interscribed triangles. For confocal pairs and for an outer ellipse with an inner concentric circular caustic, the paper shows that many such loci admit the normalized parametrization

$$F(\lambda)=u\lambda+v\lambda^{-1}+w,\qquad \lambda\in T,$$

which is an ellipse when the center is a fixed affine combination of $X_2$, $X_3$, and a stationary center. In the confocal case, the theory gives explicit criteria for degeneration to a segment, criteria for a circular locus, and the statement that the locus turning number is $\pm 3$; monotonicity fails only in the degenerate case $|u|=|v|$ (Helman et al., 2021).

In convex 3-manifolds, the conjugate locus of a point $\mathbb{C}^*$0 is the set of points $\mathbb{C}^*$1 conjugate to $\mathbb{C}^*$2 along geodesics $\mathbb{C}^*$3. The cited work develops a Jacobi-field-based coordinate system on $\mathbb{C}^*$4, detects conjugate points by the vanishing of the signed area $\mathbb{C}^*$5 swept by a 1-parameter family of orthogonal Jacobi fields, and shows that in 3D the first conjugate locus is organized into two sheets whose singularities are cuspidal edges called ribs. On the quadraxial ellipsoid, each sheet has one closed rib and two partial ribs, and the overlaid sheets share a third closed rib at umbilic directions where $\mathbb{C}^*$6 (Waters et al., 2022).

2. Parameter-space loci in control and cocycle dynamics

In linear systems on Hilbert spaces, the root locus is the family of closed-loop eigenvalue branches for proportional output feedback. For a SISO system $\mathbb{C}^*$7, the closed-loop generator is

$\mathbb{C}^*$8

and the closed-loop eigenvalues satisfy $\mathbb{C}^*$9, equivalently $q_i=m_i(m_i+1)$0. Under the paper’s assumptions—$q_i=m_i(m_i+1)$1 generating a $q_i=m_i(m_i+1)$2-semigroup, discrete spectrum of isolated eigenvalues of finite algebraic multiplicity, and minimality—each branch is well-defined and continuous, branches are simple and non-self-intersecting, and every branch either converges to a transmission zero or escapes to infinity. For collocated self-adjoint generators, poles and zeros are real and interlace; for collocated skew-adjoint generators, poles and zeros lie on the imaginary axis and the closed-loop spectrum moves into the open left half-plane for $q_i=m_i(m_i+1)$3 (Jacob et al., 2014).

For locally constant $q_i=m_i(m_i+1)$4-valued cocycles, the hyperbolic locus $q_i=m_i(m_i+1)$5 consists of uniformly hyperbolic $q_i=m_i(m_i+1)$6-tuples. In the projective picture, Avila–Bochi–Yoccoz’s criterion says that $q_i=m_i(m_i+1)$7 is uniformly hyperbolic if and only if there exists a finite union $q_i=m_i(m_i+1)$8 of open intervals with disjoint closures such that $q_i=m_i(m_i+1)$9 for all $S^1\subset \mathbb{C}^*$0. The paper introduces two further parameter loci: the elliptic locus $S^1\subset \mathbb{C}^*$1, where the generated semigroup contains the identity or an elliptic element, and the semidiscrete and inverse-free locus $S^1\subset \mathbb{C}^*$2, characterized by the existence of a nontrivial closed subset $S^1\subset \mathbb{C}^*$3 mapped strictly inside itself by each generator. It proves that $S^1\subset \mathbb{C}^*$4, that boundary points of non-principal hyperbolic components have finite rank greater than one, and that for $S^1\subset \mathbb{C}^*$5 one has $S^1\subset \mathbb{C}^*$6, answering negatively the question of whether the hyperbolic locus is the complement of the elliptic locus in general (Christodoulou, 2020).

3. Moduli, exceptional, and bounded-regularity loci in algebraic geometry

In the Hilbert scheme $S^1\subset \mathbb{C}^*$7, the locus of points corresponding to subschemes of $S^1\subset \mathbb{C}^*$8 with Castelnuovo–Mumford regularity at most $S^1\subset \mathbb{C}^*$9 is the open subscheme $L=\Delta+u(x)$0. For every $L=\Delta+u(x)$1, it is realized as a locally closed subscheme of the Grassmannian $L=\Delta+u(x)$2, where $L=\Delta+u(x)$3, and the paper describes it by equations of degree $L=\Delta+u(x)$4 together with linear inequalities in Plücker coordinates. The construction uses Borel-fixed ideals, marked bases, and $L=\Delta+u(x)$5-equivariance, and recovers the full Hilbert scheme when $L=\Delta+u(x)$6 equals the Gotzmann number (Ballico et al., 2011).

For plane quartics and moduli of curves, “locus” typically refers to a divisor or codimension-two cycle defined by a special ramification or spin condition. Hu determines an explicit Siegel modular form $L=\Delta+u(x)$7 of weight $L=\Delta+u(x)$8 for $L=\Delta+u(x)$9 whose zero locus on $$F(\lambda)=u\lambda+v\lambda^{-1}+w,\qquad \lambda\in T,$$0 is the locus where the bitangent corresponding to the odd characteristic $$F(\lambda)=u\lambda+v\lambda^{-1}+w,\qquad \lambda\in T,$$1 becomes a hyperflex. This yields the divisor class

$$F(\lambda)=u\lambda+v\lambda^{-1}+w,\qquad \lambda\in T,$$2

in $$F(\lambda)=u\lambda+v\lambda^{-1}+w,\qquad \lambda\in T,$$3, and the paper shows that the locus of banana curves is contained in the closure of the hyperflex locus (Hu, 2015). In low genus, the loci

$$F(\lambda)=u\lambda+v\lambda^{-1}+w,\qquad \lambda\in T,$$4

of hyperelliptic genus-3 curves with a marked Weierstrass point and non-hyperelliptic genus-3 curves with a marked hyperflex are both codimension two, and their closure classes in $$F(\lambda)=u\lambda+v\lambda^{-1}+w,\qquad \lambda\in T,$$5 are computed explicitly. The same paper also computes the class of the genus-4 locus $$F(\lambda)=u\lambda+v\lambda^{-1}+w,\qquad \lambda\in T,$$6 of curves admitting a point $$F(\lambda)=u\lambda+v\lambda^{-1}+w,\qquad \lambda\in T,$$7 with $$F(\lambda)=u\lambda+v\lambda^{-1}+w,\qquad \lambda\in T,$$8 an even theta characteristic (Chen et al., 2015).

In the Tannakian theory of Nori motivic local systems, the exceptional locus is defined by

$$F(\lambda)=u\lambda+v\lambda^{-1}+w,\qquad \lambda\in T,$$9

Here $X_2$0 is the motivic Galois group of the Tannakian subcategory generated by $X_2$1, $X_2$2 is its Artin quotient, and $X_2$3 is the kernel of $X_2$4. The main theorem is a motivic analogue of Cattani–Deligne–Kaplan: if $X_2$5 is not Artin, then $X_2$6 is a countable union of strict closed algebraic subvarieties. The same geometric description holds for the splitting locus $X_2$7 of the motivic weight filtration, and the maximal closed subvarieties are defined over any algebraically closed field of definition for $X_2$8 and $X_2$9, with Galois stability under descent (Terenzi, 23 Mar 2026).

4. Genomic loci and locus-specific chromatin mechanics

In the chromatin-mechanics study, a locus is a fixed-size segment of chromatin represented as a node in a coarse-grained polymer network inferred from contact maps. Two primary resolutions are analyzed: $X_3$0 kb bins in $X_3$1 Mb windows for GM12878, $X_3$2 kb bins for a whole chromosome analysis, and $X_3$3 bp bins in an mESC Region Capture Micro-C region. The structural ensembles come from the HIPPS-DIMES maximum-entropy framework, which infers effective couplings $X_3$4 and 3D coordinates $X_3$5; the spectrum of the connectivity matrix $X_3$6 then governs viscoelastic response (Shi et al., 28 Dec 2025).

The global viscoelastic response is Rouse-like, with region-averaged moduli satisfying $X_3$7 and $X_3$8 in an intermediate-frequency regime. The locus-specific moduli are obtained by weighting modes by the locus participation $X_3$9: $\pm 3$0 Using $\pm 3$1 as a threshold, the paper separates loci into single-timescale and multi-timescale subpopulations. Multi-timescale loci are strongly enriched in active marks, with H3K27ac at least twofold higher than in the short-$\pm 3$2 group, and $\pm 3$3 follows an approximately inverse trend $\pm 3$4 with effective local stiffness $\pm 3$5 (Shi et al., 28 Dec 2025).

The same framework predicts loading-rate-dependent susceptibility under pull–release simulations. For sustained forcing, H3K27ac-rich loci deform more; for a brief, strong impulse with $\pm 3$6 and $\pm 3$7, the trend reverses, with reported mean displacements $\pm 3$8 for high H3K27ac, $\pm 3$9 for medium, and $|u|=|v|$0 for low. At $|u|=|v|$1 bp resolution, promoters, enhancers, and gene bodies aligned with focal interactions emerge as “viscoelastic islands” with three $|u|=|v|$2 crossings and elevated $|u|=|v|$3, notably in the JUNB/PRDX2 region (Shi et al., 28 Dec 2025).

5. LoCUS: learning multiscale 3D-consistent features from posed images

“LoCUS” in computer vision stands for “Learning Multiscale 3D-consistent Features from Posed Images.” It is a self-supervised method that learns image-patch descriptors by casting training as a 3D-aware patch retrieval problem over posed views. Given a query landmark embedding $|u|=|v|$4, the model ranks patch embeddings $|u|=|v|$5 from other views using cosine similarity

$|u|=|v|$6

with positives defined by $|u|=|v|$7 in the same environment and considered negatives restricted to the shell $|u|=|v|$8. Patches outside $|u|=|v|$9 are ignored. This “don’t-care” outer region is the mechanism used to balance retrieval precision/recall near the landmark with descriptor reuse for semantically similar but spatially distant landmarks (Kloepfer et al., 2023).

The optimization target is a smooth differentiable surrogate of Average Precision, used both for descriptor learning and for landmark selection. Scale is explicitly regulated by the spatial tolerance $\mathbb{C}^*$00: small $\mathbb{C}^*$01 yields point-/texture-scale invariance, medium $\mathbb{C}^*$02 yields object-scale invariance, and large $\mathbb{C}^*$03 yields room/place-scale invariance. The implementation reported in the paper uses a frozen DINO ViT backbone with 768-dimensional features, a two-stage transformer head with 128-dimensional internal features, and two linear layers producing 64-dimensional patch descriptors, for a total of 503,232 trainable parameters; training uses Adam with initial learning rate $\mathbb{C}^*$04, temperature $\mathbb{C}^*$05, 20 epochs on Matterport3D, and a mini-batch size of 16 images from the same environment (Kloepfer et al., 2023).

On Matterport3D validation patch retrieval, DINO yields $\mathbb{C}^*$06 and $\mathbb{C}^*$07, DINOv2 yields $\mathbb{C}^*$08 and $\mathbb{C}^*$09, and LoCUS yields $\mathbb{C}^*$10 and $\mathbb{C}^*$11. With linear probes on frozen 64-dimensional patch descriptors, the reported overall segmentation results are $\mathbb{C}^*$12, $\mathbb{C}^*$13, and $\mathbb{C}^*$14, compared with DINO overall $\mathbb{C}^*$15, $\mathbb{C}^*$16, and $\mathbb{C}^*$17. In relative pose estimation on SparsePlanes-generated Matterport3D pairs, LoCUS reports translation median $\mathbb{C}^*$18 m, average $\mathbb{C}^*$19 m, $\mathbb{C}^*$20 m accuracy $\mathbb{C}^*$21, and rotation median $\mathbb{C}^*$22, average $\mathbb{C}^*$23, $\mathbb{C}^*$24 accuracy $\mathbb{C}^*$25 (Kloepfer et al., 2023).

6. LOCUS and Locus in lidar odometry and place recognition

“LOCUS” in robotics denotes “Lidar Odometry for Consistent operation in Uncertain Settings,” a lidar-centric front end for real-time odometry and 3D mapping in extreme environments. Its architecture combines motion distortion correction, optional multi-lidar merging, point-cloud filtering, a health-aware sensor integration module, scan-to-scan and scan-to-submap GICP, and an octree map with optional Flat Ground Assumption. The baseline health test is rate $\mathbb{C}^*$26 Hz, with priority-based switching among VIO, WIO/KIO, IMU, and pure lidar. The reported map update thresholds are $\mathbb{C}^*$27 m translation or $\mathbb{C}^*$28 rotation, voxel leaf size is typically $\mathbb{C}^*$29 m, and the system is designed to sustain $\mathbb{C}^*$30 Hz lidar in field-deployable settings (Palieri et al., 2020).

The evaluation reports mean absolute pose error $\mathbb{C}^*$31 m on Urban Alpha and $\mathbb{C}^*$32 m on Urban Beta, improving to $\mathbb{C}^*$33 m and $\mathbb{C}^*$34 m with Flat Ground Assumption; on Tunnel Safety Research, mean APE is $\mathbb{C}^*$35 m. Map-error RMSE after ICP alignment to the ground-truth map is $\mathbb{C}^*$36 m for Urban Alpha, $\mathbb{C}^*$37 m for Urban Beta, and $\mathbb{C}^*$38 m for Tunnel Safety Research. The system was deployed on multiple robotic platforms and formed a key part of the CoSTAR team’s winning Urban Circuit system in the DARPA Subterranean Challenge (Palieri et al., 2020).

“Locus” in LiDAR place recognition denotes a global descriptor built from structural appearance, topology, and temporal co-occurrence of scene segments. Starting from Euclidean clusters, the method computes 64-dimensional SegMap-CNN segment features, builds a spatial graph using Minimum Translational Distance between convex hulls, constructs temporal correspondences over a $\mathbb{C}^*$39 frame window, and aggregates complementary features with second-order outer-product pooling and a Power-Euclidean transform with $\mathbb{C}^*$40. The final descriptor is a 4096-dimensional, permutation-invariant global vector. On KITTI, the reported mean $\mathbb{C}^*$41 is $\mathbb{C}^*$42, with sequence-wise values $\mathbb{C}^*$43, $\mathbb{C}^*$44, $\mathbb{C}^*$45, $\mathbb{C}^*$46, $\mathbb{C}^*$47, and $\mathbb{C}^*$48 on sequences $\mathbb{C}^*$49, respectively; the method is also reported as robust to viewpoint rotations and severe azimuth-sector occlusions (Vidanapathirana et al., 2020).

7. LOCUS in multimodal LLMs and the term’s cross-disciplinary structure

In multimodal LLMs, “LOCUS” stands for “LOcal visual CUe Search.” The paper identifies a failure mode called visual context rot: decisive evidence may exist in a high-resolution image but fail to be selected and used amid redundant visual context. During training, LOCUS supplies a local crop $\mathbb{C}^*$50 and asks the model to recover its spatial support in the full image. The reward is

$\mathbb{C}^*$51

with $\mathbb{C}^*$52 for a valid predicted box and $\mathbb{C}^*$53 otherwise. Optimization uses Group-Relative Policy Optimization with KL regularization, leaving inference unchanged: test-time input remains the standard image–question interface without crops, zooms, or tools (Tao et al., 15 Jun 2026).

On the primary Qwen2.5-VL-7B run, the paper reports V*Bench $\mathbb{C}^*$54, HR-8K $\mathbb{C}^*$55, HR-4K $\mathbb{C}^*$56, CV-Bench $\mathbb{C}^*$57, MME-RealWorld $\mathbb{C}^*$58, POPE $\mathbb{C}^*$59, HallusionBench $\mathbb{C}^*$60, MMStar $\mathbb{C}^*$61, RealWorldQA $\mathbb{C}^*$62, OCRBench $\mathbb{C}^*$63, AI2D $\mathbb{C}^*$64, and BabyVision $\mathbb{C}^*$65. On the proxy cue-search task, mean IoU rises from $\mathbb{C}^*$66 to $\mathbb{C}^*$67 and $\mathbb{C}^*$68 from $\mathbb{C}^*$69 to $\mathbb{C}^*$70; attention-in-box analyses show stronger late-layer concentration on ground-truth evidence regions (Tao et al., 15 Jun 2026).

A common source of confusion is to treat “locus” as a single invariant notion. In the cited literature it can mean a traced geometric set, a subset of parameter space defined by stability or ramification conditions, a fixed-size chromatin segment, or an acronym for a computational system. This suggests that the shared semantic core is condition-defined localization, but the object being localized varies sharply: hyperplanes in $\mathbb{C}^*$71, triangle centers, conjugate points, closed-loop spectra, moduli points, chromatin bins, image patches, robot poses, point-cloud places, or fine-grained visual evidence.