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.

168,657 papers · 148 categories

Trend · papers per month

203405608810 · Jun 202019922001200920172026
48 results for collinear digit sets

In the paper, we focus on the connectedness of planar self-affine sets T(A,D)T(A,{\mathcal{D}}) generated by an integer expanding matrix AA with det(A)=3|\det (A)|=3 and a collinear digit set D={0,1,b}v{\mathcal{D}}=\{0,1,b\}v, where b>1b>1 and vR2v\in {\mathbb{R}}^2 such that {v,Av}\{v, Av\} is linearly independent. We discuss the domain of…

2012-05-16abs ↗pdf ↗

We study the connectedness of the planar self-affine sets T(A,D)T(A,{\mathcal{D}}) generated by an integer expanding matrix AA with det(A)=3|\det(A)|=3 and a non-collinear digit set D={0,v,kAv}{\mathcal D}=\{0, v, kAv\} where kZ{0}k\in {\mathbb Z}\setminus\{0\} and vZ2v\in {\mathbb Z}^2 such that {v,Av}\{v, Av\} is linearly independent. By chec…

2012-08-18abs ↗pdf ↗

Self-affine tiles homeomorphic to a ball proven for a specific digit set.

problem Topology of self-affine tiles with collinear digit sets.
method Proving homeomorphism to a ball using integral self-affine tiles with collinear digit sets.
result A large class of integral self-affine tiles with collinear digit sets is homeomorphic to a closed 3-dimensional ball.

Let MM be a 3×33\times 3 integer matrix each of whose eigenvalues is greater than 11 in modulus and let DZ3\mathcal{D}\subset\mathbb{Z}^3 be a set with D=detM|\mathcal{D}|=|\det M|, called digit set. The set equation MT=T+DMT = T+\mathcal{D} uniquely defines a nonempty compact set TR3T\subset \mathbb{R}^3. If TT has positive L…

2018-11-16abs ↗pdf ↗

