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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for maximal reflection sublattices

The paper improves Vinberg's algorithm for arithmetic hyperbolic lattices.

problem Finding maximal reflection sublattices in arithmetic hyperbolic lattices.
method Provided an effective termination condition for Vinberg's semi-algorithm.
result The algorithm becomes an effective method for finding maximal reflection sublattices.

Let YY be a sublattice of a vector lattice XX. We consider the problem of identifying the smallest order closed sublattice of XX containing YY. It is known that the analogy with topological closure fails. Let Yo\overline{Y}^o be the order closure of YY consisting of all order limits of nets of elements from YY. T…

2017-03-28abs ↗pdf ↗

The article classifies cubiquitous sublattices and applies them to branched covers.

problem Understanding cubiquitous sublattices as obstructions to rational homology 4-balls.
method Developed a geometric Wu obstruction to classify cubiquitous sublattices and applied it to branched covers.
result Completely classified which sublattices with orthogonal bases are cubiquitous.

The paper explores reflection principles for lightlike line segments on maximal surfaces.

problem Reflection property does not hold for lightlike line segments on maximal surfaces.
method Analyzes reflection properties for lightlike line segments connecting shrinking singularities.
result Shows a kind of reflection principle for lightlike line segments on maximal surfaces.

According to our previous results, the conjugacy class of the involution induced by the complex conjugation in the homology of a real non-singular cubic fourfold determines the fourfold up to projective equivalence and deformation. Here, we show how to eliminate the projective equivalence and to obtain a pure deformati…

2008-04-30abs ↗pdf ↗

A hyperbolic lattice is called \textit{1.21.2-reflective} if the subgroup of its automorphism group generated by all 11- and 22-reflections is of finite index. The main result of this article is a complete classification of 1.21.2-reflective maximal anisotropic lattices of rank 44.

2016-10-19abs ↗pdf ↗

Paper investigates reflection principles for zero mean curvature surfaces in isotropic 3-space.

problem Investigating reflection principles for zero mean curvature surfaces in isotropic 3-space.
method Analyzes reflection principles for zero mean curvature surfaces in I3\mathbb{I}^3.
result Shows a reflection principle for isotropic line segments on zero mean curvature surfaces in I3\mathbb{I}^3.

In this paper, it is shown that a Fuchsian group, acting on the upper half-plane model for H2\mathbb{H}^2, admits a Ford domain which is also a Dirichlet domain, for some center, if and only if it is an index 2 subgroup of a reflection group. This is used to exhibit an example of a maximal arithmetic hyperbolic reflect…

2009-11-25abs ↗pdf ↗

The transition constant was introduced in our 1981 paper and denoted as N(14). It is equal to the maximal degree of the ground fields of V-arithmetic connected edge graphs with 4 vertices and of the minimality 14. This constant is fundamental since if the degree of the ground field of an arithmetic hyperbolic reflectio…

2009-10-27abs ↗pdf ↗

Motivated by Kohno's result on the holonomy Lie algebra of a hyperplane arrangement, we define the holonomy Lie algebra of a finite geometric lattice in a combinatorial way. For a solvable pair of lattices, we show that the holonomy Lie algebra is an almost-direct product of the holonomy Lie algebra of the sublattice a…

2019-08-16abs ↗pdf ↗

Study on hyperbolic polyhedra and their volume, proving finiteness of arithmetic groups.

problem Finiteness of arithmetic maximal reflection groups in hyperbolic polyhedra.
method Observation of volume distribution and recent work with M. Fraczyk and S. Hurtado.
result Proof of finiteness of arithmetic maximal reflection groups.

Many examples of nonpositively curved closed manifolds arise as blow-ups of projective hyperplane arrangements. If the hyperplane arrangement is associated to a finite reflection group W, and the blow-up locus is W-invariant, then the resulting manifold M will admit a cell decomposition whose maximal cells are all comb…

2002-03-13abs ↗pdf ↗

We introduce the concept of singular recursive utility. This leads to a kind of singular BSDE which, to the best of our knowledge, has not been studied before. We show conditions for existence and uniqueness of a solution for this kind of singular BSDE. Furthermore, we analyze the problem of maximizing the singular rec…

2015-04-30abs ↗pdf ↗

In 1966, Jenkins and Serrin gave existence and uniqueness results for infinite boundary value problems of minimal surfaces in the Euclidean space, and after that such solutions have been studied by using the univalent harmonic mapping theory. In this paper, we show that there exists a one-to-one correspondence between …

