Research
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.

169,051 papers · 148 categories

Trend · papers per month

481216 · Jul 202219922001200920182026
48 results for color constancy

New approach for camera-specific color constancy using few-shot meta-learning.

problem Domain gaps and lack of generalization across different cameras.
method Formulates color constancy as few-shot meta-learning tasks, leveraging annotated samples across different cameras.
result Significant reduction in data collection time and improved generalization to new cameras.

V1 cortex reconstructs images as Poisson equation solutions with varying weights.

problem Reconstructing images from V1 cortical cell receptive profiles.
method Solves a heterogeneous Poisson equation with varying weights representing neural connectivity.
result Reconstructions converge to homogeneous solutions using homogenization techniques.

Local constancy of index for certain gradient mappings proved.

problem Proving the local constancy of the index for specific gradient mappings.
method Using a more general theorem for quasiregular gradient mappings, deducing the result from the Hessian's properties.
result The index is locally constant for C1,1C^{1,1} functions with uniformly positive determinant Hessian almost everywhere.

COMBO network improves optical flow estimation by combining deep learning with brightness constancy.

problem Optical flow estimation using deep learning requires complex training schemes.
method COMBO network explicitly exploits brightness constancy and combines it with a data-driven approach.
result COMBO network outperforms state-of-the-art methods on various benchmarks.

Study almost rigidity of super Ricci flow with non-negative Muller quantity.

problem Almost rigidity properties of super Ricci flow with non-negative Muller quantity.
method Almost splitting and quantitative stratification theorems established by Bamler for Ricci flow.
result Obtained almost constancy for a certain integral quantity concerning scalar curvature at an almost self-similar point.

Determinants remain constant along specific families of differential operators.

problem Local constancy of regularized determinants for differential operators.
method Analyzing families of operators Dτ=[δτ,d]D_τ=[δ_τ,d_\nabla], showing flat-regularized determinant's constancy.
result The flat-regularized determinant is constant in ττ when restricted to im(δτ)\mathrm{im}(δ_τ) under suitable assumptions.

Paper compares algebraic quantum field theories and factorization algebras on Lorentzian manifolds.

problem Relationship between algebraic quantum field theories and factorization algebras on Lorentzian manifolds.
method Developed functorial constructions under natural hypotheses, including local constancy and descent axioms.
result Equivalence theorem between algebraic quantum field theories and prefactorization algebras.

The paper explores equi-affine curvatures in pseudo-Riemannian manifolds.

problem Understanding equi-affine curvatures in pseudo-Riemannian manifolds.
method Using Cartan frames and Frenet frames, the paper describes equi-affine curvatures and their relation to Frenet curvatures.
result The constancy of Frenet curvatures does not guarantee the constancy of equi-affine curvatures, and vice versa.

Wide neural networks become linear, with constant tangent kernel, due to Hessian scaling.

problem Understanding the linearity of large non-linear models and the tangent kernel.
method Analyzing the scaling properties of the Hessian matrix of neural networks as their width increases.
result The constancy of the tangent kernel is due to the scaling properties of the Hessian matrix.

For a link with zero determinants, a Z-coloring is defined as a generalization of Fox coloring. We call a link having a diagram which admits a non-trivial Z-coloring a Z-colorable link. The minimal coloring number of a Z-colorable link is the minimal number of colors for non-trivial Z-colorings on diagrams of the link.…

2016-05-26abs ↗pdf ↗

Aicardi's invariant F(L)F(L) is extended to colored singular links using graphical calculus.

problem Constructing an invariant for colored classical and singular links.
method State-sum model using graphical calculus for oriented, colored, 4-valent planar graphs.
result Extends F(L)F(L) to colored singular links, showing it's stronger than HOMFLY-PT polynomial.

The paper finds minimum Dehn colors for knots and defines useful graphs for coloring.

problem Finding the minimum number of colors for Dehn colorings of knots.
method Analyzes Dehn colorings for knots and defines R\R-palette graphs.
result For Dehn pp-colorable knots, the minimum number of colors is at least log2pfloor+2\lfloor \log_2 p floor +2.

Factor complexity bφ(n)b_φ(n) for a vertex coloring φφ of a regular tree is the number of colored nn-balls up to color-preserving automorphisms. Sturmian colorings are colorings of minimal unbounded factor complexity bφ(n)=n+2b_φ(n) = n+2. In this article, we prove an induction algorithm for Sturmian colorings using colored ba…

