The paper classifies and describes five-sided hyperbolic polyhedra with one ideal vertex.
problem Classifying five-sided hyperbolic polyhedra with one ideal vertex.
method Using lines and circles in the plane to find each polyhedron in the upper half-space model, and generating matrix generators for the reflection groups.
result Matrix generators for the orientation-preserving subgroup of each corresponding reflection group.
Hyperbolic knots decompose into prism orbifolds.
problem Understanding hyperbolic knot complements and their geometric properties.
method Analyzing knot complements as quotients of H3 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.
The paper identifies five extreme learning regimes for large linear autoencoders.
problem Understanding the learning dynamics of large weight-tied linear autoencoders.
method Formal loss-expansion hierarchy and analysis of gradient flow.
result Five extreme regimes associated with faces of a triangular prism.
Smooth knots with odd Conway polynomial terms have inscribed trefoils.
problem Finding inscribed trefoils for smooth knots with specific polynomial terms.
method Using a perturbation of the double-cover of the orientation class and analyzing planar configurations.
result Smooth knots with odd quadratic terms of the Conway polynomial have inscribed trefoils.
Prism complexes help classify 3-manifolds, especially Seifert fiber spaces.
problem Classifying compact 3-manifolds using prism complexes.
method Introduced prism complexes and criteria for special prism structures.
result Compact 3-manifolds with special prism structures are Seifert fiber spaces.
Researchers find braid words for knots yielding prism manifolds.
problem Realizing prism manifolds via knot surgeries.
method Explicitly determined braid words for primitive/Seifert-fibered knots.
result Complete solution to prism manifold realization problem.
New classification of hyperbolic Coxeter prisms.
problem Classifying hyperbolic Coxeter prisms.
method Determine which prisms are quasi-arithmetic or arithmetic.
result New insights into commensurability and systoles of associated orbifolds.
Complete solution for prism manifold realization problem.
problem Realizing prism manifolds via positive surgeries.
method Parametrization by integers, surgery on knots in S3. result Solved realization problem for all prism manifolds.
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>1 and q. We determine a complete list of prism manifolds P(p,q) that can be realized by positive integral surgeries on knots in S3 when q>p. The methodology…
Proves a conjecture about prism shapes with nonnegative curvature.
problem Understanding the rigidity of prism shapes with nonnegative curvature.
method Constructing free boundary minimal hypersurfaces and extending a dimension descent idea.
result Dihedral angles of certain prisms cannot exceed Euclidean models unless isometric.
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.
In this paper we calculate the number of equivariant diffeomorphism classes of small covers over a prism.
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…
PRISM identifies simplex vertices from noisy data.
problem Identifying vertices of a simplex from noisy data.
method Probabilistic simplex model with maximum likelihood inference.
result Vertices are identifiable under certain assumptions.
The spherical manifold realization problem asks which spherical three-manifolds arise from surgeries on knots in S3. 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…
In this paper, based upon the basic theory for glued manifolds in M.W. Hirsch (1976) \cite[Chapter 8, §2 Gluing Manifolds Together]{h}, we give a method of constructing homeomorphisms between two small covers over simple convex polytopes. As a result we classify, up to homeomorphism, all small covers over a 3-dimension…
Explicitly constructed 5-manifolds tessellated by prisms.
problem Constructing closed arithmetic hyperbolic 5-manifolds.
method Explicit construction and tessellation of manifolds by Coxeter simplicial prisms.
result Explicit construction of 5-manifolds with specified properties.
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.
PRISM-FCP improves federated prediction robustness against Byzantine attacks.
problem Byzantine attacks in federated learning.
method Partial model sharing and distance-based maliciousness scores.
result Maintains nominal coverage guarantees under Byzantine attacks.
The study confirms conjectures about normals to convex polytopes in 3D space.
problem Concurrent normals problem for convex polytopes in 3D.
method Analyzes the PL concurrent normals problem for convex polytopes, proving conjectures for specific cases.
result Polytopes in 3D have points with 10 normals from interior points, confirmed for all tetrahedra and triangular prisms.
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…
Paper presents a new triangular form for flat systems.
problem Designing flat systems with two inputs.
method Geometric characterization and static feedback equivalence.
result Sufficient condition for affine input systems to be flat.
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.
Study shows space of persistence diagrams doesn't have Yu's property A.
problem Failure of property A in the space of persistence diagrams.
method Introduced k-prisms to prove failure of property A.
result Space of persistence diagrams fails to have Yu's property A in a Wasserstein metric.
Paper presents a new flat triangular form for systems.
problem Creating a structurally flat triangular form for systems.
method Developed a new triangular form based on the extended chained form with conditions for static feedback equivalence.
result Provided conditions for affine input systems to be static feedback equivalent to the new triangular form.
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…
We consider the problem of approximate joint triangularization of a set of noisy jointly diagonalizable real matrices. Approximate joint triangularizers are commonly used in the estimation of the joint eigenstructure of a set of matrices, with applications in signal processing, linear algebra, and tensor decomposition.…
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.
Introduces triangular transport for uncertain data.
problem Uncertainty in complex systems without known probabilistic representations.
method Characterizes and manipulates unknown probability distributions using triangular transport maps.
result Triangular transport guarantees desirable mathematical and computational properties.
Probabilistic descent on manifolds using triangular sets and embedding theorems.
problem Descent over manifolds defined by polynomials.
method Triangularization, embedding theorem, numerical continuation.
result Effective numerical method for probabilistic descent.
Solves problem of describing transformations for upper triangular Toeplitz operators.
problem Describing coordinate transformations preserving upper triangular Toeplitz form of operator fields.
method Implicit formulas involving matrix-valued functions for describing transformations and Nijenhuis operators.
result Formulas for coordinate transformations and Nijenhuis operators in upper triangular Toeplitz form.
Triangular flows ensure statistical consistency and fast rates in generative modeling.
problem Ensuring statistical consistency and fast rates in generative models.
method Statistical guarantees and sample complexity bounds for triangular flow models using empirical process theory.
result Established statistical consistency and finite sample convergence rates for Kullback-Leibler estimator of Knöthe-Rosenblatt measure coupling.
We classify n-dimensional geometric graph manifolds with nonnegative scalar curvature, and first show that if n>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…
Paper uses GNNs to efficiently detect profitable triangular arbitrage opportunities.
problem Detecting profitable triangular arbitrage opportunities in dynamic markets.
method Formulate the problem as a graph-based optimization task and use a GNN architecture to capture complex relationships.
result GNN-based method achieves higher average yield with reduced computational time compared to traditional methods.
We create a smooth manifold of triangular meshes with a geodesically complete metric.
problem Representing and manipulating 2D shapes as triangular meshes.
method Developed a geodesically complete Riemannian metric for triangular meshes.
result The metric preserves mesh connectivity and avoids mesh degradation.
PRISM-VQ combines financial priors with vector quantization for better stock prediction.
problem Predicting cross-sectional stock returns is hard due to low signal-to-noise ratios and changing market conditions.
method Integrates expert priors, vector-quantized latent factors, and dynamic factor loadings.
result Consistent improvements in cross-sectional return prediction and portfolio performance.
PRISM provides real-time SLAM with uncertainty estimates for agent and map states.
problem Lack of uncertainty estimates and real-time capability in SLAM.
method Combines differentiable rendering and 6-DoF dynamics, uses approximations for Bayesian inference.
result Runs at 10Hz real-time with similar accuracy to state-of-the-art SLAM.
Study develops curvature for contact-sequence networks, revealing temporal dynamics.
problem Lack of geometric analysis for temporal network sequences.
method Develops Forman--Ricci curvature on spatiotemporal prism complexes.
result Two curvature variants disagree on 56-67% of temporal edges.
Discretizes Helfrich-type energies on surfaces using triangular complexes.
problem Discretizing curvature energies on surfaces of specific type.
method Asymptotic lower bound combined with recovery sequence of triangulations and edge director fields.
result Valid discrete versions of integral curvature energies on surfaces.
We study the problem to provide a triangular form based on implicit differential equations for non-linear multi-input systems with respect to the flatness property. Furthermore, we suggest a constructive method for the transformation of a given system into that special triangular shape, if possible. The well known Brun…
We first show that there are in fact triangular arbitrage opportunities in the spot foreign exchange markets, analyzing the time dependence of the yen-dollar rate, the dollar-euro rate and the yen-euro rate. Next, we propose a model of foreign exchange rates with an interaction. The model includes effects of triangular…
We show that every knot can be realized as a billiard trajectory in a convex prism. This solves a conjecture of Jones and Przytycki.
New constructions from non-separating planar graphs improve understanding of graph linkability and knotability.
problem Understanding linkability and knotability of graph complements.
method Using maximal non-separating planar graphs to construct examples of maximal linkless and knotless graphs, and analyzing their Colin de Verdière invariant.
result The Colin de Verdière invariant of the complement of a maximal non-separating planar graph satisfies μ(cG) ≤ n-4, and equality holds.
This paper explores how deep learning models can fit data exactly and why this is important.
problem Understanding why deep learning models can fit data exactly and generalize well.
method Interpolation and over-parameterization as key themes to understand deep learning.
result Interpolation and over-parameterization are crucial for deep learning models to fit data exactly and generalize well.
Study uses multifractal detrended cross-correlation to detect Forex arbitrage opportunities.
problem Detecting arbitrage opportunities in Forex markets.
method Multifractal detrended cross-correlation analysis applied to Forex time series.
result Strong cross-correlations found between exchange rates involved in triangular relations, including AUD and NZD.
Study of alternating links on nonorientable surfaces, extending results to nonorientable projections.
problem Generalizing hyperbolic geometry results to nonorientable surfaces.
method Extending results from orientable to nonorientable surfaces.
result Klein-bottly alternating links in prism manifolds have hyperbolic geometry.
We investigate triangular arbitrage within the spot foreign exchange market using high-frequency executable prices. We show that triangular arbitrage opportunities do exist, but that most have short durations and small magnitudes. We find intra-day variations in the number and length of arbitrage opportunities, with la…