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

2468 · May 202119922001200920172026
48 results for rectangular prism

The paper constructs free boundary minimal surfaces in product spaces using eigenvalue methods.

problem Constructing free boundary minimal surfaces in product spaces of balls.
method Extremal eigenvalue approach involving mixed Steklov-Neumann eigenvalues.
result No absolute maximum exists for the problem in product spaces.

Hyperbolic knots decompose into prism orbifolds.

problem Understanding hyperbolic knot complements and their geometric properties.
method Analyzing knot complements as quotients of H3\mathbb{H}^3 by discrete groups of reflections in polyhedra with triangular prism combinatorial type.
result Knot complements decompose into hidden symmetries and contain closed, embedded, totally geodesic surfaces.

Ballinger et al. have determined the list of all prism manifolds that are possibly realizable by Dehn surgeries on knots in S3S^3. In this paper, we explicitly find braid words of primitive/Seifert-fibered knots on which surface slope surgeries yield all the prism manifolds listed above. This completes the solution to …

2019-09-05abs ↗pdf ↗

Every prism manifold can be parametrized by a pair of relatively prime integers p>1p>1 and qq. In our earlier papers, we determined a complete list of prism manifolds P(p,q)P(p, q) that can be realized by positive integral surgeries on knots in S3S^3 when q<0q<0 or q>pq>p; in the present work, we solve the case when 0<q<p0<q<p.…

2018-08-16abs ↗pdf ↗

We continue our study of the realization problem for prism manifolds. Every prism manifold can be parametrized by a pair of relatively prime integers p>1p>1 and qq. We determine a complete list of prism manifolds P(p,q)P(p, q) that can be realized by positive integral surgeries on knots in S3S^3 when q>pq>p. The methodology…

2017-09-29abs ↗pdf ↗

Study flat metrics from right prisms, finding non-lattice surfaces with translation coverings.

problem Analyzing flat metrics from right regular prisms.
method Viewing prisms as n-differentials and analyzing unfoldings, proving translation coverings to hyperelliptic surfaces.
result Non-lattice surfaces admit translation coverings to hyperelliptic surfaces, allowing explicit computation of orbit closures and counting problems.

PRISM integrates diverse rewards in MORL, improving sample efficiency and Pareto coverage.

problem Heterogeneous MORL where dense objectives dominate, leading to poor sample efficiency.
method PRISM uses reflectional symmetry and ReSymNet to reconcile temporal-frequency mismatches and accelerate exploration.
result PRISM consistently outperforms sparse-reward baselines and oracles, achieving significant Pareto gains.

We derive an analytic formula for the dual Jacobian matrix of a generalised hyperbolic tetrahedron. Two cases are considered: a mildly truncated and a prism truncated tetrahedron. The Jacobian for the latter arises as an analytic continuation of the former, that falls in line with a similar behaviour of the correspondi…

2014-09-11abs ↗pdf ↗

The spherical manifold realization problem asks which spherical three-manifolds arise from surgeries on knots in S3S^3. In recent years, the realization problem for C, T, O, and I-type spherical manifolds has been solved, leaving the D-type manifolds (also known as the prism manifolds) as the only remaining case. Every…

2016-12-15abs ↗pdf ↗

Asymmetry PRISM outperforms CPU and GPU solvers for institutional rebalancing.

problem Institutional rebalancing with deadline constraints
method Asymmetry PRISM
result Asymmetry PRISM-CPU is 4.5x to 24.1x faster than the fastest completed reference row in the same lane.

We prove the following comparison theorem for metrics with nonnegative scalar curvature, also known as the dihedral rigidity conjecture by Gromov: for n7n\le 7, if an nn-dimensional prism has nonnegative scalar curvature and weakly mean convex faces, then its dihedral angle cannot be everywhere not larger than its Euc…

2019-07-08abs ↗pdf ↗

Person re-identification (re-id), an emerging problem in visual surveillance, deals with maintaining entities of individuals whilst they traverse various locations surveilled by a camera network. From a visual perspective re-id is challenging due to significant changes in visual appearance of individuals in cameras wit…

2014-06-13abs ↗pdf ↗

If a rectangular diagram represents the trivial knot, then it can be deformed into the rectangular diagram with only two vertical edges by a finite sequence of merge operations and exchange operations, without increasing the number of vertical edges, which was shown by I. A. Dynnikov. We show in this paper that we need…

2013-03-27abs ↗pdf ↗

In this paper Legendrian graphs in (R3,ξst)(\mathbb{R}^3,ξ_{\mathrm{st}}) are considered modulo Legendrian isotopy and edge contraction. To a Legendrian graph we associate a (generalized) rectangular diagram --- a purely combinatorial object. Moves of rectangular diagrams are introduced so that equivalence classes of Legendr…