2019-09-03abs ↗pdf ↗

The paper solves a control problem using reflections to track a benchmark process.

problem Optimal consumption with a benchmark process that grows over time.
method Introduced two auxiliary state processes with reflections to transform the problem into a more tractable form.
result Established the existence of a unique classical solution to the dual PDE.

Study complex structure deformations on Lie algebras and Dolbeault cohomology.

problem Deformations of complex structures on Lie algebras and their associated Dolbeault cohomology.
method Construct a complete deformation of complex structures similar to the Kuranishi family, showing extension isomorphism validity.
result Analytic open subset of deformations where Dolbeault cohomology can be computed by left invariant tensor fields.

Develops non-Markovian couplings for sub-Riemannian Brownian motions.

problem Constructing couplings for sub-Riemannian Brownian motions starting from points on the same vertical fiber.
method Uses global isometries to construct maximal couplings, satisfying a reflection principle.
result Estimates coupling time and applies to inequalities for the heat semigroup.

Inexact acquisition solutions in BO lead to sublinear cumulative regret.

problem Inexact maximization of acquisition functions in Bayesian optimization.
method Define inaccuracy measure, establish cumulative regret bounds for GP-UCB and GP-TS.
result Inexact BO algorithms can achieve sublinear cumulative regret under appropriate inaccuracy conditions.

Study explores robust Orlicz spaces in finance, showing separability implications.

problem Understanding robustness in financial and economic contexts.
method Distinguished two constructions of robust Orlicz spaces: top-down and bottom-up.
result Separability of robust Orlicz spaces has strong implications for dominatedness and order completeness.

Hiss and Szczepański proved in 1991 that the holonomy group of any compact flat Riemannian manifold, of dimension at least two, acts reducibly on the rational span of the Euclidean lattice associated with the manifold via the first Bieberbach theorem. Geometrically, their result states that such a manifold must admit a…

2019-03-25abs ↗pdf ↗

Transfer learning borrows knowledge from a source domain to facilitate learning in a target domain. Two primary issues to be addressed in transfer learning are what and how to transfer. For a pair of domains, adopting different transfer learning algorithms results in different knowledge transferred between them. To dis…

2017-08-18abs ↗pdf ↗

Suppose that we wish to estimate a user's preference vector ww from paired comparisons of the form "does user ww prefer item pp or item qq?," where both the user and items are embedded in a low-dimensional Euclidean space with distances that reflect user and item similarities. Such observations arise in numerous se…

2019-05-10abs ↗pdf ↗

The paper extends Merton's problem by adding benchmark tracking, finding optimal strategies.

problem Maximizing consumption utility with a trade-off against benchmark performance.
method Developed a convex duality theorem and derived optimal strategies for specific cases.
result Found optimal portfolio and consumption strategies for CRRA utility and geometric Brownian motion benchmarks.

Investment strategy optimization from discrete to continuous models.

problem Optimizing investment strategies and stopping times in both continuous and discrete settings.
method Characterized value functions via quadratic reflected BSDEs for continuous case, discretized BSDEs for discrete case, and derived uniform convergence rates.
result Uniform convergence and rate from discrete to continuous quadratic reflected BSDEs.

A discrete subgroup of the group of isometries of the hyperbolic space is called reflective if up to a finite index it is generated by reflections in hyperplanes. The main result of this paper is a complete classification of the reflective (and quasi-reflective) subgroups among the Bianchi groups and their extensions.

2012-10-09abs ↗pdf ↗

A new method improves graph node embeddings by considering both nearby and distant node similarities.

problem Improving graph node embeddings by considering both nearby and distant node similarities.
method Distance-aware Negative Sampling (DNS) which maximizes cohesion at nearby node-pairs and separation at distant node-pairs.
result DNS outperforms baseline methods in downstream node classification tasks on various datasets and GRL algorithms.

Survey explores interactions between four conformal dynamics branches.

problem Understanding complex dynamics through different mathematical concepts.
method Examples and general results with technical tools.
result Dynamical relations between Schwarz reflection parameter spaces and anti-rational maps/ reflection groups.

This paper examines if CTE risk measure aligns with profit-maximizing risk capital allocations.

problem Whether CTE risk measure aligns with profit-maximizing risk capital allocations.
method Exhaustive probabilistic model settings analysis.
result CTE risk measure may align with profit-maximizing risk capital allocations under certain conditions.