In this paper, we consider the connectedness of planar self-affine set T(A,D)T(A,\mathcal{D}) arising from an integral expanding matrix AA with characteristic polynomial f(x)=x2+bx+cf(x)=x^2+bx+c and a digit set D={0,1,,m}v\mathcal{D}=\{0,1,\dots, m\}v. The necessary and sufficient conditions only depending on b,c,mb,c,m are given for the $T(A…

2014-04-25abs ↗pdf ↗

The study characterizes quadrics among affine hyperspheres based on centroid collinearity of sections.

problem Characterizing quadrics among affine hyperspheres based on section centroid collinearity.
method Extending Meyer and Reisner's theorem to unbounded convex sets and identifying additional assumptions.
result Ellipsoids, paraboloids, and one sheet of a two-sheeted hyperboloid are the only quadrics satisfying the centroid collinearity condition.

Two-dimensional almost-Riemannian structures are generalized Riemannian structures on surfaces for which a local orthonormal frame is given by a Lie bracket generating pair of vector fields that can become collinear. Generically, the singular set is an embedded one dimensional manifold and there are three type of point…

2011-05-24abs ↗pdf ↗

Let T:=T(A,D)T:= T(A, {\mathcal D}) be a disk-like self-affine tile generated by an integral expanding matrix AA and a consecutive collinear digit set D{\mathcal D}, and let f(x)=x2+px+qf(x)=x^{2}+px+q be the characteristic polynomial of AA. In the paper, we identify the boundary T\partial T with a sofic system by constructing a ne…

2012-06-02abs ↗pdf ↗

Bayesian approach tackles collinearity in large-scale linear system identification.

problem Collinearity in large-scale linear system identification.
method Bayesian regularization framework with Gaussian process and stable spline kernel. Novel Markov chain Monte Carlo scheme.
result Efficiently reconstructs impulse responses posterior by dealing with collinearity.

No feature ranking can be faithful, stable, and complete when features are collinear.

problem The impossibility of creating a feature ranking that is simultaneously faithful, stable, and complete when features are collinear.
method Proving the impossibility, quantifying it for four model classes, resolving it via ensemble averaging (DASH), and machine-verifying it with Lean 4 theorems.
result No method lies outside the dichotomy of faithful-complete methods (unstable, with rankings that flip up to 50% of the time) and ensemble methods (stable, reporting ties for symmetric features).

Bayesian regularization tackles collinearity in large-scale systems with correlated inputs.

problem Collinearity in large-scale linear systems identification due to correlated inputs.
method Bayesian regularization with stable spline covariance and Markov chain Monte Carlo scheme.
result Efficient reconstruction of impulse responses with high correlation among inputs.

Symmetry-electronic fingerprints reveal competing magnetic phases in two-dimensional materials.

problem Predicting magnetic ground states, moments, and anisotropy in two-dimensional magnets.
method Introduce the symmetry-electronic fingerprint (SEF), a physically interpretable representation that encodes crystallographic symmetry operations, Wyckoff-site geometry, and site-resolved electronic structure.
result SEF-trained models accurately classify magnetic ordering and regress moments alongside anisotropy energies.

The paper derives theoretical foundations for two common machine learning variable importance measures.

problem Understanding variable importance in machine learning problems.
method The paper derives closed-form expressions for Permute-and-Predict (PaP) and Leave-One-Covariate-Out (LOCO) methods.
result Theoretical derivations explain the behavior of PaP and LOCO under collinearity, linking them to coefficients and predictor variability.

New bounds on NTK's smallest eigenvalue for arbitrary data without distributional assumptions.

problem Existing bounds on NTK's smallest eigenvalue require distributional assumptions and high-dimensional data.
method Novel application of the hemisphere transform.
result Bounds on NTK's smallest eigenvalue hold with high probability even for constant input dimension.

We give an answer to the question given by T.Y.Kong in his article "Can 3-D Digital Topology be Based on Axiomatically Defined Digital Spaces?" In this article he asks the question, if so called "good pairs" of neighborhood relations can be found on the set Z^n such that the existence of digital manifolds of dimension …

2011-11-13abs ↗pdf ↗

New theory explains how noisy, high-dimensional data can still lead to robust predictions.

problem Modern machine learning models achieve high performance with noisy, high-dimensional data.
method Synthesizes principles from Information Theory, Latent Factor Models, and Psychometrics to clarify predictive robustness.
result Predictive robustness arises from data architecture and model capacity, not just data cleanliness.

We propose a penalized orthogonal-components regression (POCRE) for large p small n data. Orthogonal components are sequentially constructed to maximize, upon standardization, their correlation to the response residuals. A new penalization framework, implemented via empirical Bayes thresholding, is presented to effecti…

2008-11-25abs ↗pdf ↗

This work discovers algebraic structures from data using a differentiable measure.

problem Discovering discrete algebraic rules from data.
method Formalizes the problem through Cayley-table completion and uses HyperCube operator-valued tensor factorization.
result Derives an absolute lower bound for the differentiable measure of algebraic complexity, proving it is attained only for group structures.

KG-WDRO optimizes transfer learning with external knowledge.

problem Over-pessimism in WDRO for small target samples.
method KG-WDRO incorporates multiple sources of external knowledge to construct smaller Wasserstein ambiguity sets.
result KG-WDRO improves transfer learning performance and adaptivity.

We consider the problem of learning linear prediction models with model misspecification bias. In such case, the collinearity among input variables may inflate the error of parameter estimation, resulting in instability of prediction results when training and test distributions do not match. In this paper we theoretica…

2019-11-28abs ↗pdf ↗

A kk-Artal arrangement is a reducible algebraic curve composed of a smooth cubic and kk inflectional tangents. By studying the topological properties of their subarrangements, we prove that for k=3,4,5,6k=3,4,5,6, there exist Zariski pairs of kk-Artal arrangements. These Zariki pairs can be distinguished in a geometric way…

2016-07-26abs ↗pdf ↗

In N(k)N(k)-contact metric manifolds and/or (k,μ)(k,μ)-manifolds, gradient Ricci solitons, compact Ricci solitons and Ricci solitons with VV pointwise collinear with the structure vector field ξξ are studied.

2008-01-28abs ↗pdf ↗

A new method streamlines digital payment programming using smart contracts.

problem High costs and security challenges in programming smart contracts for digital payments.
method Transforming digital currencies into token streams and using configurable templates to generate specialized smart contracts.
result Reduces payment programming costs and enhances security, self-enforcement, adaptability, and controllability.

We continue the work of [10], studying properties of digital images determined by fixed point invariants. We introduce pointed versions of invariants that were introduced in [10]. We introduce freezing sets and cold sets to show how the existence of a fixed point set for a continuous self-map restricts the map on the c…

2019-04-01abs ↗pdf ↗

Consider an immersed Legendrian surface in the five dimensional complex projective space equipped with the standard homogeneous contact structure. We introduce a class of fourth order projective Legendrian deformation called \emph{Ψ\,Ψ-deformation}, and give a differential geometric characterization of surfaces admitt…

2011-07-21abs ↗pdf ↗

Benford's law states that in data sets from different phenomena leading digits tend to be distributed logarithmically such that the numbers beginning with smaller digits occur more often than those with larger ones. Particularly, the law is known to hold for different types of financial data. The Illicit Financial Flow…

2012-01-17abs ↗pdf ↗

Automates translating natural language to Verilog for digital design.

problem Manual translation of natural language specifications to Verilog is time-consuming and error-prone.
method Fine-tuned GPT-2 to derive Verilog from English, using a dataset of design tasks.
result GPT-2 achieved 94.8% correct translation across simple and abstract design tasks.