2014-12-06abs ↗pdf ↗

Paper studies S-rectangular DR-RL models for robust reinforcement learning with near-optimal sample complexity.

problem Addressing distributional discrepancies in reinforcement learning environments.
method Empirical value iteration algorithm for divergence-based S-rectangular DR-RL models.
result Near-optimal sample complexity bound of O(SA(1γ)4ε2)O(|\mathcal{S}||\mathcal{A}|(1-γ)^{-4}\varepsilon^{-2}).

We introduce a simple combinatorial way, which we call a rectangular diagram of a surface, to represent a surface in the three-sphere. It has a particularly nice relation to the standard contact structure on S3\mathbb S^3 and to rectangular diagrams of links. By using rectangular diagrams of surfaces we are going, in p…

2016-06-10abs ↗pdf ↗

Study reveals 1/f1/f noise in signals made from nonoverlapping rectangular pulses.

problem Analyzing 1/f1/f noise in signals composed of nonoverlapping pulses.
method Derived a general formula for power spectral density, analyzed rectangular pulse case.
result Observed pure 1/f1/f noise until very low frequencies with long pulse durations.

The study examines the systole of 3-manifolds with positive scalar curvature.

problem Analyzing the systole of 3-manifolds with positive scalar curvature.
method Local-to-global approach using capillary prisms and Coxeter gluing.
result Estimates the systole of 3-manifolds with positive scalar curvature.

We claim that the recently discovered universal-matrix precursor for the FF functions, which define the differential expansion of colored polynomials for twist and double braid knots, can be extended from rectangular to non-rectangular representations. This case is far more interesting, because it involves multiplicit…

2019-03-01abs ↗pdf ↗

A correspondence is studied by H. Matsuda between front projections of Legendrian links in the standard contact structure for 3-space and rectangular diagrams. In this paper, we introduce braided rectangular diagrams, and study a relationship with Legendrian links in the standard contact structure for 3-space. We show …

2007-08-17abs ↗pdf ↗

In this paper, we classify all of the five-sided three-dimensional hyperbolic polyhedra with one ideal vertex, which have the shape of a triangular prism. We show how to find each such polyhedron in the upper half-space model by considering lines and circles in the plane. Finally, we give matrix generators in $\mathrm{…

2018-08-23abs ↗pdf ↗

In arxiv:1205.1274 Rieck and Yamashita defined the link volume of 3-manifolds and studied some of its basic properties. Many of these properties are similar to the corresponding properties of the hyperbolic volume. In this paper we calculate the link volume of an infinite family of prism manifolds. As a corollary, we s…

2012-05-12abs ↗pdf ↗

PRISM infers model structures and parameters from simulations, controlling complexity at test time.

problem Choosing among large model families for scientific discovery.
method Simulation-based encoder-decoder that infers model structures and parameters, with test-time complexity control.
result PRISM scales to large model families and performs model selection in biophysical diffusion MRI.

New framework for higher-order singular-value derivatives of rectangular matrices.

problem Challenging to derive higher-order Fréchet derivatives of singular values in real rectangular matrices.
method Using Kato's analytic perturbation theory for self-adjoint operators and embedding rectangular matrices into block self-adjoint operators.
result Closed-form expressions for the nn-th order spectral variations of singular values.

Paper studies robust MDPs, improving sample complexity and asymptotic performance.

problem Optimal robust policy and value function in robust MDPs with generative models.
method Improves prior results on non-asymptotic and asymptotic performances of robust MDPs, considering various uncertainty sets.
result Improved sample complexity and asymptotic normality of optimal robust value function.

We classify nn-dimensional geometric graph manifolds with nonnegative scalar curvature, and first show that if n>3n>3, the universal cover splits off a codimension 3 Euclidean factor. We then proceed with the classification of the 3-dimensional case by showing that such a manifold is either a lens space or a prism mani…

2017-05-11abs ↗pdf ↗

Factorization of the differential expansion coefficients for HOMFLY-PT polynomials of double braids, discovered in arXiv:1606.06015 in the case of rectangular representations RR, is extended to the first non-rectangular representations R=[2,1]R=[2,1] and R=[3,1]R=[3,1]. This increases chances that such factorization will take p…

2016-12-01abs ↗pdf ↗

We elaborate on the recent observation that evolution for twist knots simplifies when described in terms of triangular evolution matrix B{\cal B}, not just its eigenvalues ΛΛ, and provide a universal formula for B{\cal B}, applicable to arbitrary rectangular representation R=[rs]R=[r^s]. This expression is in terms of s…

2019-02-11abs ↗pdf ↗