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,742 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for Cartesian subgroup

The Cartesian subgroup in graph products of groups is studied with bounds and algorithms.

problem Understanding the structure of Cartesian subgroups in graph products of groups.
method Theory of polyhedral products, lower and upper bounds, algorithm for small presentations.
result Bounds on the number of relations and deficiency in presentations of Cartesian groups.

The paper studies HKKN stratifications for non-compact spaces and proves convexity properties.

problem Proving convexity properties of moment maps for non-compact subsets.
method Algebraic and analytical study of HKKN stratifications for a vector space and compact Kähler manifold, then applying to non-compact subsets.
result Convexity properties of moment maps for invariant subsets are proven.

Study on balanced Hermitian structures on Lie algebras twisted by representations.

problem Conditions for balanced and locally conformally balanced Hermitian structures on Lie algebras.
method Analysis of Hermitian structures on twisted cartesian products of Lie algebras.
result Classification of six-dimensional balanced Hermitian twisted cartesian products Lie algebras.

Study benchmarks methods for learning non-Cartesian k-space trajectories and reconstruction.

problem Benchmarking methods for learning non-Cartesian k-space trajectories and reconstruction.
method Comparing PILOT, BJORK, and HybLearn schemes to learn non-Cartesian k-space trajectories and reconstruction.
result HybLearn scheme outperforms other methods in learning and comparing non-Cartesian k-space trajectories and reconstruction.

In this paper we show that the cohomology of a connected CW complex is periodic if and only if it is the base space of an orientable spherical fibration with total space that is homotopically finite dimensional. As applications we characterize those discrete groups that act freely and properly on a cartesian product of…

2000-10-10abs ↗pdf ↗

TACE unifies scalar and tensorial modeling in Cartesian space for accurate, stable, and efficient atomistic predictions.

problem Complexity and challenges in equivariant atomistic machine learning models.
method Tensor Atomic Cluster Expansion (TACE) in Cartesian space, decomposing local environments into irreducible Cartesian tensors (ICT).
result Universal invariant and equivariant embeddings, enabling explicit control at inference.

We show that the Cartesian product of three hereditarily infinite dimensional compact metric spaces is never hereditarily infinite dimensional. It is quite surprising that the proof of this fact (and this is the only proof known to the author) essentially relies on algebraic topology.

2012-12-12abs ↗pdf ↗

Given a complete and (locally) cartesian closed category U, it is shown that the category of functors from the category of Weil algebras to the category U is (locally, resp.) cartesian closed. The corresponding axiomatization for differential geometry based upon Weil functors is then given.

2012-09-27abs ↗pdf ↗

Frolicher spaces and smooth mappings form a cartesian closed category. It was shown in our previous paper [Far East Journal of Mathematical Sciences, 35 (2009), 211-233] that its full subcategory of Weil exponentiable Frolicher spaces is cartesian closed. By emancipating microlinearity from within a well-adapted model …

2009-12-04abs ↗pdf ↗

Simplifies neural network models by explicitly enforcing constraints in Cartesian coordinates.

problem Learning dynamics of complex systems efficiently and accurately.
method Embedding systems into Cartesian coordinates and using Lagrange multipliers to enforce constraints.
result Explicitly enforcing constraints leads to a 100x improvement in accuracy and data efficiency.

The decomposability of a Cartesian product of two nondecomposable manifolds into products of lower dimensional manifolds is studied. For 3-manifolds we obtain an analog of a result due to Borsuk for surfaces, and in higher dimensions we show that similar analogs do not exist unless one imposes further restrictions such…

2017-11-30abs ↗pdf ↗

Let M be a surface, perhaps with boundary, and either compact, or with a finite number of points removed from the interior of the surface. We consider the inclusion i: F\_n(M) --\textgreater{} M^n of the nth configuration space F\_n(M) of M into the n-fold Cartesian product of M, as well as the induced homomorphism i\_…

2015-11-06abs ↗pdf ↗

Let B be a fiber bundle with compact fiber F over a compact Riemannian n-manifold M. There is a natural Riemannian metric on the total space B consistent with the metric on M. With respect to that metric, the volume of a rectifiable section s:M--> B is the mass of the image s(M) as a rectifiable n-current in B. Theorem…

2004-03-28abs ↗pdf ↗

We prove that if a compact nilmanifold Γ\GΓ\backslash G is endowed with a Vaisman structure, then GG is isomorphic to the Cartesian product of the Heisenberg group with R\mathbb{R}.

2016-05-09abs ↗pdf ↗

New limits of minimal surface systems have surprising large interior parts.

problem Minimal surface system limits with large interior vertical and non-minimal portions.
method Construction of limits with smallest possible dimension and codimension.
result Limits of minimal surface systems can have surprising large interior parts.

This paper focuses on Bayesian Optimization (BO) for objectives on combinatorial search spaces, including ordinal and categorical variables. Despite the abundance of potential applications of Combinatorial BO, including chipset configuration search and neural architecture search, only a handful of methods have been pro…

2019-02-01abs ↗pdf ↗

Using standard analysis only, we present an extension R{^\bullet\R} of the real field containing nilpotent infinitesimals. On the one hand we want to present a very simple setting to formalize infinitesimal methods in Differential Geometry, Analysis and Physics. On the other hand we want to show that these infinitesim…

2003-08-13abs ↗pdf ↗

WeLa-VAE learns interpretable disentangled representations with weak supervision.

problem Learning disentangled representations without strong supervision.
method Variational inference framework with shared latent variables and modified variational lower bound.
result WeLa-VAE learns alternative disentangled representations (polar) from weak labels (distance and angle) without refined supervision.

The study bounds the effective diameter of graphs with positive Ollivier curvature.

problem Bounding the effective diameter of graphs with positive Ollivier curvature.
method Introducing reflective graphs and proving discrete Bonnet Myers theorem.
result The effective diameter bound is attained only for specific graphs.

We study an extention of total variation denoising over images to over Cartesian power graphs and its applications to estimating non-parametric network models. The power graph fused lasso (PGFL) segments a matrix by exploiting a known graphical structure, GG, over the rows and columns. Our main results shows that for …

2018-05-25abs ↗pdf ↗

Many signals on Cartesian product graphs appear in the real world, such as digital images, sensor observation time series, and movie ratings on Netflix. These signals are "multi-dimensional" and have directional characteristics along each factor graph. However, the existing graph Fourier transform does not distinguish …

2017-12-21abs ↗pdf ↗

We prove a modified version of Turbiner's conjecture in three dimensions and we give a counter-example to the original conjecture. The Lie algebraic Schrödinger operators corresponding to flat metrics of a certain restricted type are shown to separate partially in either Cartesian, cylindrical or spherical coordinates.

2006-12-20abs ↗pdf ↗

Novel RL approach for molecular design using quantum mechanics.

problem Existing RL methods for molecular design are limited in scope and reward function.
method Formulation in Cartesian coordinates, direct use of quantum mechanics for reward function, translation and rotation invariant state-action space.
result Agent efficiently learns to solve molecular design tasks from scratch.

A free action of the direct product of two copies of the symmetric group on 3 elements on the cartesian product of two copies of the 3-sphere is constructed. This nonlinear action is constructed using surgery. The action provides a counterexample to a conjecture of Lewis made in 1968.

1998-06-06abs ↗pdf ↗

CAN approximates explicit feature interactions for CTR prediction.

problem Learning explicit feature interactions from sparse features.
method Co-Action Network approximates explicit pairwise feature interactions without introducing too many additional parameters.
result CAN outperforms state-of-the-art CTR models and the cartesian product method.