In the paper, we focus on the connectedness of planar self-affine sets T(A,D) generated by an integer expanding matrix A with ∣det(A)∣=3 and a collinear digit set D={0,1,b}v, where b>1 and v∈R2 such that {v,Av} is linearly independent. We discuss the domain of…
We study the connectedness of the planar self-affine sets T(A,D) generated by an integer expanding matrix A with ∣det(A)∣=3 and a non-collinear digit set D={0,v,kAv} where k∈Z∖{0} and v∈Z2 such that {v,Av} is linearly independent. By chec…
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 M be a 3×3 integer matrix each of whose eigenvalues is greater than 1 in modulus and let D⊂Z3 be a set with ∣D∣=∣detM∣, called digit set. The set equation MT=T+D uniquely defines a nonempty compact set T⊂R3. If T has positive L…
In this paper, we consider the connectedness of planar self-affine set T(A,D) arising from an integral expanding matrix A with characteristic polynomial f(x)=x2+bx+c and a digit set D={0,1,…,m}v. The necessary and sufficient conditions only depending on b,c,m are given for the $T(A…
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…
AEC method improves XAI for models with collinear features.
problem Collinearity issues in machine learning models.
method Divides multivariate models into univariate models to examine feature effects.
result AEC method is more robust and stable against collinearity.
Let T:=T(A,D) be a disk-like self-affine tile generated by an integral expanding matrix A and a consecutive collinear digit set D, and let f(x)=x2+px+q be the characteristic polynomial of A. In the paper, we identify the boundary ∂T with a sofic system by constructing a ne…
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.
We compute the Betti numbers and describe the cohomology algebras of the ordered and unordered configuration spaces of three points in complex projective spaces, including the infinite dimensional case. We also compute these invariants for the configuration spaces of three collinear and non-collinear points.
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.
Study on cold and freezing sets in digital images.
problem Properties of cold sets in digital images.
method Analysis of properties and relationships between cold and freezing sets.
result Examined relationships between cold and freezing sets.
Find limiting sets for digital cones and suspensions.
problem Digital topology cone and suspension constructions.
method Identify (m, n)-limiting sets, especially (0, 0)-freezing sets.
result Discover (0, 0)-limiting sets for digital cones and suspensions.
Study minimal freezing sets in convex digital disks.
problem Finding minimal freezing sets in convex digital disks.
method Showed how to find minimal freezing sets for convex disks in digital plane.
result Found minimal freezing sets for convex disks in digital plane.
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.
Study freezing sets for digital images in a 2D grid.
problem Determine minimal freezing sets for digital images.
method Prove methods to obtain freezing sets for digital images (X, c_i) where X is a subset of Z^2.
result Examples show how methods can lead to the determination of minimal freezing sets.
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.
Examines how irreducibility and rigidity affect digital images.
problem Understanding interactions between irreducibility and rigidity in digital images.
method Analyzes Cartesian products, wedges, and cold and freezing sets.
result Interactions between irreducibility and rigidity in digital images.
New method for freezing sets in arbitrary dimensions.
problem Creating freezing sets for digital images in arbitrary dimensions.
method Using c1 and cn adjacencies to obtain freezing sets in Zn. result Demonstrated freezing sets for digital images in arbitrary dimensions.
In this paper, we consider ∗-Ricci soliton in the frame-work of Kenmotsu manifolds. First, we prove that if the metric of a Kenmotsu manifold M is a ∗-Ricci soliton, then soliton constant λ is zero. For 3-dimensional case, if M admits a ∗-Ricci soliton, then we show that M is of constant sectional curvatu…
Digital money could reduce germ spread during coronavirus.
problem Spreading of germs via paper money during coronavirus.
method Policy recommendations for mobile wallets, digital currencies, and data protection.
result Adopting digital money can help reduce germ spread.
We investigate the optimal structure of dynamic regression models used in multivariate time series prediction and propose a scheme to form the lagged variable structure called Backward-in-Time Selection (BTS) that takes into account feedback and multi-collinearity, often present in multivariate time series. We compare …
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 …
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.
Efficiently solves Elastic Net in high dimensions with Newton method.
problem Feature selection in high-dimensional data with non-negligible collinearity.
method Semi-smooth Newton Augmented Lagrangian Method.
result Significantly reduces computational cost compared to competitors.
Two XAI methods, SHAP and LIME, are discussed for tabular data models.
problem Making machine learning models transparent and trustworthy.
method SHAP and LIME methods for explaining model predictions.
result SHAP and LIME are model-dependent and sensitive to feature collinearity.
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…
New tools for constructing fixed point sets in digital topology.
problem Constructing fixed point sets in digital topology.
method Defining excludable points and articulation points, and showing their exclusion from freezing sets.
result Excludable points and articulation points can be excluded from all freezing sets.
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.
Wrist movements can reveal digits, posing security risks.
problem Security vulnerabilities in wrist wearable devices.
method Machine learning model trained on wrist movement data.
result 100% accuracy in predicting digits via wrist movement.
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.
A new method clusters intersecting lines using hypergraphs.
problem Clustering intersecting lines in subspace clustering.
method Constructing a geometric hypergraph and using spectral algorithm.
result Achieves information-theoretic bounds for line clustering.
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…
A k-Artal arrangement is a reducible algebraic curve composed of a smooth cubic and k inflectional tangents. By studying the topological properties of their subarrangements, we prove that for k=3,4,5,6, there exist Zariski pairs of k-Artal arrangements. These Zariki pairs can be distinguished in a geometric way…
In N(k)-contact metric manifolds and/or (k,μ)-manifolds, gradient Ricci solitons, compact Ricci solitons and Ricci solitons with V pointwise collinear with the structure vector field ξ are studied.
Strict concavity proven for growth indicator function of certain groups.
problem Proving strict concavity of growth indicator function for specific groups.
method Smoothness of Manhattan hypersurface and critical-exponent map.
result Strict concavity of growth indicator function for relatively Anosov groups.
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…
Generically, the set of points along which two non-singular vector fields on the three-sphere are positively (resp. negatively) collinear form a link. We prove that the two vector fields are homotopic if and only if the linking number of those links is zero. We use this criterion to give a new proof of a result of Yano…
Introduces a new tensor for electrostatic systems in arbitrary dimensions.
problem Developing a tensor for electrostatic systems in various dimensions.
method Comparison of Cotton and Weyl decompositions of the Riemann curvature tensor.
result The tensor is totally trace-free and satisfies symmetries of the Cotton tensor.
Generative models create personalized patient health simulations.
problem Creating accurate digital twins for personalized medicine.
method Neural network architecture for conditional generative models of clinical trajectories.
result Same architecture generates accurate twins across 13 indications.
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…
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…
New method predicts political ideology from online activity.
problem Predicting political ideology from digital footprints.
method Statistical learning approaches applied to reddit data.
result Activity in non-political forums can predict political ideology with high accuracy.
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.