2016-09-20abs ↗pdf ↗

We prove that any 1111-colorable knot is presented by an 1111-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially 1111-colored diagrams of the knot. We also prove a similar result for any 1111-colorable ribbon 22-knot.

2015-05-12abs ↗pdf ↗

This survey article discusses three aspects of knot colorings. Fox colorings are assignments of labels to arcs, Dehn colorings are assignments of labels to regions, and Alexander-Briggs colorings assign labels to vertices. The labels are found among the integers modulo n. The choice of n depends upon the knot. Each typ…

2013-01-23abs ↗pdf ↗

For each odd prime p, and for each non-split link admitting non-trivial p-colorings, we prove that the maximum number of Fox colors is p. We also prove that we can assemble a non-trivial p-coloring with any number of colors, from the minimum to the maximum number of colors. Furthermore, for any rational link, we prove …

2012-05-07abs ↗pdf ↗

The minimal coloring number of a Z\mathbb{Z}-colorable link is the minimal number of colors for non-trivial Z\mathbb{Z}-colorings on diagrams of the link. In this paper, we show that the minimal coloring number of any non-splittable Z\mathbb{Z}-colorable links is four. As an example, we consider the link obtained by…

2017-05-22abs ↗pdf ↗

For any link and for any modulus mm we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring is formed by each assignment of colors to the arcs of the diagram that is obtaine…

2012-08-05abs ↗pdf ↗

Study of quandle coloring quivers with dihedral quandles.

problem Link invariants and their enhancements using quandles.
method Introduced shadow quandle coloring quivers and cocycle quivers, studied equivalence with quandle coloring numbers and shadow quandle cocycle invariants.
result Equivalence of quandle coloring quivers with quandle coloring numbers and shadow quandle cocycle quivers with shadow quandle cocycle invariants for specific dihedral quandles.

In this article we present the following new fact for prime p=11. For knots 6_2 and 7_2, mincol_{11} 6_2 = 5 = mincol_{11} 7_2, along with the following feature. There is a pair of diagrams, one for 6_2 and the other one for 7_2, each of them admitting only non-trivial 11-colorings using 5 colors, but neither of them a…

2013-08-28abs ↗pdf ↗

New TQFT homologies help color graphs, potentially solving the four color theorem.

problem Graph coloring problem, especially the four color theorem.
method Topological quantum field theory (TQFT) to define homology theories.
result TQFT homologies can generate 4-face colorings of bridgeless planar graphs, offering a constructive approach to the four color theorem.

The ability to characterize the color content of natural imagery is an important application of image processing. The pixel by pixel coloring of images may be viewed naturally as points in color space, and the inherent structure and distribution of these points affords a quantization, through clustering, of the color i…

2012-02-20abs ↗pdf ↗

In this article we show that if a knot diagram admits a non-trivial coloring modulo 13 then there is an equivalent diagram which can be colored with 5 colors. Leaning on known results, this implies that the minimum number of colors modulo 13 is 5.

2015-08-30abs ↗pdf ↗

Gradient descent with error feedback performs better than vanilla when features are rare.

problem Improving communication complexity in distributed optimization with rare features.
method Gradient descent with greedy sparsification and error feedback for rare features.
result Communication complexity improves as features become more rare, potentially better than vanilla GD.

Paper extends Enami-Ozeki-Yamaguchi's work on planar quadrangulations.

problem Finding the maximum number of colors for proper anti-rainbow colorings on planar quadrangulations.
method Introducing half-monochromatic colorings for plane graphs with even polygonal faces and providing an upper bound in terms of the independence number.
result An upper bound on the maximum number of colors for half-monochromatic colorings is given in terms of the independence number.

Classifies colored links and spatial graphs up to colored link-homotopy.

problem Classifying colored links and spatial graphs up to colored link-homotopy.
method Using Habegger-Lin theory for colored string links, and extending to colored links and spatial graphs.
result Classification of colored links and spatial graphs up to colored link-homotopy.

We show that a family of isolated complex hypersurface singularities with constant Milnor number may fail, in the strongest sense, to have constant bi-Lipschitz type. Our example is the Briac con--Speder family $X_t:=\{(x,y,z)\in\C^3 | x^5+z^{15}+y^7z+txy^6=0 \}$ of normal complex surface germs; we show the germ $(X_0,…

2008-09-04abs ↗pdf ↗